Benny applebaum
Benny applebaum
Electrical Engineering School, Tel-Aviv University
Zweryfikowany adres z - Strona główna
Cytowane przez
Cytowane przez
Fast cryptographic primitives and circular-secure encryption based on hard learning problems
B Applebaum, D Cash, C Peikert, A Sahai
Annual International Cryptology Conference, 595-618, 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
Computationally private randomizing polynomials and their applications
B Applebaum, Y Ishai, E Kushilevitz
computational complexity 15 (2), 115-162, 2006
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
Key-dependent message security: Generic amplification and completeness
B Applebaum
Journal of cryptology 27 (3), 429-451, 2014
How to garble arithmetic circuits
B Applebaum, Y Ishai, E Kushilevitz
SIAM Journal on Computing 43 (2), 905-929, 2014
Obfuscating circuits via composite-order graded encoding
B Applebaum, Z Brakerski
Theory of Cryptography Conference, 528-556, 2015
Cryptography with constant input locality
B Applebaum, Y Ishai, E Kushilevitz
Journal of Cryptology 22 (4), 429-469, 2009
Pseudorandom generators with long stretch and low locality from random local one-way functions
B Applebaum
SIAM Journal on Computing 42 (5), 2008-2037, 2013
Semantic security under related-key attacks and applications
B Applebaum, D Harnik, Y Ishai
Cryptology ePrint Archive, 2010
On pseudorandom generators with linear stretch in NC 0
B Applebaum, Y Ishai, E Kushilevitz
Computational Complexity 17 (1), 38-69, 2008
Collaborative, privacy-preserving data aggregation at scale
B Applebaum, H Ringberg, MJ Freedman, M Caesar, J Rexford
International Symposium on Privacy Enhancing Technologies Symposium, 56-74, 2010
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
Algebraic attacks against random local functions and their countermeasures
B Applebaum, S Lovett
SIAM Journal on Computing 47 (1), 52-79, 2018
Bootstrapping obfuscators via fast pseudorandom functions
B Applebaum
International Conference on the Theory and Application of Cryptology and …, 2014
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
Cryptographic hardness of random local functions
B Applebaum
Computational complexity 25 (3), 667-722, 2016
Low-complexity cryptographic hash functions
B Applebaum, N Haramaty-Krasne, Y Ishai, E Kushilevitz, ...
8th Innovations in Theoretical Computer Science Conference (ITCS 2017), 2017
On basing lower-bounds for learning on worst-case assumptions
B Applebaum, B Barak, D Xiao
2008 49th Annual IEEE Symposium on Foundations of Computer Science, 211-220, 2008
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20