Benny applebaum
Benny applebaum
Electrical Engineering School, Tel-Aviv University
Verified email at - Homepage
Cited by
Cited by
Fast cryptographic primitives and circular-secure encryption based on hard learning problems
B Applebaum, D Cash, C Peikert, A Sahai
Advances in Cryptology-CRYPTO 2009: 29th Annual International Cryptology …, 2009
Cryptography in NC 0
B Applebaum, Y Ishai, E Kushilevitz
SIAM Journal on Computing 36 (4), 845-888, 2006
From secrecy to soundness: Efficient verification via secure computation
B Applebaum, Y Ishai, E Kushilevitz
International Colloquium on Automata, Languages, and Programming, 152-163, 2010
Public-key cryptography from different assumptions
B Applebaum, B Barak, A Wigderson
Proceedings of the forty-second ACM symposium on Theory of computing, 171-180, 2010
Computationally private randomizing polynomials and their applications
B Applebaum, Y Ishai, E Kushilevitz
computational complexity 15 (2), 115-162, 2006
How to garble arithmetic circuits
B Applebaum, Y Ishai, E Kushilevitz
SIAM Journal on Computing 43 (2), 905-929, 2014
Key-dependent message security: Generic amplification and completeness
B Applebaum
Journal of cryptology 27 (3), 429-451, 2014
Pseudorandom generators with long stretch and low locality from random local one-way functions
B Applebaum
Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012
Cryptography with constant input locality
B Applebaum, Y Ishai, E Kushilevitz
Journal of Cryptology 22 (4), 429-469, 2009
Obfuscating circuits via composite-order graded encoding
B Applebaum, Z Brakerski
Theory of Cryptography: 12th Theory of Cryptography Conference, TCC 2015 …, 2015
Semantic security under related-key attacks and applications
B Applebaum, D Harnik, Y Ishai
Cryptology ePrint Archive, 2010
Secure arithmetic computation with constant computational overhead
B Applebaum, I Damgård, Y Ishai, M Nielsen, L Zichron
Annual International Cryptology Conference, 223-254, 2017
On Pseudorandom Generators with Linear Stretch in NC0
B Applebaum, Y Ishai, E Kushilevitz
Computational Complexity 17, 38-69, 2008
Algebraic attacks against random local functions and their countermeasures
B Applebaum, S Lovett
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016
Low-complexity cryptographic hash functions
B Applebaum, N Haramaty-Krasne, Y Ishai, E Kushilevitz, ...
Collaborative, privacy-preserving data aggregation at scale
B Applebaum, H Ringberg, MJ Freedman, M Caesar, J Rexford
Privacy Enhancing Technologies: 10th International Symposium, PETS 2010 …, 2010
Cryptographic hardness of random local functions: Survey
B Applebaum
Computational complexity 25, 667-722, 2016
Encoding functions with constant online rate, or how to compress garbled circuit keys
B Applebaum, Y Ishai, E Kushilevitz, B Waters
SIAM Journal on Computing 44 (2), 433-466, 2015
Bootstrapping obfuscators via fast pseudorandom functions
B Applebaum
International Conference on the Theory and Application of Cryptology and …, 2014
A dichotomy for local small-bias generators
B Applebaum, A Bogdanov, A Rosen
Journal of Cryptology 29, 577-596, 2016
The system can't perform the operation now. Try again later.
Articles 1–20