Omer Reingold

	2009
81		Omer Reingold: Theory of Cryptography, 6th Theory of Cryptography Conference, TCC 2009, San Francisco, CA, USA, March 15-17, 2009. Proceedings Springer 2009
80		Klim Efremenko, Omer Reingold: How Well Do Random Walks Parallelize?. APPROX-RANDOM 2009: 476-489
79		Shachar Lovett, Omer Reingold, Luca Trevisan, Salil P. Vadhan: Pseudorandom Bit Generators That Fool Modular Sums. APPROX-RANDOM 2009: 615-630
78		Ilya Mironov, Omkant Pandey, Omer Reingold, Salil P. Vadhan: Computational Differential Privacy. CRYPTO 2009: 126-142
77		Cynthia Dwork, Moni Naor, Omer Reingold, Guy N. Rothblum, Salil P. Vadhan: On the complexity of differentially private data release: efficient algorithms and hardness results. STOC 2009: 381-390
76		Iftach Haitner, Omer Reingold, Salil P. Vadhan, Hoeteck Wee: Inaccessible entropy. STOC 2009: 611-620
75		Eyal Kaplan, Moni Naor, Omer Reingold: Derandomized Constructions of k-Wise (Almost) Independent Permutations. Algorithmica 55(1): 113-133 (2009)
	2008
74		Ronen Gradwohl, Omer Reingold: Fault tolerance in large games. ACM Conference on Electronic Commerce 2008: 274-283
73		Omer Reingold, Luca Trevisan, Madhur Tulsiani, Salil P. Vadhan: Dense Subsets of Pseudorandom Sets. FOCS 2008: 76-85
72		Omer Reingold, Luca Trevisan, Madhur Tulsiani, Salil P. Vadhan: Dense Subsets of Pseudorandom Sets. Electronic Colloquium on Computational Complexity (ECCC) 15(045): (2008)
71		Omer Reingold: Undirected connectivity in log-space. J. ACM 55(4): (2008)
	2007
70		Moses Charikar, Klaus Jansen, Omer Reingold, José D. P. Rolim: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20-22, 2007, Proceedings Springer 2007
69		Iftach Haitner, Jonathan J. Hoch, Omer Reingold, Gil Segev: Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments. FOCS 2007: 669-679
68		Kai-Min Chung, Omer Reingold, Salil P. Vadhan: S-T Connectivity on Digraphs with a Known Stationary Distribution. IEEE Conference on Computational Complexity 2007: 236-249
67		Iftach Haitner, Omer Reingold: A New Interactive Hashing Theorem. IEEE Conference on Computational Complexity 2007: 319-332
66		Iftach Haitner, Omer Reingold: Statistically-hiding commitment from any one-way function. STOC 2007: 1-10
65		Kai-Min Chung, Omer Reingold, Salil P. Vadhan: S-T Connectivity on Digraphs with a Known Stationary Distribution. Electronic Colloquium on Computational Complexity (ECCC) 14(030): (2007)
64		Iftach Haitner, Jonathan J. Hoch, Omer Reingold, Gil Segev: Finding Collisions in Interactive Protocols -- A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments. Electronic Colloquium on Computational Complexity (ECCC) 14(038): (2007)
	2006
63		Iftach Haitner, Danny Harnik, Omer Reingold: On the Power of the Randomized Iterate. CRYPTO 2006: 22-40
62		Iftach Haitner, Danny Harnik, Omer Reingold: Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions. ICALP (2) 2006: 228-239
61		Omer Reingold, Luca Trevisan, Salil P. Vadhan: Pseudorandom walks on regular digraphs and the RL vs. L problem. STOC 2006: 457-466
60		Eyal Kaplan, Moni Naor, Omer Reingold: Derandomized Constructions of k-Wise (Almost) Independent Permutations Electronic Colloquium on Computational Complexity (ECCC)(002): (2006)
59		Iftach Haitner, Omer Reingold: A New Interactive Hashing Theorem. Electronic Colloquium on Computational Complexity (ECCC) 13(096): (2006)
58		Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen: Completeness in Two-Party Secure Computation: A Computational View. J. Cryptology 19(4): 521-552 (2006)
57		Omer Reingold, Ronen Shaltiel, Avi Wigderson: Extracting Randomness via Repeated Condensing. SIAM J. Comput. 35(5): 1185-1209 (2006)
56		Irit Dinur, Omer Reingold: Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem. SIAM J. Comput. 36(4): 975-1024 (2006)
	2005
