Computationally Private Randomizing Polynomials and Their Applications. - Benny Applebaum; Yuval Ishai; Eyal Kushilevitz (Comput. Complex., 2006)

Cryptography in NC0. - Benny Applebaum; Yuval Ishai; Eyal Kushilevitz (SIAM J. Comput., 2006)

Cryptography in constant parallel time. - Benny Applebaum (2007)

On Basing Lower-Bounds for Learning on Worst-Case Assumptions. - Benny Applebaum; Boaz Barak; David Xiao (FOCS, 2008)

On Pseudorandom Generators with Linear Stretch in NC0. - Benny Applebaum; Yuval Ishai; Eyal Kushilevitz (Comput. Complex., 2008)

Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems. - Benny Applebaum; David Cash; Chris Peikert; Amit Sahai (CRYPTO, 2009)

Collaborative, Privacy-Preserving Data Aggregation at Scale. - Haakon Ringberg; Benny Applebaum; Michael J. Freedman; Matthew Caesar 001; Jennifer Rexford (IACR Cryptol. ePrint Arch., 2009)

Cryptography with Constant Input Locality. - Benny Applebaum; Yuval Ishai; Eyal Kushilevitz (J. Cryptol., 2009)

From Secrecy to Soundness: Efficient Verification via Secure Computation. - Benny Applebaum; Yuval Ishai; Eyal Kushilevitz (ICALP (1), 2010)

Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature? - Benny Applebaum; Yuval Ishai; Eyal Kushilevitz (ICS, 2010)

Public-key cryptography from different assumptions. - Benny Applebaum; Boaz Barak; Avi Wigderson (STOC, 2010)

Semantic Security Under Related-Key Attacks and Applications. - Benny Applebaum; Danny Harnik; Yuval Ishai (IACR Cryptol. ePrint Arch., 2010)

Randomly Encoding Functions: A New Cryptographic Paradigm - (Invited Talk). - Benny Applebaum (ICITS, 2011)

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

Encoding Functions with Constant Online Rate or How to Compress Keys in Garbled Circuits. - Benny Applebaum; Yuval Ishai; Eyal Kushilevitz; Brent Waters (IACR Cryptol. ePrint Arch., 2012)

Encoding Functions with Constant Online Rate or How to Compress Garbled Circuits Keys. - Benny Applebaum; Yuval Ishai; Eyal Kushilevitz; Brent Waters (CRYPTO (2), 2013)

Locally Computable UOWHF with Linear Shrinkage. - Benny Applebaum; Yoni Moses (Electron. Colloquium Comput. Complex., 2013)

Bootstrapping Obfuscators via Fast Pseudorandom Functions. - Benny Applebaum (IACR Cryptol. ePrint Arch., 2013)

Pseudorandom Generators with Long Stretch and Low Locality from Random Local One-Way Functions. - Benny Applebaum (SIAM J. Comput., 2013)

Related-Key Secure Pseudorandom Functions: The Case of Additive Attacks. - Benny Applebaum; Eyal Widder (IACR Cryptol. ePrint Arch., 2014)

Key-Dependent Message Security: Generic Amplification and Completeness. - Benny Applebaum (J. Cryptol., 2014)

How to Garble Arithmetic Circuits. - Benny Applebaum; Yuval Ishai; Eyal Kushilevitz (SIAM J. Comput., 2014)

Cryptography in Constant Parallel Time. - Benny Applebaum (Springer, 2014)

Incompressible Functions, Relative-Error Extractors, and the Power of Nondeterministic Reductions (Extended Abstract). - Benny Applebaum; Sergei Artemenko; Ronen Shaltiel; Guang Yang 020 (CCC, 2015)

Arithmetic Cryptography: Extended Abstract. - Benny Applebaum; Jonathan Avron; Christina Brzuska (ITCS, 2015)

Deterministic Rateless Codes for BSC. - Benny Applebaum; Liron David; Guy Even (ITCS, 2015)

Arithmetic Cryptography. - Benny Applebaum; Jonathan Avron; Christina Brzuska (Electron. Colloquium Comput. Complex., 2015)

Incompressible Functions, Relative-Error Extractors, and the Power of Nondeterminsitic Reductions. - Benny Applebaum; Sergei Artemenko; Ronen Shaltiel; Guang Yang 020 (Electron. Colloquium Comput. Complex., 2015)

Minimizing Locality of One-Way Functions via Semi-Private Randomized Encodings. - Benny Applebaum; Yuval Ishai; Eyal Kushilevitz (Electron. Colloquium Comput. Complex., 2015)

From Private Simultaneous Messages to Zero-Information Arthur-Merlin Protocols and Back. - Benny Applebaum; Pavel Raykov (Electron. Colloquium Comput. Complex., 2015)

Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys. - Benny Applebaum; Yuval Ishai; Eyal Kushilevitz; Brent Waters (SIAM J. Comput., 2015)

Cryptographic Hardness of Random Local Functions - Survey. - Benny Applebaum (Comput. Complex., 2016)

