A Note on the Round-Complexity of Concurrent Zero-Knowledge. - Alon Rosen (CRYPTO, 2000)

Pseudo-random functions and factoring (extended abstract). - Moni Naor; Omer Reingold; Alon Rosen (STOC, 2000)

Black-Box Concurrent Zero-Knowledge Requires Omega(log n) Rounds - Ran Canetti; Joe Kilian; Erez Petrank; Alon Rosen (Electron. Colloquium Comput. Complex., 2001)

Pseudo-Random Functions and Factoring - Moni Naor; Omer Reingold; Alon Rosen (Electron. Colloquium Comput. Complex., 2001)

Concurrent Zero Knowledge with Logarithmic Round-Complexity. - Manoj Prabhakaran 001; Alon Rosen; Amit Sahai (FOCS, 2002)

Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds. - Ran Canetti; Joe Kilian; Erez Petrank; Alon Rosen (SIAM J. Comput., 2002)

Pseudorandom Functions and Factoring. - Moni Naor; Omer Reingold; Alon Rosen (SIAM J. Comput., 2002)

Bounded-Concurrent Secure Two-Party Computation in a Constant Number of Rounds. - Rafael Pass; Alon Rosen (FOCS, 2003)

Completeness in Two-Party Secure Computation - A Computational View - Danny Harnik; Moni Naor; Omer Reingold; Alon Rosen (Electron. Colloquium Comput. Complex., 2003)

A Note on Constant-Round Zero-Knowledge Proofs for NP. - Alon Rosen (TCC, 2004)

On Robust Combiners for Oblivious Transfer and Other Primitives. - Danny Harnik; Joe Kilian; Moni Naor; Omer Reingold; Alon Rosen (EUROCRYPT, 2005)

Concurrent Non-Malleable Commitments. - Rafael Pass; Alon Rosen (FOCS, 2005)

New and improved constructions of non-malleable cryptographic protocols. - Rafael Pass; Alon Rosen (STOC, 2005)

Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices - Chris Peikert; Alon Rosen (Electron. Colloquium Comput. Complex., 2005)

Concurrent Zero-Knowledge - With Additional Background by Oded Goldreich - Alon Rosen (Springer, 2006)

Input-Indistinguishable Computation. - Silvio Micali; Rafael Pass; Alon Rosen (FOCS, 2006)

Lattices that Admit Logarithmic Worst-Case to Average-Case Connection Factors. - Chris Peikert; Alon Rosen (Electron. Colloquium Comput. Complex., 2006)

Constant-Round Oblivious Transfer in the Bounded Storage Model. - Yan Zong Ding; Danny Harnik; Alon Rosen; Ronen Shaltiel (J. Cryptol., 2007)

SWIFFT: A Modest Proposal for FFT Hashing. - Vadim Lyubashevsky; Daniele Micciancio; Chris Peikert; Alon Rosen (FSE, 2008)

Fairness with an Honest Minority and a Rational Majority. - Shien Jin Ong; David C. Parkes; Alon Rosen; Salil P. Vadhan (IACR Cryptol. ePrint Arch., 2008)

Efficient Lossy Trapdoor Functions based on the Composite Residuosity Assumption. - Alon Rosen; Gil Segev 001 (IACR Cryptol. ePrint Arch., 2008)

Concurrent Nonmalleable Commitments. - Rafael Pass; Alon Rosen (SIAM J. Comput., 2008)

New and Improved Constructions of Nonmalleable Cryptographic Protocols. - Rafael Pass; Alon Rosen (SIAM J. Comput., 2008)

On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols. - Iftach Haitner; Alon Rosen; Ronen Shaltiel (TCC, 2009)

Optimistic Concurrent Zero Knowledge. - Alon Rosen; Abhi Shelat (ASIACRYPT, 2010)

RIPPLE Authentication for Network Coding. - Yaping Li; Hongyi Yao; Minghua Chen 001; Sidharth Jaggi; Alon Rosen (INFOCOM, 2010)

Chosen-Ciphertext Security via Correlated Products. - Alon Rosen; Gil Segev 001 (SIAM J. Comput., 2010)

Verifiable Elections and the Public (Dagstuhl Seminar 11281). - R. Michael Alvarez; Josh Benaloh; Alon Rosen; Peter Y. A. Ryan (Dagstuhl Reports, 2011)

A Dichotomy for Local Small-Bias Generators. - Benny Applebaum; Andrej Bogdanov; Alon Rosen (Electron. Colloquium Comput. Complex., 2011)

