Contact

Email: bennyap
AT post DOT tau DOT ac DOT il 

Address
:
School of Electrical Engineering
Tel-Aviv University
Ramat-Aviv, Tel-Aviv 69978 Israel 

Office
:
203 Computer Engineering Building

Phone
: +972-3-6407352

Publications

See Surveys and books below

Exponentially-Hard gap-CSP and local PRG via Local Hardcore Functions
Benny Applebaum
Proc. 58th FOCS, 2017
Available as an ECCC report.

Secure Arithmetic Computation with Constant Computational Overhead
Benny Applebaum and Ivan Damgård and Yuval Ishai and Michael Nielsen and Lior Zichron
Proc. 37th CRYPTO, 2017
Available as an eprint eport.

Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations

Benny Applebaum and Barak Arkis and Pavel Raykov and Prashant Nalini Vasudevan
Proc. 37th CRYPTO, 2017
Available as an ECCC and eprint eport.

Low-Complexity Cryptographic Hash Functions 

Benny Applebaum and Naama Haramaty and Yuval Ishai and Eyal Kushilevitz and Vinod Vaikuntanathan
Proc. 8th ITCS, 2017
Available as an ECCC and eprint report.

Fast Pseudorandom Functions Based on Expander Graphs
Benny Applebaum and Pavel Raykov
Proc. 14th TCC, 2016B
Available as an ECCC report.

On the Relationship between Statistical Zero-Knowledge and Statistical Randomized Encodings
Benny Applebaum and Pavel Raykov
Proc. 36th CRYPTO, 2016.
Available as an ECCC report.

Algebraic Attacks against Random Local Functions and Their Countermeasures
Benny Applebaum and Shachar Lovett
Proc. 48th STOC, 2016.
Available as an ECCC report.

From Private Simultaneous Messages to Zero-Information Arthur-Merlin Protocols and Back
Benny Applebaum and Pavel Raykov
Journal of Cryptology, 2016
Conference version in Proc. 13th TCC, 2016.
Available as an eprint report.

Related-Key Secure Pseudorandom Functions: The Case of Additive Attacks
Benny Applebaum and Eyal Widder
Available as an eprint report
 
Minimizing Locality of One-Way Functions via Semi-Private Randomized Encodings.
Benny Applebaum, Yuval Ishai and Eyal Kushilevitz.
Journal of Cryptology (DOI :10.1007/s00145-016-9244-6).
Available as an ECCC report.
Subsumes the manuscript "On One-Way Functions with Optimal Locality".

Incompressible Functions, Relative-Error Extractors, and the Power of Nondeterminsitic Reductions
Benny Applebaum and Sergei Artemenko and Ronen Shaltiel and Guang Yang.
Computational Complexity, 25(2), 349-418, 2016, Special issue for CCC 2015.
Conference version in Proc. 30th CCC, 2015.
Available as an ECCC report.

Obfuscating Circuits via Composite-Order Graded Encoding
Benny Applebaum and Zvika Brakerski.
Proc. 12th TCC, 2015. 
Available as an eprint report.

Arithmetic Cryptography
Benny Applebaum, Jonathan Avron, and Christina Brzuska.
Journal of the ACM, 64(2), 2017
Proc. 6th ITCS, 2015.
Available as an ECCC report.
See also talks at GTACS and at the Simons Institute

Deterministic Rateless Codes for the Binary Symmetric Channel
Benny Applebaum, Liron David, and Guy Even.
Proc. 6th ITCS, 2015.
Available as an arxiv report.

Bootstrapping Obfuscators via Fast Pseudorandom Functions
Benny Applebaum.
Proc. 20th ASIACRYPT, 2014.
Available as an eprint report.

Encoding Functions with Constant Online Rate or How to Compress Keys in Garbled Circuits
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz and Brent Waters. 
SICOMP, 44(2), 433-466, 2015. (pdf)
Conference version in Proc. 33rd CRYPTO, 2013.
Available as an eprint report.

Localy Computable UOWHF with Linear Shrinkage
Benny Applebaum and Yoni Moses. 
Journal of Cryptology
Conference version in Proc. 32nd EUROCRYPT, 2013.
Available as an ECCC and eprint report.

Garbling XOR Gates "For Free" in the Standard Model
Benny Applebaum.
Journal of Cryptology, vol. 29, number 3, 552-576, 2016. (pdf)
Conference version in Proc. 10th TCC, 2013. 
Available as an eprint Report.

Pseudorandom Generators with Long Stretch and Low Locality from Random Local One-Way Functions.
Benny Applebaum.
SICOMP, 42(5), 2008-2037, 2013. (pdf)
Conference version in Proc. 44th STOC, 2012.
Available as an ECCC Report.  

A Dichotomy for Local Small-Bias Generators
Benny Applebaum, Andrej Bogdanov and Alon Rosen.
Journal of Cryptology, vol. 29, number 3, 577-596, 2016. (pdf)
Conference version in Proc. 9th TCC, 2012.
Available as an ECCC and eprint reports.

How to Garble Arithmetic Circuits
Benny Applebaum, Yuval Ishai and Eyal Kushilevitz. 
SICOMP special issue for FOCS 2011, 43(2), 905-929, 2014. (pdf)
Conference version in Proc. 52nd FOCS, 2011. (pdf)

