The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Oded Goldreich: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Shimon Even, Oded Goldreich, Abraham Lempel
    A Randomized Protocol for Signing Contracts. [Citation Graph (1, 0)][DBLP]
    Commun. ACM, 1985, v:28, n:6, pp:637-647 [Journal]
  2. Oded Goldreich, Liuba Shrira
    On the Complexity of Computation in the Presence of Link Failures: The Case of a Ring. [Citation Graph (1, 0)][DBLP]
    Distributed Computing, 1991, v:5, n:, pp:121-131 [Journal]
  3. Oded Goldreich, Dana Ron
    Approximating Average Parameters of Graphs. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2006, pp:363-374 [Conf]
  4. Baruch Awerbuch, Oded Goldreich, David Peleg, Ronen Vainish
    A Tradeoff between Information and Communication in Broadcast Protocols. [Citation Graph (0, 0)][DBLP]
    AWOC, 1988, pp:369-379 [Conf]
  5. Oded Goldreich
    Concurrent Zero-Knowledge with Timing, Revisited. [Citation Graph (0, 0)][DBLP]
    Essays in Memory of Shimon Even, 2006, pp:27-87 [Conf]
  6. Oded Goldreich
    On Promise Problems: A Survey. [Citation Graph (0, 0)][DBLP]
    Essays in Memory of Shimon Even, 2006, pp:254-290 [Conf]
  7. Oded Goldreich
    On Teaching the Basics of Complexity Theory. [Citation Graph (0, 0)][DBLP]
    Essays in Memory of Shimon Even, 2006, pp:348-374 [Conf]
  8. Shai Ben-David, Benny Chor, Oded Goldreich, Michael Luby
    On the Theory of Average Case Complexity (abstract). [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1989, pp:36- [Conf]
  9. Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan
    Short PCPs Verifiable in Polylogarithmic Time. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2005, pp:120-134 [Conf]
  10. Ziv Bar-Yossef, Oded Goldreich, Avi Wigderson
    Deterministic Amplification of Space-Bounded Probabilistic Algorithms. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1999, pp:188-0 [Conf]
  11. Boaz Barak, Oded Goldreich
    Universal Arguments and their Applications. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2002, pp:194-203 [Conf]
  12. Oded Goldreich, Howard J. Karloff, Leonard J. Schulman, Luca Trevisan
    Lower Bounds for Linear Locally Decodable Codes and Private Information Retrieval. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2002, pp:175-183 [Conf]
  13. Oded Goldreich, Madhu Sudan
    Computational Indistinguishability: A Sample Hierarchy. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1998, pp:24-33 [Conf]
  14. Oded Goldreich, Salil P. Vadhan
    Comparing Entropies in Statistical Zero Knowledge with Applications to the Structure of SZK. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1999, pp:54-0 [Conf]
  15. Scott E. Decatur, Oded Goldreich, Dana Ron
    Computational Sample Complexity. [Citation Graph (0, 0)][DBLP]
    COLT, 1997, pp:130-142 [Conf]
  16. Mihir Bellare, Oded Goldreich
    On Defining Proofs of Knowledge. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1992, pp:390-420 [Conf]
  17. Mihir Bellare, Oded Goldreich, Shafi Goldwasser
    Incremental Cryptography: The Case of Hashing and Signing. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1994, pp:216-233 [Conf]
  18. Mihir Bellare, Oded Goldreich, Hugo Krawczyk
    Stateless Evaluation of Pseudorandom Functions: Security beyond the Birthday Barrier. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1999, pp:270-287 [Conf]
  19. Michael Ben-Or, Oded Goldreich, Shafi Goldwasser, Johan Håstad, Joe Kilian, Silvio Micali, Phillip Rogaway
    Everything Provable is Provable in Zero-Knowledge. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1988, pp:37-56 [Conf]
  20. Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil P. Vadhan, Ke Yang
    On the (Im)possibility of Obfuscating Programs. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2001, pp:1-18 [Conf]
  21. Benny Chor, Oded Goldreich, Shafi Goldwasser
    The Bit Security of Modular Squaring Given Partial Factorization of the Modulos. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1985, pp:448-457 [Conf]
  22. Ivan Damgård, Oded Goldreich, Tatsuaki Okamoto, Avi Wigderson
    Honest Verifier vs Dishonest Verifier in Public Coin Zero-Knowledge Proofs. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1995, pp:325-338 [Conf]
  23. Shimon Even, Oded Goldreich, Adi Shamir
    On the Security of Ping-Pong Protocols when Implemented using the RSA. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1985, pp:58-72 [Conf]
  24. Shimon Even, Oded Goldreich, Silvio Micali
    On-Line/Off-Line Digital Schemes. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1989, pp:263-275 [Conf]
  25. Oded Goldreich
    A Simple Protocol for Signing Contracts. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1983, pp:133-136 [Conf]
  26. Benny Chor, Oded Goldreich
    RSA/Rabin Least Significant Bits are 1/2 + 1/(poly(log N)) Secure. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1984, pp:303-313 [Conf]
  27. Oded Goldreich
    Two Remarks Concerning the Goldwasser-Micali-Rivest Signature Scheme. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1986, pp:104-110 [Conf]
  28. Oded Goldreich
    Towards a Theory of Software Protection. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1986, pp:426-439 [Conf]
  29. Oded Goldreich
    On the Foundations of Modern Cryptography. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1997, pp:46-74 [Conf]
  30. Shimon Even, Oded Goldreich
    On the Security of Multi-Party Ping-Pong Protocols. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1982, pp:315- [Conf]
  31. Shimon Even, Oded Goldreich
    On the Power of Cascade Ciphers. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1983, pp:43-50 [Conf]
  32. Shimon Even, Oded Goldreich
    Electronic Wallet. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1983, pp:383-386 [Conf]
  33. Oded Goldreich, Shafi Goldwasser, Shai Halevi
    Eliminating Decryption Errors in the Ajtai-Dwork Cryptosystem. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1997, pp:105-111 [Conf]
  34. Oded Goldreich, Shafi Goldwasser, Shai Halevi
    Public-Key Cryptosystems from Lattice Reduction Problems. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1997, pp:112-131 [Conf]
  35. Oded Goldreich, Shafi Goldwasser, Silvio Micali
    On the Cryptographic Applications of Random Functions. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1984, pp:276-288 [Conf]
  36. Oded Goldreich, Eyal Kushilevitz
    A Perfect Zero-Knowledge Proof for a Problem Equivalent to Discrete Logarithm. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1988, pp:57-70 [Conf]
  37. Oded Goldreich, Hugo Krawczyk
    Sparse Pseudorandom Distributions. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1989, pp:113-127 [Conf]
  38. Oded Goldreich, Hugo Krawczyk, Michael Luby
    On the Existence of Pseudorandom Generators. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1988, pp:146-162 [Conf]
  39. Oded Goldreich, Yehuda Lindell
    Session-Key Generation Using Human Passwords Only. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2001, pp:408-432 [Conf]
  40. Oded Goldreich, Silvio Micali, Avi Wigderson
    How to Prove all NP-Statements in Zero-Knowledge, and a Methodology of Cryptographic Protocol Design. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1986, pp:171-185 [Conf]
  41. Oded Goldreich, Birgit Pfitzmann, Ronald L. Rivest
    Self-Delegation with Controlled Propagation - or - What If You Lose Your Laptop. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1998, pp:153-168 [Conf]
  42. Oded Goldreich, Amit Sahai, Salil P. Vadhan
    Can Statistical Zero Knowledge Be Made Non-interactive? or On the Relationship of SZK and NISZK. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1999, pp:467-484 [Conf]
  43. Oded Goldreich, Ronen Vainish
    How to Solve any Protocol Problem - An Efficiency Improvement. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1987, pp:73-86 [Conf]
  44. Shimon Even, Oded Goldreich, Abraham Lempel
    A Randomized Protocol for Signing Contracts. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1982, pp:205-210 [Conf]
  45. Oded Goldreich
    On the Number of Close-and-Equal Pairs of Bits in a String. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1984, pp:127-141 [Conf]
  46. Oded Goldreich
    On Concurrent Identification Protocols. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1984, pp:387-396 [Conf]
  47. Werner Alexi, Benny Chor, Oded Goldreich, Claus-Peter Schnorr
    RSA/Rabin Bits are 1/2 + 1/poly(log N) Secure [Citation Graph (0, 0)][DBLP]
    FOCS, 1984, pp:449-457 [Conf]
  48. Noga Alon, Oded Goldreich, Johan Håstad, René Peralta
    Simple Constructions of Almost k-Wise Independent Random Variables [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:544-553 [Conf]
  49. Boaz Barak, Oded Goldreich, Shafi Goldwasser, Yehuda Lindell
    Resettably-Sound Zero-Knowledge and its Applications. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:116-125 [Conf]
  50. Mihir Bellare, Oded Goldreich, Shafi Goldwasser
    Randomness in Interactive Proofs [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:563-572 [Conf]
  51. Mihir Bellare, Oded Goldreich, Madhu Sudan
    Free Bits, PCPs and Non-Approximability - Towards Tight Results. [Citation Graph (0, 0)][DBLP]
    FOCS, 1995, pp:422-431 [Conf]
  52. Manuel Blum, Oded Goldreich
    Towards a Computational Theory of Statistical Tests (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:406-416 [Conf]
  53. Ran Canetti, Oded Goldreich
    Bounds on Tradeoffs between Randomness and Communication Complexity [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:766-775 [Conf]
  54. Benny Chor, Oded Goldreich
    Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1985, pp:429-442 [Conf]
  55. Benny Chor, Oded Goldreich, Johan Håstad, Joel Friedman, Steven Rudich, Roman Smolensky
    The Bit Extraction Problem of t-Resilient Functions (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1985, pp:396-407 [Conf]
  56. Benny Chor, Oded Goldreich, Eyal Kushilevitz, Madhu Sudan
    Private Information Retrieval. [Citation Graph (0, 0)][DBLP]
    FOCS, 1995, pp:41-50 [Conf]
  57. Shimon Even, Oded Goldreich
    On the Security of Multi-Party Ping-Pong Protocols [Citation Graph (0, 0)][DBLP]
    FOCS, 1983, pp:34-39 [Conf]
  58. Oded Goldreich
    Zero-Knowledge. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:3-0 [Conf]
  59. Oded Goldreich, Shafi Goldwasser, Nathan Linial
    Fault-tolerant Computation in the Full Information Model (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:447-457 [Conf]
  60. Oded Goldreich, Shafi Goldwasser, Eric Lehman, Dana Ron
    Testing Monotonicity. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:426-435 [Conf]
  61. Oded Goldreich, Shafi Goldwasser, Silvio Micali
    How to Construct Random Functions (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1984, pp:464-479 [Conf]
  62. Oded Goldreich, Shafi Goldwasser, Asaf Nussboim
    On the Implementation of Huge Random Objects. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:68-79 [Conf]
  63. Oded Goldreich, Shafi Goldwasser, Dana Ron
    Property Testing and Its Connection to Learning and Approximation. [Citation Graph (0, 0)][DBLP]
    FOCS, 1996, pp:339-348 [Conf]
  64. Oded Goldreich, Russell Impagliazzo, Leonid A. Levin, Ramarathnam Venkatesan, David Zuckerman
    Security Preserving Amplification of Hardness [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:318-326 [Conf]
  65. Oded Goldreich, Hugo Krawczyk, Michael Luby
    On the Existence of Pseudorandom Generators (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:12-24 [Conf]
  66. Oded Goldreich, Yishay Mansour, Michael Sipser
    Interactive Proof Systems: Provers that never Fail and Random Selection (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1987, pp:449-461 [Conf]
  67. Oded Goldreich, Silvio Micali, Avi Wigderson
    Proofs that Yield Nothing But their Validity and a Methodology of Cryptographic Protocol Design (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:174-187 [Conf]
  68. Oded Goldreich, Erez Petrank
    Quantifying Knowledge Complexity [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:59-68 [Conf]
  69. Oded Goldreich, Ronitt Rubinfeld, Madhu Sudan
    Learning Polynomials with Queries: The Highly Noisy Case. [Citation Graph (0, 0)][DBLP]
    FOCS, 1995, pp:294-303 [Conf]
  70. Oded Goldreich, Madhu Sudan
    Locally Testable Codes and PCPs of Almost-Linear Length. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:13-22 [Conf]
  71. Oded Goldreich, Luca Trevisan
    Three Theorems Regarding Testing Graph Properties. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:460-469 [Conf]
  72. Michael Ben-Or, Oded Goldreich, Silvio Micali, Ronald L. Rivest
    A Fair Protocol for Signing Contracts (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1985, pp:43-52 [Conf]
  73. Oded Goldreich
    Pseudorandomness. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:687-704 [Conf]
  74. Oded Goldreich, Hugo Krawczyk
    On the Composition of Zero-Knowledge Proof Systems. [Citation Graph (0, 0)][DBLP]
    ICALP, 1990, pp:268-282 [Conf]
  75. Oded Goldreich, Salil P. Vadhan, Avi Wigderson
    On Interactive Proofs with a Laconic Prover. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:334-345 [Conf]
  76. Oded Goldreich, Avi Wigderson
    On Pseudorandomness with respect to Deterministic Observes. [Citation Graph (0, 0)][DBLP]
    ICALP Satellite Workshops, 2000, pp:77-84 [Conf]
  77. Oded Goldreich, Silvio Micali, Avi Wigderson
    Proofs that Release Minimum Knowledge. [Citation Graph (0, 0)][DBLP]
    MFCS, 1986, pp:639-650 [Conf]
  78. Baruch Awerbuch, Oded Goldreich, Amir Herzberg
    A Quantitative Approach to Dynamic Networks. [Citation Graph (0, 0)][DBLP]
    PODC, 1990, pp:189-203 [Conf]
  79. Reuven Bar-Yehuda, Oded Goldreich, Alon Itai
    On the Time-Complexity of Broadcast in Radio Networks: An Exponential Gap Between Determinism and Randomization. [Citation Graph (0, 0)][DBLP]
    PODC, 1987, pp:98-108 [Conf]
  80. Oded Goldreich, Amir Herzberg, Yishay Mansour
    Source to Destination Communication in the Presence of Faults. [Citation Graph (0, 0)][DBLP]
    PODC, 1989, pp:85-101 [Conf]
  81. Oded Goldreich, Liuba Shrira
    The Effect of Link Failures on Computations in Asynchronous Rings. [Citation Graph (0, 0)][DBLP]
    PODC, 1986, pp:174-185 [Conf]
  82. Oded Goldreich, Dror Sneh
    On the Complexity of Global Computation in the Presence of Link Failures: The Case of Uni-Directional Faults. [Citation Graph (0, 0)][DBLP]
    PODC, 1992, pp:103-111 [Conf]
  83. Oded Goldreich, Shmuel Safra
    A Combinatorial Consistency Lemma with Application to Proving the PCP Theorem. [Citation Graph (0, 0)][DBLP]
    RANDOM, 1997, pp:67-84 [Conf]
  84. Oded Goldreich, Avi Wigderson
    Derandomization That Is Rarely Wrong from Short Advice That Is Typically Good. [Citation Graph (0, 0)][DBLP]
    RANDOM, 2002, pp:209-223 [Conf]
  85. Oded Goldreich, Avi Wigderson
    Improved Derandomization of BPP Using a Hitting Set Generator. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 1999, pp:131-137 [Conf]
  86. Eli Ben-Sasson, Oded Goldreich, Madhu Sudan
    Bounds on 2-Query Codeword Testing. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2003, pp:216-227 [Conf]
  87. Yevgeniy Dodis, Oded Goldreich, Eric Lehman, Sofya Raskhodnikova, Dana Ron, Alex Samorodnitsky
    Improved Testing Algorithms for Monotonicity. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 1999, pp:97-108 [Conf]
  88. Oded Goldreich
    Probabilistic Proof Systems - A Survey. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:595-611 [Conf]
  89. Adi Akavia, Oded Goldreich, Shafi Goldwasser, Dana Moshkovitz
    On basing one-way functions on NP-hardness. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:701-710 [Conf]
  90. Mihir Bellare, Oded Goldreich, Shafi Goldwasser
    Incremental cryptography and application to virus protection. [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:45-56 [Conf]
  91. Shai Ben-David, Benny Chor, Oded Goldreich, Michael Luby
    On the Theory of Average Case Complexity [Citation Graph (0, 0)][DBLP]
    STOC, 1989, pp:204-216 [Conf]
  92. Michael Ben-Or, Ran Canetti, Oded Goldreich
    Asynchronous secure computation. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:52-61 [Conf]
  93. Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan
    Robust pcps of proximity, shorter pcps and applications to coding. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:1-10 [Conf]
  94. Ran Canetti, Uriel Feige, Oded Goldreich, Moni Naor
    Adaptively Secure Multi-Party Computation. [Citation Graph (0, 0)][DBLP]
    STOC, 1996, pp:639-648 [Conf]
  95. Ran Canetti, Oded Goldreich, Shafi Goldwasser, Silvio Micali
    Resettable zero-knowledge (extended abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:235-244 [Conf]
  96. Ran Canetti, Oded Goldreich, Shai Halevi
    The Random Oracle Methodology, Revisited (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:209-218 [Conf]
  97. Guy Even, Oded Goldreich, Michael Luby, Noam Nisan, Boban Velickovic
    Approximations of General Independent Distributions [Citation Graph (0, 0)][DBLP]
    STOC, 1992, pp:10-16 [Conf]
  98. Oded Goldreich
    Concurrent zero-knowledge with timing, revisited. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:332-340 [Conf]
  99. Oded Goldreich
    Towards a Theory of Software Protection and Simulation by Oblivious RAMs [Citation Graph (0, 0)][DBLP]
    STOC, 1987, pp:182-194 [Conf]
  100. Oded Goldreich, Shafi Goldwasser
    On the Limits of Non-Approximability of Lattice Problems. [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:1-9 [Conf]
  101. Oded Goldreich, Leonid A. Levin
    A Hard-Core Predicate for all One-Way Functions [Citation Graph (0, 0)][DBLP]
    STOC, 1989, pp:25-32 [Conf]
  102. Oded Goldreich, Silvio Micali, Avi Wigderson
    How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority [Citation Graph (0, 0)][DBLP]
    STOC, 1987, pp:218-229 [Conf]
  103. Oded Goldreich, Rafail Ostrovsky, Erez Petrank
    Computational complexity and knowledge complexity (extended abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 1994, pp:534-543 [Conf]
  104. Oded Goldreich, Dana Ron
    Property Testing in Bounded Degree Graphs. [Citation Graph (0, 0)][DBLP]
    STOC, 1997, pp:406-415 [Conf]
  105. Oded Goldreich, Dana Ron
    A Sublinear Bipartiteness Tester for Bunded Degree Graphs. [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:289-298 [Conf]
  106. Oded Goldreich, Dana Ron, Madhu Sudan
    Chinese Remaindering with Errors. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:225-234 [Conf]
  107. Oded Goldreich, Amit Sahai, Salil P. Vadhan
    Honest-Verifier Statistical Zero-Knowledge Equals General Statistical Zero-Knowledge. [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:399-408 [Conf]
  108. Oded Goldreich, Avi Wigderson
    Tiny families of functions with random properties (preliminary version): a quality-size trade-off for hashing. [Citation Graph (0, 0)][DBLP]
    STOC, 1994, pp:574-584 [Conf]
  109. Ran Canetti, Oded Goldreich, Shai Halevi
    On the Random-Oracle Methodology as Applied to Length-Restricted Signature Schemes. [Citation Graph (0, 0)][DBLP]
    TCC, 2004, pp:40-57 [Conf]
  110. Oded Goldreich
    On Expected Probabilistic Polynomial-Time Adversaries: A Suggestion for Restricted Definitions and Their Benefits. [Citation Graph (0, 0)][DBLP]
    TCC, 2007, pp:174-193 [Conf]
  111. Reuven Bar-Yehuda, Oded Goldreich, Alon Itai
    Efficient Emulation of Single-Hop Radio Network with Collision Detection on Multi-Hop Radio Network with no Collision Detection. [Citation Graph (0, 0)][DBLP]
    WDAG, 1989, pp:24-32 [Conf]
  112. Oded Goldreich, Liuba Shrira
    Electing a Leader in a Ring with Link Failures. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1987, v:24, n:1, pp:79-91 [Journal]
  113. Benny Chor, Oded Goldreich
    An Improved Parallel Algorithm for Integer GCD. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1990, v:5, n:1, pp:1-10 [Journal]
  114. Oded Goldreich, Dana Ron
    Property Testing in Bounded Degree Graphs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:32, n:2, pp:302-343 [Journal]
  115. Oded Goldreich, Howard J. Karloff, Leonard J. Schulman, Luca Trevisan
    Lower bounds for linear locally decodable codes and private information retrieval. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2006, v:15, n:3, pp:263-296 [Journal]
  116. Oded Goldreich, Erez Petrank
    Quantifying Knowledge Complexity. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1999, v:8, n:1, pp:50-98 [Journal]
  117. Oded Goldreich, Salil P. Vadhan, Avi Wigderson
    On interactive proofs with a laconic prover. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2002, v:11, n:1-2, pp:1-53 [Journal]
  118. Mihir Bellare, Oded Goldreich, Shafi Goldwasser
    Randomness in Interactive Proofs. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1993, v:3, n:, pp:319-354 [Journal]
  119. Ran Canetti, Oded Goldreich
    Bounds on Tradeoffs Between Randomness and Communication Complexity. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1993, v:3, n:, pp:141-167 [Journal]
  120. Oded Goldreich, Shafi Goldwasser, Eric Lehman, Dana Ron, Alex Samorodnitsky
    Testing Monotonicity. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2000, v:20, n:3, pp:301-337 [Journal]
  121. Oded Goldreich, Dana Ron
    A Sublinear Bipartiteness Tester for Bounded Degree Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1999, v:19, n:3, pp:335-373 [Journal]
  122. Ran Canetti, Oded Goldreich, Shai Halevi
    The Random Oracle Methodology, Revisited [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  123. Oded Goldreich, Avi Wigderson
    Theory of Computing: A Scientific Perspective. [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 1996, v:28, n:4es, pp:218- [Journal]
  124. Reuven Bar-Yehuda, Oded Goldreich, Alon Itai
    Efficient Emulation of Single-Hop Radio Network with Collision Detection on Multi-Hop Radio Network with no Collision Detection. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 1991, v:5, n:, pp:67-71 [Journal]
  125. Oded Goldreich
    Cryptography and cryptographic protocols. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2003, v:16, n:2-3, pp:177-199 [Journal]
  126. Oded Goldreich, Salil P. Vadhan, Avi Wigderson
    Simplified derandomization of BPP using a hitting set generator. [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:4, pp:- [Journal]
  127. Oded Goldreich
    Candidate One-Way Functions Based on Expander Graphs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:90, pp:- [Journal]
  128. Oded Goldreich, Dana Ron
    On Testing Expansion in Bounded-Degree Graphs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:20, pp:- [Journal]
  129. Oded Goldreich, Luca Trevisan
    Three Theorems regarding Testing Graph Properties. [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:10, pp:- [Journal]
  130. Oded Goldreich, Avi Wigderson
    On Pseudorandomness with respect to Deterministic Observers. [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:56, pp:- [Journal]
  131. Oded Goldreich, Salil P. Vadhan, Avi Wigderson
    On Interactive Proofs with a Laconic Prover [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:46, pp:- [Journal]
  132. Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil P. Vadhan, Ke Yang
    On the (Im)possibility of Obfuscating Programs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:057, pp:- [Journal]
  133. Oded Goldreich, Howard J. Karloff, Leonard J. Schulman, Luca Trevisan
    Lower Bounds for Linear Locally Decodable Codes and Private Information Retrieval [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:, n:080, pp:- [Journal]
  134. Oded Goldreich
    Concurrent Zero-Knowledge With Timing, Revisited [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:, n:091, pp:- [Journal]
  135. Boaz Barak, Oded Goldreich
    Universal Arguments and their Applications [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:, n:093, pp:- [Journal]
  136. Oded Goldreich
    Using the FGLSS-reduction to Prove Inapproximability Results for Minimum Vertex Cover in Hypergraphs. [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:, n:102, pp:- [Journal]
  137. Oded Goldreich, Avi Wigderson
    Derandomization that is rarely wrong from short advice that is typically good [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:039, pp:- [Journal]
  138. Oded Goldreich
    The GGM Construction does NOT yield Correlation Intractable Function Ensembles. [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:047, pp:- [Journal]
  139. Noga Alon, Oded Goldreich, Yishay Mansour
    Almost k-wise independence versus k-wise independence [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:048, pp:- [Journal]
  140. Oded Goldreich, Vered Rosen
    On the Security of Modular Exponentiation with Application to the Construction of Pseudorandom Generators [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:049, pp:- [Journal]
  141. Oded Goldreich, Madhu Sudan
    Locally Testable Codes and PCPs of Almost-Linear Length [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:050, pp:- [Journal]
  142. Oded Goldreich
    Zero-Knowledge twenty years after its invention [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:063, pp:- [Journal]
  143. Eli Ben-Sasson, Oded Goldreich, Madhu Sudan
    Bounds on 2-Query Codeword Testing. [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:10, n:019, pp:- [Journal]
  144. Oded Goldreich, Shafi Goldwasser, Asaf Nussboim
    On the Implementation of Huge Random Objects [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:045, pp:- [Journal]
  145. Oded Goldreich, Dana Ron
    On Estimating the Average Degree of a Graph [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:013, pp:- [Journal]
  146. Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan
    Robust PCPs of Proximity, Shorter PCPs and Applications to Coding [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:021, pp:- [Journal]
  147. Oded Goldreich, Madhu Sudan, Luca Trevisan
    From logarithmic advice to single-bit advice [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:093, pp:- [Journal]
  148. Oded Goldreich
    Short Locally Testable Codes and Proofs (Survey) [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:014, pp:- [Journal]
  149. Oded Goldreich
    On Promise Problems (a survey in memory of Shimon Even [1935-2004]) [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:018, pp:- [Journal]
  150. Oded Goldreich, Dana Ron
    Approximating Average Parameters of Graphs. [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:073, pp:- [Journal]
  151. Oded Goldreich
    Bravely, Moderately: A Common Theme in Four Recent Results [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:098, pp:- [Journal]
  152. Oded Goldreich, Rafail Ostrovsky, Erez Petrank
    Computational Complexity and Knowledge Complexity [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1994, v:1, n:7, pp:- [Journal]
  153. Oded Goldreich
    Probabilistic Proof Systems (A Survey) [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1994, v:1, n:8, pp:- [Journal]
  154. Mihir Bellare, Oded Goldreich, Madhu Sudan
    Free Bits, PCP and Non-Approximability - Towards Tight Results [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:24, pp:- [Journal]
  155. Oded Goldreich, Leonid A. Levin, Noam Nisan
    On Constructing 1-1 One-Way Functions [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:29, pp:- [Journal]
  156. Oded Goldreich, Noam Nisan, Avi Wigderson
    On Yao's XOR-Lemma [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:50, pp:- [Journal]
  157. Oded Goldreich
    Three XOR-Lemmas - An Exposition [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:56, pp:- [Journal]
  158. Oded Goldreich, Shafi Goldwasser, Shai Halevi
    Collision-Free Hashing from Lattice Problems [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1996, v:3, n:42, pp:- [Journal]
  159. Oded Goldreich, Shmuel Safra
    A Combinatorial Consistency Lemma with application to the PCP Theorem [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1996, v:3, n:47, pp:- [Journal]
  160. Oded Goldreich
    The Graph Clustering Problem has a Perfect Zero-Knowledge Proof [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1996, v:3, n:54, pp:- [Journal]
  161. Oded Goldreich, Shafi Goldwasser, Shai Halevi
    Eliminating Decryption Errors in the Ajtai-Dwork Cryptosystem. [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:18, pp:- [Journal]
  162. Oded Goldreich
    A Sample of Samplers - A Computational Perspective on Sampling (survey). [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:20, pp:- [Journal]
  163. Scott E. Decatur, Oded Goldreich, Dana Ron
    Computational Sample Complexity [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:28, pp:- [Journal]
  164. Oded Goldreich, Shafi Goldwasser
    On the Limits of Non-Approximability of Lattice Problems [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:31, pp:- [Journal]
  165. Oded Goldreich
    Combinatorial Property Testing (a survey). [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:56, pp:- [Journal]
  166. Oded Goldreich
    Notes on Levin's Theory of Average-Case Complexity. [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:58, pp:- [Journal]
  167. Alfredo De Santis, Giovanni Di Crescenzo, Oded Goldreich, Giuseppe Persiano
    The Graph Clustering Problem has a Perfect Zero-Knowledge Proof [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:6, pp:- [Journal]
  168. Mihir Bellare, Oded Goldreich, Erez Petrank
    Uniform Generation of NP-witnesses using an NP-oracle. [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:32, pp:- [Journal]
  169. Oded Goldreich, Ronitt Rubinfeld, Madhu Sudan
    Learning Polynomials with Queries - The Highly Noisy Case. [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:60, pp:- [Journal]
  170. Oded Goldreich, Dana Ron, Madhu Sudan
    Chinese Remaindering with Errors [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:62, pp:- [Journal]
  171. Ziv Bar-Yossef, Oded Goldreich, Avi Wigderson
    Deterministic Amplification of Space Bounded Probabilistic Algorithms. [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:72, pp:- [Journal]
  172. Oded Goldreich, Daniele Micciancio, Shmuel Safra, Jean-Pierre Seifert
    Approximating Shortest Lattice Vectors is Not Harder Than Approximating Closest Lattice Vectors. [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1999, v:6, n:2, pp:- [Journal]
  173. Oded Goldreich, Amit Sahai, Salil P. Vadhan
    Can Statistical Zero Knowledge be made Non-Interactive? or On the Relationship of SZK and NISZK [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1999, v:6, n:13, pp:- [Journal]
  174. Yevgeniy Dodis, Oded Goldreich, Eric Lehman, Sofya Raskhodnikova, Dana Ron, Alex Samorodnitsky
    Improved Testing Algorithms for Monotonicity. [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1999, v:6, n:17, pp:- [Journal]
  175. Oded Goldreich, Shafi Goldwasser, Silvio Micali
    Interleaved Zero-Knowledge in the Public-Key Model. [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1999, v:6, n:24, pp:- [Journal]
  176. Ran Canetti, Oded Goldreich, Shafi Goldwasser, Silvio Micali
    Resettable Zero-Knowledge. [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1999, v:, n:42, pp:- [Journal]
  177. Mihir Bellare, Oded Goldreich, Erez Petrank
    Uniform Generation of NP-Witnesses Using an NP-Oracle. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2000, v:163, n:2, pp:510-526 [Journal]
  178. Noga Alon, Oded Goldreich, Yishay Mansour
    Almost k-wise independence versus k-wise independence. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:88, n:3, pp:107-110 [Journal]
  179. Ran Canetti, Guy Even, Oded Goldreich
    Lower Bounds for Sampling Algorithms for Estimating the Average. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:53, n:1, pp:17-25 [Journal]
  180. Oded Goldreich
    A Note on Computational Indistinguishability. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:34, n:6, pp:277-281 [Journal]
  181. Oded Goldreich, Johan Håstad
    On the Complexity of Interactive Proofs with Bounded Communication. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:67, n:4, pp:205-214 [Journal]
  182. Oded Goldreich, Daniele Micciancio, Shmuel Safra, Jean-Pierre Seifert
    Approximating Shortest Lattice Vectors is not Harder than Approximating Closest Lattice Vectors. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:71, n:2, pp:55-61 [Journal]
  183. Oded Goldreich, Erez Petrank
    The Best of Both Worlds: Guaranteeing Termination in Fast Randomized Byzantine Agreement Protocols. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:36, n:1, pp:45-49 [Journal]
  184. Oded Goldreich, Dana Ron
    On Universal Learning Algorithms. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:63, n:3, pp:131-136 [Journal]
  185. Alfredo De Santis, Giovanni Di Crescenzo, Oded Goldreich, Giuseppe Persiano
    The Graph Clustering Problem has a Perfect Zero-Knowledge Interactive Proof. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:69, n:4, pp:201-206 [Journal]
  186. Baruch Awerbuch, Oded Goldreich, David Peleg, Ronen Vainish
    A Trade-Off between Information and Communication in Broadcast Protocols [Citation Graph (0, 0)][DBLP]
    J. ACM, 1990, v:37, n:2, pp:238-256 [Journal]
  187. Ran Canetti, Oded Goldreich, Shai Halevi
    The random oracle methodology, revisited. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2004, v:51, n:4, pp:557-594 [Journal]
  188. Benny Chor, Eyal Kushilevitz, Oded Goldreich, Madhu Sudan
    Private Information Retrieval. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1998, v:45, n:6, pp:965-981 [Journal]
  189. Oded Goldreich, Shafi Goldwasser, Silvio Micali
    How to construct random functions. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1986, v:33, n:4, pp:792-807 [Journal]
  190. Oded Goldreich, Shafi Goldwasser, Dana Ron
    Property Testing and its Connection to Learning and Approximation. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1998, v:45, n:4, pp:653-750 [Journal]
  191. Oded Goldreich, Silvio Micali, Avi Wigderson
    Proofs that Yield Nothing But Their Validity or All Languages in NP Have Zero-Knowledge Proof Systems. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1991, v:38, n:3, pp:691-729 [Journal]
  192. Oded Goldreich, Rafail Ostrovsky
    Software Protection and Simulation on Oblivious RAMs. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1996, v:43, n:3, pp:431-473 [Journal]
  193. Oded Goldreich, Madhu Sudan
    Locally testable codes and PCPs of almost-linear length. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2006, v:53, n:4, pp:558-655 [Journal]
  194. Shimon Even, Oded Goldreich
    The Minimum-Length Generator Sequence Problem is NP-Hard. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1981, v:2, n:3, pp:311-313 [Journal]
  195. Benny Chor, Oded Goldreich
    On the power of two-point based sampling. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1989, v:5, n:1, pp:96-106 [Journal]
  196. Reuven Bar-Yehuda, Oded Goldreich, Alon Itai
    On the Time-Complexity of Broadcast in Multi-hop Radio Networks: An Exponential Gap Between Determinism and Randomization. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1992, v:45, n:1, pp:104-126 [Journal]
  197. Shai Ben-David, Benny Chor, Oded Goldreich, Michael Luby
    On the Theory of Average Case Complexity. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1992, v:44, n:2, pp:193-219 [Journal]
  198. Richard Chang, Benny Chor, Oded Goldreich, Juris Hartmanis, Johan Håstad, Desh Ranjan, Pankaj Rohatgi
    The Random Oracle Hypothesis Is False. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1994, v:49, n:1, pp:24-39 [Journal]
  199. Oded Goldreich, Shafi Goldwasser
    On the Limits of Nonapproximability of Lattice Problems. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2000, v:60, n:3, pp:540-563 [Journal]
  200. Oded Goldreich, Madhu Sudan
    Computational Indistinguishability: A Sample Hierarchy. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1999, v:59, n:2, pp:253-269 [Journal]
  201. Shimon Even, Oded Goldreich, Silvio Micali
    On-Line/Off-Line Digital Signatures. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 1996, v:9, n:1, pp:35-67 [Journal]
  202. Oded Goldreich
    Preface. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 2000, v:13, n:1, pp:1-7 [Journal]
  203. Oded Goldreich
    Preface. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 2004, v:17, n:1, pp:1-3 [Journal]
  204. Oded Goldreich
    A Uniform-Complexity Treatment of Encryption and Zero-Knowledge. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 1993, v:6, n:1, pp:21-53 [Journal]
  205. Oded Goldreich, Eyal Kushilevitz
    A Perfect Zero-Knowledge Proof System for a Problem Equivalent to the Discrete Logarithm. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 1993, v:6, n:2, pp:97-116 [Journal]
  206. Oded Goldreich, Ariel Kahan
    How to Construct Constant-Round Zero-Knowledge Proof Systems for NP. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 1996, v:9, n:3, pp:167-190 [Journal]
  207. Oded Goldreich, Yair Oren
    Definitions and Properties of Zero-Knowledge Proof Systems. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 1994, v:7, n:1, pp:1-32 [Journal]
  208. Oded Goldreich, Vered Rosen
    On the Security of Modular Exponentiation with Application to the Construction of Pseudorandom Generators. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 2003, v:16, n:2, pp:71-93 [Journal]
  209. Oded Goldreich, Yehuda Lindell
    Session-Key Generation Using Human Passwords Only. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 2006, v:19, n:3, pp:241-340 [Journal]
  210. Noga Alon, Oded Goldreich, Johan Håstad, René Peralta
    Simple Construction of Almost k-wise Independent Random Variables. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1992, v:3, n:3, pp:289-304 [Journal]
  211. Noga Alon, Oded Goldreich, Johan Håstad, Rene Paralta
    Addendum to "Simple Construction of Almost k-wise Independent Random Variables". [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1993, v:4, n:1, pp:119-120 [Journal]
  212. Guy Even, Oded Goldreich, Michael Luby, Noam Nisan, Boban Velickovic
    Efficient approximation of product distributions. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1998, v:13, n:1, pp:1-16 [Journal]
  213. Oded Goldreich, Hugo Krawczyk
    Sparse Pseudorandom Distributions. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1992, v:3, n:2, pp:163-174 [Journal]
  214. Oded Goldreich, Luca Trevisan
    Three theorems regarding testing graph properties. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2003, v:23, n:1, pp:23-57 [Journal]
  215. Oded Goldreich, Avi Wigderson
    Tiny families of functions with random properties: A quality-size trade-off for hashing. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1997, v:11, n:4, pp:315-343 [Journal]
  216. Werner Alexi, Benny Chor, Oded Goldreich, Claus-Peter Schnorr
    RSA and Rabin Functions: Certain Parts are as Hard as the Whole. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:2, pp:194-209 [Journal]
  217. Mihir Bellare, Oded Goldreich, Madhu Sudan
    Free Bits, PCPs, and Nonapproximability-Towards Tight Results. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:3, pp:804-915 [Journal]
  218. Benny Chor, Oded Goldreich
    Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:2, pp:230-261 [Journal]
  219. Scott E. Decatur, Oded Goldreich, Dana Ron
    Computational Sample Complexity. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:3, pp:854-879 [Journal]
  220. Oded Goldreich, Shafi Goldwasser, Nathan Linial
    Fault-Tolerant Computation in the Full Information Model. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:2, pp:506-544 [Journal]
  221. Oded Goldreich, Hugo Krawczyk
    On the Composition of Zero-Knowledge Proof Systems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1996, v:25, n:1, pp:169-192 [Journal]
  222. Oded Goldreich, Hugo Krawczyk, Michael Luby
    On the Existence of Pseudorandom Generators. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:6, pp:1163-1175 [Journal]
  223. Oded Goldreich, Rafail Ostrovsky, Erez Petrank
    Computational Complexity and Knowledge Complexity. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:4, pp:1116-1141 [Journal]
  224. Oded Goldreich, Shmuel Safra
    A Combinatorial Consistency Lemma with Application to Proving the PCP Theorem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:29, n:4, pp:1132-1154 [Journal]
  225. Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan
    Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:4, pp:889-974 [Journal]
  226. Oded Goldreich, Madhu Sudan
    Special Issue on Randomness and Complexity. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:4, pp:- [Journal]
  227. Oded Goldreich, Ronitt Rubinfeld, Madhu Sudan
    Learning Polynomials with Queries: The Highly Noisy Case. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2000, v:13, n:4, pp:535-570 [Journal]
  228. Oded Goldreich, Bernd Meyer
    Computational Indistinguishability: Algorithms vs. Circuits. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:191, n:1-2, pp:215-218 [Journal]
  229. Michael Ben-Or, Oded Goldreich, Silvio Micali, Ronald L. Rivest
    A fair protocol for signing contracts. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:1, pp:40-46 [Journal]
  230. Shimon Even, Oded Goldreich
    DES-like functions can generate the alternating group. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:6, pp:863-865 [Journal]
  231. Shimon Even, Oded Goldreich
    Correction to 'DES-like functions can generate the alternating group' (Nov 83 863-865). [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:5, pp:780-0 [Journal]
  232. Oded Goldreich, Dana Ron, Madhu Sudan
    Chinese remaindering with errors. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:4, pp:1330-1338 [Journal]
  233. Shimon Even, Oded Goldreich
    On the Power of Cascade Ciphers [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Syst., 1985, v:3, n:2, pp:108-116 [Journal]
  234. Oded Goldreich, Or Sheffet
    On the Randomness Complexity of Property Testing. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:509-524 [Conf]
  235. Kfir Barhum, Oded Goldreich, Adi Shraibman
    On Approximating the Average Distance Between Points. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:296-310 [Conf]
  236. Oded Goldreich
    On the number of monochromatic close pairs of beads in a rosary. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:80, n:1, pp:59-68 [Journal]

  237. Algorithmic Aspects of Property Testing in the Dense Graphs Model. [Citation Graph (, )][DBLP]


  238. Hierarchy Theorems for Property Testing. [Citation Graph (, )][DBLP]


  239. On Testing Computability by Small Width OBDDs. [Citation Graph (, )][DBLP]


  240. Contemplations on Testing Graph Properties. [Citation Graph (, )][DBLP]


  241. Approximating Average Parameters of Graphs. [Citation Graph (, )][DBLP]


  242. More Constructions of Lossy and Correlation-Secure Trapdoor Functions. [Citation Graph (, )][DBLP]


  243. On proximity oblivious testing. [Citation Graph (, )][DBLP]


  244. Erratum for: on basing one-way functions on NP-hardness. [Citation Graph (, )][DBLP]


  245. Preface to the Special Issue from Random'06. [Citation Graph (, )][DBLP]


  246. On The Randomness Complexity of Property Testing. [Citation Graph (, )][DBLP]


  247. Special Issue On Worst-case Versus Average-case Complexity Editors' Foreword. [Citation Graph (, )][DBLP]


  248. Finding Cycles and Trees in Sublinear Time [Citation Graph (, )][DBLP]


  249. Hierarchy Theorems for Property Testing. [Citation Graph (, )][DBLP]


  250. Algorithmic Aspects of Property Testing in the Dense Graphs Model. [Citation Graph (, )][DBLP]


  251. On Proximity Oblivious Testing. [Citation Graph (, )][DBLP]


  252. On the Average-Case Complexity of Property Testing. [Citation Graph (, )][DBLP]


  253. The Tensor Product of Two Good Codes Is Not Necessarily Robustly Testable. [Citation Graph (, )][DBLP]


  254. On the randomness complexity of property testing. [Citation Graph (, )][DBLP]


  255. On Expected Probabilistic Polynomial-Time Adversaries -- A suggestion for restricted definitions and their benefits. [Citation Graph (, )][DBLP]


  256. On Probabilistic versus Deterministic Provers in the Definition of Proofs Of Knowledge. [Citation Graph (, )][DBLP]


Search in 0.022secs, Finished in 0.932secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002