The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Omer Reingold: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. 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]
  3. 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]
  4. 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]
  5. 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]
  6. 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]
  7. Iftach Haitner, Danny Harnik, Omer Reingold
    On the Power of the Randomized Iterate. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2006, pp:22-40 [Conf]
  8. 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]
  9. Cynthia Dwork, Moni Naor, Omer Reingold
    Immunizing Encryption Schemes from Decryption Errors. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2004, pp:342-360 [Conf]
  10. 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]
  11. Moni Naor, Benny Pinkas, Omer Reingold
    Distributed Pseudo-random Functions and KDCs. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1999, pp:327-346 [Conf]
  12. 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]
  13. Cynthia Dwork, Moni Naor, Omer Reingold, Larry J. Stockmeyer
    Magic Functions. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:523-534 [Conf]
  14. 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]
  15. 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]
  16. 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]
  17. Moni Naor, Omer Reingold
    Number-theoretic Constructions of Efficient Pseudo-random Functions. [Citation Graph (0, 0)][DBLP]
    FOCS, 1997, pp:458-467 [Conf]
  18. 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]
  19. Ran Raz, Omer Reingold, Salil P. Vadhan
    Error Reduction for Extractors. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:191-201 [Conf]
  20. Omer Reingold, Ronen Shaltiel, Avi Wigderson
    Extracting Randomness via Repeated Condensing. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:22-31 [Conf]
  21. 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]
  22. Moni Naor, Omer Reingold
    Constructing pseudo-random permutations with a prescribed structure. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:458-459 [Conf]
  23. 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]
  24. 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]
  25. 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]
  26. 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]
  27. 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]
  28. 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]
  29. Moni Naor, Omer Reingold, Alon Rosen
    Pseudo-random functions and factoring (extended abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:11-20 [Conf]
  30. 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]
  31. 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]
  32. Omer Reingold
    Undirected ST-connectivity in log-space. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:376-385 [Conf]
  33. 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]
  34. Omer Reingold, Luca Trevisan, Salil P. Vadhan
    Notions of Reducibility between Cryptographic Primitives. [Citation Graph (0, 0)][DBLP]
    TCC, 2004, pp:1-20 [Conf]
  35. 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]
  36. 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]
  37. 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]
  38. 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]
  39. 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]
  40. 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]
  41. 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]
  42. 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]
  43. 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]
  44. 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]
  45. 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]
  46. 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]
  47. 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]
  48. 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]
  49. 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]
  50. 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]
  51. 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]
  52. 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]
  53. 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]
  54. 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]
  55. 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]
  56. 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]
  57. 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]
  58. 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]
  59. 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]
  60. 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]
  61. 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]
  62. Iftach Haitner, Omer Reingold
    A New Interactive Hashing Theorem. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2007, pp:319-332 [Conf]
  63. Iftach Haitner, Omer Reingold
    Statistically-hiding commitment from any one-way function. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:1-10 [Conf]

  64. Pseudorandom Bit Generators That Fool Modular Sums. [Citation Graph (, )][DBLP]


  65. How Well Do Random Walks Parallelize?. [Citation Graph (, )][DBLP]


  66. Computational Differential Privacy. [Citation Graph (, )][DBLP]


  67. Universal One-Way Hash Functions via Inaccessible Entropy. [Citation Graph (, )][DBLP]


  68. Dense Subsets of Pseudorandom Sets. [Citation Graph (, )][DBLP]


  69. Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments. [Citation Graph (, )][DBLP]


  70. Fault tolerance in large games. [Citation Graph (, )][DBLP]


  71. On the complexity of differentially private data release: efficient algorithms and hardness results. [Citation Graph (, )][DBLP]


  72. Inaccessible entropy. [Citation Graph (, )][DBLP]


  73. Efficiency improvements in constructing pseudorandom generators from one-way functions. [Citation Graph (, )][DBLP]


  74. Derandomized Constructions of k-Wise (Almost) Independent Permutations. [Citation Graph (, )][DBLP]


  75. Dense Subsets of Pseudorandom Sets. [Citation Graph (, )][DBLP]


  76. Finding Collisions in Interactive Protocols -- A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments. [Citation Graph (, )][DBLP]


  77. S-T Connectivity on Digraphs with a Known Stationary Distribution. [Citation Graph (, )][DBLP]


  78. A New Interactive Hashing Theorem. [Citation Graph (, )][DBLP]


Search in 0.007secs, Finished in 0.010secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002