The SCEAS System
| |||||||

## Search the dblp DataBase
Omer Reingold:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Eyal Kaplan, Moni Naor, Omer Reingold
**Derandomized Constructions of k-Wise (Almost) Independent Permutations.**[Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2005, pp:354-365 [Conf] - Ronen Gradwohl, Guy Kindler, Omer Reingold, Amnon Ta-Shma
**On the Error Parameter of Dispersers.**[Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2005, pp:294-305 [Conf] - 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.**[Citation Graph (0, 0)][DBLP] ACM Conference on Computer and Communications Security, 2002, pp:48-58 [Conf] - Ziv Bar-Yossef, Luca Trevisan, Omer Reingold, Ronen Shaltiel
**Streaming Computation of Combinatorial Objects.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2002, pp:165-174 [Conf] - Michael R. Capalbo, Omer Reingold, Salil P. Vadhan, Avi Wigderson
**Randomness Conductors and Constant-Degree Lossless Expanders.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2002, pp:15- [Conf] - Moni Naor, Omer Reingold
**From Unpredictability to Indistinguishability: A Simple Construction of Pseudo-Random Functions from MACs (Extended Abstract).**[Citation Graph (0, 0)][DBLP] CRYPTO, 1998, pp:267-282 [Conf] - Iftach Haitner, Danny Harnik, Omer Reingold
**On the Power of the Randomized Iterate.**[Citation Graph (0, 0)][DBLP] CRYPTO, 2006, pp:22-40 [Conf] - William Aiello, Yuval Ishai, Omer Reingold
**Priced Oblivious Transfer: How to Sell Digital Goods.**[Citation Graph (0, 0)][DBLP] EUROCRYPT, 2001, pp:119-135 [Conf] - Cynthia Dwork, Moni Naor, Omer Reingold
**Immunizing Encryption Schemes from Decryption Errors.**[Citation Graph (0, 0)][DBLP] EUROCRYPT, 2004, pp:342-360 [Conf] - Danny Harnik, Joe Kilian, Moni Naor, Omer Reingold, Alon Rosen
**On Robust Combiners for Oblivious Transfer and Other Primitives.**[Citation Graph (0, 0)][DBLP] EUROCRYPT, 2005, pp:96-113 [Conf] - Moni Naor, Benny Pinkas, Omer Reingold
**Distributed Pseudo-random Functions and KDCs.**[Citation Graph (0, 0)][DBLP] EUROCRYPT, 1999, pp:327-346 [Conf] - Irit Dinur, Omer Reingold
**Assignment Testers: Towards a Combinatorial Proof of the PCP-Theorem.**[Citation Graph (0, 0)][DBLP] FOCS, 2004, pp:155-164 [Conf] - Cynthia Dwork, Moni Naor, Omer Reingold, Larry J. Stockmeyer
**Magic Functions.**[Citation Graph (0, 0)][DBLP] FOCS, 1999, pp:523-534 [Conf] - Yael Gertner, Sampath Kannan, Tal Malkin, Omer Reingold, Mahesh Viswanathan
**The Relationship between Public Key Encryption and Oblivious Transfer.**[Citation Graph (0, 0)][DBLP] FOCS, 2000, pp:325-335 [Conf] - Yael Gertner, Tal Malkin, Omer Reingold
**On the Impossibility of Basing Trapdoor Functions on Trapdoor Predicates.**[Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:126-135 [Conf] - Moni Naor, Omer Reingold
**Synthesizers and Their Application to the Parallel Construction of Psuedo-Random Functions.**[Citation Graph (0, 0)][DBLP] FOCS, 1995, pp:170-181 [Conf] - Moni Naor, Omer Reingold
**Number-theoretic Constructions of Efficient Pseudo-random Functions.**[Citation Graph (0, 0)][DBLP] FOCS, 1997, pp:458-467 [Conf] - Omer Reingold, Salil P. Vadhan, Avi Wigderson
**Entropy Waves, the Zig-Zag Graph Product, and New Constant-Degree Expanders and Extractors.**[Citation Graph (0, 0)][DBLP] FOCS, 2000, pp:3-13 [Conf] - Ran Raz, Omer Reingold, Salil P. Vadhan
**Error Reduction for Extractors.**[Citation Graph (0, 0)][DBLP] FOCS, 1999, pp:191-201 [Conf] - Omer Reingold, Ronen Shaltiel, Avi Wigderson
**Extracting Randomness via Repeated Condensing.**[Citation Graph (0, 0)][DBLP] FOCS, 2000, pp:22-31 [Conf] - Iftach Haitner, Danny Harnik, Omer Reingold
**Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions.**[Citation Graph (0, 0)][DBLP] ICALP (2), 2006, pp:228-239 [Conf] - Moni Naor, Omer Reingold
**Constructing pseudo-random permutations with a prescribed structure.**[Citation Graph (0, 0)][DBLP] SODA, 2001, pp:458-459 [Conf] - 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.**[Citation Graph (0, 0)][DBLP] Security Protocols Workshop, 2001, pp:27-39 [Conf] - Ran Canetti, Daniele Micciancio, Omer Reingold
**Perfectly One-Way Probabilistic Hash Functions (Preliminary Version).**[Citation Graph (0, 0)][DBLP] STOC, 1998, pp:131-140 [Conf] - Michael R. Capalbo, Omer Reingold, Salil P. Vadhan, Avi Wigderson
**Randomness conductors and constant-degree lossless expanders.**[Citation Graph (0, 0)][DBLP] STOC, 2002, pp:659-668 [Conf] - Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen
**Completeness in two-party secure computation: a computational view.**[Citation Graph (0, 0)][DBLP] STOC, 2004, pp:252-261 [Conf] - Chi-Jen Lu, Omer Reingold, Salil P. Vadhan, Avi Wigderson
**Extractors: optimal up to constant factors.**[Citation Graph (0, 0)][DBLP] STOC, 2003, pp:602-611 [Conf] - Moni Naor, Omer Reingold
**On the Construction of Pseudo-Random Permutations: Luby-Rackoff Revisited (Extended Abstract).**[Citation Graph (0, 0)][DBLP] STOC, 1997, pp:189-199 [Conf] - Moni Naor, Omer Reingold, Alon Rosen
**Pseudo-random functions and factoring (extended abstract).**[Citation Graph (0, 0)][DBLP] STOC, 2000, pp:11-20 [Conf] - Ran Raz, Omer Reingold
**On Recycling the Randomness of States in Space Bounded Computation.**[Citation Graph (0, 0)][DBLP] STOC, 1999, pp:159-168 [Conf] - Ran Raz, Omer Reingold, Salil P. Vadhan
**Extracting all the Randomness and Reducing the Error in Trevisan's Extractors.**[Citation Graph (0, 0)][DBLP] STOC, 1999, pp:149-158 [Conf] - Omer Reingold
**Undirected ST-connectivity in log-space.**[Citation Graph (0, 0)][DBLP] STOC, 2005, pp:376-385 [Conf] - Omer Reingold, Luca Trevisan, Salil P. Vadhan
**Pseudorandom walks on regular digraphs and the RL vs. L problem.**[Citation Graph (0, 0)][DBLP] STOC, 2006, pp:457-466 [Conf] - Omer Reingold, Luca Trevisan, Salil P. Vadhan
**Notions of Reducibility between Cryptographic Primitives.**[Citation Graph (0, 0)][DBLP] TCC, 2004, pp:1-20 [Conf] - Michael J. Freedman, Yuval Ishai, Benny Pinkas, Omer Reingold
**Keyword Search and Oblivious Pseudorandom Functions.**[Citation Graph (0, 0)][DBLP] TCC, 2005, pp:303-324 [Conf] - Michael Merritt, Omer Reingold, Gadi Taubenfeld, Rebecca N. Wright
**Tight Bounds for Shared Memory Systems Accessed by Byzantine Processes.**[Citation Graph (0, 0)][DBLP] DISC, 2002, pp:222-236 [Conf] - Noga Alon, Michael Merritt, Omer Reingold, Gadi Taubenfeld, Rebecca N. Wright
**Tight bounds for shared memory systems accessed by Byzantine processes.**[Citation Graph (0, 0)][DBLP] Distributed Computing, 2005, v:18, n:2, pp:99-109 [Journal] - Omer Reingold, Salil P. Vadhan, Avi Wigderson
**Entropy Waves, the Zig-Zag Graph Product, and New Constant-Degree Expanders and Extractors**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:18, pp:- [Journal] - Omer Reingold, Ronen Shaltiel, Avi Wigderson
**Extracting Randomness via Repeated Condensing**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:59, pp:- [Journal] - Moni Naor, Omer Reingold, Alon Rosen
**Pseudo-Random Functions and Factoring**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:064, pp:- [Journal] - Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen
**Completeness in Two-Party Secure Computation - A Computational View**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:060, pp:- [Journal] - Omer Reingold
**Undirected ST-Connectivity in Log-Space**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:094, pp:- [Journal] - Omer Reingold, Luca Trevisan, Salil P. Vadhan
**Pseudorandom Walks in Biregular Graphs and the RL vs. L Problem**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:022, pp:- [Journal] - Ronen Gradwohl, Guy Kindler, Omer Reingold, Amnon Ta-Shma
**On the Error Parameter of Dispersers**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:061, pp:- [Journal] - Iftach Haitner, Danny Harnik, Omer Reingold
**On the Power of the Randomized Iterate**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:135, pp:- [Journal] - Eyal Kaplan, Moni Naor, Omer Reingold
**Derandomized Constructions of k-Wise (Almost) Independent Permutations**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2006, v:, n:002, pp:- [Journal] - Eli Biham, Dan Boneh, Omer Reingold
**Generalized Diffie-Hellman Modulo a Composite is not Weaker than Factoring**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:61, pp:- [Journal] - Ran Raz, Omer Reingold, Salil P. Vadhan
**Extracting All the Randomness and Reducing the Error in Trevisan's Extractors**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 1999, v:, n:46, pp:- [Journal] - Eli Biham, Dan Boneh, Omer Reingold
**Breaking Generalized Diffie-Hellmann Modulo a Composite is no Easier Than Factoring.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1999, v:70, n:2, pp:83-87 [Journal] - Cynthia Dwork, Moni Naor, Omer Reingold, Larry J. Stockmeyer
**Magic Functions.**[Citation Graph (0, 0)][DBLP] J. ACM, 2003, v:50, n:6, pp:852-921 [Journal] - Moni Naor, Omer Reingold
**Number-theoretic constructions of efficient pseudo-random functions.**[Citation Graph (0, 0)][DBLP] J. ACM, 2004, v:51, n:2, pp:231-262 [Journal] - Moni Naor, Omer Reingold
**Synthesizers and Their Application to the Parallel Construction of Pseudo-Random Functions.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1999, v:58, n:2, pp:336-375 [Journal] - Ran Raz, Omer Reingold, Salil P. Vadhan
**Extracting all the Randomness and Reducing the Error in Trevisan's Extractors.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2002, v:65, n:1, pp:97-128 [Journal] - Moni Naor, Omer Reingold
**Constructing Pseudo-Random Permutations with a Prescribed Structure.**[Citation Graph (0, 0)][DBLP] J. Cryptology, 2002, v:15, n:2, pp:97-102 [Journal] - Moni Naor, Omer Reingold
**On the Construction of Pseudorandom Permutations: Luby-Rackoff Revisited.**[Citation Graph (0, 0)][DBLP] J. Cryptology, 1999, v:12, n:1, pp:29-66 [Journal] - Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen
**Completeness in Two-Party Secure Computation: A Computational View.**[Citation Graph (0, 0)][DBLP] J. Cryptology, 2006, v:19, n:4, pp:521-552 [Journal] - Moni Naor, Omer Reingold, Alon Rosen
**Pseudorandom Functions and Factoring.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2002, v:31, n:5, pp:1383-1404 [Journal] - Omer Reingold, Ronen Shaltiel, Avi Wigderson
**Extracting Randomness via Repeated Condensing.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2006, v:35, n:5, pp:1185-1209 [Journal] - Irit Dinur, Omer Reingold
**Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2006, v:36, n:4, pp:975-1024 [Journal] - 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.**[Citation Graph (0, 0)][DBLP] ACM Trans. Inf. Syst. Secur., 2004, v:7, n:2, pp:242-273 [Journal] - Kai-min Chung, Omer Reingold, Salil P. Vadhan
**S-T Connectivity on Digraphs with a Known Stationary Distribution.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2007, pp:236-249 [Conf] - Iftach Haitner, Omer Reingold
**A New Interactive Hashing Theorem.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2007, pp:319-332 [Conf] - Iftach Haitner, Omer Reingold
**Statistically-hiding commitment from any one-way function.**[Citation Graph (0, 0)][DBLP] STOC, 2007, pp:1-10 [Conf] **Pseudorandom Bit Generators That Fool Modular Sums.**[Citation Graph (, )][DBLP]**How Well Do Random Walks Parallelize?.**[Citation Graph (, )][DBLP]**Computational Differential Privacy.**[Citation Graph (, )][DBLP]**Universal One-Way Hash Functions via Inaccessible Entropy.**[Citation Graph (, )][DBLP]**Dense Subsets of Pseudorandom Sets.**[Citation Graph (, )][DBLP]**Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments.**[Citation Graph (, )][DBLP]**Fault tolerance in large games.**[Citation Graph (, )][DBLP]**On the complexity of differentially private data release: efficient algorithms and hardness results.**[Citation Graph (, )][DBLP]**Inaccessible entropy.**[Citation Graph (, )][DBLP]**Efficiency improvements in constructing pseudorandom generators from one-way functions.**[Citation Graph (, )][DBLP]**Derandomized Constructions of**[Citation Graph (, )][DBLP]*k*-Wise (Almost) Independent Permutations.**Dense Subsets of Pseudorandom Sets.**[Citation Graph (, )][DBLP]**Finding Collisions in Interactive Protocols -- A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments.**[Citation Graph (, )][DBLP]**S-T Connectivity on Digraphs with a Known Stationary Distribution.**[Citation Graph (, )][DBLP]**A New Interactive Hashing Theorem.**[Citation Graph (, )][DBLP]
Search in 0.041secs, Finished in 0.046secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |