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