Oded Goldreich
机构: Professor of Computer Science, Weizmann Institute of Science
每年引用次数
引用次数
引用: 67,123
H-指数: 99
I10-指数 : 222
出版物: 559
On the cryptographic applications of random functions
Oded Goldreich , Silvio Micali , Shafi Goldwasser
international cryptology conference 276 -288
239
1985
Studies in Complexity and Cryptography: Miscellanea on the Interplay between Randomness and Computation
Oded Goldreich
3
2011
Theoretical Computer Science: essays in Memory of Shimon Even
Oded Goldreich , Alan L. Selman , Arnold L. Rosenberg
Springer-Verlag
8
2006
Foundations of Cryptography: A Primer
Oded Goldreich
125
2005
Computational Complexity: A Conceptual Perspective
Oded Goldreich
850
2008
A Primer on Pseudorandom Generators
Oded Goldreich
18
2010
Input-Oblivious Proof Systems and a Uniform Complexity Perspective on P/poly.
Oded Goldreich , Or Meir
Electronic Colloquium on Computational Complexity 18 23
2011
Improved Testing Algorithms for Monotonicity.
Oded Goldreich , Alex Samorodnitsky , Sofya Raskhodnikova , Yevgeniy Dodis
Electronic Colloquium on Computational Complexity 6
1999
Improved Derandomization of BPP Using a Hitting Set Generator
Avi Wigderson , Oded Goldreich
randomization and approximation techniques in computer science 131 -137
19
1999
Estimating Simple Graph Parameters in Sublinear Time.
Oded Goldreich , Dana Ron
Encyclopedia of Algorithms 650 -653
2016
On Multiple Input Problems in Property Testing.
Oded Goldreich
international workshop and international workshop on approximation, randomization, and combinatorial optimization. algorithms and techniques 28 704 -720
4
2014
On randomness extraction in AC0
Avi Wigderson , Oded Goldreich , Emanuele Viola
conference on computational complexity 33 601 -668
3
2015
On Pseudorandomness with respect to Deterministic Observes.
Avi Wigderson , Oded Goldreich
ICALP Satellite Workshops 77 -84
11
2000
General Cryptographic Protocols: The Very Basics
Oded Goldreich
Secure Multi-Party Computation 1 -27
2
2013
Robust PCPs of Proximity, Shorter PCPs and Applications to Coding
Oded Goldreich , Salil P. Vadhan , Eli Ben-Sasson , Madhu Sudan
Electronic Colloquium on Computational Complexity
336
2004
Approximating Shortest Lattice Vectors is Not Harder Than Approximating Closest Lattice Vectors.
Oded Goldreich , Daniele Micciancio , Jean-Pierre Seifert , Shmuel Safra
Electronic Colloquium on Computational Complexity 6
201
1999
A Short Tutorial of Zero-Knowledge
Oded Goldreich ,
Secure Multi-Party Computation 28 -60
4
2013
Computational Sample Complexity
Oded Goldreich , Scott E. Decatur , Dana Ron
Electronic Colloquium on Computational Complexity 4
1997
Probabilistic Proof Systems - Lecture Notes
Oded Goldreich
University of California at Berkeley
1996
On security preserving reductions - revised terminology
Oded Goldreich
Studies in complexity and cryptography 540 -546
1
2011