Oded Goldreich

Citeras av

	Alla	Sedan 2016
Citat	54471	15608
h-index	92	50
i10-index	213	144

3300

1650

825

2475

1988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021145 176 214 207 241 318 344 349 481 568 851 777 900 1006 1049 1351 1455 1907 2258 2315 2328 2506 2680 2493 2548 2570 2795 2873 3067 2934 3037 3239 3194 134

Medförfattare

Dana RonTel Aviv UniversityVerifierad e-postadress på tau.ac.il
Madhu SudanGordon McKay Professor of Computer Science, Harvard UniversityVerifierad e-postadress på cs.harvard.edu
Benny ChorProfessor of Computer Science, Tel-Aviv UniversityVerifierad e-postadress på cs.tau.ac.il
Mihir BellareProfessor, Department of Computer Science and Engineering, University of California San Diego (UCSD)Verifierad e-postadress på eng.ucsd.edu
Ran CanettiProfessor of Computer Science, Boston UniversityVerifierad e-postadress på bu.edu
Johan HåstadProfessor i teoretisk datalogi, KTHVerifierad e-postadress på kth.se
Shai HaleviResearch Fellow, Algorand FoundationVerifierad e-postadress på alum.mit.edu
Amit SahaiSymantec Chair Professor of Computer Science, UCLA; Director of Center for Encrypted FunctionalitiesVerifierad e-postadress på cs.ucla.edu
Eyal KushilevitzComputer Science Department, TechnionVerifierad e-postadress på cs.technion.ac.il
Rafail OstrovskyProfessor of Computer Science and Professor of Mathematics, UCLAVerifierad e-postadress på cs.ucla.edu
Hugo KrawczykIBM ResearchVerifierad e-postadress på us.ibm.com
Steven RudichProfessor of Computer Science, Carnegie Mellon UniversityVerifierad e-postadress på cs.cmu.edu
Russell ImpagliazzoUC, San DiegoVerifierad e-postadress på eng.ucsd.edu
Michael LubyBitRipple and ICSIVerifierad e-postadress på bitripple.com
Leonid A. LevinVerifierad e-postadress på bu.edu
Noam NisanProfessor of Computer Science, Hebrew University of JerusalemVerifierad e-postadress på cs.huji.ac.il
Noga AlonPrinceton University and Tel Aviv UniversityVerifierad e-postadress på tau.ac.il
Luca TrevisanBocconi UniversityVerifierad e-postadress på unibocconi.it
Michael Ben-OrThe Jean and Helena Alfassa Professor of Computer Science, The Hebrew UniversityVerifierad e-postadress på cs.huji.ac.il
Rene PeraltaNISTVerifierad e-postadress på nist.gov

Oded Goldreich

Professor of Computer Science, Weizmann Institute of Science

Verifierad e-postadress på weizmann.ac.il

Theory of computation Theoretical Computer Science


Titel Sortera efter citat Sortera efter år Sortera efter titel	Citeras av Citeras av	År
Foundations of Cryptography O Goldreich Cambridge University Press, 2001	5980*	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	4739	2019
Private information retrieval B Chor, O Goldreich, E Kushilevitz, M Sudan Proceedings of IEEE 36th Annual Foundations of Computer Science, 41-50, 1995	2562	1995
How to construct random functions O Goldreich, S Goldwasser, S Micali Providing Sound Foundations for Cryptography: On the Work of Shafi …, 2019	2418	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	2246*	1991
The random oracle methodology, revisited R Canetti, O Goldreich, S Halevi Journal of the ACM (JACM) 51 (4), 557-594, 2004	2032	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	1802*	2012
A randomized protocol for signing contracts S Even, O Goldreich, A Lempel Communications of the ACM 28 (6), 637-647, 1985	1670	1985
Software protection and simulation on oblivious RAMs O Goldreich, R Ostrovsky Journal of the ACM (JACM) 43 (3), 431-473, 1996	1609	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	1317	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	1146	1998
On-line/off-line digital signatures S Even, O Goldreich, S Micali Journal of cryptology 9 (1), 35-67, 1996	993*	1996
Secure multi-party computation O Goldreich Manuscript. Preliminary version 78, 1998	753	1998
Free bits, PCPs, and nonapproximability---towards tight results M Bellare, O Goldreich, M Sudan SIAM Journal on Computing 27 (3), 804-915, 1998	740	1998
Public-key cryptosystems from lattice reduction problems O Goldreich, S Goldwasser, S Halevi Annual International Cryptology Conference, 112-131, 1997	728	1997
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	722	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	719	1988
Computational Complexity: A Conceptual Perspective O Goldreich Cambridge University Press, 2008	715	2008
On defining proofs of knowledge M Bellare, O Goldreich Annual International Cryptology Conference, 390-420, 1992	692	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	582*	1992

Systemet kan inte utföra åtgärden just nu. Försök igen senare.

Artiklar 1–20

Citat per år

Dubblettcitat

Sammanfogade citat

Lägg till medförfattareMedförfattare

Ladda upp PDF

Följ den här författaren

Citeras av

Medförfattare