Input locality and hardness amplification. - Andrej Bogdanov; Alon Rosen (Electron. Colloquium Comput. Complex., 2011)

Pseudorandom Functions and Lattices. - Abhishek Banerjee 001; Chris Peikert; Alon Rosen (IACR Cryptol. ePrint Arch., 2011)

A New Implementation of a Dual (Paper and Cryptographic) Voting System. - Jonathan Ben-Nun; Niko Fahri; Morgan Llewellyn; Ben Riva; Alon Rosen; Amnon Ta-Shma; Douglas Wikström (Electronic Voting, 2012)

Lossy Functions Do Not Amplify Well. - Krzysztof Pietrzak; Alon Rosen; Gil Segev 001 (TCC, 2012)

Lower Bounds in the Hardware Token Model. - Shashank Agrawal; Prabhanjan Ananth; Vipul Goyal; Manoj Prabhakaran 001; Alon Rosen (IACR Cryptol. ePrint Arch., 2013)

Indistinguishability Obfuscation vs. Auxiliary-Input Extractable Functions: One Must Fall. - Nir Bitansky; Ran Canetti; Omer Paneth; Alon Rosen (IACR Cryptol. ePrint Arch., 2013)

More on the Impossibility of Virtual-Black-Box Obfuscation with Auxiliary Input. - Nir Bitansky; Ran Canetti; Omer Paneth; Alon Rosen (IACR Cryptol. ePrint Arch., 2013)

Limits on the Power of Cryptographic Cheap Talk. - Pavel Hubácek; Jesper Buus Nielsen; Alon Rosen (IACR Cryptol. ePrint Arch., 2013)

There is no Indistinguishability Obfuscation in Pessiland. - Tal Moran; Alon Rosen (IACR Cryptol. ePrint Arch., 2013)

More Constructions of Lossy and Correlation-Secure Trapdoor Functions. - David Mandell Freeman; Oded Goldreich 001; Eike Kiltz; Alon Rosen; Gil Segev 001 (J. Cryptol., 2013)

Public-Coin Parallel Zero-Knowledge for NP. - Rafael Pass; Alon Rosen; Wei-Lung Dustin Tseng (J. Cryptol., 2013)

Sequential rationality in cryptographic protocols. - Ronen Gradwohl; Noam Livne; Alon Rosen (ACM Trans. Economics and Comput., 2013)

FPGA Implementations of SPRING - And Their Countermeasures against Side-Channel Attacks. - Hai Brenner; Lubos Gaspar; Gaëtan Leurent; Alon Rosen; François-Xavier Standaert (CHES, 2014)

The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator. - Nir Bitansky; Ran Canetti; Henry Cohn; Shafi Goldwasser; Yael Tauman Kalai; Omer Paneth; Alon Rosen (CRYPTO (2), 2014)

SPRING: Fast Pseudorandom Functions from Rounded Ring Products. - Abhishek Banerjee 001; Hai Brenner; Gaëtan Leurent; Chris Peikert; Alon Rosen (FSE, 2014)

Rational arguments: single round delegation with sublinear verification. - Siyao Guo; Pavel Hubácek; Alon Rosen; Margarita Vald (ITCS, 2014)

Candidate weak pseudorandom functions in AC0 ○ MOD2. - Adi Akavia; Andrej Bogdanov; Siyao Guo; Akshay Kamath; Alon Rosen (Electron. Colloquium Comput. Complex., 2014)

Public Verification of Private Effort. - Giulia Alberini; Tal Moran; Alon Rosen (IACR Cryptol. ePrint Arch., 2014)

An Algebraic Approach to Non-Malleability. - Vipul Goyal; Silas Richelson; Alon Rosen; Margarita Vald (IACR Cryptol. ePrint Arch., 2014)

Fast Non-Malleable Commitments. - Hai Brenner; Vipul Goyal; Silas Richelson; Alon Rosen; Margarita Vald (CCS, 2015)

On the Cryptographic Hardness of Finding a Nash Equilibrium. - Nir Bitansky; Omer Paneth; Alon Rosen (Electron. Colloquium Comput. Complex., 2015)

The Power of Negations in Cryptography. - Igor Carboni Oliveira; Siyao Guo; Tal Malkin; Alon Rosen (Electron. Colloquium Comput. Complex., 2015)

On the Hardness of Learning with Rounding over Small Modulus. - Andrej Bogdanov; Siyao Guo; Daniel Masny; Silas Richelson; Alon Rosen (IACR Cryptol. ePrint Arch., 2015)

Rational Sumchecks. - Siyao Guo; Pavel Hubácek; Alon Rosen; Margarita Vald (IACR Cryptol. ePrint Arch., 2015)

