Oded Goldreich
机构: Professor of Computer Science, Weizmann Institute of Science
每年引用次数
引用次数
引用: 67,123
H-指数: 99
I10-指数 : 222
出版物: 559
A quantitative approach to dynamic networks
Baruch Awerbuch , Oded Godlreich , Amir Herzberg
principles of distributed computing 189 -203
22
1990
Quantitative analysis of dynamic network protocols
Oded Goldreichy , Amir Herzbergz , Adrian Segall
preparation. The results are contained in the dissertation'Computer Networks in the Presence of Faults' by Amir Herzberg, Computer Science Dept., Technion (in Hebrew, 1991)
1
1994
On our duties as scientists (a personal version)
Oded Goldreichy
2004
Errata regarding
Reuven Bar-Yehuda , Oded Goldreichy , Alon Itai
2003
On Chosen Ciphertext Security of Multiple Encryptions (Preliminary Version)
Oded Goldreichy , Yoad Lustig , Moni Naorz
2002
TR97-018
Oded Goldreichy , Sha Goldwasserz , Shai Halevix
1997
Addendum to the paper\Randomness in Interactive Proofs
Mihir Bellare , Oded Goldreichy , Sha Goldwasser
1997
Tiny Families of Functions with Random Properties: A Quality {Size Trade {o for Hashing
Oded Goldreichy , Avi Wigdersonz , Givat Ram
1997
Towards a theory of software protection
Oded Goldreich
international cryptology conference 426 -439
31
1987
Another proof that BPP subseteq PH (and more).
Oded Goldreich , David Zuckerman
Electronic Colloquium on Computational Complexity 4
17
1997
On Estimating the Average Degree of a Graph
Oded Goldreich , Dana Ron
Electronic Colloquium on Computational Complexity
8
2004
On Completeness and Soundness in Interactive Proof Systems.
Oded Goldreich , Martin Fürer , Michael Sipser , Yishay Mansour
Adv. Comput. Res. 5 429 -442
82
1989
On the complexity of computational problems regarding distributions (a survey).
Oded Goldreich , Salil P. Vadhan
Electronic Colloquium on Computational Complexity 18 4
7
2011
On the possibility of basing Cryptography on the assumption that P ≠ NP.
Oded Goldreich , Shafi Goldwasser
IACR Cryptology ePrint Archive 1998 5
20
1998
A Combinatorial Consistency Lemma with application to the PCP Theorem
Oded Goldreich , Shmuel Safra
Electronic Colloquium on Computational Complexity 3
4
1996
On Chosen Ciphertext Security of Multiple Encryptions.
Oded Goldreich , Moni Naor , Yoad Lustig
IACR Cryptology ePrint Archive 2002 89
6
2002
Computational Complexity and Knowledge Complexity
Oded Goldreich , Erez Petrank , Rafail Ostrovsky
Electronic Colloquium on Computational Complexity 1
20
1994
207
2010
Concurrent zero-knowledge with timing, revisited
Oded Goldreich
Theoretical Computer Science 27 -87
3
2006
How to Solve any Protocol Problem - An Efficiency Improvement
Oded Goldreich , Ronen Vainish
international cryptology conference 73 -86
203
1987