| 2026 | STOC | Adaptive Robustness of Hypergrid Johnson-Lindenstrauss. | Andrej Bogdanov, Alon Rosen, Neekon Vafa, Vinod Vaikuntanathan |
| 2026 | STOC | Secret-Key PIR from Random Linear Codes. | Caicai Chen, Yuval Ishai, Tamer Mour, Alon Rosen |
| 2025 | CCS | Encrypted Matrix-Vector Products from Secret Dual Codes. | Fabrice Benhamouda, Caicai Chen, Shai Halevi, Yuval Ishai, Hugo Krawczyk, Tamer Mour, Tal Rabin, Alon Rosen |
| 2025 | CRYPTO | Sample Efficient Search to Decision for kLIN. | Andrej Bogdanov, Alon Rosen, Kel Zin Tan |
| 2025 | ESA | The Planted Orthogonal Vectors Problem. | David Khnemann, Adam Polak, Alon Rosen |
| 2025 | SODA | Locally Testable Tree Codes. | Tamer Mour, Alon Rosen, Ron Rothblum |
| 2024 | CRYPTO | CDS Composition of Multi-round Protocols. | Masayuki Abe, Andrej Bogdanov, Miyako Ohkubo, Alon Rosen, Zehua Shang, Mehdi Tibouchi |
| 2024 | TCC | Low-Degree Security of the Planted Random Subgraph Problem. | Andrej Bogdanov, Chris Jones, Alon Rosen, Ilias Zadik |
| 2023 | ICALP | Nondeterministic Interactive Refutations for Nearest Boolean Vector. | Andrej Bogdanov, Alon Rosen |
| 2023 | TCC | Public-Key Encryption, Local Pseudorandom Generators, and the Low-Degree Method. | Andrej Bogdanov, Pravesh K. Kothari, Alon Rosen |
| 2022 | TCC | Public-Key Encryption from Homogeneous CLWE. | Andrej Bogdanov, Miguel Cueto Noval, Charlotte Hoffmann, Alon Rosen |
| 2021 | CRYPTO | Secure Computation from One-Way Noisy Communication, or: Anti-correlation via Anti-concentration. | Shweta Agrawal, Yuval Ishai, Eyal Kushilevitz, Varun Narayanan, Manoj Prabhakaran, Vinod M. Prabhakaran, Alon Rosen |
| 2021 | CRYPTO | Time- and Space-Efficient Arguments from Groups of Unknown Order. | Alexander R. Block, Justin Holmgren, Alon Rosen, Ron D. Rothblum, Pratik Soni |
| 2021 | TCC | Acyclicity Programming for Sigma-Protocols. | Masayuki Abe, Miguel Ambrona, Andrej Bogdanov, Miyako Ohkubo, Alon Rosen |
| 2020 | ASIACRYPT | Non-interactive Composition of Sigma-Protocols via Share-then-Hash. | Masayuki Abe, Miguel Ambrona, Andrej Bogdanov, Miyako Ohkubo, Alon Rosen |
| 2020 | ASIACRYPT | Cryptography from One-Way Communication: On Completeness of Finite Channels. | Shweta Agrawal, Yuval Ishai, Eyal Kushilevitz, Varun Narayanan, Manoj Prabhakaran, Vinod M. Prabhakaran, Alon Rosen |
| 2020 | PKC | Limits on the Efficiency of (Ring) LWE Based Non-interactive Key Exchange. | Siyao Guo, Pritish Kamath, Alon Rosen, Katerina Sotiraki |
| 2020 | TCC | Public-Coin Zero-Knowledge Arguments with (almost) Minimal Time and Space Overheads. | Alexander R. Block, Justin Holmgren, Alon Rosen, Ron D. Rothblum, Pratik Soni |
| 2019 | STOC | Finding a Nash equilibrium is no easier than breaking Fiat-Shamir. | Arka Rai Choudhuri, Pavel Hubcek, Chethan Kamath, Krzysztof Pietrzak, Alon Rosen, Guy N. Rothblum |
| 2018 | CRYPTO | Proofs of Work From Worst-Case Assumptions. | Marshall Ball, Alon Rosen, Manuel Sabin, Prashant Nalini Vasudevan |
| 2018 | EuroCrypt | An Efficiency-Preserving Transformation from Honest-Verifier Statistical Zero-Knowledge to Statistical Zero-Knowledge. | Pavel Hubcek, Alon Rosen, Margarita Vald |
| 2018 | SCN | Securing Abe's Mix-Net Against Malicious Verifiers via Witness Indistinguishability. | Elette Boyle, Saleet Klein, Alon Rosen, Gil Segev |
| 2017 | STOC | Average-case fine-grained hardness. | Marshall Ball, Alon Rosen, Manuel Sabin, Prashant Nalini Vasudevan |
| 2017 | TCC | Functional Encryption for Bounded Collusions, Revisited. | Shweta Agrawal, Alon Rosen |
| 2017 | TCC | Can PPAD Hardness be Based on Standard Cryptographic Assumptions? | Alon Rosen, Gil Segev, Ido Shahaf |
| 2016 | TCC | On the Hardness of Learning with Rounding over Small Modulus. | Andrej Bogdanov, Siyao Guo, Daniel Masny, Silas Richelson, Alon Rosen |
| 2016 | TCC | Rational Sumchecks. | Siyao Guo, Pavel Hubcek, Alon Rosen, Margarita Vald |
| 2016 | TCC | Adaptive Security with Quasi-Optimal Rate. | Brett Hemenway, Rafail Ostrovsky, Silas Richelson, Alon Rosen |
| 2015 | CCS | Fast Non-Malleable Commitments. | Hai Brenner, Vipul Goyal, Silas Richelson, Alon Rosen, Margarita Vald |
| 2015 | FOCS | On the Cryptographic Hardness of Finding a Nash Equilibrium. | Nir Bitansky, Omer Paneth, Alon Rosen |
| 2015 | TCC | Public Verification of Private Effort. | Giulia Alberini, Tal Moran, Alon Rosen |
| 2015 | TCC | The Power of Negations in Cryptography. | Siyao Guo, Tal Malkin, Igor C. Oliveira, Alon Rosen |
| 2015 | TCC | Non-committing Encryption from Φ-hiding. | Brett Hemenway, Rafail Ostrovsky, Alon Rosen |
| 2014 | CHES | FPGA Implementations of SPRING - And Their Countermeasures against Side-Channel Attacks. | Hai Brenner, Lubos Gaspar, Gatan Leurent, Alon Rosen, Franois-Xavier Standaert |
| 2014 | CRYPTO | 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 |
| 2014 | FOCS | An Algebraic Approach to Non-malleability. | Vipul Goyal, Silas Richelson, Alon Rosen, Margarita Vald |
| 2014 | FOCS | One-Way Functions and (Im)Perfect Obfuscation. | Ilan Komargodski, Tal Moran, Moni Naor, Rafael Pass, Alon Rosen, Eylon Yogev |
| 2014 | FSE | SPRING: Fast Pseudorandom Functions from Rounded Ring Products. | Abhishek Banerjee, Hai Brenner, Gatan Leurent, Chris Peikert, Alon Rosen |
| 2014 | STOC | On the existence of extractable one-way functions. | Nir Bitansky, Ran Canetti, Omer Paneth, Alon Rosen |
| 2014 | TCC | Lower Bounds in the Hardware Token Model. | Shashank Agrawal, Prabhanjan Ananth, Vipul Goyal, Manoj Prabhakaran, Alon Rosen |
| 2013 | CRYPTO | Limits on the Power of Cryptographic Cheap Talk. | Pavel Hubcek, Jesper Buus Nielsen, Alon Rosen |
| 2012 | EuroCrypt | Pseudorandom Functions and Lattices. | Abhishek Banerjee, Chris Peikert, Alon Rosen |
| 2012 | TCC | A Dichotomy for Local Small-Bias Generators. | Benny Applebaum, Andrej Bogdanov, Alon Rosen |
| 2012 | TCC | Lossy Functions Do Not Amplify Well. | Krzysztof Pietrzak, Alon Rosen, Gil Segev |
| 2011 | TCC | Input Locality and Hardness Amplification. | Andrej Bogdanov, Alon Rosen |
| 2010 | ASIACRYPT | Optimistic Concurrent Zero Knowledge. | Alon Rosen, Abhi Shelat |
| 2010 | FOCS | Sequential Rationality in Cryptographic Protocols. | Ronen Gradwohl, Noam Livne, Alon Rosen |
| 2010 | INFOCOM | RIPPLE Authentication for Network Coding. | Yaping Li, Hongyi Yao, Minghua Chen, Sidharth Jaggi, Alon Rosen |
| 2010 | PKC | More Constructions of Lossy and Correlation-Secure Trapdoor Functions. | David Mandell Freeman, Oded Goldreich, Eike Kiltz, Alon Rosen, Gil Segev |
| 2009 | TCC | On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols. | Iftach Haitner, Alon Rosen, Ronen Shaltiel |
| 2009 | TCC | Fairness with an Honest Minority and a Rational Majority. | Shien Jin Ong, David C. Parkes, Alon Rosen, Salil P. Vadhan |
| 2009 | TCC | Chosen-Ciphertext Security via Correlated Products. | Alon Rosen, Gil Segev |
| 2008 | FSE | SWIFFT: A Modest Proposal for FFT Hashing. | Vadim Lyubashevsky, Daniele Micciancio, Chris Peikert, Alon Rosen |
| 2007 | STOC | Lattices that admit logarithmic worst-case to average-case connection factors. | Chris Peikert, Alon Rosen |
| 2006 | FOCS | Input-Indistinguishable Computation. | Silvio Micali, Rafael Pass, Alon Rosen |
| 2006 | TCC | Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices. | Chris Peikert, Alon Rosen |
| 2005 | EuroCrypt | On Robust Combiners for Oblivious Transfer and Other Primitives. | Danny Harnik, Joe Kilian, Moni Naor, Omer Reingold, Alon Rosen |
| 2005 | FOCS | Concurrent Non-Malleable Commitments. | Rafael Pass, Alon Rosen |
| 2005 | STOC | New and improved constructions of non-malleable cryptographic protocols. | Rafael Pass, Alon Rosen |
| 2004 | STOC | Completeness in two-party secure computation: a computational view. | Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen |
| 2004 | TCC | Constant-Round Oblivious Transfer in the Bounded Storage Model. | Yan Zong Ding, Danny Harnik, Alon Rosen, Ronen Shaltiel |
| 2004 | TCC | A Note on Constant-Round Zero-Knowledge Proofs for NP. | Alon Rosen |
| 2003 | FOCS | Bounded-Concurrent Secure Two-Party Computation in a Constant Number of Rounds. | Rafael Pass, Alon Rosen |
| 2002 | FOCS | Concurrent Zero Knowledge with Logarithmic Round-Complexity. | Manoj Prabhakaran, Alon Rosen, Amit Sahai |
| 2001 | STOC | Black-box concurrent zero-knowledge requires Omega~(log n) rounds. | Ran Canetti, Joe Kilian, Erez Petrank, Alon Rosen |
| 2000 | CRYPTO | A Note on the Round-Complexity of Concurrent Zero-Knowledge. | Alon Rosen |
| 2000 | STOC | Pseudo-random functions and factoring (extended abstract). | Moni Naor, Omer Reingold, Alon Rosen |