55		Ronen Gradwohl, Guy Kindler, Omer Reingold, Amnon Ta-Shma: On the Error Parameter of Dispersers. APPROX-RANDOM 2005: 294-305
54		Eyal Kaplan, Moni Naor, Omer Reingold: Derandomized Constructions of k-Wise (Almost) Independent Permutations. APPROX-RANDOM 2005: 354-365
53		Danny Harnik, Joe Kilian, Moni Naor, Omer Reingold, Alon Rosen: On Robust Combiners for Oblivious Transfer and Other Primitives. EUROCRYPT 2005: 96-113
52		Omer Reingold: Undirected ST-connectivity in log-space. STOC 2005: 376-385
51		Michael J. Freedman, Yuval Ishai, Benny Pinkas, Omer Reingold: Keyword Search and Oblivious Pseudorandom Functions. TCC 2005: 303-324
50		Noga Alon, Michael Merritt, Omer Reingold, Gadi Taubenfeld, Rebecca N. Wright: Tight bounds for shared memory systems accessed by Byzantine processes. Distributed Computing 18(2): 99-109 (2005)
49		Omer Reingold, Luca Trevisan, Salil P. Vadhan: Pseudorandom Walks in Biregular Graphs and the RL vs. L Problem Electronic Colloquium on Computational Complexity (ECCC)(022): (2005)
48		Ronen Gradwohl, Guy Kindler, Omer Reingold, Amnon Ta-Shma: On the Error Parameter of Dispersers Electronic Colloquium on Computational Complexity (ECCC)(061): (2005)
47		Iftach Haitner, Danny Harnik, Omer Reingold: On the Power of the Randomized Iterate Electronic Colloquium on Computational Complexity (ECCC)(135): (2005)
	2004
46		Cynthia Dwork, Moni Naor, Omer Reingold: Immunizing Encryption Schemes from Decryption Errors. EUROCRYPT 2004: 342-360
45		Irit Dinur, Omer Reingold: Assignment Testers: Towards a Combinatorial Proof of the PCP-Theorem. FOCS 2004: 155-164
44		Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen: Completeness in two-party secure computation: a computational view. STOC 2004: 252-261
43		Omer Reingold, Luca Trevisan, Salil P. Vadhan: Notions of Reducibility between Cryptographic Primitives. TCC 2004: 1-20
42		William Aiello, Steven M. Bellovin, Matt Blaze, Ran Canetti, John Ioannidis, Angelos D. Keromytis, Omer Reingold: Just fast keying: Key agreement in a hostile internet. ACM Trans. Inf. Syst. Secur. 7(2): 242-273 (2004)
41		Omer Reingold: Undirected ST-Connectivity in Log-Space Electronic Colloquium on Computational Complexity (ECCC)(094): (2004)
40		Moni Naor, Omer Reingold: Number-theoretic constructions of efficient pseudo-random functions. J. ACM 51(2): 231-262 (2004)
	2003
39		Chi-Jen Lu, Omer Reingold, Salil P. Vadhan, Avi Wigderson: Extractors: optimal up to constant factors. STOC 2003: 602-611
38		Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen: Completeness in Two-Party Secure Computation - A Computational View Electronic Colloquium on Computational Complexity (ECCC)(060): (2003)
37		Cynthia Dwork, Moni Naor, Omer Reingold, Larry J. Stockmeyer: Magic Functions. J. ACM 50(6): 852-921 (2003)
	2002
36		William Aiello, Steven M. Bellovin, Matt Blaze, John Ioannidis, Omer Reingold, Ran Canetti, Angelos D. Keromytis: Efficient, DoS-resistant, secure key exchange for internet protocols. ACM Conference on Computer and Communications Security 2002: 48-58
35		Michael Merritt, Omer Reingold, Gadi Taubenfeld, Rebecca N. Wright: Tight Bounds for Shared Memory Systems Accessed by Byzantine Processes. DISC 2002: 222-236
34		Michael R. Capalbo, Omer Reingold, Salil P. Vadhan, Avi Wigderson: Randomness Conductors and Constant-Degree Lossless Expanders. IEEE Conference on Computational Complexity 2002: 15
33		Ziv Bar-Yossef, Luca Trevisan, Omer Reingold, Ronen Shaltiel: Streaming Computation of Combinatorial Objects. IEEE Conference on Computational Complexity 2002: 165-174
32		Michael R. Capalbo, Omer Reingold, Salil P. Vadhan, Avi Wigderson: Randomness conductors and constant-degree lossless expanders. STOC 2002: 659-668
31		Ran Raz, Omer Reingold, Salil P. Vadhan: Extracting all the Randomness and Reducing the Error in Trevisan's Extractors. J. Comput. Syst. Sci. 65(1): 97-128 (2002)
30		Moni Naor, Omer Reingold: Constructing Pseudo-Random Permutations with a Prescribed Structure. J. Cryptology 15(2): 97-102 (2002)
29		Moni Naor, Omer Reingold, Alon Rosen: Pseudorandom Functions and Factoring. SIAM J. Comput. 31(5): 1383-1404 (2002)
	2001