Non-committing encryption from Φ-hiding. - Brett Hemenway; Rafail Ostrovsky; Alon Rosen (IACR Cryptol. ePrint Arch., 2015)

Adaptive Security with Quasi-Optimal Rate. - Brett Hemenway; Rafail Ostrovsky; Silas Richelson; Alon Rosen (TCC (A1), 2016)

Indistinguishability Obfuscation Does Not Reduce to Structured Languages. - Gilad Asharov; Alon Rosen; Gil Segev 001 (Electron. Colloquium Comput. Complex., 2016)

Can PPAD Hardness be Based on Standard Cryptographic Assumptions? - Alon Rosen; Gil Segev 001; Ido Shahaf (Electron. Colloquium Comput. Complex., 2016)

Online-Offline Functional Encryption for Bounded Collusions. - Shweta Agrawal 001; Alon Rosen (IACR Cryptol. ePrint Arch., 2016)

On the Existence of Extractable One-Way Functions. - Nir Bitansky; Ran Canetti; Omer Paneth; Alon Rosen (SIAM J. Comput., 2016)

Pseudorandom Functions: Three Decades Later. - Andrej Bogdanov; Alon Rosen (Tutorials on the Foundations of Cryptography, 2017)

Functional Encryption for Bounded Collusions, Revisited. - Shweta Agrawal 001; Alon Rosen (TCC (1), 2017)

Average-Case Fine-Grained Hardness. - Marshall Ball; Alon Rosen; Manuel Sabin; Prashant Nalini Vasudevan (Electron. Colloquium Comput. Complex., 2017)

Pseudorandom Functions: Three Decades Later. - Andrej Bogdanov; Alon Rosen (Electron. Colloquium Comput. Complex., 2017)

Proofs of Useful Work. - Marshall Ball; Alon Rosen; Manuel Sabin; Prashant Nalini Vasudevan (IACR Cryptol. ePrint Arch., 2017)

Securing Abe's Mix-net Against Malicious Verifiers via Witness Indistinguishability. - Elette Boyle; Saleet Klein; Alon Rosen; Gil Segev 001 (IACR Cryptol. ePrint Arch., 2017)

Proofs of Work from Worst-Case Assumptions. - Marshall Ball; Alon Rosen; Manuel Sabin; Prashant Nalini Vasudevan (IACR Cryptol. ePrint Arch., 2018)

An Efficiency-Preserving Transformation from Honest-Verifier Statistical Zero-Knowledge to Statistical Zero-Knowledge. - Pavel Hubácek; Alon Rosen; Margarita Vald (IACR Cryptol. ePrint Arch., 2018)

Finding a Nash Equilibrium Is No Easier Than Breaking Fiat-Shamir. - Arka Rai Choudhuri; Pavel Hubácek; Chethan Kamath; Krzysztof Pietrzak; Alon Rosen; Guy N. Rothblum (Electron. Colloquium Comput. Complex., 2019)

PPAD-Hardness via Iterated Squaring Modulo a Composite. - Arka Rai Choudhuri; Pavel Hubácek; Chethan Kamath; Krzysztof Pietrzak; Alon Rosen; Guy N. Rothblum (IACR Cryptol. ePrint Arch., 2019)

Cryptography from One-Way Communication: On Completeness of Finite Channels. - Shweta Agrawal 001; Yuval Ishai; Eyal Kushilevitz; Varun Narayanan; Manoj Prabhakaran 001; Vinod M. Prabhakaran; Alon Rosen (ASIACRYPT (3), 2020)

Cryptography from Information Loss. - Marshall Ball; Elette Boyle; Akshay Degwekar; Apoorvaa Deshpande; Alon Rosen; Vinod Vaikuntanathan; Prashant Nalini Vasudevan (Electron. Colloquium Comput. Complex., 2020)

Public-Coin Zero-Knowledge Arguments with (almost) Minimal Time and Space Overheads. - Alexander R. Block; Justin Holmgren; Alon Rosen; Ron D. Rothblum; Pratik Soni (IACR Cryptol. ePrint Arch., 2020)

Fine-Grained Cryptography: A New Frontier? - Alon Rosen (IACR Cryptol. ePrint Arch., 2020)

Secure Computation from One-Way Noisy Communication, or: Anti-correlation via Anti-concentration. - Shweta Agrawal 001; Yuval Ishai; Eyal Kushilevitz; Varun Narayanan; Manoj Prabhakaran 001; Vinod M. Prabhakaran; Alon Rosen (CRYPTO (2), 2021)