Key-Dependent Message Security: Generic Amplification and Completeness Theorems.
Benny Applebaum.
Journal of Cryptology, 27(3), 429-451, 2013. (pdf)  
Conference version in Proc. 30th Eurocrypt, 2011. (pdf)

Semantic Security Under Related-Key Attacks.
Benny Applebaum, Danny Harnik and Yuval Ishai.  
The 2nd Symposium on Innovations in Computer Science (ICS 2011).
Available as an ePrint Report

From Secrecy to Soundness: Efficient Verification via Secure Computation.
Benny Applebaum, Yuval Ishai and Eyal Kushilevitz.  
The 37th International Colloquium on Automata, Languages and Programming. (ICALP 2010, Track A).
Conference version (.ps, .pdf)

Public-Key Cryptography from Different Assumptions.
Benny Applebaum, Boaz Barak and Avi Wigderson.  
The 42th ACM Symposium on Theory of Computing (STOC 2010).
Conference version (.ps, .pdf)
Draft of full version (.ps.pdf)

Collaborative, Privacy-Preserving Data Aggregation at Scale.
Benny Applebaum, Matthew Caesar, Michael J. Freedman, Jennifer Rexford and Haakon Ringberg.
The 10th Privacy Enhancing Technologies Symposium (PETS 2010).
Conference version (.pdf)
Also available as an ePrint Report

Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature? 
Benny Applebaum, Yuval Ishai and  Eyal Kushilevitz.  
The First Symposium on Innovations in Computer Science (ICS 2010).
Conference version (.ps, .pdf)

Fast Cryptographic Primitives and Circular Secure Encryption Based on Hard Learning Problems. 
Benny Applebaum, David Cash, Chris Peikert and Amit Sahai.
Proc. 29th CRYPTO, 2009.  
Conference version (.ps, .pdf)
Subsumes the following Technical-Report . 

On Basing Lower-Bounds for Learning on Worst-Case Assumptions.
Benny Applebaum, Boaz Barak and David Xiao.  
Proc. 49th  FOCS, 2008. 
Conference version ( .pdf)
This version has more proofs than the proceedings version (but it may contain more typos).

Cryptography with Constant Input Locality. 
Benny Applebaum, Yuval Ishai and Eyal Kushilevitz.  
Journal of Cryptology, Special issue for Crypto 2007. 
Proc. 27th  Crypto, 2007. 
Winner of the Best Paper Award.
Journal version (.ps.pdf)
Conference version (.ps, .pdf)

On Pseudorandom Generators with Linear Stretch in NC0.
Benny Applebaum, Yuval Ishai and Eyal Kushilevitz.
Journal of Computational Complexity, 17(1):38-69, 2008, Special issue for Random 2006.
Conference version in Proc. 10th  Random, 2006. 
Journal version (.ps, .pdf)
Conference version (.ps, .pdf)

On One-Way Functions with Optimal Locality.
Benny Applebaum, Yuval Ishai and Eyal Kushilevitz.
Unpublished manuscript. (.ps)

Computationally Private Randomizing Polynomials and Their Applications.
Benny Applebaum, Yuval Ishai and Eyal Kushilevitz.
Journal of Computational Complexity, 15(2):115-162, 2006, Special issue for CCC 2005.
Conference version in Proc. 20th IEEE Conference on Computational Complexity (CCC), 2005.
Journal version (.ps, .pdf)
Conference version (.ps, .pdf)

Cryptography in NC0. 
Benny Applebaum, Yuval Ishai and Eyal Kushilevitz.
SIAM Journal of Computing, 36(4):845-888, 2006, Special Issue on Randomness and Complexity. 
Co-winner of the 2007 SIAM Outstanding Paper Prize invited to JACM.
Conference version in Proc. 45th Symposium on Foundations of Computer Science (FOCS 2004). 
Co-winner of the Best Paper Award
Journal version (.ps, .pdf
Conference version (.ps, .pdf)

Surveys

Garbled Circuits as Randomized Encodings of Functions: a Primer
Benny Applebaum.
In Tutorials on the Foundations of Cryptography Dedicated to Oded Goldreich
Published in Springer's series on Information Security and Cryptography, 2017.
Available as an ECCC report.
See also a tutorial in Simons Institute (part 1 & part 2)

Cryptographic Hardness of Random Local Functions (Survey)
Benny Applebaum.
Computational Complexity, vol. 25, number 3, 667-722, Special issue for TCC13. 
Invited talk in Proc. 10th TCC, 2013. (pdf).
Available as an ECCC report.

Randomly Encoding Functions: A New Cryptographic Paradigm (Survey)
Benny Applebaum.  
Invited to The 5th International Conference on Information Theoretic Security, (ICITS 2011) 
Conference Version (pdf)

Cryptography in Constant Parallel Time.
Benny Applebaum.
Ph.D thesis, Technion, June 2007. 
Received Honorable Mention for the ACM Doctoral Dissertation Award (2007).
(.ps.pdf)
Published in Springer's series on Information Security and Cryptography, 2014.


Copyright Notice. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright.  These works may not be reposted without the explicit permission of the copyright holder.  Also, some of these works have been submitted for publication. Copyright may be transferred without further notice and this version may no longer be accessible.