Oded Goldreich
Oded Goldreich
Professor of Computer Science, Weizmann Institute of Science
Verified email at weizmann.ac.il
Cited by
Cited by
Foundations of Cryptography
O Goldreich
Cambridge University Press, 2001
How to play any mental game, or a completeness theorem for protocols with honest majority
O Goldreich, S Micali, A Wigderson
Providing Sound Foundations for Cryptography: On the Work of Shafi …, 2019
Private information retrieval
B Chor, O Goldreich, E Kushilevitz, M Sudan
Proceedings of IEEE 36th Annual Foundations of Computer Science, 41-50, 1995
How to construct random functions
O Goldreich, S Goldwasser, S Micali
Providing Sound Foundations for Cryptography: On the Work of Shafi …, 2019
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
O Goldreich, S Micali, A Wigderson
Journal of the ACM 38, 1991
The random oracle methodology, revisited
R Canetti, O Goldreich, S Halevi
Journal of the ACM (JACM) 51 (4), 557-594, 2004
On the (im) possibility of obfuscating programs
B Barak, O Goldreich, R Impagliazzo, S Rudich, A Sahai, S Vadhan, ...
Journal of the ACM (JACM) 59 (2), 1-48, 2012
A randomized protocol for signing contracts
S Even, O Goldreich, A Lempel
Communications of the ACM 28 (6), 637-647, 1985
Software protection and simulation on oblivious RAMs
O Goldreich, R Ostrovsky
Journal of the ACM (JACM) 43 (3), 431-473, 1996
A hard-core predicate for all one-way functions
O Goldreich, LA Levin
Proceedings of the twenty-first annual ACM symposium on Theory of computing …, 1989
Property testing and its connection to learning and approximation
O Goldreich, S Goldwasser, D Ron
Journal of the ACM (JACM) 45 (4), 653-750, 1998
On-line/off-line digital signatures
S Even, O Goldreich, S Micali
Journal of cryptology 9 (1), 35-67, 1996
Free bits, PCPs, and nonapproximability---towards tight results
M Bellare, O Goldreich, M Sudan
SIAM Journal on Computing 27 (3), 804-915, 1998
Secure multi-party computation
O Goldreich
Manuscript. Preliminary version 78, 1998
Simple constructions of almost k‐wise independent random variables
N Alon, O Goldreich, J Håstad, R Peralta
Random Structures & Algorithms 3 (3), 289-304, 1992
Unbiased bits from sources of weak randomness and probabilistic communication complexity
B Chor, O Goldreich
SIAM Journal on Computing 17 (2), 230-261, 1988
Public-key cryptosystems from lattice reduction problems
O Goldreich, S Goldwasser, S Halevi
Annual International Cryptology Conference, 112-131, 1997
Computational Complexity: A Conceptual Perspective
O Goldreich
Cambridge University Press, 2008
On defining proofs of knowledge
M Bellare, O Goldreich
Annual International Cryptology Conference, 390-420, 1992
On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
R Bar-Yehuda, O Goldreich, A Itai
Journal of Computer and System Sciences 45 (1), 104-126, 1992
The system can't perform the operation now. Try again later.
Articles 1–20