Acyclicity Programming for Sigma-Protocols. - Masayuki Abe; Miguel Ambrona; Andrej Bogdanov; Miyako Ohkubo; Alon Rosen (IACR Cryptol. ePrint Arch., 2021)

Non-Interactive Composition of Sigma-Protocols via Share-then-Hash. - Masayuki Abe; Miguel Ambrona; Andrej Bogdanov; Miyako Ohkubo; Alon Rosen (IACR Cryptol. ePrint Arch., 2021)

Time- and Space-Efficient Arguments from Groups of Unknown Order. - Alexander R. Block; Justin Holmgren; Alon Rosen; Ron D. Rothblum; Pratik Soni (IACR Cryptol. ePrint Arch., 2021)

An Algebraic Approach to Nonmalleability. - Vipul Goyal; Silas Richelson; Alon Rosen; Margarita Vald (SIAM J. Comput., 2021)

Public-Key Encryption from Homogeneous CLWE. - Andrej Bogdanov; Miguel Cueto Noval; Charlotte Hoffmann; Alon Rosen (TCC (2), 2022)

Public-Key Encryption from Continuous LWE. - Andrej Bogdanov; Miguel Cueto Noval; Charlotte Hoffmann; Alon Rosen (Electron. Colloquium Comput. Complex., 2022)

PPP-Completeness and Extremal Combinatorics. - Romain Bourneuf; Lukás Folwarczný; Pavel Hubácek; Alon Rosen; Nikolaj I. Schwartzbach (Electron. Colloquium Comput. Complex., 2022)

Downward Self-Reducibility in TFNP. - Prahladh Harsha; Daniel Mitropolsky; Alon Rosen (Electron. Colloquium Comput. Complex., 2022)

Limits on the Efficiency of (Ring) LWE-Based Non-interactive Key Exchange. - Siyao Guo; Pritish Kamath; Alon Rosen; Katerina Sotiraki (J. Cryptol., 2022)

One-Way Functions and (Im)perfect Obfuscation. - Ilan Komargodski; Tal Moran; Moni Naor; Rafael Pass; Alon Rosen; Eylon Yogev (SIAM J. Comput., 2022)

Nondeterministic Interactive Refutations for Nearest Boolean Vector. - Andrej Bogdanov; Alon Rosen (ICALP, 2023)

Public-Key Encryption, Local Pseudorandom Generators, and the Low-Degree Method. - Andrej Bogdanov; Pravesh Kothari; Alon Rosen (Electron. Colloquium Comput. Complex., 2023)

CDS Composition of Multi-round Protocols. - Masayuki Abe; Andrej Bogdanov; Miyako Ohkubo; Alon Rosen; Zehua Shang; Mehdi Tibouchi (CRYPTO (9), 2024)

Locally Testable Tree Codes. - Tamer Mour; Alon Rosen; Ron Rothblum (Electron. Colloquium Comput. Complex., 2024)

Low-degree Security of the Planted Random Subgraph Problem. - Andrej Bogdanov; Chris Jones; Alon Rosen; Ilias Zadik (IACR Cryptol. ePrint Arch., 2024)

Obituary for Luca Trevisan. - Andrea Clementi; Venkatesan Guruswami; Kristin Kane; Alon Rosen; Nikhil Srivastava; Salil P. Vadhan; Riccardo Zecchina (Bull. EATCS, 2025)

Tree PCPs. - Tamer Mour; Alon Rosen; Ron Rothblum (Electron. Colloquium Comput. Complex., 2025)

Encrypted Matrix-Vector Products from Secret Dual Codes. - Fabrice Benhamouda; Caicai Chen; Shai Halevi; Yuval Ishai; Hugo Krawczyk; Tamer Mour; Tal Rabin; Alon Rosen (IACR Cryptol. ePrint Arch., 2025)

Sample Efficient Search to Decision for kLIN. - Andrej Bogdanov; Alon Rosen; Kel Zin Tan (IACR Cryptol. ePrint Arch., 2025)

Adaptive Robustness of Hypergrid Johnson-Lindenstrauss. - Andrej Bogdanov; Alon Rosen; Neekon Vafa; Vinod Vaikuntanathan (IACR Cryptol. ePrint Arch., 2025)

Secret-Key PIR from Random Linear Codes. - Caicai Chen; Yuval Ishai; Tamer Mour; Alon Rosen (IACR Cryptol. ePrint Arch., 2025)

The Planted Orthogonal Vectors Problem. - David Kühnemann; Adam Polak 001; Alon Rosen (IACR Cryptol. ePrint Arch., 2025)