Oded Goldreich
Author's Web Page
46 papers and 3 books in database with 6851 citations  H-number: 31
Books
	1. Oded Goldreich,  Foundations of Cryptography: Volume 1, Basic Tools. Cambridge University Press, 2007. ISBN 978-0-521-03536-1. Find this book on amazon.com , amazon.co.uk, amazon.ca, amazon.de, amazon.fr, Google Books or Wikipedia. [Cited 1001 times ]
	2. Oded Goldreich,  Foundations of Cryptography: Volume 2, Basic Applications. Cambridge University Press, 2004. ISBN 978-0-521-83084-3. Find this book on amazon.com , amazon.co.uk, amazon.ca, amazon.de, amazon.fr, Google Books or Wikipedia. [Cited 1001 times ]
	3. Oded Goldreich,  Modern Cryptography, Probabilistic Proofs and Pseudorandomness. Springer, 1998. ISBN 978-3-540-64766-9. Find this book on amazon.com , amazon.co.uk, amazon.ca, amazon.de, amazon.fr, Google Books or Wikipedia. [Cited 175 times ]
Journal Papers
[Sort papers chronologically] [Sort papers by citations count]
1. Oded Goldreich,  Yehuda Lindell,  Session-Key Generation Using Human Passwords Only, Journal of Cryptology, Volume 19(3), pp. 241 - 340, Springer, 2006. [Cited 118 times ]
2. Oded Goldreich,  Vered Rosen,  On the Security of Modular Exponentiation with Application to the Construction of Pseudorandom Generators, Journal of Cryptology, Volume 16(2), pp. 71 - 93, Springer, 2003. [Cited 15 times ]
3. Oded Goldreich,  Ariel Kahan,  How to Construct Constant-Round Zero-Knowledge Proof Systems for NP, Journal of Cryptology, Volume 9(3), pp. 167 - 190, Springer, 1996. [Cited 149 times ]
4. Shimon Even,  Oded Goldreich,  Silvio Micali,  On-Line/Off-Line Digital Signatures, Journal of Cryptology, Volume 9(1), pp. 35 - 67, Springer, 1996. [Cited 205 times ]
5. Oded Goldreich,  Yair Oren,  Definitions and Properties of Zero-Knowledge Proof Systems, Journal of Cryptology, Volume 7(1), pp. 1 - 32, Springer, 1994. [Cited 202 times ]
6. Oded Goldreich,  Eyal Kushilevitz,  A Perfect Zero-Knowledge Proof System for a Problem Equivalent to the Discrete Logarithm, Journal of Cryptology, Volume 6(2), pp. 97 - 116, Springer, 1993. [Cited 28 times ]
7. Oded Goldreich,  A Uniform-Complexity Treatment of Encryption and Zero-Knowledge, Journal of Cryptology, Volume 6(1), pp. 21 - 53, Springer, 1993. [Cited 115 times ]
8. Oded Goldreich,  Silvio Micali,  Avi Wigderson,  Proofs that Yield Nothing but Their Validity or All Languages in NP Have Zero-Knowledge Proof Systems, Journal of the ACM, Volume 38(3), pp. 690 - 728, Association for Computing Machinery, 1991. [Cited 528 times ]
9. Werner Alexi,  Benny Chor,  Oded Goldreich,  Claus-Peter Schnorr,  RSA and Rabin Functions: Certain Parts are as Hard as the Whole, SIAM Journal on Computing, Volume 17(2), pp. 194 - 209, Society for Industrial and Applied Mathematics, 1988. [Cited 218 times ]
10. Oded Goldreich,  Shafi Goldwasser,  Silvio Micali,  How to Construct Random Functions, Journal of the ACM, Volume 33(4), pp. 792 - 807, Association for Computing Machinery, 1986. [Cited 916 times ]
11. Shimon Even,  Oded Goldreich,  Abraham Lempel,  A Randomized Protocol for Signing Contracts, Communications of the ACM, Volume 28(6), pp. 637 - 647, Association for Computing Machinery, 1985. [Cited 635 times ]
Conference Papers
[Sort papers chronologically] [Sort papers by citations count]
1. Oded Goldreich,  On Expected Probabilistic Polynomial-Time Adversaries: A Suggestion for Restricted Definitions and Their Benefits, pp. 174 - 193, TCC 2007. [Electronic Edition][Cited 6 times ]
2. Adi Akavia,  Oded Goldreich,  Shafi Goldwasser,  Dana Moshkovitz,  On basing one-way functions on NP-hardness, pp. 701 - 710, STOC 2006. [Electronic Edition][Cited 33 times ]
3. Ran Canetti,  Oded Goldreich,  Shai Halevi,  On the Random-Oracle Methodology as Applied to Length-Restricted Signature Schemes, pp. 40 - 57, TCC 2004. [Electronic Edition][Cited 42 times ]
4. Oded Goldreich,  Zero-Knowledge, pp. 3 - 3, FOCS 2002. [Electronic Edition][Cited 2 times ]
5. Boaz Barak,  Oded Goldreich,  Russell Impagliazzo,  Steven Rudich,  Amit Sahai,  Salil P. Vadhan,  Ke Yang,  On the (Im)possibility of Obfuscating Programs, pp. 1 - 18, CRYPTO 2001. [Electronic Edition][IACR Online Archive][Cited 441 times ]
6. Oded Goldreich,  Yehuda Lindell,  Session-Key Generation Using Human Passwords Only, pp. 408 - 432, CRYPTO 2001. [Electronic Edition][IACR Online Archive][Cited 154 times ]
7. Mihir Bellare,  Oded Goldreich,  Hugo Krawczyk,  Stateless Evaluation of Pseudorandom Functions: Security beyond the Birthday Barrier, pp. 270 - 287, CRYPTO 1999. [Electronic Edition][Cited 31 times ]
8. Oded Goldreich,  Amit Sahai,  Salil P. Vadhan,  Can Statistical Zero Knowledge Be Made Non-interactive? or On the Relationship of SZK and NISZK, pp. 467 - 484, CRYPTO 1999. [Electronic Edition][Cited 39 times ]
9. Oded Goldreich,  Birgit Pfitzmann,  Ronald L. Rivest,  Self-Delegation with Controlled Propagation - or - What If You Lose Your Laptop, pp. 153 - 168, CRYPTO 1998. [Electronic Edition][Cited 36 times ]
10. Oded Goldreich,  On the Foundations of Modern Cryptography, pp. 46 - 74, CRYPTO 1997. [Electronic Edition][Cited 41 times ]
11. Oded Goldreich,  Shafi Goldwasser,  Shai Halevi,  Public-Key Cryptosystems from Lattice Reduction Problems, pp. 112 - 131, CRYPTO 1997. [Electronic Edition][Cited 214 times ]
12. Oded Goldreich,  Shafi Goldwasser,  Shai Halevi,  Eliminating Decryption Errors in the Ajtai-Dwork Cryptosystem, pp. 105 - 111, CRYPTO 1997. [Electronic Edition][Cited 46 times ]
13. Ivan Damgard,  Oded Goldreich,  Tatsuaki Okamoto,  Avi Wigderson,  Honest Verifier vs Dishonest Verifier in Public Coin Zero-Knowledge Proofs, pp. 325 - 338, CRYPTO 1995. [Electronic Edition][Cited 30 times ]
14. Mihir Bellare,  Oded Goldreich,  Shafi Goldwasser,  Incremental Cryptography: The Case of Hashing and Signing, pp. 216 - 233, CRYPTO 1994. [Electronic Edition][Cited 121 times ]
15. Mihir Bellare,  Oded Goldreich,  On Defining Proofs of Knowledge, pp. 390 - 420, CRYPTO 1992. [Electronic Edition][Cited 257 times ]
16. Shimon Even,  Oded Goldreich,  Silvio Micali,  On-Line/Off-Line Digital Schemes, pp. 263 - 275, CRYPTO 1989. [Electronic Edition][Cited 15 times ]
17. Oded Goldreich,  Hugo Krawczyk,  Sparse Pseudorandom Distributions, pp. 113 - 127, CRYPTO 1989. [Electronic Edition][Cited 24 times ]
18. Michael Ben-Or,  Oded Goldreich,  Shafi Goldwasser,  Johan HÃ¥stad,  Joe Kilian,  Silvio Micali,  Phillip Rogaway,  Everything Provable is Provable in Zero-Knowledge, pp. 37 - 56, CRYPTO 1988. [Electronic Edition][Cited 149 times ]
19. Oded Goldreich,  Hugo Krawczyk,  Michael Luby,  On the Existence of Pseudorandom Generators, pp. 146 - 162, CRYPTO 1988. [Electronic Edition][Cited 117 times ]
20. Oded Goldreich,  Eyal Kushilevitz,  A Perfect Zero-Knowledge Proof for a Problem Equivalent to Discrete Logarithm, pp. 57 - 70, CRYPTO 1988. [Electronic Edition][Cited 15 times ]
21. Oded Goldreich,  Ronen Vainish,  How to Solve any Protocol Problem - An Efficiency Improvement, pp. 73 - 86, CRYPTO 1987. [Electronic Edition][Cited 109 times ]
22. Oded Goldreich,  Two Remarks Concerning the Goldwasser-Micali-Rivest Signature Scheme, pp. 104 - 110, CRYPTO 1986. [Electronic Edition][Cited 80 times ]
23. Oded Goldreich,  Silvio Micali,  Avi Wigderson,  How to Prove all NP-Statements in Zero-Knowledge, and a Methodology of Cryptographic Protocol Design, pp. 171 - 185, CRYPTO 1986. [Electronic Edition][Cited 85 times ]
24. Oded Goldreich,  Towards a Theory of Software Protection (Extended Abstract), pp. 426 - 439, CRYPTO 1986. [Electronic Edition][Cited 27 times ]
25. Shimon Even,  Oded Goldreich,  Adi Shamir,  On the Security of Ping-Pong Protocols when Implemented using the RSA, pp. 58 - 72, CRYPTO 1985. [Electronic Edition][Cited 28 times ]
26. Benny Chor,  Oded Goldreich,  Shafi Goldwasser,  The Bit Security of Modular Squaring Given Partial Factorization of the Modulos, pp. 448 - 457, CRYPTO 1985. [Electronic Edition][Cited 10 times ]
27. Oded Goldreich,  Shafi Goldwasser,  Silvio Micali,  On the Cryptographic Applications of Random Functions, pp. 276 - 288, CRYPTO 1984. [Electronic Edition][Cited 80 times ]
28. Benny Chor,  Oded Goldreich,  RSA/Rabin Least Significant Bits are 1/2 + 1/(poly(log N)) Secure, pp. 303 - 313, CRYPTO 1984. [Electronic Edition][Cited 18 times ]
29. Oded Goldreich,  On the Number of Close-and-Equal Pairs of Bits in a String, pp. 127 - 141, EUROCRYPT 1984. [Electronic Edition][Cited 6 times ]
30. Oded Goldreich,  On Concurrent Identification Protocols, pp. 387 - 396, EUROCRYPT 1984. [Electronic Edition][Cited 4 times ]
31. Shimon Even,  Oded Goldreich,  Electronic Wallet, pp. 383 - 386, CRYPTO 1983. [Electronic Edition][Cited 49 times ]
32. Shimon Even,  Oded Goldreich,  On the Power of Cascade Ciphers, pp. 43 - 50, CRYPTO 1983. [Electronic Edition][Cited 52 times ]
33. Oded Goldreich,  A Simple Protocol for Signing Contracts, pp. 133 - 136, CRYPTO 1983. [Electronic Edition][Cited 53 times ]
34. Shimon Even,  Oded Goldreich,  On the Security of Multi-Party Ping-Pong Protocols, pp. 315 - 315, CRYPTO 1982. [Electronic Edition][Cited 140 times ]
35. Shimon Even,  Oded Goldreich,  Abraham Lempel,  A Randomized Protocol for Signing Contracts, pp. 205 - 210, CRYPTO 1982. [Electronic Edition][Cited 745 times ]

Database status:
3755 authors,
5428 conference papers from 177 conference proceedings,
559 journal papers from 8 journals