| 2026 | CRYPTO | Security Amplification via Robust Indistinguishability Combiners. | Benny Applebaum, Nir Bitansky, Nathan Geier |
| 2026 | CRYPTO | On Arithmetic Private Information Retrieval: Why Code-Based PIR (Usually) Fails. | Benny Applebaum, Yuval Ishai, Shahar Shechter |
| 2025 | CRYPTO | NIZK Amplification via Leakage-Resilient Secure Computation. | Benny Applebaum, Eliran Kachlon |
| 2025 | CRYPTO | How to Share an NP Statement or Combiners for Zero-Knowledge Proofs. | Benny Applebaum, Eliran Kachlon |
| 2025 | STOC | The Meta-complexity of Secret Sharing. | Benny Applebaum, Oded Nir |
| 2024 | CRYPTO | Stochastic Secret Sharing with 1-Bit Shares and Applications to MPC. | Benny Applebaum, Eliran Kachlon |
| 2024 | SODA | Conflict Checkable and Decodable Codes and Their Applications. | Benny Applebaum, Eliran Kachlon |
| 2024 | TCC | Distributing Keys and Random Secrets with Constant Complexity. | Benny Applebaum, Benny Pinkas |
| 2023 | CRYPTO | How to Recover a Secret with O(n) Additions. | Benny Applebaum, Oded Nir, Benny Pinkas |
| 2023 | EuroCrypt | Actively Secure Arithmetic Computation and VOLE with Constant Computational Overhead. | Benny Applebaum, Niv Konstantini |
| 2023 | FOCS | Advisor-Verifier-Prover Games and the Hardness of Information Theoretic Cryptography. | Benny Applebaum, Oded Nir |
| 2023 | STOC | Succinct Computational Secret Sharing. | Benny Applebaum, Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Tianren Liu, Vinod Vaikuntanathan |
| 2023 | STOC | The Round Complexity of Statistical MPC with Optimal Resiliency. | Benny Applebaum, Eliran Kachlon, Arpita Patra |
| 2022 | CRYPTO | Quadratic Multiparty Randomized Encodings Beyond Honest Majority and Their Applications. | Benny Applebaum, Yuval Ishai, Or Karni, Arpita Patra |
| 2022 | CRYPTO | Verifiable Relation Sharing and Multi-verifier Zero-Knowledge in Two Rounds: Trading NIZKs with Honest Majority - (Extended Abstract). | Benny Applebaum, Eliran Kachlon, Arpita Patra |
| 2022 | TCC | Round-Optimal Honest-Majority MPC in Minicrypt and with Everlasting Security - (Extended Abstract). | Benny Applebaum, Eliran Kachlon, Arpita Patra |
| 2021 | CRYPTO | Upslices, Downslices, and Secret-Sharing with Complexity of 1.5 | Benny Applebaum, Oded Nir |
| 2021 | TCC | On Actively-Secure Elementary MPC Reductions. | Benny Applebaum, Aarushi Goel |
| 2020 | FOCS | The Round Complexity of Perfect MPC with Active Security and Optimal Resiliency. | Benny Applebaum, Eliran Kachlon, Arpita Patra |
| 2020 | STOC | Better secret sharing via robust conditional disclosure of secrets. | Benny Applebaum, Amos Beimel, Oded Nir, Naty Peter |
| 2020 | TCC | The Resiliency of MPC with Low Interaction: The Benefit of Making Errors (Extended Abstract). | Benny Applebaum, Eliran Kachlon, Arpita Patra |
| 2019 | EuroCrypt | Secret-Sharing Schemes for General and Uniform Access Structures. | Benny Applebaum, Amos Beimel, Oriol Farrs, Oded Nir, Naty Peter |
| 2019 | EuroCrypt | Degree 2 is Complete for the Round-Complexity of Malicious MPC. | Benny Applebaum, Zvika Brakerski, Rotem Tsabary |
| 2019 | FOCS | Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error. | Benny Applebaum, Eliran Kachlon |
| 2018 | EuroCrypt | The Communication Complexity of Private Simultaneous Messages, Revisited. | Benny Applebaum, Thomas Holenstein, Manoj Mishra, Ofer Shayevitz |
| 2018 | TCC | On the Power of Amortization in Secret Sharing: d-Uniform Secret Sharing and CDS with Constant Information Rate. | Benny Applebaum, Barak Arkis |
| 2018 | TCC | Perfect Secure Computation in Two Rounds. | Benny Applebaum, Zvika Brakerski, Rotem Tsabary |
| 2017 | CRYPTO | Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-Bounds, and Separations. | Benny Applebaum, Barak Arkis, Pavel Raykov, Prashant Nalini Vasudevan |
| 2017 | CRYPTO | Secure Arithmetic Computation with Constant Computational Overhead. | Benny Applebaum, Ivan Damgrd, Yuval Ishai, Michael Nielsen, Lior Zichron |
| 2017 | FOCS | Exponentially-Hard Gap-CSP and Local PRG via Local Hardcore Functions. | Benny Applebaum |
| 2016 | CRYPTO | On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings. | Benny Applebaum, Pavel Raykov |
| 2016 | STOC | Algebraic attacks against random local functions and their countermeasures. | Benny Applebaum, Shachar Lovett |
| 2016 | TCC | From Private Simultaneous Messages to Zero-Information Arthur-Merlin Protocols and Back. | Benny Applebaum, Pavel Raykov |
| 2016 | TCC | Fast Pseudorandom Functions Based on Expander Graphs. | Benny Applebaum, Pavel Raykov |
| 2015 | TCC | Obfuscating Circuits via Composite-Order Graded Encoding. | Benny Applebaum, Zvika Brakerski |
| 2014 | ASIACRYPT | Bootstrapping Obfuscators via Fast Pseudorandom Functions. | Benny Applebaum |
| 2013 | CRYPTO | Encoding Functions with Constant Online Rate or How to Compress Garbled Circuits Keys. | Benny Applebaum, Yuval Ishai, Eyal Kushilevitz, Brent Waters |
| 2013 | EuroCrypt | Locally Computable UOWHF with Linear Shrinkage. | Benny Applebaum, Yoni Moses |
| 2013 | TCC | Garbling XOR Gates "For Free" in the Standard Model. | Benny Applebaum |
| 2013 | TCC | Cryptographic Hardness of Random Local Functions-Survey. | Benny Applebaum |
| 2012 | STOC | Pseudorandom generators with long stretch and low locality from random local one-way functions. | Benny Applebaum |
| 2012 | TCC | A Dichotomy for Local Small-Bias Generators. | Benny Applebaum, Andrej Bogdanov, Alon Rosen |
| 2011 | EuroCrypt | Key-Dependent Message Security: Generic Amplification and Completeness. | Benny Applebaum |
| 2011 | FOCS | How to Garble Arithmetic Circuits. | Benny Applebaum, Yuval Ishai, Eyal Kushilevitz |
| 2010 | ICALP | From Secrecy to Soundness: Efficient Verification via Secure Computation. | Benny Applebaum, Yuval Ishai, Eyal Kushilevitz |
| 2010 | STOC | Public-key cryptography from different assumptions. | Benny Applebaum, Boaz Barak, Avi Wigderson |
| 2009 | CRYPTO | Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems. | Benny Applebaum, David Cash, Chris Peikert, Amit Sahai |
| 2008 | FOCS | On Basing Lower-Bounds for Learning on Worst-Case Assumptions. | Benny Applebaum, Boaz Barak, David Xiao |
| 2007 | CRYPTO | Cryptography with Constant Input Locality. | Benny Applebaum, Yuval Ishai, Eyal Kushilevitz |
| 2004 | FOCS | Cryptography in NC | Benny Applebaum, Yuval Ishai, Eyal Kushilevitz |