Benny Applebaum

ORCID

Publication Activity (10 Years)

Years Active: 2004-2024
Publications (10 Years): 106

Top Venues

IACR Cryptol. ePrint Arch.

Electron. Colloquium Comput. Complex.

J. Cryptol.

SIAM J. Comput.

Publications

Benny Applebaum, Kaartik Bhushan, Manoj Prabhakaran
Communication Complexity vs Randomness Complexity in Interactive Proofs. ITC (2024)
Benny Applebaum, Eliran Kachlon
Stochastic Secret Sharing with $1$-Bit Shares and Applications to MPC. Electron. Colloquium Comput. Complex. (2024)
Benny Applebaum, Eliran Kachlon
Stochastic Secret Sharing with 1-Bit Shares and Applications to MPC. IACR Cryptol. ePrint Arch. 2024 (2024)
Benny Applebaum, Eliran Kachlon
Conflict Checkable and Decodable Codes and Their Applications. SODA (2024)
Benny Applebaum, Kaartik Bhushan, Manoj Prabhakaran
Communication Complexity vs Randomness Complexity in Interactive Proofs. Electron. Colloquium Comput. Complex. (2024)
Benny Applebaum, Benny Pinkas
Distributing Keys and Random Secrets with Constant Complexity. IACR Cryptol. ePrint Arch. 2024 (2024)
Benny Applebaum, Kaartik Bhushan, Manoj Prabhakaran
Communication Complexity vs Randomness Complexity in Interactive Proofs. IACR Cryptol. ePrint Arch. 2024 (2024)
Benny Applebaum, Eliran Kachlon
Stochastic Secret Sharing with 1-Bit Shares and Applications to MPC. CRYPTO (5) (2024)
Benny Applebaum, Eliran Kachlon
Conflict Checkable and Decodable Codes and Their Applications. Electron. Colloquium Comput. Complex. (2023)
Benny Applebaum, Yoni Moses
Correction: Locally Computable UOWHF with Linear Shrinkage. J. Cryptol. 36 (2) (2023)
Benny Applebaum, Eliran Kachlon, Arpita Patra
The Round Complexity of Statistical MPC with Optimal Resiliency. IACR Cryptol. ePrint Arch. 2023 (2023)
Benny Applebaum, Eliran Kachlon
Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error. SIAM J. Comput. 52 (6) (2023)
Benny Applebaum, Oded Nir
Advisor-Verifier-Prover Games and the Hardness of Information Theoretic Cryptography. Electron. Colloquium Comput. Complex. (2023)
Benny Applebaum, Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Tianren Liu, Vinod Vaikuntanathan
Succinct Computational Secret Sharing. Electron. Colloquium Comput. Complex. (2023)
Benny Applebaum, Oded Nir
Advisor-Verifier-Prover Games and the Hardness of Information Theoretic Cryptography. IACR Cryptol. ePrint Arch. 2023 (2023)
Benny Applebaum, Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Tianren Liu, Vinod Vaikuntanathan
Succinct Computational Secret Sharing. IACR Cryptol. ePrint Arch. 2023 (2023)
Benny Applebaum, Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Tianren Liu, Vinod Vaikuntanathan
Succinct Computational Secret Sharing. STOC (2023)
Benny Applebaum, Oded Nir, Benny Pinkas
How to Recover a Secret with O(n) Additions. CRYPTO (1) (2023)
Benny Applebaum, Oded Nir
Advisor-Verifier-Prover Games and the Hardness of Information Theoretic Cryptography. FOCS (2023)
Benny Applebaum, Eliran Kachlon, Arpita Patra
The Round Complexity of Statistical MPC with Optimal Resiliency. Electron. Colloquium Comput. Complex. (2023)
Benny Applebaum, Eliran Kachlon
Conflict Checkable and Decodable Codes and Their Applications. IACR Cryptol. ePrint Arch. 2023 (2023)
Benny Applebaum, Oded Nir, Benny Pinkas
How to Recover a Secret with $O(n)$ Additions. Electron. Colloquium Comput. Complex. (2023)
Benny Applebaum, Eliran Kachlon, Arpita Patra
The Round Complexity of Statistical MPC with Optimal Resiliency. STOC (2023)
Benny Applebaum, Niv Konstantini
Actively Secure Arithmetic Computation and VOLE with Constant Computational Overhead. EUROCRYPT (2) (2023)
Benny Applebaum, Niv Konstantini
Actively Secure Arithmetic Computation and VOLE with Constant Computational Overhead. IACR Cryptol. ePrint Arch. 2023 (2023)
Benny Applebaum, Oded Nir, Benny Pinkas
How to Recover a Secret with O(n) Additions. IACR Cryptol. ePrint Arch. 2023 (2023)
Benny Applebaum, Eliran Kachlon, Arpita Patra
Verifiable Relation Sharing and Multi-verifier Zero-Knowledge in Two Rounds: Trading NIZKs with Honest Majority - (Extended Abstract). CRYPTO (4) (2022)
Benny Applebaum, Amos Beimel, Oded Nir, Naty Peter, Toniann Pitassi
Secret Sharing, Slice Formulas, and Monotone Real Circuits. Electron. Colloquium Comput. Complex. 29 (2022)
Benny Applebaum, Amos Beimel, Oded Nir, Naty Peter, Toniann Pitassi
Secret Sharing, Slice Formulas, and Monotone Real Circuits. ITCS (2022)
Benny Applebaum, Yuval Ishai, Or Karni, Arpita Patra
Quadratic Multiparty Randomized Encodings Beyond Honest Majority and Their Applications. CRYPTO (4) (2022)
Alin Tomescu, Adithya Bhat, Benny Applebaum, Ittai Abraham, Guy Gueta, Benny Pinkas, Avishay Yanai
UTT: Decentralized Ecash with Accountable Privacy. IACR Cryptol. ePrint Arch. 2022 (2022)
Benny Applebaum, Eliran Kachlon, Arpita Patra
Round-Optimal Honest-Majority MPC in Minicrypt and with Everlasting Security - (Extended Abstract). TCC (2) (2022)
Benny Applebaum, Eliran Kachlon, Arpita Patra
Verifiable Relation Sharing and Multi-Verifier Zero-Knowledge in Two Rounds: Trading NIZKs with Honest Majority. IACR Cryptol. ePrint Arch. 2022 (2022)
Benny Applebaum, Yuval Ishai, Or Karni, Arpita Patra
Quadratic Multiparty Randomized Encodings Beyond Honest Majority and Their Applications. IACR Cryptol. ePrint Arch. 2022 (2022)
Benny Applebaum, Oded Nir
. IACR Cryptol. ePrint Arch. 2021 (2021)
Benny Applebaum, Eyal Golombek
On the Randomness Complexity of Interactive Proofs and Statistical Zero-Knowledge Proofs. IACR Cryptol. ePrint Arch. 2021 (2021)
Benny Applebaum, Aarushi Goel
On Actively-Secure Elementary MPC Reductions. IACR Cryptol. ePrint Arch. 2021 (2021)
Benny Applebaum, Prashant Nalini Vasudevan
Placing Conditional Disclosure of Secrets in the Communication Complexity Universe. J. Cryptol. 34 (2) (2021)
Benny Applebaum, Barak Arkis, Pavel Raykov, Prashant Nalini Vasudevan
Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations. SIAM J. Comput. 50 (1) (2021)
Benny Applebaum, Oded Nir
. CRYPTO (3) (2021)
Benny Applebaum, Eliran Kachlon, Arpita Patra
Round-optimal Honest-majority MPC in Minicrypt and with Everlasting Security. IACR Cryptol. ePrint Arch. 2021 (2021)
Benny Applebaum, Aarushi Goel
On Actively-Secure Elementary MPC Reductions. TCC (1) (2021)
Benny Applebaum, Zvika Brakerski
Obfuscating Circuits Via Composite-Order Graded Encoding. J. Cryptol. 34 (2) (2021)
Benny Applebaum, Eyal Golombek
On the Randomness Complexity of Interactive Proofs and Statistical Zero-Knowledge Proofs. ITC (2021)
Benny Applebaum, Oded Nir
Upslices, Downslices, and Secret-Sharing with Complexity of $1.5^n$. Electron. Colloquium Comput. Complex. 28 (2021)
Benny Applebaum, Zvika Brakerski, Rotem Tsabary
Perfect Secure Computation in Two Rounds. SIAM J. Comput. 50 (1) (2021)
Benny Applebaum, Eliran Kachlon, Arpita Patra
The Round Complexity of Perfect MPC with Active Security and Optimal Resiliency. IACR Cryptol. ePrint Arch. 2020 (2020)
Benny Applebaum, Barak Arkis
-Uniform Secret Sharing and CDS with Constant Information Rate. ACM Trans. Comput. Theory 12 (4) (2020)
Benny Applebaum, Amos Beimel, Oded Nir, Naty Peter
Better Secret-Sharing via Robust Conditional Disclosure of Secrets. Electron. Colloquium Comput. Complex. 27 (2020)
Benny Applebaum, Eliran Kachlon, Arpita Patra
The Round Complexity of Perfect MPC with Active Security and Optimal Resiliency. Electron. Colloquium Comput. Complex. 27 (2020)
Benny Applebaum, Amos Beimel, Oded Nir, Naty Peter
Better secret sharing via robust conditional disclosure of secrets. STOC (2020)
Benny Applebaum, Thomas Holenstein, Manoj Mishra, Ofer Shayevitz
The Communication Complexity of Private Simultaneous Messages, Revisited. J. Cryptol. 33 (3) (2020)
Benny Applebaum, Zvika Brakerski, Sanjam Garg, Yuval Ishai, Akshayaram Srinivasan
Separating Two-Round Secure Computation from Oblivious Transfer. IACR Cryptol. ePrint Arch. 2020 (2020)
Benny Applebaum, Amos Beimel, Oded Nir, Naty Peter
Better Secret-Sharing via Robust Conditional Disclosure of Secrets. IACR Cryptol. ePrint Arch. 2020 (2020)
Benny Applebaum, Eliran Kachlon, Arpita Patra
The Round Complexity of Perfect MPC with Active Security and Optimal Resiliency. FOCS (2020)
Benny Applebaum, Eliran Kachlon, Arpita Patra
The Resiliency of MPC with Low Interaction: The Benefit of Making Errors. IACR Cryptol. ePrint Arch. 2020 (2020)
Benny Applebaum, Eliran Kachlon, Arpita Patra
The Resiliency of MPC with Low Interaction: The Benefit of Making Errors (Extended Abstract). TCC (2) (2020)
Benny Applebaum, Zvika Brakerski, Sanjam Garg, Yuval Ishai, Akshayaram Srinivasan
Separating Two-Round Secure Computation From Oblivious Transfer. ITCS (2020)
Benny Applebaum, Pavel Raykov
On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings. Comput. Complex. 28 (4) (2019)
Benny Applebaum, Eliran Kachlon
Sampling Graphs without Forbidden Subgraphs and Almost-Explicit Unbalanced Expanders. Electron. Colloquium Comput. Complex. 26 (2019)
Benny Applebaum, Prashant Nalini Vasudevan
Placing Conditional Disclosure of Secrets in the Communication Complexity Universe. ITCS (2019)
Benny Applebaum, Zvika Brakerski, Rotem Tsabary
Degree 2 is Complete for the Round-Complexity of Malicious MPC. EUROCRYPT (2) (2019)
Benny Applebaum, Amos Beimel, Oriol Farràs, Oded Nir, Naty Peter
Secret-Sharing Schemes for General and Uniform Access Structures. EUROCRYPT (3) (2019)
Benny Applebaum, Zvika Brakerski, Rotem Tsabary
Degree 2 is Complete for the Round-Complexity of Malicious MPC. IACR Cryptol. ePrint Arch. 2019 (2019)
Benny Applebaum, Amos Beimel, Oriol Farràs, Oded Nir, Naty Peter
Secret-Sharing Schemes for General and Uniform Access Structures. IACR Cryptol. ePrint Arch. 2019 (2019)
Benny Applebaum, Eliran Kachlon
Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error. FOCS (2019)
Benny Applebaum, Thomas Holenstein, Manoj Mishra, Ofer Shayevitz
The Communication Complexity of Private Simultaneous Messages, Revisited. EUROCRYPT (2) (2018)
Benny Applebaum, Thomas Holenstein, Manoj Mishra, Ofer Shayevitz
The Communication Complexity of Private Simultaneous Messages, Revisited. Electron. Colloquium Comput. Complex. 25 (2018)
Benny Applebaum, Barak Arkis
On the Power of Amortization in Secret Sharing: d-Uniform Secret Sharing and CDS with Constant Information Rate. TCC (1) (2018)
Benny Applebaum, Shachar Lovett
Algebraic Attacks against Random Local Functions and Their Countermeasures. SIAM J. Comput. 47 (1) (2018)
Benny Applebaum, Barak Arkis
Conditional Disclosure of Secrets and d-Uniform Secret Sharing with Constant Information Rate. IACR Cryptol. ePrint Arch. 2018 (2018)
Benny Applebaum, Prashant Nalini Vasudevan
Placing Conditional Disclosure of Secrets in the Communication Complexity Universe. IACR Cryptol. ePrint Arch. 2018 (2018)
Benny Applebaum, Prashant Nalini Vasudevan
Placing Conditional Disclosure of Secrets in the Communication Complexity Universe. Electron. Colloquium Comput. Complex. 25 (2018)
Benny Applebaum, Zvika Brakerski, Rotem Tsabary
Perfect Secure Computation in Two Rounds. TCC (1) (2018)
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
Minimizing Locality of One-Way Functions via Semi-private Randomized Encodings. J. Cryptol. 31 (1) (2018)
Benny Applebaum, Zvika Brakerski, Rotem Tsabary
Perfect Secure Computation in Two Rounds. IACR Cryptol. ePrint Arch. 2018 (2018)
Benny Applebaum, Thomas Holenstein, Manoj Mishra, Ofer Shayevitz
The Communication Complexity of Private Simultaneous Messages, Revisited. IACR Cryptol. ePrint Arch. 2018 (2018)
Benny Applebaum, Liron David, Guy Even
Explicit Rateless Codes for Memoryless Binary-Input Output-Symmetric Channels. Theory Comput. 14 (1) (2018)
Benny Applebaum, Naama Haramaty, Yuval Ishai, Eyal Kushilevitz, Vinod Vaikuntanathan
Low-Complexity Cryptographic Hash Functions . ITCS (2017)
Benny Applebaum, Pavel Raykov
From Private Simultaneous Messages to Zero-Information Arthur-Merlin Protocols and Back. J. Cryptol. 30 (4) (2017)
Benny Applebaum, Jonathan Avron, Chris Brzuska
Arithmetic Cryptography. J. ACM 64 (2) (2017)
Benny Applebaum, Yoni Moses
Locally Computable UOWHF with Linear Shrinkage. J. Cryptol. 30 (3) (2017)
Benny Applebaum
Garbled Circuits as Randomized Encodings of Functions: a Primer. IACR Cryptol. ePrint Arch. 2017 (2017)
Benny Applebaum
Exponentially-Hard Gap-CSP and Local PRG via Local Hardcore Functions. FOCS (2017)
Benny Applebaum, Ivan Damgård, Yuval Ishai, Michael Nielsen, Lior Zichron
Secure Arithmetic Computation with Constant Computational Overhead. CRYPTO (1) (2017)
Benny Applebaum
Garbled Circuits as Randomized Encodings of Functions: a Primer. Electron. Colloquium Comput. Complex. 24 (2017)
Benny Applebaum, Barak Arkis, Pavel Raykov, Prashant Nalini Vasudevan
Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-Bounds, and Separations. CRYPTO (1) (2017)
Benny Applebaum, Barak Arkis
Conditional Disclosure of Secrets and d-Uniform Secret Sharing with Constant Information Rate. Electron. Colloquium Comput. Complex. 24 (2017)
Benny Applebaum, Barak Arkis, Pavel Raykov, Prashant Nalini Vasudevan
Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations. IACR Cryptol. ePrint Arch. 2017 (2017)
Benny Applebaum, Naama Haramaty, Yuval Ishai, Eyal Kushilevitz, Vinod Vaikuntanathan
Low-Complexity Cryptographic Hash Functions. IACR Cryptol. ePrint Arch. 2017 (2017)
Benny Applebaum, Barak Arkis, Pavel Raykov, Prashant Nalini Vasudevan
Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations. Electron. Colloquium Comput. Complex. 24 (2017)
Benny Applebaum, Naama Haramaty, Yuval Ishai, Eyal Kushilevitz, Vinod Vaikuntanathan
Low-Complexity Cryptographic Hash Functions. Electron. Colloquium Comput. Complex. 24 (2017)
Benny Applebaum
Exponentially-Hard gap-CSP and local PRG via Local Hardcore Functions. Electron. Colloquium Comput. Complex. 24 (2017)
Benny Applebaum, Ivan Damgård, Yuval Ishai, Michael Nielsen, Lior Zichron
Secure Arithmetic Computation with Constant Computational Overhead. IACR Cryptol. ePrint Arch. 2017 (2017)
Benny Applebaum, Andrej Bogdanov, Alon Rosen
A Dichotomy for Local Small-Bias Generators. J. Cryptol. 29 (3) (2016)
Benny Applebaum, Pavel Raykov
On the Relationship between Statistical Zero-Knowledge and Statistical Randomized Encodings. IACR Cryptol. ePrint Arch. 2016 (2016)
Benny Applebaum, Pavel Raykov
Fast Pseudorandom Functions Based on Expander Graphs. Electron. Colloquium Comput. Complex. 23 (2016)
Benny Applebaum, Pavel Raykov
On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings. CRYPTO (3) (2016)
Benny Applebaum, Sergei Artemenko, Ronen Shaltiel, Guang Yang
Incompressible Functions, Relative-Error Extractors, and the Power of Nondeterministic Reductions. Comput. Complex. 25 (2) (2016)
Benny Applebaum, Dariusz R. Kowalski, Boaz Patt-Shamir, Adi Rosén
Clique Here: On the Distributed Complexity in Fully-Connected Networks. Parallel Process. Lett. 26 (1) (2016)

Benny Applebaum.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Benny Applebaum