Alon Rosen

174 papers A* 26A 8B 10Misc 1Journal 99Unranked 26
YearRankTypeTitle / Venue / Authors
2025 J jnl
Adaptive Robustness of Hypergrid Johnson-Lindenstrauss.
CoRR
Andrej Bogdanov, Alon Rosen, Neekon Vafa, Vinod Vaikuntanathan
2025 J jnl
Adaptive Robustness of Hypergrid Johnson-Lindenstrauss.
IACR Cryptol. ePrint Arch.
Andrej Bogdanov, Alon Rosen, Neekon Vafa, Vinod Vaikuntanathan
2025 J jnl
Are Neural Networks Collision Resistant?
CoRR
Marco Benedetti, Andrej Bogdanov, Enrico M. Malatesta, Marc Mézard, Gianmarco Perrupato, Alon Rosen, Nikolaj I. Schwartzbach, Riccardo Zecchina
2025 J jnl
Are Neural Networks Collision Resistant?
IACR Cryptol. ePrint Arch.
Marco Benedetti, Andrej Bogdanov, Enrico M. Malatesta, Marc Mézard, Gianmarco Perrupato, Alon Rosen, Nikolaj I. Schwartzbach, Riccardo Zecchina
2025 A* conf
Encrypted Matrix-Vector Products from Secret Dual Codes.
CCS
Fabrice Benhamouda, Caicai Chen, Shai Halevi, Yuval Ishai, Hugo Krawczyk, Tamer Mour, Tal Rabin, Alon Rosen
2025 J jnl
Encrypted Matrix-Vector Products from Secret Dual Codes.
IACR Cryptol. ePrint Arch.
Fabrice Benhamouda, Caicai Chen, Shai Halevi, Yuval Ishai, Hugo Krawczyk, Tamer Mour, Tal Rabin, Alon Rosen
2025 A* conf
Locally Testable Tree Codes.
SODA
Tamer Mour, Alon Rosen, Ron Rothblum
2025 J jnl
Obituary for Luca Trevisan.
Bull. EATCS
Andrea Clementi, Venkatesan Guruswami, Kristin Kane, Alon Rosen, Nikhil Srivastava, Salil P. Vadhan, Riccardo Zecchina
2025 — conf
Sample Efficient Search to Decision for kLIN.
CRYPTO (1)
Andrej Bogdanov, Alon Rosen, Kel Zin Tan
2025 J jnl
Sample Efficient Search to Decision for kLIN.
IACR Cryptol. ePrint Arch.
Andrej Bogdanov, Alon Rosen, Kel Zin Tan
2025 J jnl
Secret-Key PIR from Random Linear Codes.
IACR Cryptol. ePrint Arch.
Caicai Chen, Yuval Ishai, Tamer Mour, Alon Rosen
2025 A conf
The Planted Orthogonal Vectors Problem.
ESA
David Kühnemann, Adam Polak, Alon Rosen
2025 J jnl
The Planted Orthogonal Vectors Problem.
CoRR
David Kühnemann, Adam Polak, Alon Rosen
2025 J jnl
The Planted Orthogonal Vectors Problem.
IACR Cryptol. ePrint Arch.
David Kühnemann, Adam Polak, Alon Rosen
2025 J jnl
Tree PCPs.
Electron. Colloquium Comput. Complex.
Tamer Mour, Alon Rosen, Ron Rothblum
2025 J jnl
Tree PCPs.
IACR Cryptol. ePrint Arch.
Tamer Mour, Alon Rosen, Ron Rothblum
2024 — conf
CDS Composition of Multi-round Protocols.
CRYPTO (9)
Masayuki Abe, Andrej Bogdanov, Miyako Ohkubo, Alon Rosen, Zehua Shang, Mehdi Tibouchi
2024 J jnl
Locally Testable Tree Codes.
Electron. Colloquium Comput. Complex.
Tamer Mour, Alon Rosen, Ron Rothblum
2024 — conf
Low-Degree Security of the Planted Random Subgraph Problem.
TCC (2)
Andrej Bogdanov, Chris Jones, Alon Rosen, Ilias Zadik
2024 J jnl
Low-degree Security of the Planted Random Subgraph Problem.
CoRR
Andrej Bogdanov, Chris Jones, Alon Rosen, Ilias Zadik
2024 J jnl
Low-degree Security of the Planted Random Subgraph Problem.
IACR Cryptol. ePrint Arch.
Andrej Bogdanov, Chris Jones, Alon Rosen, Ilias Zadik
2023 A conf
Downward Self-Reducibility in TFNP.
ITCS
Prahladh Harsha, Daniel Mitropolsky, Alon Rosen
2023 A* conf
Nondeterministic Interactive Refutations for Nearest Boolean Vector.
ICALP
Andrej Bogdanov, Alon Rosen
2023 A conf
PPP-Completeness and Extremal Combinatorics.
ITCS
Romain Bourneuf, Lukás Folwarczný, Pavel Hubácek, Alon Rosen, Nikolaj I. Schwartzbach
2023 — conf
Public-Key Encryption, Local Pseudorandom Generators, and the Low-Degree Method.
TCC (1)
Andrej Bogdanov, Pravesh K. Kothari, Alon Rosen
2023 J jnl
Public-Key Encryption, Local Pseudorandom Generators, and the Low-Degree Method.
Electron. Colloquium Comput. Complex.
Andrej Bogdanov, Pravesh Kothari, Alon Rosen
2023 J jnl
Public-Key Encryption, Local Pseudorandom Generators, and the Low-Degree Method.
IACR Cryptol. ePrint Arch.
Andrej Bogdanov, Pravesh Kothari, Alon Rosen
2022 J jnl
Downward Self-Reducibility in TFNP.
CoRR
Prahladh Harsha, Daniel Mitropolsky, Alon Rosen
2022 J jnl
Downward Self-Reducibility in TFNP.
Electron. Colloquium Comput. Complex.
Prahladh Harsha, Daniel Mitropolsky, Alon Rosen
2022 J jnl
Limits on the Efficiency of (Ring) LWE-Based Non-interactive Key Exchange.
J. Cryptol.
Siyao Guo, Pritish Kamath, Alon Rosen, Katerina Sotiraki
2022 J jnl
One-Way Functions and (Im)perfect Obfuscation.
SIAM J. Comput.
Ilan Komargodski, Tal Moran, Moni Naor, Rafael Pass, Alon Rosen, Eylon Yogev
2022 J jnl
PPP-Completeness and Extremal Combinatorics.
CoRR
Romain Bourneuf, Lukás Folwarczný, Pavel Hubácek, Alon Rosen, Nikolaj Ignatieff Schwartzbach
2022 J jnl
PPP-Completeness and Extremal Combinatorics.
Electron. Colloquium Comput. Complex.
Romain Bourneuf, Lukás Folwarczný, Pavel Hubácek, Alon Rosen, Nikolaj I. Schwartzbach
2022 J jnl
Public-Key Encryption from Continuous LWE.
Electron. Colloquium Comput. Complex.
Andrej Bogdanov, Miguel Cueto Noval, Charlotte Hoffmann, Alon Rosen
2022 J jnl
Public-Key Encryption from Continuous LWE.
IACR Cryptol. ePrint Arch.
Andrej Bogdanov, Miguel Cueto Noval, Charlotte Hoffmann, Alon Rosen
2022 — conf
Public-Key Encryption from Homogeneous CLWE.
TCC (2)
Andrej Bogdanov, Miguel Cueto Noval, Charlotte Hoffmann, Alon Rosen
2021 — conf
Acyclicity Programming for Sigma-Protocols.
TCC (1)
Masayuki Abe, Miguel Ambrona, Andrej Bogdanov, Miyako Ohkubo, Alon Rosen
2021 J jnl
Acyclicity Programming for Sigma-Protocols.
IACR Cryptol. ePrint Arch.
Masayuki Abe, Miguel Ambrona, Andrej Bogdanov, Miyako Ohkubo, Alon Rosen
2021 J jnl
An Algebraic Approach to Nonmalleability.
SIAM J. Comput.
Vipul Goyal, Silas Richelson, Alon Rosen, Margarita Vald
2021 J jnl
Can PPAD Hardness be Based on Standard Cryptographic Assumptions?
J. Cryptol.
Alon Rosen, Gil Segev, Ido Shahaf
2021 J jnl
Non-Interactive Composition of Sigma-Protocols via Share-then-Hash.
IACR Cryptol. ePrint Arch.
Masayuki Abe, Miguel Ambrona, Andrej Bogdanov, Miyako Ohkubo, Alon Rosen
2021 — conf
Secure Computation from One-Way Noisy Communication, or: Anti-correlation via Anti-concentration.
CRYPTO (2)
Shweta Agrawal, Yuval Ishai, Eyal Kushilevitz, Varun Narayanan, Manoj Prabhakaran, Vinod M. Prabhakaran, Alon Rosen
2021 — conf
Time- and Space-Efficient Arguments from Groups of Unknown Order.
CRYPTO (4)
Alexander R. Block, Justin Holmgren, Alon Rosen, Ron D. Rothblum, Pratik Soni
2021 J jnl
Time- and Space-Efficient Arguments from Groups of Unknown Order.
IACR Cryptol. ePrint Arch.
Alexander R. Block, Justin Holmgren, Alon Rosen, Ron D. Rothblum, Pratik Soni
2020 A conf
Cryptography from Information Loss.
ITCS
Marshall Ball, Elette Boyle, Akshay Degwekar, Apoorvaa Deshpande, Alon Rosen, Vinod Vaikuntanathan, Prashant Nalini Vasudevan
2020 J jnl
Cryptography from Information Loss.
Electron. Colloquium Comput. Complex.
Marshall Ball, Elette Boyle, Akshay Degwekar, Apoorvaa Deshpande, Alon Rosen, Vinod Vaikuntanathan, Prashant Nalini Vasudevan
2020 J jnl
Cryptography from Information Loss.
IACR Cryptol. ePrint Arch.
Marshall Ball, Elette Boyle, Akshay Degwekar, Apoorvaa Deshpande, Alon Rosen, Vinod Vaikuntanathan, Prashant Nalini Vasudevan
2020 — conf
Cryptography from One-Way Communication: On Completeness of Finite Channels.
ASIACRYPT (3)
Shweta Agrawal, Yuval Ishai, Eyal Kushilevitz, Varun Narayanan, Manoj Prabhakaran, Vinod M. Prabhakaran, Alon Rosen
2020 J jnl
Fine-Grained Cryptography: A New Frontier?
IACR Cryptol. ePrint Arch.
Alon Rosen
2020 — conf
Limits on the Efficiency of (Ring) LWE Based Non-interactive Key Exchange.
Public Key Cryptography (1)
Siyao Guo, Pritish Kamath, Alon Rosen, Katerina Sotiraki
2020 J jnl
Limits on the Efficiency of (Ring) LWE based Non-Interactive Key Exchange.
IACR Cryptol. ePrint Arch.
Siyao Guo, Pritish Kamath, Alon Rosen, Katerina Sotiraki
2020 — conf
Non-interactive Composition of Sigma-Protocols via Share-then-Hash.
ASIACRYPT (3)
Masayuki Abe, Miguel Ambrona, Andrej Bogdanov, Miyako Ohkubo, Alon Rosen
2020 — conf
Public-Coin Zero-Knowledge Arguments with (almost) Minimal Time and Space Overheads.
TCC (2)
Alexander R. Block, Justin Holmgren, Alon Rosen, Ron D. Rothblum, Pratik Soni
2020 J jnl
Public-Coin Zero-Knowledge Arguments with (almost) Minimal Time and Space Overheads.
IACR Cryptol. ePrint Arch.
Alexander R. Block, Justin Holmgren, Alon Rosen, Ron D. Rothblum, Pratik Soni
2019 J jnl
Finding a Nash Equilibrium Is No Easier Than Breaking Fiat-Shamir.
Electron. Colloquium Comput. Complex.
Arka Rai Choudhuri, Pavel Hubácek, Chethan Kamath, Krzysztof Pietrzak, Alon Rosen, Guy N. Rothblum
2019 J jnl
Finding a Nash Equilibrium Is No Easier Than Breaking Fiat-Shamir.
IACR Cryptol. ePrint Arch.
Arka Rai Choudhuri, Pavel Hubácek, Chethan Kamath, Krzysztof Pietrzak, Alon Rosen, Guy N. Rothblum
2019 A* conf
Finding a Nash equilibrium is no easier than breaking Fiat-Shamir.
STOC
Arka Rai Choudhuri, Pavel Hubácek, Chethan Kamath, Krzysztof Pietrzak, Alon Rosen, Guy N. Rothblum
2019 J jnl
PPAD-Hardness via Iterated Squaring Modulo a Composite.
IACR Cryptol. ePrint Arch.
Arka Rai Choudhuri, Pavel Hubácek, Chethan Kamath, Krzysztof Pietrzak, Alon Rosen, Guy N. Rothblum
2019 — ed.
Theory of Cryptography - 17th International Conference, TCC 2019, Nuremberg, Germany, December 1-5, 2019, Proceedings, Part I
TCC (1)
Dennis Hofheinz, Alon Rosen
2019 — ed.
Theory of Cryptography - 17th International Conference, TCC 2019, Nuremberg, Germany, December 1-5, 2019, Proceedings, Part II
TCC (2)
Dennis Hofheinz, Alon Rosen
2018 — conf
An Efficiency-Preserving Transformation from Honest-Verifier Statistical Zero-Knowledge to Statistical Zero-Knowledge.
EUROCRYPT (3)
Pavel Hubácek, Alon Rosen, Margarita Vald
2018 J jnl
An Efficiency-Preserving Transformation from Honest-Verifier Statistical Zero-Knowledge to Statistical Zero-Knowledge.
IACR Cryptol. ePrint Arch.
Pavel Hubácek, Alon Rosen, Margarita Vald
2018 — conf
Proofs of Work From Worst-Case Assumptions.
CRYPTO (1)
Marshall Ball, Alon Rosen, Manuel Sabin, Prashant Nalini Vasudevan
2018 J jnl
Proofs of Work from Worst-Case Assumptions.
IACR Cryptol. ePrint Arch.
Marshall Ball, Alon Rosen, Manuel Sabin, Prashant Nalini Vasudevan
2018 Misc conf
Securing Abe's Mix-Net Against Malicious Verifiers via Witness Indistinguishability.
SCN
Elette Boyle, Saleet Klein, Alon Rosen, Gil Segev
2017 J jnl
Average-Case Fine-Grained Hardness.
Electron. Colloquium Comput. Complex.
Marshall Ball, Alon Rosen, Manuel Sabin, Prashant Nalini Vasudevan
2017 J jnl
Average-Case Fine-Grained Hardness.
IACR Cryptol. ePrint Arch.
Marshall Ball, Alon Rosen, Manuel Sabin, Prashant Nalini Vasudevan
2017 A* conf
Average-case fine-grained hardness.
STOC
Marshall Ball, Alon Rosen, Manuel Sabin, Prashant Nalini Vasudevan
2017 — conf
Can PPAD Hardness be Based on Standard Cryptographic Assumptions?
TCC (2)
Alon Rosen, Gil Segev, Ido Shahaf
2017 — conf
Functional Encryption for Bounded Collusions, Revisited.
TCC (1)
Shweta Agrawal, Alon Rosen
2017 J jnl
Proofs of Useful Work.
IACR Cryptol. ePrint Arch.
Marshall Ball, Alon Rosen, Manuel Sabin, Prashant Nalini Vasudevan
2017 — ch.
Pseudorandom Functions: Three Decades Later.
Tutorials on the Foundations of Cryptography
Andrej Bogdanov, Alon Rosen
2017 J jnl
Pseudorandom Functions: Three Decades Later.
Electron. Colloquium Comput. Complex.
Andrej Bogdanov, Alon Rosen
2017 J jnl
Pseudorandom Functions: Three Decades Later.
IACR Cryptol. ePrint Arch.
Andrej Bogdanov, Alon Rosen
2017 J jnl
Securing Abe's Mix-net Against Malicious Verifiers via Witness Indistinguishability.
IACR Cryptol. ePrint Arch.
Elette Boyle, Saleet Klein, Alon Rosen, Gil Segev
2016 J jnl
A Dichotomy for Local Small-Bias Generators.
J. Cryptol.
Benny Applebaum, Andrej Bogdanov, Alon Rosen
2016 — conf
Adaptive Security with Quasi-Optimal Rate.
TCC (A1)
Brett Hemenway, Rafail Ostrovsky, Silas Richelson, Alon Rosen
2016 J jnl
Can PPAD Hardness be Based on Standard Cryptographic Assumptions?
Electron. Colloquium Comput. Complex.
Alon Rosen, Gil Segev, Ido Shahaf
2016 J jnl
Can PPAD Hardness be Based on Standard Cryptographic Assumptions?
IACR Cryptol. ePrint Arch.
Alon Rosen, Gil Segev, Ido Shahaf
2016 J jnl
Indistinguishability Obfuscation Does Not Reduce to Structured Languages.
Electron. Colloquium Comput. Complex.
Gilad Asharov, Alon Rosen, Gil Segev
2016 J jnl
On the Existence of Extractable One-Way Functions.
SIAM J. Comput.
Nir Bitansky, Ran Canetti, Omer Paneth, Alon Rosen
2016 — conf
On the Hardness of Learning with Rounding over Small Modulus.
TCC (A1)
Andrej Bogdanov, Siyao Guo, Daniel Masny, Silas Richelson, Alon Rosen
2016 J jnl
Online-Offline Functional Encryption for Bounded Collusions.
IACR Cryptol. ePrint Arch.
Shweta Agrawal, Alon Rosen
2016 — conf
Rational Sumchecks.
TCC (A2)
Siyao Guo, Pavel Hubácek, Alon Rosen, Margarita Vald
2015 A* conf
Fast Non-Malleable Commitments.
CCS
Hai Brenner, Vipul Goyal, Silas Richelson, Alon Rosen, Margarita Vald
2015 — conf
Non-committing Encryption from Φ-hiding.
TCC (1)
Brett Hemenway, Rafail Ostrovsky, Alon Rosen
2015 J jnl
Non-committing encryption from Φ-hiding.
IACR Cryptol. ePrint Arch.
Brett Hemenway, Rafail Ostrovsky, Alon Rosen
2015 A* conf
On the Cryptographic Hardness of Finding a Nash Equilibrium.
FOCS
Nir Bitansky, Omer Paneth, Alon Rosen
2015 J jnl
On the Cryptographic Hardness of Finding a Nash Equilibrium.
Electron. Colloquium Comput. Complex.
Nir Bitansky, Omer Paneth, Alon Rosen
2015 J jnl
On the Hardness of Learning with Rounding over Small Modulus.
IACR Cryptol. ePrint Arch.
Andrej Bogdanov, Siyao Guo, Daniel Masny, Silas Richelson, Alon Rosen
2015 — conf
Public Verification of Private Effort.
TCC (2)
Giulia Alberini, Tal Moran, Alon Rosen
2015 J jnl
Rational Sumchecks.
IACR Cryptol. ePrint Arch.
Siyao Guo, Pavel Hubácek, Alon Rosen, Margarita Vald
2015 — conf
The Power of Negations in Cryptography.
TCC (1)
Siyao Guo, Tal Malkin, Igor C. Oliveira, Alon Rosen
2015 J jnl
The Power of Negations in Cryptography.
Electron. Colloquium Comput. Complex.
Igor Carboni Oliveira, Siyao Guo, Tal Malkin, Alon Rosen
2014 J jnl
An Algebraic Approach to Non-Malleability.
IACR Cryptol. ePrint Arch.
Vipul Goyal, Silas Richelson, Alon Rosen, Margarita Vald
2014 A* conf
An Algebraic Approach to Non-malleability.
FOCS
Vipul Goyal, Silas Richelson, Alon Rosen, Margarita Vald
2014 A conf
Candidate weak pseudorandom functions in AC
ITCS
Adi Akavia, Andrej Bogdanov, Siyao Guo, Akshay Kamath, Alon Rosen
2014 J jnl
Candidate weak pseudorandom functions in AC
Electron. Colloquium Comput. Complex.
Adi Akavia, Andrej Bogdanov, Siyao Guo, Akshay Kamath, Alon Rosen
2014 A conf
FPGA Implementations of SPRING - And Their Countermeasures against Side-Channel Attacks.
CHES
Hai Brenner, Lubos Gaspar, Gaëtan Leurent, Alon Rosen, François-Xavier Standaert
2014 B conf
Lower Bounds in the Hardware Token Model.
TCC
Shashank Agrawal, Prabhanjan Ananth, Vipul Goyal, Manoj Prabhakaran, Alon Rosen
2014 J jnl
On the Cryptographic Hardness of Finding a Nash Equilibrium.
IACR Cryptol. ePrint Arch.
Nir Bitansky, Omer Paneth, Alon Rosen
2014 J jnl
On the Existence of Extractable One-Way Functions.
IACR Cryptol. ePrint Arch.
Nir Bitansky, Ran Canetti, Omer Paneth, Alon Rosen
2014 A* conf
On the existence of extractable one-way functions.
STOC
Nir Bitansky, Ran Canetti, Omer Paneth, Alon Rosen
2014 A* conf
One-Way Functions and (Im)Perfect Obfuscation.
FOCS
Ilan Komargodski, Tal Moran, Moni Naor, Rafael Pass, Alon Rosen, Eylon Yogev
2014 J jnl
One-Way Functions and (Im)perfect Obfuscation.
IACR Cryptol. ePrint Arch.
Ilan Komargodski, Tal Moran, Moni Naor, Rafael Pass, Alon Rosen, Eylon Yogev
2014 J jnl
Public Verification of Private Effort.
IACR Cryptol. ePrint Arch.
Giulia Alberini, Tal Moran, Alon Rosen
2014 A conf
Rational arguments: single round delegation with sublinear verification.
ITCS
Siyao Guo, Pavel Hubácek, Alon Rosen, Margarita Vald
2014 A* conf
SPRING: Fast Pseudorandom Functions from Rounded Ring Products.
FSE
Abhishek Banerjee, Hai Brenner, Gaëtan Leurent, Chris Peikert, Alon Rosen
2014 — conf
The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator.
CRYPTO (2)
Nir Bitansky, Ran Canetti, Henry Cohn, Shafi Goldwasser, Yael Tauman Kalai, Omer Paneth, Alon Rosen
2014 J jnl
The Power of Negations in Cryptography.
IACR Cryptol. ePrint Arch.
Siyao Guo, Tal Malkin, Igor C. Oliveira, Alon Rosen
2013 J jnl
Indistinguishability Obfuscation vs. Auxiliary-Input Extractable Functions: One Must Fall.
IACR Cryptol. ePrint Arch.
Nir Bitansky, Ran Canetti, Omer Paneth, Alon Rosen
2013 J jnl
Input Locality and Hardness Amplification.
J. Cryptol.
Andrej Bogdanov, Alon Rosen
2013 — conf
Limits on the Power of Cryptographic Cheap Talk.
CRYPTO (1)
Pavel Hubácek, Jesper Buus Nielsen, Alon Rosen
2013 J jnl
Limits on the Power of Cryptographic Cheap Talk.
IACR Cryptol. ePrint Arch.
Pavel Hubácek, Jesper Buus Nielsen, Alon Rosen
2013 J jnl
Lower Bounds in the Hardware Token Model.
IACR Cryptol. ePrint Arch.
Shashank Agrawal, Prabhanjan Ananth, Vipul Goyal, Manoj Prabhakaran, Alon Rosen
2013 J jnl
More Constructions of Lossy and Correlation-Secure Trapdoor Functions.
J. Cryptol.
David Mandell Freeman, Oded Goldreich, Eike Kiltz, Alon Rosen, Gil Segev
2013 J jnl
More on the Impossibility of Virtual-Black-Box Obfuscation with Auxiliary Input.
IACR Cryptol. ePrint Arch.
Nir Bitansky, Ran Canetti, Omer Paneth, Alon Rosen
2013 J jnl
Public-Coin Parallel Zero-Knowledge for NP.
J. Cryptol.
Rafael Pass, Alon Rosen, Wei-Lung Dustin Tseng
2013 J jnl
Sequential rationality in cryptographic protocols.
ACM Trans. Economics and Comput.
Ronen Gradwohl, Noam Livne, Alon Rosen
2013 J jnl
There is no Indistinguishability Obfuscation in Pessiland.
IACR Cryptol. ePrint Arch.
Tal Moran, Alon Rosen
2012 B conf
A Dichotomy for Local Small-Bias Generators.
TCC
Benny Applebaum, Andrej Bogdanov, Alon Rosen
2012 — conf
A New Implementation of a Dual (Paper and Cryptographic) Voting System.
Electronic Voting
Jonathan Ben-Nun, Niko Fahri, Morgan Llewellyn, Ben Riva, Alon Rosen, Amnon Ta-Shma, Douglas Wikström
2012 B conf
Lossy Functions Do Not Amplify Well.
TCC
Krzysztof Pietrzak, Alon Rosen, Gil Segev
2012 A* conf
Pseudorandom Functions and Lattices.
EUROCRYPT
Abhishek Banerjee, Chris Peikert, Alon Rosen
2011 J jnl
A Dichotomy for Local Small-Bias Generators.
Electron. Colloquium Comput. Complex.
Benny Applebaum, Andrej Bogdanov, Alon Rosen
2011 J jnl
A Dichotomy for Local Small-Bias Generators.
IACR Cryptol. ePrint Arch.
Benny Applebaum, Andrej Bogdanov, Alon Rosen
2011 B conf
Input Locality and Hardness Amplification.
TCC
Andrej Bogdanov, Alon Rosen
2011 J jnl
Input locality and hardness amplification.
Electron. Colloquium Comput. Complex.
Andrej Bogdanov, Alon Rosen
2011 J jnl
Pseudorandom Functions and Lattices.
IACR Cryptol. ePrint Arch.
Abhishek Banerjee, Chris Peikert, Alon Rosen
2011 J jnl
Verifiable Elections and the Public (Dagstuhl Seminar 11281).
Dagstuhl Reports
R. Michael Alvarez, Josh Benaloh, Alon Rosen, Peter Y. A. Ryan
2010 J jnl
Chosen-Ciphertext Security via Correlated Products.
SIAM J. Comput.
Alon Rosen, Gil Segev
2010 — conf
More Constructions of Lossy and Correlation-Secure Trapdoor Functions.
Public Key Cryptography
David Mandell Freeman, Oded Goldreich, Eike Kiltz, Alon Rosen, Gil Segev
2010 A conf
Optimistic Concurrent Zero Knowledge.
ASIACRYPT
Alon Rosen, Abhi Shelat
2010 A* conf
RIPPLE Authentication for Network Coding.
INFOCOM
Yaping Li, Hongyi Yao, Minghua Chen, Sidharth Jaggi, Alon Rosen
2010 J jnl
Sequential Rationality in Cryptographic Protocols
CoRR
Ronen Gradwohl, Noam Livne, Alon Rosen
2010 A* conf
Sequential Rationality in Cryptographic Protocols.
FOCS
Ronen Gradwohl, Noam Livne, Alon Rosen
2010 J jnl
Sequential Rationality in Cryptographic Protocols.
IACR Cryptol. ePrint Arch.
Ronen Gradwohl, Noam Livne, Alon Rosen
2009 B conf
Chosen-Ciphertext Security via Correlated Products.
TCC
Alon Rosen, Gil Segev
2009 B conf
Fairness with an Honest Minority and a Rational Majority.
TCC
Shien Jin Ong, David C. Parkes, Alon Rosen, Salil P. Vadhan
2009 J jnl
More Constructions of Lossy and Correlation-Secure Trapdoor Functions.
IACR Cryptol. ePrint Arch.
David Mandell Freeman, Oded Goldreich, Eike Kiltz, Alon Rosen, Gil Segev
2009 B conf
On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols.
TCC
Iftach Haitner, Alon Rosen, Ronen Shaltiel
2008 J jnl
Chosen-Ciphertext Security via Correlated Products.
IACR Cryptol. ePrint Arch.
Alon Rosen, Gil Segev
2008 J jnl
Concurrent Nonmalleable Commitments.
SIAM J. Comput.
Rafael Pass, Alon Rosen
2008 J jnl
Efficient Lossy Trapdoor Functions based on the Composite Residuosity Assumption.
IACR Cryptol. ePrint Arch.
Alon Rosen, Gil Segev
2008 J jnl
Fairness with an Honest Minority and a Rational Majority.
IACR Cryptol. ePrint Arch.
Shien Jin Ong, David C. Parkes, Alon Rosen, Salil P. Vadhan
2008 J jnl
New and Improved Constructions of Nonmalleable Cryptographic Protocols.
SIAM J. Comput.
Rafael Pass, Alon Rosen
2008 A* conf
SWIFFT: A Modest Proposal for FFT Hashing.
FSE
Vadim Lyubashevsky, Daniele Micciancio, Chris Peikert, Alon Rosen
2007 J jnl
Constant-Round Oblivious Transfer in the Bounded Storage Model.
J. Cryptol.
Yan Zong Ding, Danny Harnik, Alon Rosen, Ronen Shaltiel
2007 A* conf
Lattices that admit logarithmic worst-case to average-case connection factors.
STOC
Chris Peikert, Alon Rosen
2006 J jnl
Completeness in Two-Party Secure Computation: A Computational View.
J. Cryptol.
Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen
2006 — book
Concurrent Zero-Knowledge - With Additional Background by Oded Goldreich
Alon Rosen
2006 B conf
Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices.
TCC
Chris Peikert, Alon Rosen
2006 A* conf
Input-Indistinguishable Computation.
FOCS
Silvio Micali, Rafael Pass, Alon Rosen
2006 J jnl
Lattices that Admit Logarithmic Worst-Case to Average-Case Connection Factors.
Electron. Colloquium Comput. Complex.
Chris Peikert, Alon Rosen
2006 J jnl
Lattices that Admit Logarithmic Worst-Case to Average-Case Connection Factors.
IACR Cryptol. ePrint Arch.
Chris Peikert, Alon Rosen
2005 A* conf
Concurrent Non-Malleable Commitments.
FOCS
Rafael Pass, Alon Rosen
2005 J jnl
Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices
Electron. Colloquium Comput. Complex.
Chris Peikert, Alon Rosen
2005 A* conf
New and improved constructions of non-malleable cryptographic protocols.
STOC
Rafael Pass, Alon Rosen
2005 A* conf
On Robust Combiners for Oblivious Transfer and Other Primitives.
EUROCRYPT
Danny Harnik, Joe Kilian, Moni Naor, Omer Reingold, Alon Rosen
2004 B conf
A Note on Constant-Round Zero-Knowledge Proofs for NP.
TCC
Alon Rosen
2004 A* conf
Completeness in two-party secure computation: a computational view.
STOC
Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen
2004 B conf
Constant-Round Oblivious Transfer in the Bounded Storage Model.
TCC
Yan Zong Ding, Danny Harnik, Alon Rosen, Ronen Shaltiel
2003 A* conf
Bounded-Concurrent Secure Two-Party Computation in a Constant Number of Rounds.
FOCS
Rafael Pass, Alon Rosen
2003 J jnl
Completeness in Two-Party Secure Computation - A Computational View
Electron. Colloquium Comput. Complex.
Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen
2002 J jnl
Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds.
SIAM J. Comput.
Ran Canetti, Joe Kilian, Erez Petrank, Alon Rosen
2002 A* conf
Concurrent Zero Knowledge with Logarithmic Round-Complexity.
FOCS
Manoj Prabhakaran, Alon Rosen, Amit Sahai
2002 J jnl
Pseudorandom Functions and Factoring.
SIAM J. Comput.
Moni Naor, Omer Reingold, Alon Rosen
2001 J jnl
Black-Box Concurrent Zero-Knowledge Requires Omega(log n) Rounds.
IACR Cryptol. ePrint Arch.
Ran Canetti, Joe Kilian, Erez Petrank, Alon Rosen
2001 J jnl
Black-Box Concurrent Zero-Knowledge Requires ~Omega(log n) Rounds
Electron. Colloquium Comput. Complex.
Ran Canetti, Joe Kilian, Erez Petrank, Alon Rosen
2001 A* conf
Black-box concurrent zero-knowledge requires Omega~(log n) rounds.
STOC
Ran Canetti, Joe Kilian, Erez Petrank, Alon Rosen
2001 J jnl
Pseudo-Random Functions and Factoring
Electron. Colloquium Comput. Complex.
Moni Naor, Omer Reingold, Alon Rosen
2001 J jnl
Pseudo-Random Functions and Factoring.
IACR Cryptol. ePrint Arch.
Moni Naor, Omer Reingold, Alon Rosen
2000 A* conf
A Note on the Round-Complexity of Concurrent Zero-Knowledge.
CRYPTO
Alon Rosen
2000 A* conf
Pseudo-random functions and factoring (extended abstract).
STOC
Moni Naor, Omer Reingold, Alon Rosen