28		William Aiello, Yuval Ishai, Omer Reingold: Priced Oblivious Transfer: How to Sell Digital Goods. EUROCRYPT 2001: 119-135
27		Yael Gertner, Tal Malkin, Omer Reingold: On the Impossibility of Basing Trapdoor Functions on Trapdoor Predicates. FOCS 2001: 126-135
26		Moni Naor, Omer Reingold: Constructing pseudo-random permutations with a prescribed structure. SODA 2001: 458-459
25		William Aiello, Steven M. Bellovin, Matt Blaze, Ran Canetti, John Ioannidis, Angelos D. Keromytis, Omer Reingold: Efficient, DoS-Resistant, Secure Key Exchange for Internet Protocols. Security Protocols Workshop 2001: 27-39
24		Moni Naor, Omer Reingold, Alon Rosen: Pseudo-Random Functions and Factoring Electronic Colloquium on Computational Complexity (ECCC) 8(064): (2001)
23		Omer Reingold, Salil P. Vadhan, Avi Wigderson: Entropy Waves, the Zig-Zag Graph Product, and New Constant-Degree Expanders and Extractors Electronic Colloquium on Computational Complexity (ECCC) 8(18): (2001)
	2000
22		Omer Reingold, Ronen Shaltiel, Avi Wigderson: Extracting Randomness via Repeated Condensing. FOCS 2000: 22-31
21		Omer Reingold, Salil P. Vadhan, Avi Wigderson: Entropy Waves, the Zig-Zag Graph Product, and New Constant-Degree Expanders and Extractors. FOCS 2000: 3-13
20		Yael Gertner, Sampath Kannan, Tal Malkin, Omer Reingold, Mahesh Viswanathan: The Relationship between Public Key Encryption and Oblivious Transfer. FOCS 2000: 325-335
19		Moni Naor, Omer Reingold, Alon Rosen: Pseudo-random functions and factoring (extended abstract). STOC 2000: 11-20
18		Omer Reingold, Ronen Shaltiel, Avi Wigderson: Extracting Randomness via Repeated Condensing Electronic Colloquium on Computational Complexity (ECCC) 7(59): (2000)
	1999
17		Moni Naor, Benny Pinkas, Omer Reingold: Distributed Pseudo-random Functions and KDCs. EUROCRYPT 1999: 327-346
16		Ran Raz, Omer Reingold, Salil P. Vadhan: Error Reduction for Extractors. FOCS 1999: 191-201
15		Cynthia Dwork, Moni Naor, Omer Reingold, Larry J. Stockmeyer: Magic Functions. FOCS 1999: 523-534
14		Ran Raz, Omer Reingold, Salil P. Vadhan: Extracting all the Randomness and Reducing the Error in Trevisan's Extractors. STOC 1999: 149-158
13		Ran Raz, Omer Reingold: On Recycling the Randomness of States in Space Bounded Computation. STOC 1999: 159-168
12		Ran Raz, Omer Reingold, Salil P. Vadhan: Extracting All the Randomness and Reducing the Error in Trevisan's Extractors Electronic Colloquium on Computational Complexity (ECCC)(46): (1999)
11		Eli Biham, Dan Boneh, Omer Reingold: Breaking Generalized Diffie-Hellmann Modulo a Composite is no Easier Than Factoring. Inf. Process. Lett. 70(2): 83-87 (1999)
10		Moni Naor, Omer Reingold: Synthesizers and Their Application to the Parallel Construction of Pseudo-Random Functions. J. Comput. Syst. Sci. 58(2): 336-375 (1999)
9		Moni Naor, Omer Reingold: On the Construction of Pseudorandom Permutations: Luby-Rackoff Revisited. J. Cryptology 12(1): 29-66 (1999)
	1998
