Benny Applebaum

(in hebrew בני אפלבאום)

Email:

Address:
Department of Computer Science
Princeton University
35 Olden Street
Princeton, New Jersey, 08540-5233
USA
Office: 414 CS Building
Phone: (609) 258-1795

I am a postdoc at the Department of Computer Science of Princeton University, with Boaz Barak. I'm interested in the theory of computer science, mainly in computational complexity and the foundations of cryptography. I am also interested in the practical aspects of computer security.

Previously, I was a PhD student in the Computer Science Department of the Technion under the supervision of Prof. Eyal Kushilevitz and Dr. Yuval Ishai. The title of my dissertation was "cryptography in constant parallel time". Here are the slides from a talk that I recently gave about this subject at the IBM/NYU/Columbia Theory Day.

Publications

Collaborative, Privacy-Preserving Data Aggregation at Scale.
With Matthew Caesar, Michael J. Freedman, Jennifer Rexford and Haakon Ringberg.
Submitted. Available as an ePrint Report.

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

Public-Key Cryptography from Different Assumptions.
With Boaz Barak, Avi Wigderson.
Manuscript. (.ps, .pdf)

Cryptography with Constant Latency.
With Yuval Ishai, Eyal Kushilevitz.
Submitted.

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

Cryptography in Constant Parallel Time.
Ph.D thesis, Technion, June 2007.
Received Honorable Mention for the ACM Doctoral Dissertation Award (2007).
(.ps, .pdf)

Cryptography with Constant Input Locality.
With Yuval Ishai, 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 NC⁰.
With Yuval Ishai, 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.
With Yuval Ishai, Eyal Kushilevitz .
Unpublished manuscript. (.ps)

Computationally Private Randomizing Polynomials and Their Applications.
With Yuval Ishai, 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 NC⁰.
With Yuval Ishai, 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.
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)

Teaching

Winter 2002/3 - Spring 2005: Data Structure 1 (234218) (TA in charge)
Spring 2005: Cryptography and Complexity (236508)
Winter 2005/6: Modern Cryptography (236506) and Adavnced Topics in Cryptography (236613)
Spring 2006: Adavnced Topics in Cryptology (236612)
Winter, Spring 2007: Data Structure 1 (234218) (Lecturer)

Personal

I am happily married to my beloved wife Hilla and we have two lovely daughters, Shira and Maya.