Incompressible Functions, Relative-Error Extractors, and the Power of Nondeterministic Reductions. - Benny Applebaum; Sergei Artemenko; Ronen Shaltiel; Guang Yang 020 (Comput. Complex., 2016)

Fast Pseudorandom Functions Based on Expander Graphs. - Benny Applebaum; Pavel Raykov (Electron. Colloquium Comput. Complex., 2016)

Garbling XOR Gates "For Free" in the Standard Model. - Benny Applebaum (J. Cryptol., 2016)

Clique Here: On the Distributed Complexity in Fully-Connected Networks. - Benny Applebaum; Dariusz R. Kowalski; Boaz Patt-Shamir; Adi Rosén (Parallel Process. Lett., 2016)

Garbled Circuits as Randomized Encodings of Functions: a Primer. - Benny Applebaum (Tutorials on the Foundations of Cryptography, 2017)

Exponentially-Hard gap-CSP and local PRG via Local Hardcore Functions. - Benny Applebaum (Electron. Colloquium Comput. Complex., 2017)

Garbled Circuits as Randomized Encodings of Functions: a Primer. - Benny Applebaum (Electron. Colloquium Comput. Complex., 2017)

Conditional Disclosure of Secrets and d-Uniform Secret Sharing with Constant Information Rate. - Benny Applebaum; Barak Arkis (Electron. Colloquium Comput. Complex., 2017)

Low-Complexity Cryptographic Hash Functions. - Benny Applebaum; Naama Haramaty; Yuval Ishai; Eyal Kushilevitz; Vinod Vaikuntanathan (Electron. Colloquium Comput. Complex., 2017)

Secure Arithmetic Computation with Constant Computational Overhead. - Benny Applebaum; Ivan Damgård; Yuval Ishai; Michael Nielsen 001; Lior Zichron (IACR Cryptol. ePrint Arch., 2017)

On the Power of Amortization in Secret Sharing: d-Uniform Secret Sharing and CDS with Constant Information Rate. - Benny Applebaum; Barak Arkis (TCC (1), 2018)

The Communication Complexity of Private Simultaneous Messages, Revisited. - Benny Applebaum; Thomas Holenstein; Manoj Mishra; Ofer Shayevitz (Electron. Colloquium Comput. Complex., 2018)

Placing Conditional Disclosure of Secrets in the Communication Complexity Universe. - Benny Applebaum; Prashant Nalini Vasudevan (Electron. Colloquium Comput. Complex., 2018)

Algebraic Attacks against Random Local Functions and Their Countermeasures. - Benny Applebaum; Shachar Lovett (SIAM J. Comput., 2018)

Explicit Rateless Codes for Memoryless Binary-Input Output-Symmetric Channels. - Benny Applebaum; Liron David; Guy Even (Theory Comput., 2018)

On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings. - Benny Applebaum; Pavel Raykov (Comput. Complex., 2019)

Sampling Graphs without Forbidden Subgraphs and Almost-Explicit Unbalanced Expanders. - Benny Applebaum; Eliran Kachlon (Electron. Colloquium Comput. Complex., 2019)

Secret-Sharing Schemes for General and Uniform Access Structures. - Benny Applebaum; Amos Beimel; Oriol Farràs; Oded Nir; Naty Peter (IACR Cryptol. ePrint Arch., 2019)

Degree 2 is Complete for the Round-Complexity of Malicious MPC. - Benny Applebaum; Zvika Brakerski; Rotem Tsabary (IACR Cryptol. ePrint Arch., 2019)

The Resiliency of MPC with Low Interaction: The Benefit of Making Errors (Extended Abstract). - Benny Applebaum; Eliran Kachlon; Arpita Patra (TCC (2), 2020)

Better Secret-Sharing via Robust Conditional Disclosure of Secrets. - Benny Applebaum; Amos Beimel; Oded Nir; Naty Peter (Electron. Colloquium Comput. Complex., 2020)

The Round Complexity of Perfect MPC with Active Security and Optimal Resiliency. - Benny Applebaum; Eliran Kachlon; Arpita Patra (Electron. Colloquium Comput. Complex., 2020)

Separating Two-Round Secure Computation from Oblivious Transfer. - Benny Applebaum; Zvika Brakerski; Sanjam Garg; Yuval Ishai; Akshayaram Srinivasan (IACR Cryptol. ePrint Arch., 2020)

The Resiliency of MPC with Low Interaction: The Benefit of Making Errors. - Benny Applebaum; Eliran Kachlon; Arpita Patra (IACR Cryptol. ePrint Arch., 2020)

On the Power of Amortization in Secret Sharing: d-Uniform Secret Sharing and CDS with Constant Information Rate. - Benny Applebaum; Barak Arkis (ACM Trans. Comput. Theory, 2020)

Upslices, Downslices, and Secret-Sharing with Complexity of $1.5^n$. - Benny Applebaum; Oded Nir (Electron. Colloquium Comput. Complex., 2021)