8		Moni Naor, Omer Reingold: From Unpredictability to Indistinguishability: A Simple Construction of Pseudo-Random Functions from MACs (Extended Abstract). CRYPTO 1998: 267-282
7		Ran Canetti, Daniele Micciancio, Omer Reingold: Perfectly One-Way Probabilistic Hash Functions (Preliminary Version). STOC 1998: 131-140
	1997
6		Moni Naor, Omer Reingold: Number-theoretic Constructions of Efficient Pseudo-random Functions. FOCS 1997: 458-467
5		Moni Naor, Omer Reingold: On the Construction of Pseudo-Random Permutations: Luby-Rackoff Revisited (Extended Abstract). STOC 1997: 189-199
4		Moni Naor, Omer Reingold: On the Construction of Pseudo-Random Permutations: Luby-Rackoff Revisited Electronic Colloquium on Computational Complexity (ECCC) 4(5): (1997)
3		Eli Biham, Dan Boneh, Omer Reingold: Generalized Diffie-Hellman Modulo a Composite is not Weaker than Factoring Electronic Colloquium on Computational Complexity (ECCC) 4(61): (1997)
	1995
2		Moni Naor, Omer Reingold: Synthesizers and Their Application to the Parallel Construction of Psuedo-Random Functions. FOCS 1995: 170-181
1		Moni Naor, Omer Reingold: Synthesizers and Their Application to the Parallel Construction of Pseudo-random Functions Electronic Colloquium on Computational Complexity (ECCC) 2(45): (1995)

Coauthor Index

1	William Aiello	[25] [28] [36] [42]
2	Noga Alon	[50]
3	Ziv Bar-Yossef	[33]
4	Steven M. Bellovin	[25] [36] [42]
5	Eli Biham	[3] [11]
6	Matt Blaze	[25] [36] [42]
7	Dan Boneh	[3] [11]
8	Ran Canetti	[7] [25] [36] [42]
9	Michael R. Capalbo	[32] [34]
10	Moses Charikar	[70]
11	Kai-Min Chung	[65] [68]
12	Irit Dinur	[45] [56]
13	Cynthia Dwork	[15] [37] [46] [77]
14	Klim Efremenko	[80]
15	Michael J. Freedman	[51]
16	Yael Gertner	[20] [27]
17	Ronen Gradwohl	[48] [55] [74]
18	Iftach Haitner	[47] [59] [62] [63] [64] [66] [67] [69] [76]
19	Danny Harnik	[38] [44] [47] [53] [58] [62] [63]
20	Jonathan J. Hoch	[64] [69]
21	John Ioannidis	[25] [36] [42]
22	Yuval Ishai	[28] [51]
23	Klaus Jansen	[70]
24	Sampath Kannan	[20]
25	Eyal Kaplan	[54] [60] [75]
26	Angelos D. Keromytis	[25] [36] [42]
27	Joe Kilian	[53]
28	Guy Kindler	[48] [55]
29	Shachar Lovett	[79]
30	Chi-Jen Lu	[39]
31	Tal Malkin	[20] [27]
32	Michael Merritt	[35] [50]
33	Daniele Micciancio	[7]
34	Ilya Mironov	[78]
35	Moni Naor	[1] [2] [4] [5] [6] [8] [9] [10] [15] [17] [19] [24] [26] [29] [30] [37] [38] [40] [44] [46] [53] [54] [58] [60] [75] [77]
36	Omkant Pandey	[78]
37	Benny Pinkas	[17] [51]
38	Ran Raz	[12] [13] [14] [16] [31]
39	José D. P. Rolim	[70]
40	Alon Rosen	[19] [24] [29] [38] [44] [53] [58]
41	Guy N. Rothblum	[77]
42	Gil Segev	[64] [69]
43	Ronen Shaltiel	[18] [22] [33] [57]
44	Larry J. Stockmeyer	[15] [37]
45	Amnon Ta-Shma	[48] [55]
46	Gadi Taubenfeld	[35] [50]
47	Luca Trevisan	[33] [43] [49] [61] [72] [73] [79]
48	Madhur Tulsiani	[72] [73]
49	Salil P. Vadhan	[12] [14] [16] [21] [23] [31] [32] [34] [39] [43] [49] [61] [65] [68] [72] [73] [76] [77] [78] [79]
50	Mahesh Viswanathan	[20]
51	Hoeteck Wee	[76]
52	Avi Wigderson	[18] [21] [22] [23] [32] [34] [39] [57]
53	Rebecca N. Wright	[35] [50]

Colors in the list of coauthors