Applebaum, Benny - Faculty of Mathematics and Computer Science, Weizmann Institute of Science

• Fast Cryptographic Primitives and CircularSecure Encryption
• Cryptography in NC0 (EXTENDED ABSTRACT)
• On Pseudorandom Generators with Linear Stretch in NC0
• Cryptography with Constant Input Locality # Benny Applebaum + Yuval Ishai # Eyal Kushilevitz
• Cryptography in NC 0 # Benny Applebaum Yuval Ishai Eyal Kushilevitz
• On Pseudorandom Generators with Linear Stretch in NC 0 #
• Computationally Private Randomizing Polynomials and Their Applications
• Cryptography in NC0 Benny Applebaum Yuval Ishai Eyal Kushilevitz
• From Secrecy to Soundness: E#cient Verification via Secure Computation
• Cryptography with Constant Input Locality # (extended abstract)
• Cryptography in Constant Parallel Time Benny Applebaum
• Key-Dependent Message Security: Generic Amplification and Completeness
• From Secrecy to Soundness: Efficient Verification via Secure Computation
• Public-Key Cryptography from Different Assumptions [Extended Abstract]
• Cryptography by Cellular Automata How Fast Can Complexity Emerge in Nature?
• On Basing Lower-Bounds for Learning on Worst-Case Assumptions Benny Applebaum
• Cryptography with Constant Input Locality (extended abstract)
• On Pseudorandom Generators with Linear Stretch in NC0
• SIAM J. COMPUT. c 2006 Society for Industrial and Applied Mathematics Vol. 36, No. 5, pp. 12481263
• Some Useful Probabilistic Facts For a random variable we denote the expected value of by Exp[].
• On smoothed k-CNF formulas and the Walksat algorithm Amin Coja-Oghlan
• Fast Cryptographic Primitives Based on the Hardness of Decoding Random Linear Code
• PublicKey Cryptography from Different Assumptions [Extended Abstract]
• Computationally Private Randomizing Polynomials and Their Applications
• Randomly Encoding Functions: a New Cryptographic Paradigm
• Collaborative, Privacy-Preserving Data Aggregation Benny Applebaum1
• Cryptography by Cellular Automata How Fast Can Complexity Emerge in Nature?
• Introduction to Probability Nader H. Bshouty
• Relations between Average Case Complexity and Approximation Complexity
• Cryptography in Constant Parallel Time Benny Applebaum
• Cryptography with Constant Input Locality Benny Applebaum
• Fast Cryptographic Primitives and Circular-Secure Encryption
• Cryptography in NC 0 (EXTENDED ABSTRACT)
• On OneWay Functions with Optimal Locality Benny Applebaum Yuval Ishai Eyal Kushilevitz
• Public-Key Cryptography from Different Assumptions Benny Applebaum
• On Basing Lower-Bounds for Learning on Worst-Case Assumptions Benny Applebaum
• Computationally Private Randomizing Polynomials and Their Applications #
• PublicKey Cryptography from Di#erent Assumptions Benny Applebaum # Boaz Barak + Avi Wigderson #
• Topics in Algorithms-Random SAT (0510-7410) -Spring 2011 Benny Applebaum
• On Pseudorandom Generators with Linear Stretch in NC 0 #
• Computationally Private Randomizing Polynomials and Their Applications
• How to Garble Arithmetic Circuits Benny Applebaum