| Year |
Citation |
Score |
| 2019 |
Goldreich O, Gur T, Komargodski I. Strong Locally Testable Codes with Relaxed Local Decoders Acm Transactions On Computation Theory. 11: 17. DOI: 10.1145/3319907 |
0.337 |
|
| 2019 |
Goldreich O. Hierarchy Theorems for Testing Properties in Size-Oblivious Query Complexity Computational Complexity. 28: 709-747. DOI: 10.1007/S00037-019-00187-2 |
0.345 |
|
| 2018 |
Goldreich O, Gur T, Rothblum RD. Proofs of proximity for context-free languages and read-once branching programs Information & Computation. 261: 175-201. DOI: 10.1016/J.Ic.2018.02.003 |
0.332 |
|
| 2016 |
Goldreich O, Ron D. On Sample-Based Testers Acm Transactions On Computation Theory. 8: 7. DOI: 10.1145/2898355 |
0.302 |
|
| 2015 |
Goldreich O, Meir O. Input-Oblivious Proof Systems and a Uniform Complexity Perspective on P/poly Acm Transactions On Computation Theory. 7: 16. DOI: 10.1145/2799645 |
0.674 |
|
| 2014 |
Czumaj A, Goldreich O, Ron D, Seshadhri C, Shapira A, Sohler C. Finding cycles and trees in sublinear time Random Structures and Algorithms. 45: 139-184. DOI: 10.1002/Rsa.20462 |
0.354 |
|
| 2013 |
Freeman DM, Goldreich O, Kiltz E, Rosen A, Segev G. More constructions of lossy and correlation-secure trapdoor functions Journal of Cryptology. 26: 39-74. DOI: 10.1007/S00145-011-9112-3 |
0.741 |
|
| 2012 |
Goldreich O, Izsak R. Monotone Circuits: One-Way Functions versus Pseudorandom Generators Theory of Computing. 8: 231-238. DOI: 10.4086/Toc.2012.V008A010 |
0.319 |
|
| 2012 |
Goldreich O, Meir O. The tensor product of two good codes is not necessarily robustly testable Information Processing Letters. 112: 351-355. DOI: 10.1016/J.Ipl.2012.01.007 |
0.648 |
|
| 2012 |
Goldreich O, Vadhan S. Special issue from RANDOM’09: Editors’ Foreword Computational Complexity. 21: 1-1. DOI: 10.1007/S00037-011-0035-Z |
0.333 |
|
| 2012 |
Goldreich O, Krivelevich M, Newman I, Rozenberg E. Hierarchy Theorems for Property Testing Computational Complexity. 21: 129-192. DOI: 10.1007/S00037-011-0022-4 |
0.35 |
|
| 2011 |
Goldreich O, Ron D. On proximity-oblivious testing Siam Journal On Computing. 40: 534-566. DOI: 10.1137/100789646 |
0.328 |
|
| 2011 |
Goldreich O, Ron D. Algorithmic aspects of property testing in the dense graphs model Siam Journal On Computing. 40: 376-445. DOI: 10.1137/090749621 |
0.331 |
|
| 2010 |
Goldreich O, Goldwasser S, Nussboim A. On the Implementation of Huge Random Objects Siam Journal On Computing. 39: 2761-2822. DOI: 10.1137/080722771 |
0.306 |
|
| 2010 |
Goldreich O. On Expected Probabilistic Polynomial-Time Adversaries: A Suggestion for Restricted Definitions and Their Benefits Journal of Cryptology. 23: 1-36. DOI: 10.1007/S00145-009-9050-5 |
0.337 |
|
| 2010 |
Goldreich O. Introduction to testing graph properties Electronic Colloquium On Computational Complexity. 17: 105-141. DOI: 10.1007/978-3-642-16367-8_7 |
0.314 |
|
| 2008 |
Barak B, Goldreich O. Universal Arguments and their Applications Siam Journal On Computing. 38: 1661-1694. DOI: 10.1137/070709244 |
0.614 |
|
| 2007 |
Goldreich O, Sheffet O. On the randomness complexity of property testing Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4627: 509-524. DOI: 10.1007/S00037-009-0282-4 |
0.333 |
|
| 2007 |
Goldreich O, Vadhan S. Special Issue On Worst-case Versus Average-case Complexity Editors' Foreword Computational Complexity. 16: 325-330. DOI: 10.1007/S00037-007-0232-Y |
0.324 |
|
| 2006 |
Goldreich O, Sudan M. Locally testable codes and PCPs of almost-linear length Journal of the Acm. 53: 558-655. DOI: 10.1145/1162349.1162351 |
0.326 |
|
| 2006 |
Goldreich O. Special Issue on Randomness and Complexity Siam Journal On Computing. 36. DOI: 10.1137/Smjcat0000360000040000Ix000001 |
0.4 |
|
| 2006 |
Ben-Sasson ELI, Goldreich O, Harsha P, Sudan M, Vadhan S. Robust PCPs of proximity, shorter PCPs, and applications to coding Siam Journal On Computing. 36: 889-974. DOI: 10.1137/S0097539705446810 |
0.359 |
|
| 2006 |
Goldreich O, Lindell Y. Session-Key Generation Using Human Passwords Only Journal of Cryptology. 19: 241-340. DOI: 10.1007/S00145-006-0233-Z |
0.697 |
|
| 2006 |
Goldreich O, Karloff H, Schulman LJ, Trevisan L. Lower bounds for linear locally decodable codes and private information retrieval Computational Complexity. 15: 263-296. DOI: 10.1007/S00037-006-0216-3 |
0.318 |
|
| 2004 |
Canetti R, Goldreich O, Halevi S. The random oracle methodology, revisited Journal of the Acm. 51: 557-594. DOI: 10.1145/1008731.1008734 |
0.675 |
|
| 2003 |
Goldreich O. Cryptography and cryptographic protocols Distributed Computing. 16: 177-199. DOI: 10.1007/S00446-002-0077-1 |
0.335 |
|
| 2003 |
Goldreich O, Rosen V. On the Security of Modular Exponentiation with Application to the Construction of Pseudorandom Generators Journal of Cryptology. 16: 71-93. DOI: 10.1007/S00145-002-0038-7 |
0.302 |
|
| 2003 |
Goldreich O, Trevisan L. Three Theorems Regarding Testing Graph Properties Random Structures and Algorithms. 23: 23-57. DOI: 10.1002/Rsa.10078 |
0.328 |
|
| 2002 |
Goldreich O, Ron D. Property Testing in Bounded Degree Graphs Algorithmica. 32: 302-343. DOI: 10.1007/S00453-001-0078-7 |
0.324 |
|
| 2001 |
Barak B, Goldreich O, Impagliazzo R, Rudich S, Sahai A, Vadhan S, Yang K. On the (Im)possibility of obfuscating programs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2139: 1-18. DOI: 10.1145/2160158.2160159 |
0.6 |
|
| 2000 |
Goldreich O, Rubinfeld R, Sudan M. Learning Polynomials with Queries: The Highly Noisy Case Siam Journal On Discrete Mathematics. 13: 535-570. DOI: 10.1137/S0895480198344540 |
0.306 |
|
| 1999 |
Goldreich O, Micciancio D, Safra S, Seifert JP. Approximating shortest lattice vectors is not harder than approximating closet lattice vectors Information Processing Letters. 71: 55-61. DOI: 10.1016/S0020-0190(99)00083-6 |
0.303 |
|
| 1999 |
Goldreich O, Ron D. A Sublinear Bipartiteness Tester for Bounded Degree Graphs Combinatorica. 19: 335-373. DOI: 10.1007/S004930050060 |
0.329 |
|
| 1999 |
Goldreich O, Sudan M. Computational indistinguishability: A sample hierarchy Journal of Computer and System Sciences. 59: 253-269. DOI: 10.1006/Jcss.1999.1652 |
0.313 |
|
| 1998 |
Goldreich O, Goldwasser S, Ron D. Property testing and its connection to learning and approximation Journal of the Acm. 45: 653-750. DOI: 10.1145/285055.285060 |
0.349 |
|
| 1998 |
Bellare M, Goldreich O, Sudan M. Free Bits, PCPs, and Nonapproximability---Towards Tight Results Siam Journal On Computing. 27: 804-915. DOI: 10.1137/S0097539796302531 |
0.381 |
|
| 1998 |
Goldreich O, Goldwasser S, Linial N. Fault-tolerant Computation in the Full Information Model Siam Journal On Computing. 27: 506-544. DOI: 10.1137/S0097539793246689 |
0.304 |
|
| 1998 |
Goldreich O, Meyer B. Computational indistinguishability: algorithms vs. circuits Theoretical Computer Science. 191: 215-218. DOI: 10.1016/S0304-3975(97)00162-X |
0.329 |
|
| 1996 |
Goldreich O, Krawczyk H. On the Composition of Zero-Knowledge Proof Systems Siam Journal On Computing. 25: 169-192. DOI: 10.1137/S0097539791220688 |
0.322 |
|
| 1996 |
Even S, Goldreich O, Micali S. On-line/off-line digital signatures Journal of Cryptology. 9: 35-67. DOI: 10.1007/Bf02254791 |
0.572 |
|
| 1996 |
Goldreich O, Kahan A. How to construct constant-round zero-knowledge proof systems for NP Journal of Cryptology. 9: 167-189. DOI: 10.1007/Bf00208001 |
0.329 |
|
| 1995 |
Canetti R, Even G, Goldreich O. Lower bounds for sampling algorithms for estimating the average Information Processing Letters. 53: 17-25. DOI: 10.1016/0020-0190(94)00171-T |
0.67 |
|
| 1994 |
Damgård IB, Goldreich O, Wigderson A. Hashing Functions can Simplify Zero-Knowledge Protocol Design (too) Brics Report Series. 1. DOI: 10.7146/Brics.V1I39.21604 |
0.335 |
|
| 1994 |
Chang R, Chor B, Goldreich O, Hartmanis J, Håstad J, Ranjan D, Rohatgi P. The random oracle hypothesis is false Journal of Computer and System Sciences. 49: 24-39. DOI: 10.1016/S0022-0000(05)80084-4 |
0.343 |
|
| 1993 |
Goldreich O. A uniform-complexity treatment of encryption and zero-knowledge Journal of Cryptology. 6: 21-53. DOI: 10.1007/Bf02620230 |
0.325 |
|
| 1993 |
Goldreich O, Kushilevitz E. A perfect zero-knowledge proof system for a problem equivalent to the discrete logarithm Journal of Cryptology. 6: 97-116. DOI: 10.1007/Bf02620137 |
0.33 |
|
| 1993 |
Bellare M, Goldreich O, Goldwasser S. Randomness in interactive proofs Computational Complexity. 3: 319-354. DOI: 10.1007/Bf01275487 |
0.344 |
|
| 1993 |
Canetti R, Goldreich O. Bounds on tradeoffs between randomness and communication complexity Computational Complexity. 3: 141-167. DOI: 10.1007/Bf01200118 |
0.688 |
|
| 1992 |
Bar-Yehuda R, Goldreich O, Itai A. On the time-complexity of broadcast in multi-hop radio networks: an exponential gap between determinism and randomization Journal of Computer and System Sciences. 45: 104-126. DOI: 10.1016/0022-0000(92)90042-H |
0.605 |
|
| 1992 |
Ben-David S, Chor B, Goldreich O, Luby M. On the theory of average case complexity Journal of Computer and System Sciences. 44: 193-219. DOI: 10.1016/0022-0000(92)90019-F |
0.348 |
|
| 1992 |
Alon N, Goldreich O, Håstad J, Peralta R. Simple Constructions of Almost k‐wise Independent Random Variables Random Structures and Algorithms. 3: 289-304. DOI: 10.1002/Rsa.3240030308 |
0.306 |
|
| 1991 |
Goldreich O, Micali S, Wigderson A. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems Journal of the Acm. 38: 690-728. DOI: 10.1145/116825.116852 |
0.338 |
|
| 1991 |
Bar-Yehuda R, Goldreich O, Itai A. Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection Distributed Computing. 5: 67-71. DOI: 10.1007/Bf02259748 |
0.57 |
|
| 1991 |
Goldreich O, Shrira L. On the complexity of computation in the presence of link failures: the case of a ring Distributed Computing. 5: 121-131. DOI: 10.1007/Bf02252955 |
0.327 |
|
| 1990 |
Awerbuch B, Goldreich O, Vainish R, Peleg D. A Trade-Off Between Information and Communication in Broadcast Protocols Journal of the Acm (Jacm). 37: 238-256. DOI: 10.1145/77600.77618 |
0.346 |
|
| 1990 |
Ben-Or M, Goldreich O, Micali S, Rivest RL. A fair protocol for signing contracts Ieee Transactions On Information Theory. 36: 40-46. DOI: 10.1109/18.50372 |
0.328 |
|
| 1990 |
Goldreich O, Petrank E. The best of both worlds: guaranteeing termination in fast randomized Byzantine agreement protocols Information Processing Letters. 36: 45-49. DOI: 10.1016/0020-0190(90)90185-Z |
0.329 |
|
| 1990 |
Goldreich O. A note on computational indistinguishability Information Processing Letters. 34: 277-281. DOI: 10.1016/0020-0190(90)90010-U |
0.325 |
|
| 1990 |
Chor B, Goldreich O. An Improved Parallel Algorithm for Integer GCD Algorithmica. 5: 1-10. DOI: 10.1007/Bf01840374 |
0.302 |
|
| 1988 |
Chor B, Goldreich O. Unbiased bits from sources of weak randomness and probabilistic communication complexity Siam Journal On Computing. 17: 230-261. DOI: 10.1137/0217015 |
0.345 |
|
| 1986 |
Goldreich O, Goldwasser S, Micali S. How to construct random functions Journal of the Acm. 33: 792-807. DOI: 10.1145/6490.6503 |
0.354 |
|
| 1985 |
Even S, Goldreich O, Lempel A. A randomized protocol for signing contracts Communications of the Acm. 28: 637-647. DOI: 10.1145/3812.3818 |
0.584 |
|
| 1985 |
Even S, Goldreich O. On the power of cascade ciphers Acm Transactions On Computer Systems. 3: 108-116. DOI: 10.1145/214438.214442 |
0.584 |
|
| 1984 |
Even S, Goldreich O, Moran S, Tong P. On the np‐completeness of certain network testing problems Networks. 14: 1-24. DOI: 10.1002/Net.3230140102 |
0.601 |
|
| 1983 |
Even S, Goldreich O. DES-like functions can generate the alternating group Ieee Transactions On Information Theory. 29: 863-865. DOI: 10.1109/Tit.1983.1056752 |
0.591 |
|
| 1981 |
Even S, Goldreich O. The minimum-length generator sequence problem is NP-hard Journal of Algorithms. 2: 311-313. DOI: 10.1016/0196-6774(81)90029-8 |
0.568 |
|
| Show low-probability matches. |