متابعة
Oded Goldreich
Oded Goldreich
Professor of Computer Science, Weizmann Institute of Science
بريد إلكتروني تم التحقق منه على weizmann.ac.il
عنوان
عدد مرات الاقتباسات
عدد مرات الاقتباسات
السنة
Foundations of Cryptography
O Goldreich
Cambridge University Press, 2001
7748*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
64512019
Private information retrieval
B Chor, E Kushilevitz, O Goldreich, M Sudan
Journal of the ACM (JACM) 45 (6), 965-981, 1998
34161998
How to construct random functions
O Goldreich, S Goldwasser, S Micali
Journal of the ACM (JACM) 33 (4), 792-807, 1986
31161986
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
2840*1991
The random oracle methodology, revisited
R Canetti, O Goldreich, S Halevi
Journal of the ACM (JACM) 51 (4), 557-594, 2004
24772004
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
2389*2012
Software protection and simulation on oblivious RAMs
O Goldreich, R Ostrovsky
Journal of the ACM (JACM) 43 (3), 431-473, 1996
22071996
A randomized protocol for signing contracts
S Even, O Goldreich, A Lempel
Communications of the ACM 28 (6), 637-647, 1985
20121985
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
16191989
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
13871998
Secure multi-party computation
O Goldreich
Manuscript. Preliminary version 78 (110), 1-108, 1998
11631998
On-line/off-line digital signatures
S Even, O Goldreich, S Micali
Journal of Cryptology 9, 35-67, 1996
1120*1996
Computational Complexity: A Conceptual Perspective
O Goldreich
Cambridge University Press, 2008
10102008
Public-key cryptosystems from lattice reduction problems
O Goldreich, S Goldwasser, S Halevi
Advances in Cryptology—CRYPTO'97: 17th Annual International Cryptology …, 1997
9531997
Definitions and properties of zero-knowledge proof systems
O Goldreich, Y Oren
Journal of Cryptology 7 (1), 1-32, 1994
8821994
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
8511992
On defining proofs of knowledge
M Bellare, O Goldreich
Annual International Cryptology Conference, 390-420, 1992
8501992
Free bits, PCPs, and nonapproximability---towards tight results
M Bellare, O Goldreich, M Sudan
SIAM Journal on Computing 27 (3), 804-915, 1998
8321998
Unbiased bits from sources of weak randomness and probabilistic communication complexity
B Chor, O Goldreich
SIAM Journal on Computing 17 (2), 230-261, 1988
8231988
يتعذر على النظام إجراء العملية في الوقت الحالي. عاود المحاولة لاحقًا.
مقالات 1–20