On the Randomness Complexity of Interactive Proofs and Statistical Zero-Knowledge Proofs. - Benny Applebaum; Eyal Golombek (IACR Cryptol. ePrint Arch., 2021)

On Actively-Secure Elementary MPC Reductions. - Benny Applebaum; Aarushi Goel (IACR Cryptol. ePrint Arch., 2021)

Round-optimal Honest-majority MPC in Minicrypt and with Everlasting Security. - Benny Applebaum; Eliran Kachlon; Arpita Patra (IACR Cryptol. ePrint Arch., 2021)

Upslices, Downslices, and Secret-Sharing with Complexity of 1.5n. - Benny Applebaum; Oded Nir (IACR Cryptol. ePrint Arch., 2021)

Obfuscating Circuits Via Composite-Order Graded Encoding. - Benny Applebaum; Zvika Brakerski (J. Cryptol., 2021)

Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations. - Benny Applebaum; Barak Arkis; Pavel Raykov; Prashant Nalini Vasudevan (SIAM J. Comput., 2021)

Perfect Secure Computation in Two Rounds. - Benny Applebaum; Zvika Brakerski; Rotem Tsabary (SIAM J. Comput., 2021)

Verifiable Relation Sharing and Multi-verifier Zero-Knowledge in Two Rounds: Trading NIZKs with Honest Majority - (Extended Abstract). - Benny Applebaum; Eliran Kachlon; Arpita Patra (CRYPTO (4), 2022)

Round-Optimal Honest-Majority MPC in Minicrypt and with Everlasting Security - (Extended Abstract). - Benny Applebaum; Eliran Kachlon; Arpita Patra (TCC (2), 2022)

Secret Sharing, Slice Formulas, and Monotone Real Circuits. - Benny Applebaum; Amos Beimel; Oded Nir; Naty Peter; Toniann Pitassi (Electron. Colloquium Comput. Complex., 2022)

Quadratic Multiparty Randomized Encodings Beyond Honest Majority and Their Applications. - Benny Applebaum; Yuval Ishai; Or Karni; Arpita Patra (IACR Cryptol. ePrint Arch., 2022)

Verifiable Relation Sharing and Multi-Verifier Zero-Knowledge in Two Rounds: Trading NIZKs with Honest Majority. - Benny Applebaum; Eliran Kachlon; Arpita Patra (IACR Cryptol. ePrint Arch., 2022)

UTT: Decentralized Ecash with Accountable Privacy. - Alin Tomescu; Adithya Bhat; Benny Applebaum; Ittai Abraham; Guy Gueta; Benny Pinkas; Avishay Yanai (IACR Cryptol. ePrint Arch., 2022)

Succinct Computational Secret Sharing. - Benny Applebaum; Amos Beimel; Yuval Ishai; Eyal Kushilevitz; Tianren Liu; Vinod Vaikuntanathan (Electron. Colloquium Comput. Complex., 2023)

Conflict Checkable and Decodable Codes and Their Applications. - Benny Applebaum; Eliran Kachlon (Electron. Colloquium Comput. Complex., 2023)

The Round Complexity of Statistical MPC with Optimal Resiliency. - Benny Applebaum; Eliran Kachlon; Arpita Patra (Electron. Colloquium Comput. Complex., 2023)

Advisor-Verifier-Prover Games and the Hardness of Information Theoretic Cryptography. - Benny Applebaum; Oded Nir (Electron. Colloquium Comput. Complex., 2023)

How to Recover a Secret with $O(n)$ Additions. - Benny Applebaum; Oded Nir; Benny Pinkas (Electron. Colloquium Comput. Complex., 2023)

Actively Secure Arithmetic Computation and VOLE with Constant Computational Overhead. - Benny Applebaum; Niv Konstantini (IACR Cryptol. ePrint Arch., 2023)

Correction: Locally Computable UOWHF with Linear Shrinkage. - Benny Applebaum; Yoni Moses (J. Cryptol., 2023)

Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error. - Benny Applebaum; Eliran Kachlon (SIAM J. Comput., 2023)

Communication Complexity vs Randomness Complexity in Interactive Proofs. - Benny Applebaum; Kaartik Bhushan; Manoj Prabhakaran 001 (Electron. Colloquium Comput. Complex., 2024)

Stochastic Secret Sharing with $1$-Bit Shares and Applications to MPC. - Benny Applebaum; Eliran Kachlon (Electron. Colloquium Comput. Complex., 2024)

Distributing Keys and Random Secrets with Constant Complexity. - Benny Applebaum; Benny Pinkas (IACR Cryptol. ePrint Arch., 2024)

How to Share an NP Statement or Combiners for Zero-Knowledge Proofs. - Benny Applebaum; Eliran Kachlon (Electron. Colloquium Comput. Complex., 2025)

The Meta-Complexity of Secret Sharing. - Benny Applebaum; Oded Nir (Electron. Colloquium Comput. Complex., 2025)

NIZK Amplification via Leakage-Resilient Secure Computation. - Benny Applebaum; Eliran Kachlon (IACR Cryptol. ePrint Arch., 2025)