Publications
Encoding Functions with Constant Online Rate or How to Compress Keys in Garbled Circuits
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz and Brent Waters.
Available as an eprint report.
Garbling XOR Gates "For Free" in the Standard Model
Benny Applebaum.
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.
Proc. 44th STOC, 2012.
Available as an ECCC Report.
A Dichotomy for Local Small-Bias Generators
Benny Applebaum, Andrej Bogdanov and Alon Rosen.
Proc. 9th TCC, 2012.
How to Garble Arithmetic Circuits
Benny Applebaum, Yuval Ishai and Eyal Kushilevitz.
Proc. 52nd FOCS, 2011.
Conference Version (pdf)
Full version to appear in SICOMP, special issue for FOCS 2011.
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)
Key-Dependent Message Security: Generic Amplification and Completeness Theorems.
Benny Applebaum.
Proc. 30th Eurocrypt, 2011.
Conference version.
Preliminary full version available as an ePrint Report.
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 in Constant Parallel Time.
Benny Applebaum.
Ph.D thesis, Technion, June 2007.
Received Honorable Mention for the ACM Doctoral Dissertation Award (2007).
(.ps, .pdf)
Cryptography with Constant Input Locality.
Benny Applebaum, Yuval Ishai and Eyal Kushilevitz.
Accepted to the 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)