Benny Applebaum

182 papers A* 19A 14B 3Journal 111Unranked 28
YearRankTypeTitle / Venue / Authors
2026 — ed.
Theory of Cryptography - 23rd International Conference, TCC 2025, Aarhus, Denmark, December 1-5, 2025, Proceedings, Part I
TCC (1)
Benny Applebaum, Huijia Rachel Lin
2026 — ed.
Theory of Cryptography - 23rd International Conference, TCC 2025, Aarhus, Denmark, December 1-5, 2025, Proceedings, Part II
TCC (2)
Benny Applebaum, Huijia Rachel Lin
2026 — ed.
Theory of Cryptography - 23rd International Conference, TCC 2025, Aarhus, Denmark, December 1-5, 2025, Proceedings, Part III
TCC (3)
Benny Applebaum, Huijia Rachel Lin
2026 — ed.
Theory of Cryptography - 23rd International Conference, TCC 2025, Aarhus, Denmark, December 1-5, 2025, Proceedings, Part IV
TCC (4)
Benny Applebaum, Huijia (Rachel) Lin
2025 — conf
How to Share an NP Statement or Combiners for Zero-Knowledge Proofs.
CRYPTO (7)
Benny Applebaum, Eliran Kachlon
2025 J jnl
How to Share an NP Statement or Combiners for Zero-Knowledge Proofs.
Electron. Colloquium Comput. Complex.
Benny Applebaum, Eliran Kachlon
2025 J jnl
How to Share an NP Statement or Combiners for Zero-Knowledge Proofs.
IACR Cryptol. ePrint Arch.
Benny Applebaum, Eliran Kachlon
2025 — conf
NIZK Amplification via Leakage-Resilient Secure Computation.
CRYPTO (7)
Benny Applebaum, Eliran Kachlon
2025 J jnl
NIZK Amplification via Leakage-Resilient Secure Computation.
IACR Cryptol. ePrint Arch.
Benny Applebaum, Eliran Kachlon
2025 A conf
Structured-Seed Local Pseudorandom Generators and Their Applications.
APPROX/RANDOM
Benny Applebaum, Dung Bui, Geoffroy Couteau, Nikolas Melissaris
2025 J jnl
The Meta-Complexity of Secret Sharing.
Electron. Colloquium Comput. Complex.
Benny Applebaum, Oded Nir
2025 J jnl
The Meta-Complexity of Secret Sharing.
IACR Cryptol. ePrint Arch.
Benny Applebaum, Oded Nir
2025 A* conf
The Meta-complexity of Secret Sharing.
STOC
Benny Applebaum, Oded Nir
2024 A conf
Communication Complexity vs Randomness Complexity in Interactive Proofs.
ITC
Benny Applebaum, Kaartik Bhushan, Manoj Prabhakaran
2024 J jnl
Communication Complexity vs Randomness Complexity in Interactive Proofs.
Electron. Colloquium Comput. Complex.
Benny Applebaum, Kaartik Bhushan, Manoj Prabhakaran
2024 J jnl
Communication Complexity vs Randomness Complexity in Interactive Proofs.
IACR Cryptol. ePrint Arch.
Benny Applebaum, Kaartik Bhushan, Manoj Prabhakaran
2024 A* conf
Conflict Checkable and Decodable Codes and Their Applications.
SODA
Benny Applebaum, Eliran Kachlon
2024 — conf
Distributing Keys and Random Secrets with Constant Complexity.
TCC (4)
Benny Applebaum, Benny Pinkas
2024 J jnl
Distributing Keys and Random Secrets with Constant Complexity.
IACR Cryptol. ePrint Arch.
Benny Applebaum, Benny Pinkas
2024 J jnl
Stochastic Secret Sharing with $1$-Bit Shares and Applications to MPC.
Electron. Colloquium Comput. Complex.
Benny Applebaum, Eliran Kachlon
2024 — conf
Stochastic Secret Sharing with 1-Bit Shares and Applications to MPC.
CRYPTO (5)
Benny Applebaum, Eliran Kachlon
2024 J jnl
Stochastic Secret Sharing with 1-Bit Shares and Applications to MPC.
IACR Cryptol. ePrint Arch.
Benny Applebaum, Eliran Kachlon
2023 — conf
Actively Secure Arithmetic Computation and VOLE with Constant Computational Overhead.
EUROCRYPT (2)
Benny Applebaum, Niv Konstantini
2023 J jnl
Actively Secure Arithmetic Computation and VOLE with Constant Computational Overhead.
IACR Cryptol. ePrint Arch.
Benny Applebaum, Niv Konstantini
2023 A* conf
Advisor-Verifier-Prover Games and the Hardness of Information Theoretic Cryptography.
FOCS
Benny Applebaum, Oded Nir
2023 J jnl
Advisor-Verifier-Prover Games and the Hardness of Information Theoretic Cryptography.
Electron. Colloquium Comput. Complex.
Benny Applebaum, Oded Nir
2023 J jnl
Advisor-Verifier-Prover Games and the Hardness of Information Theoretic Cryptography.
IACR Cryptol. ePrint Arch.
Benny Applebaum, Oded Nir
2023 J jnl
Conflict Checkable and Decodable Codes and Their Applications.
Electron. Colloquium Comput. Complex.
Benny Applebaum, Eliran Kachlon
2023 J jnl
Conflict Checkable and Decodable Codes and Their Applications.
IACR Cryptol. ePrint Arch.
Benny Applebaum, Eliran Kachlon
2023 J jnl
Correction: Locally Computable UOWHF with Linear Shrinkage.
J. Cryptol.
Benny Applebaum, Yoni Moses
2023 J jnl
How to Recover a Secret with $O(n)$ Additions.
Electron. Colloquium Comput. Complex.
Benny Applebaum, Oded Nir, Benny Pinkas
2023 — conf
How to Recover a Secret with O(n) Additions.
CRYPTO (1)
Benny Applebaum, Oded Nir, Benny Pinkas
2023 J jnl
How to Recover a Secret with O(n) Additions.
IACR Cryptol. ePrint Arch.
Benny Applebaum, Oded Nir, Benny Pinkas
2023 J jnl
Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error.
SIAM J. Comput.
Benny Applebaum, Eliran Kachlon
2023 A* conf
Succinct Computational Secret Sharing.
STOC
Benny Applebaum, Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Tianren Liu, Vinod Vaikuntanathan
2023 J jnl
Succinct Computational Secret Sharing.
Electron. Colloquium Comput. Complex.
Benny Applebaum, Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Tianren Liu, Vinod Vaikuntanathan
2023 J jnl
Succinct Computational Secret Sharing.
IACR Cryptol. ePrint Arch.
Benny Applebaum, Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Tianren Liu, Vinod Vaikuntanathan
2023 A* conf
The Round Complexity of Statistical MPC with Optimal Resiliency.
STOC
Benny Applebaum, Eliran Kachlon, Arpita Patra
2023 J jnl
The Round Complexity of Statistical MPC with Optimal Resiliency.
Electron. Colloquium Comput. Complex.
Benny Applebaum, Eliran Kachlon, Arpita Patra
2023 J jnl
The Round Complexity of Statistical MPC with Optimal Resiliency.
IACR Cryptol. ePrint Arch.
Benny Applebaum, Eliran Kachlon, Arpita Patra
2022 — conf
Quadratic Multiparty Randomized Encodings Beyond Honest Majority and Their Applications.
CRYPTO (4)
Benny Applebaum, Yuval Ishai, Or Karni, Arpita Patra
2022 J jnl
Quadratic Multiparty Randomized Encodings Beyond Honest Majority and Their Applications.
IACR Cryptol. ePrint Arch.
Benny Applebaum, Yuval Ishai, Or Karni, Arpita Patra
2022 — conf
Round-Optimal Honest-Majority MPC in Minicrypt and with Everlasting Security - (Extended Abstract).
TCC (2)
Benny Applebaum, Eliran Kachlon, Arpita Patra
2022 A conf
Secret Sharing, Slice Formulas, and Monotone Real Circuits.
ITCS
Benny Applebaum, Amos Beimel, Oded Nir, Naty Peter, Toniann Pitassi
2022 J jnl
Secret Sharing, Slice Formulas, and Monotone Real Circuits.
Electron. Colloquium Comput. Complex.
Benny Applebaum, Amos Beimel, Oded Nir, Naty Peter, Toniann Pitassi
2022 J jnl
UTT: Decentralized Ecash with Accountable Privacy.
IACR Cryptol. ePrint Arch.
Alin Tomescu, Adithya Bhat, Benny Applebaum, Ittai Abraham, Guy Gueta, Benny Pinkas, Avishay Yanai
2022 J jnl
Verifiable Relation Sharing and Multi-Verifier Zero-Knowledge in Two Rounds: Trading NIZKs with Honest Majority.
IACR Cryptol. ePrint Arch.
Benny Applebaum, Eliran Kachlon, Arpita Patra
2022 — conf
Verifiable Relation Sharing and Multi-verifier Zero-Knowledge in Two Rounds: Trading NIZKs with Honest Majority - (Extended Abstract).
CRYPTO (4)
Benny Applebaum, Eliran Kachlon, Arpita Patra
2021 J jnl
Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations.
SIAM J. Comput.
Benny Applebaum, Barak Arkis, Pavel Raykov, Prashant Nalini Vasudevan
2021 J jnl
Obfuscating Circuits Via Composite-Order Graded Encoding.
J. Cryptol.
Benny Applebaum, Zvika Brakerski
2021 — conf
On Actively-Secure Elementary MPC Reductions.
TCC (1)
Benny Applebaum, Aarushi Goel
2021 J jnl
On Actively-Secure Elementary MPC Reductions.
IACR Cryptol. ePrint Arch.
Benny Applebaum, Aarushi Goel
2021 A conf
On the Randomness Complexity of Interactive Proofs and Statistical Zero-Knowledge Proofs.
ITC
Benny Applebaum, Eyal Golombek
2021 J jnl
On the Randomness Complexity of Interactive Proofs and Statistical Zero-Knowledge Proofs.
IACR Cryptol. ePrint Arch.
Benny Applebaum, Eyal Golombek
2021 J jnl
Perfect Secure Computation in Two Rounds.
SIAM J. Comput.
Benny Applebaum, Zvika Brakerski, Rotem Tsabary
2021 J jnl
Placing Conditional Disclosure of Secrets in the Communication Complexity Universe.
J. Cryptol.
Benny Applebaum, Prashant Nalini Vasudevan
2021 J jnl
Round-optimal Honest-majority MPC in Minicrypt and with Everlasting Security.
IACR Cryptol. ePrint Arch.
Benny Applebaum, Eliran Kachlon, Arpita Patra
2021 J jnl
Upslices, Downslices, and Secret-Sharing with Complexity of $1.5^n$.
Electron. Colloquium Comput. Complex.
Benny Applebaum, Oded Nir
2021 — conf
Upslices, Downslices, and Secret-Sharing with Complexity of 1.5
CRYPTO (3)
Benny Applebaum, Oded Nir
2021 J jnl
Upslices, Downslices, and Secret-Sharing with Complexity of 1.5
IACR Cryptol. ePrint Arch.
Benny Applebaum, Oded Nir
2020 J jnl
Better Secret-Sharing via Robust Conditional Disclosure of Secrets.
Electron. Colloquium Comput. Complex.
Benny Applebaum, Amos Beimel, Oded Nir, Naty Peter
2020 J jnl
Better Secret-Sharing via Robust Conditional Disclosure of Secrets.
IACR Cryptol. ePrint Arch.
Benny Applebaum, Amos Beimel, Oded Nir, Naty Peter
2020 A* conf
Better secret sharing via robust conditional disclosure of secrets.
STOC
Benny Applebaum, Amos Beimel, Oded Nir, Naty Peter
2020 J jnl
On the Power of Amortization in Secret Sharing:
ACM Trans. Comput. Theory
Benny Applebaum, Barak Arkis
2020 A conf
Separating Two-Round Secure Computation From Oblivious Transfer.
ITCS
Benny Applebaum, Zvika Brakerski, Sanjam Garg, Yuval Ishai, Akshayaram Srinivasan
2020 J jnl
Separating Two-Round Secure Computation from Oblivious Transfer.
IACR Cryptol. ePrint Arch.
Benny Applebaum, Zvika Brakerski, Sanjam Garg, Yuval Ishai, Akshayaram Srinivasan
2020 J jnl
The Communication Complexity of Private Simultaneous Messages, Revisited.
J. Cryptol.
Benny Applebaum, Thomas Holenstein, Manoj Mishra, Ofer Shayevitz
2020 — conf
The Resiliency of MPC with Low Interaction: The Benefit of Making Errors (Extended Abstract).
TCC (2)
Benny Applebaum, Eliran Kachlon, Arpita Patra
2020 J jnl
The Resiliency of MPC with Low Interaction: The Benefit of Making Errors.
IACR Cryptol. ePrint Arch.
Benny Applebaum, Eliran Kachlon, Arpita Patra
2020 A* conf
The Round Complexity of Perfect MPC with Active Security and Optimal Resiliency.
FOCS
Benny Applebaum, Eliran Kachlon, Arpita Patra
2020 J jnl
The Round Complexity of Perfect MPC with Active Security and Optimal Resiliency.
Electron. Colloquium Comput. Complex.
Benny Applebaum, Eliran Kachlon, Arpita Patra
2020 J jnl
The Round Complexity of Perfect MPC with Active Security and Optimal Resiliency.
IACR Cryptol. ePrint Arch.
Benny Applebaum, Eliran Kachlon, Arpita Patra
2019 — conf
Degree 2 is Complete for the Round-Complexity of Malicious MPC.
EUROCRYPT (2)
Benny Applebaum, Zvika Brakerski, Rotem Tsabary
2019 J jnl
Degree 2 is Complete for the Round-Complexity of Malicious MPC.
IACR Cryptol. ePrint Arch.
Benny Applebaum, Zvika Brakerski, Rotem Tsabary
2019 J jnl
On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings.
Comput. Complex.
Benny Applebaum, Pavel Raykov
2019 A conf
Placing Conditional Disclosure of Secrets in the Communication Complexity Universe.
ITCS
Benny Applebaum, Prashant Nalini Vasudevan
2019 J jnl
Sampling Graphs without Forbidden Subgraphs and Almost-Explicit Unbalanced Expanders.
Electron. Colloquium Comput. Complex.
Benny Applebaum, Eliran Kachlon
2019 A* conf
Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error.
FOCS
Benny Applebaum, Eliran Kachlon
2019 — conf
Secret-Sharing Schemes for General and Uniform Access Structures.
EUROCRYPT (3)
Benny Applebaum, Amos Beimel, Oriol Farràs, Oded Nir, Naty Peter
2019 J jnl
Secret-Sharing Schemes for General and Uniform Access Structures.
IACR Cryptol. ePrint Arch.
Benny Applebaum, Amos Beimel, Oriol Farràs, Oded Nir, Naty Peter
2018 J jnl
Algebraic Attacks against Random Local Functions and Their Countermeasures.
SIAM J. Comput.
Benny Applebaum, Shachar Lovett
2018 J jnl
Conditional Disclosure of Secrets and d-Uniform Secret Sharing with Constant Information Rate.
IACR Cryptol. ePrint Arch.
Benny Applebaum, Barak Arkis
2018 J jnl
Explicit Rateless Codes for Memoryless Binary-Input Output-Symmetric Channels.
Theory Comput.
Benny Applebaum, Liron David, Guy Even
2018 J jnl
Minimizing Locality of One-Way Functions via Semi-private Randomized Encodings.
J. Cryptol.
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
2018 — conf
On the Power of Amortization in Secret Sharing: d-Uniform Secret Sharing and CDS with Constant Information Rate.
TCC (1)
Benny Applebaum, Barak Arkis
2018 — conf
Perfect Secure Computation in Two Rounds.
TCC (1)
Benny Applebaum, Zvika Brakerski, Rotem Tsabary
2018 J jnl
Perfect Secure Computation in Two Rounds.
IACR Cryptol. ePrint Arch.
Benny Applebaum, Zvika Brakerski, Rotem Tsabary
2018 J jnl
Placing Conditional Disclosure of Secrets in the Communication Complexity Universe.
Electron. Colloquium Comput. Complex.
Benny Applebaum, Prashant Nalini Vasudevan
2018 J jnl
Placing Conditional Disclosure of Secrets in the Communication Complexity Universe.
IACR Cryptol. ePrint Arch.
Benny Applebaum, Prashant Nalini Vasudevan
2018 — conf
The Communication Complexity of Private Simultaneous Messages, Revisited.
EUROCRYPT (2)
Benny Applebaum, Thomas Holenstein, Manoj Mishra, Ofer Shayevitz
2018 J jnl
The Communication Complexity of Private Simultaneous Messages, Revisited.
Electron. Colloquium Comput. Complex.
Benny Applebaum, Thomas Holenstein, Manoj Mishra, Ofer Shayevitz
2018 J jnl
The Communication Complexity of Private Simultaneous Messages, Revisited.
IACR Cryptol. ePrint Arch.
Benny Applebaum, Thomas Holenstein, Manoj Mishra, Ofer Shayevitz
2017 J jnl
Arithmetic Cryptography.
J. ACM
Benny Applebaum, Jonathan Avron, Chris Brzuska
2017 J jnl
Conditional Disclosure of Secrets and d-Uniform Secret Sharing with Constant Information Rate.
Electron. Colloquium Comput. Complex.
Benny Applebaum, Barak Arkis
2017 — conf
Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-Bounds, and Separations.
CRYPTO (1)
Benny Applebaum, Barak Arkis, Pavel Raykov, Prashant Nalini Vasudevan
2017 J jnl
Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations.
Electron. Colloquium Comput. Complex.
Benny Applebaum, Barak Arkis, Pavel Raykov, Prashant Nalini Vasudevan
2017 J jnl
Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations.
IACR Cryptol. ePrint Arch.
Benny Applebaum, Barak Arkis, Pavel Raykov, Prashant Nalini Vasudevan
2017 A* conf
Exponentially-Hard Gap-CSP and Local PRG via Local Hardcore Functions.
FOCS
Benny Applebaum
2017 J jnl
Exponentially-Hard gap-CSP and local PRG via Local Hardcore Functions.
Electron. Colloquium Comput. Complex.
Benny Applebaum
2017 J jnl
From Private Simultaneous Messages to Zero-Information Arthur-Merlin Protocols and Back.
J. Cryptol.
Benny Applebaum, Pavel Raykov
2017 — ch.
Garbled Circuits as Randomized Encodings of Functions: a Primer.
Tutorials on the Foundations of Cryptography
Benny Applebaum
2017 J jnl
Garbled Circuits as Randomized Encodings of Functions: a Primer.
Electron. Colloquium Comput. Complex.
Benny Applebaum
2017 J jnl
Garbled Circuits as Randomized Encodings of Functions: a Primer.
IACR Cryptol. ePrint Arch.
Benny Applebaum
2017 J jnl
Locally Computable UOWHF with Linear Shrinkage.
J. Cryptol.
Benny Applebaum, Yoni Moses
2017 A conf
Low-Complexity Cryptographic Hash Functions .
ITCS
Benny Applebaum, Naama Haramaty, Yuval Ishai, Eyal Kushilevitz, Vinod Vaikuntanathan
2017 J jnl
Low-Complexity Cryptographic Hash Functions.
Electron. Colloquium Comput. Complex.
Benny Applebaum, Naama Haramaty, Yuval Ishai, Eyal Kushilevitz, Vinod Vaikuntanathan
2017 J jnl
Low-Complexity Cryptographic Hash Functions.
IACR Cryptol. ePrint Arch.
Benny Applebaum, Naama Haramaty, Yuval Ishai, Eyal Kushilevitz, Vinod Vaikuntanathan
2017 — conf
Secure Arithmetic Computation with Constant Computational Overhead.
CRYPTO (1)
Benny Applebaum, Ivan Damgård, Yuval Ishai, Michael Nielsen, Lior Zichron
2017 J jnl
Secure Arithmetic Computation with Constant Computational Overhead.
IACR Cryptol. ePrint Arch.
Benny Applebaum, Ivan Damgård, Yuval Ishai, Michael Nielsen, Lior Zichron
2016 J jnl
A Dichotomy for Local Small-Bias Generators.
J. Cryptol.
Benny Applebaum, Andrej Bogdanov, Alon Rosen
2016 A* conf
Algebraic attacks against random local functions and their countermeasures.
STOC
Benny Applebaum, Shachar Lovett
2016 J jnl
Clique Here: On the Distributed Complexity in Fully-Connected Networks.
Parallel Process. Lett.
Benny Applebaum, Dariusz R. Kowalski, Boaz Patt-Shamir, Adi Rosén
2016 J jnl
Cryptographic Hardness of Random Local Functions - Survey.
Comput. Complex.
Benny Applebaum
2016 — conf
Fast Pseudorandom Functions Based on Expander Graphs.
TCC (B1)
Benny Applebaum, Pavel Raykov
2016 J jnl
Fast Pseudorandom Functions Based on Expander Graphs.
Electron. Colloquium Comput. Complex.
Benny Applebaum, Pavel Raykov
2016 J jnl
Fast Pseudorandom Functions Based on Expander Graphs.
IACR Cryptol. ePrint Arch.
Benny Applebaum, Pavel Raykov
2016 — conf
From Private Simultaneous Messages to Zero-Information Arthur-Merlin Protocols and Back.
TCC (A2)
Benny Applebaum, Pavel Raykov
2016 J jnl
Garbling XOR Gates "For Free" in the Standard Model.
J. Cryptol.
Benny Applebaum
2016 J jnl
Incompressible Functions, Relative-Error Extractors, and the Power of Nondeterministic Reductions.
Comput. Complex.
Benny Applebaum, Sergei Artemenko, Ronen Shaltiel, Guang Yang
2016 — conf
On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings.
CRYPTO (3)
Benny Applebaum, Pavel Raykov
2016 J jnl
On the Relationship between Statistical Zero-Knowledge and Statistical Randomized Encodings.
IACR Cryptol. ePrint Arch.
Benny Applebaum, Pavel Raykov
2015 J jnl
Algebraic Attacks against Random Local Functions and Their Countermeasures.
Electron. Colloquium Comput. Complex.
Benny Applebaum, Shachar Lovett
2015 J jnl
Arithmetic Cryptography.
Electron. Colloquium Comput. Complex.
Benny Applebaum, Jonathan Avron, Christina Brzuska
2015 J jnl
Arithmetic Cryptography.
IACR Cryptol. ePrint Arch.
Benny Applebaum, Jonathan Avron, Christina Brzuska
2015 A conf
Arithmetic Cryptography: Extended Abstract.
ITCS
Benny Applebaum, Jonathan Avron, Christina Brzuska
2015 J jnl
Cryptographic Hardness of Random Local Functions - Survey.
Electron. Colloquium Comput. Complex.
Benny Applebaum
2015 A conf
Deterministic Rateless Codes for BSC.
ITCS
Benny Applebaum, Liron David, Guy Even
2015 J jnl
Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys.
SIAM J. Comput.
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz, Brent Waters
2015 J jnl
From Private Simultaneous Messages to Zero-Information Arthur-Merlin Protocols and Back.
Electron. Colloquium Comput. Complex.
Benny Applebaum, Pavel Raykov
2015 J jnl
From Private Simultaneous Messages to Zero-Information Arthur-Merlin Protocols and Back.
IACR Cryptol. ePrint Arch.
Benny Applebaum, Pavel Raykov
2015 A conf
Incompressible Functions, Relative-Error Extractors, and the Power of Nondeterministic Reductions (Extended Abstract).
CCC
Benny Applebaum, Sergei Artemenko, Ronen Shaltiel, Guang Yang
2015 J jnl
Incompressible Functions, Relative-Error Extractors, and the Power of Nondeterminsitic Reductions.
Electron. Colloquium Comput. Complex.
Benny Applebaum, Sergei Artemenko, Ronen Shaltiel, Guang Yang
2015 J jnl
Minimizing Locality of One-Way Functions via Semi-Private Randomized Encodings.
Electron. Colloquium Comput. Complex.
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
2015 — conf
Obfuscating Circuits via Composite-Order Graded Encoding.
TCC (2)
Benny Applebaum, Zvika Brakerski
2015 J jnl
Obfuscating Circuits via Composite-Order Graded Encoding.
IACR Cryptol. ePrint Arch.
Benny Applebaum, Zvika Brakerski
2015 J jnl
On the Relationship between Statistical Zero-Knowledge and Statistical Randomized Encodings.
Electron. Colloquium Comput. Complex.
Benny Applebaum, Pavel Raykov
2015 J jnl
The Cryptographic Hardness of Random Local Functions - Survey.
IACR Cryptol. ePrint Arch.
Benny Applebaum
2014 — conf
Bootstrapping Obfuscators via Fast Pseudorandom Functions.
ASIACRYPT (2)
Benny Applebaum
2014 — book
Cryptography in Constant Parallel Time.
Benny Applebaum
2014 J jnl
Deterministic Rateless Codes for BSC.
CoRR
Benny Applebaum, Liron David, Guy Even
2014 J jnl
How to Garble Arithmetic Circuits.
SIAM J. Comput.
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
2014 J jnl
Key-Dependent Message Security: Generic Amplification and Completeness.
J. Cryptol.
Benny Applebaum
2014 J jnl
Related-Key Secure Pseudorandom Functions: The Case of Additive Attacks.
IACR Cryptol. ePrint Arch.
Benny Applebaum, Eyal Widder
2013 J jnl
Bootstrapping Obfuscators via Fast Pseudorandom Functions.
IACR Cryptol. ePrint Arch.
Benny Applebaum
2013 B conf
Cryptographic Hardness of Random Local Functions-Survey.
TCC
Benny Applebaum
2013 — conf
Encoding Functions with Constant Online Rate or How to Compress Garbled Circuits Keys.
CRYPTO (2)
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz, Brent Waters
2013 B conf
Garbling XOR Gates "For Free" in the Standard Model.
TCC
Benny Applebaum
2013 A* conf
Locally Computable UOWHF with Linear Shrinkage.
EUROCRYPT
Benny Applebaum, Yoni Moses
2013 J jnl
Locally Computable UOWHF with Linear Shrinkage.
Electron. Colloquium Comput. Complex.
Benny Applebaum, Yoni Moses
2013 J jnl
Locally Computable UOWHF with Linear Shrinkage.
IACR Cryptol. ePrint Arch.
Benny Applebaum, Yoni Moses
2013 J jnl
Pseudorandom Generators with Long Stretch and Low Locality from Random Local One-Way Functions.
SIAM J. Comput.
Benny Applebaum
2012 B conf
A Dichotomy for Local Small-Bias Generators.
TCC
Benny Applebaum, Andrej Bogdanov, Alon Rosen
2012 J jnl
Encoding Functions with Constant Online Rate or How to Compress Keys in Garbled Circuits.
IACR Cryptol. ePrint Arch.
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz, Brent Waters
2012 J jnl
Garbling XOR Gates "For Free" in the Standard Model.
IACR Cryptol. ePrint Arch.
Benny Applebaum
2012 J jnl
How to Garble Arithmetic Circuits.
Electron. Colloquium Comput. Complex.
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
2012 J jnl
How to Garble Arithmetic Circuits.
IACR Cryptol. ePrint Arch.
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
2012 A* conf
Pseudorandom generators with long stretch and low locality from random local one-way functions.
STOC
Benny Applebaum
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 A* conf
How to Garble Arithmetic Circuits.
FOCS
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
2011 A* conf
Key-Dependent Message Security: Generic Amplification and Completeness.
EUROCRYPT
Benny Applebaum
2011 J jnl
Pseudorandom Generators with Long Stretch and Low locality from Random Local One-Way Functions.
Electron. Colloquium Comput. Complex.
Benny Applebaum
2011 — conf
Randomly Encoding Functions: A New Cryptographic Paradigm - (Invited Talk).
ICITS
Benny Applebaum
2011 A conf
Semantic Security under Related-Key Attacks and Applications.
ICS
Benny Applebaum, Danny Harnik, Yuval Ishai
2010 A conf
Collaborative, Privacy-Preserving Data Aggregation at Scale.
Privacy Enhancing Technologies
Benny Applebaum, Haakon Ringberg, Michael J. Freedman, Matthew Caesar, Jennifer Rexford
2010 A conf
Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature?
ICS
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
2010 — conf
From Secrecy to Soundness: Efficient Verification via Secure Computation.
ICALP (1)
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
2010 J jnl
Key-Dependent Message Security: Generic Amplification and Completeness.
IACR Cryptol. ePrint Arch.
Benny Applebaum
2010 A* conf
Public-key cryptography from different assumptions.
STOC
Benny Applebaum, Boaz Barak, Avi Wigderson
2010 J jnl
Semantic Security Under Related-Key Attacks and Applications.
IACR Cryptol. ePrint Arch.
Benny Applebaum, Danny Harnik, Yuval Ishai
2009 J jnl
Collaborative, Privacy-Preserving Data Aggregation at Scale.
IACR Cryptol. ePrint Arch.
Haakon Ringberg, Benny Applebaum, Michael J. Freedman, Matthew Caesar, Jennifer Rexford
2009 J jnl
Cryptography with Constant Input Locality.
J. Cryptol.
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
2009 A* conf
Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems.
CRYPTO
Benny Applebaum, David Cash, Chris Peikert, Amit Sahai
2008 A* conf
On Basing Lower-Bounds for Learning on Worst-Case Assumptions.
FOCS
Benny Applebaum, Boaz Barak, David Xiao
2008 J jnl
On Pseudorandom Generators with Linear Stretch in NC
Comput. Complex.
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
2007 — —
Cryptography in constant parallel time.
Benny Applebaum
2007 A* conf
Cryptography with Constant Input Locality.
CRYPTO
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
2006 J jnl
Computationally Private Randomizing Polynomials and Their Applications.
Comput. Complex.
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
2006 J jnl
Cryptography in NC
SIAM J. Comput.
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
2006 — conf
On Pseudorandom Generators with Linear Stretch in NC
APPROX-RANDOM
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
2005 A conf
Computationally Private Randomizing Polynomials and Their Applications.
CCC
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
2004 A* conf
Cryptography in NC
FOCS
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz