Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarOmer Reingold
Person information
- affiliation: Weizmann Institute of Science, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
showing all ?? records
2010 – today
- 2018
[j30]Ilya Mironov, Omkant Pandey, Omer Reingold, Gil Segev:
Incremental Deterministic Public-Key Encryption. J. Cryptology 31(1): 134-161 (2018)- [i48]Michael P. Kim, Omer Reingold, Guy N. Rothblum:
Fairness Through Computationally-Bounded Awareness. CoRR abs/1803.03239 (2018) - [i47]Omer Reingold, Guy N. Rothblum, Ron Rothblum:
Efficient Batch Verification for UP. Electronic Colloquium on Computational Complexity (ECCC) 25: 22 (2018) - [i46]Iftach Haitner, Noam Mazor, Rotem Oshman, Omer Reingold, Amir Yehudayoff:
On the Communication Complexity of Key-Agreement Protocols. Electronic Colloquium on Computational Complexity (ECCC) 25: 31 (2018) - 2017
- [j29]Cynthia Dwork, Vitaly Feldman, Moritz Hardt, Toniann Pitassi, Omer Reingold, Aaron Roth:
Guilt-free data reuse. Commun. ACM 60(4): 86-93 (2017) - [c69]Jack Murtagh, Omer Reingold, Aaron Sidford, Salil P. Vadhan:
Derandomization Beyond Connectivity: Undirected Laplacian Systems in Nearly Logarithmic Space. FOCS 2017: 801-812 - [c68]Moshe Babaioff, Yishay Mansour, Noam Nisan, Gali Noti, Carlo Curino, Nar Ganapathy, Ishai Menache, Omer Reingold, Moshe Tennenholtz, Erez Timnat:
ERA: A Framework for Economic Resource Allocation for the Cloud. WWW (Companion Volume) 2017: 635-642 - [i45]Moshe Babaioff, Yishay Mansour, Noam Nisan, Gali Noti, Carlo Curino, Nar Ganapathy, Ishai Menache, Omer Reingold, Moshe Tennenholtz, Erez Timnat:
ERA: A Framework for Economic Resource Allocation for the Cloud. CoRR abs/1702.07311 (2017) - [i44]Jack Murtagh, Omer Reingold, Aaron Sidford, Salil P. Vadhan:
Derandomization Beyond Connectivity: Undirected Laplacian Systems in Nearly Logarithmic Space. CoRR abs/1708.04634 (2017) - [i43]Úrsula Hébert-Johnson, Michael P. Kim, Omer Reingold, Guy N. Rothblum:
Calibration for the (Computationally-Identifiable) Masses. CoRR abs/1711.08513 (2017) - [i42]Eshan Chattopadhyay, Pooya Hatami, Omer Reingold, Avishay Tal:
Improved Pseudorandomness for Unordered Branching Programs through Local Monotonicity. Electronic Colloquium on Computational Complexity (ECCC) 24: 171 (2017) - 2016
- [j28]Omer Reingold, Shai Vardi:
New techniques and tighter bounds for local computation algorithms. J. Comput. Syst. Sci. 82(7): 1180-1200 (2016) - [c67]Omer Reingold, Nina Narodytska:
Adaptive Condorcet-Based Stopping Rules Can Be Efficient. ECAI 2016: 1704-1705 - [c66]Omer Reingold, Guy N. Rothblum, Ron D. Rothblum:
Constant-round interactive proofs for delegating computation. STOC 2016: 49-62 - [c65]Katherine Ellis, Moisés Goldszmidt, Gert R. G. Lanckriet, Nina Mishra, Omer Reingold:
Equality and Social Mobility in Twitter Discussion Groups. WSDM 2016: 523-532 - [i41]Omer Reingold, Ron Rothblum, Guy N. Rothblum:
Constant-Round Interactive Proofs for Delegating Computation. Electronic Colloquium on Computational Complexity (ECCC) 23: 61 (2016) - 2015
- [j27]Iftach Haitner, Jonathan J. Hoch, Omer Reingold, Gil Segev:
Finding Collisions in Interactive Protocols - Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments. SIAM J. Comput. 44(1): 193-242 (2015) - [c64]Cynthia Dwork, Moni Naor, Omer Reingold, Guy N. Rothblum:
Pure Differential Privacy for Rectangle Queries via Private Partitions. ASIACRYPT (2) 2015: 735-751 - [c63]Cynthia Dwork, Vitaly Feldman, Moritz Hardt, Toniann Pitassi, Omer Reingold, Aaron Roth:
Generalization in Adaptive Data Analysis and Holdout Reuse. NIPS 2015: 2350-2358 - [c62]Cynthia Dwork, Vitaly Feldman, Moritz Hardt, Toniann Pitassi, Omer Reingold, Aaron Leon Roth:
Preserving Statistical Validity in Adaptive Data Analysis. STOC 2015: 117-126 - [i40]Cynthia Dwork, Vitaly Feldman, Moritz Hardt, Toniann Pitassi, Omer Reingold, Aaron Roth:
Generalization in Adaptive Data Analysis and Holdout Reuse. CoRR abs/1506.02629 (2015) - 2014
- [j26]Ronen Gradwohl, Omer Reingold:
Fault tolerance in large games. Games and Economic Behavior 86: 438-457 (2014) - [j25]Iftach Haitner, Omer Reingold:
A New Interactive Hashing Theorem. J. Cryptology 27(1): 109-138 (2014) - [c61]Raghu Meka, Omer Reingold, Yuan Zhou:
Deterministic Coupon Collection and Better Strong Dispersers. APPROX-RANDOM 2014: 872-884 - [c60]Raghu Meka, Omer Reingold, Guy N. Rothblum, Ron D. Rothblum:
Fast Pseudorandomness for Independence and Load Balancing - (Extended Abstract). ICALP (1) 2014: 859-870 - [c59]Omer Reingold, Ron D. Rothblum, Udi Wieder:
Pseudorandom Graphs in Data Structures. ICALP (1) 2014: 943-954 - [i39]Omer Reingold, Shai Vardi:
New Techniques and Tighter Bounds for Local Computation Algorithms. CoRR abs/1404.5398 (2014) - [i38]Cynthia Dwork, Vitaly Feldman, Moritz Hardt, Toniann Pitassi, Omer Reingold, Aaron Roth:
Preserving Statistical Validity in Adaptive Data Analysis. CoRR abs/1411.2664 (2014) - 2013
- [j24]Parikshit Gopalan, Raghu Meka, Omer Reingold:
DNF sparsification and a faster deterministic counting algorithm. Computational Complexity 22(2): 275-310 (2013) - [j23]L. Elisa Celis, Omer Reingold, Gil Segev, Udi Wieder:
Balls and Bins: Smaller Hash Families and Faster Evaluation. SIAM J. Comput. 42(3): 1030-1050 (2013) - [j22]Parikshit Gopalan, Raghu Meka, Omer Reingold, David Zuckerman:
Pseudorandom Generators for Combinatorial Shapes. SIAM J. Comput. 42(3): 1051-1076 (2013) - [j21]Iftach Haitner, Omer Reingold, Salil P. Vadhan:
Efficiency Improvements in Constructing Pseudorandom Generators from One-Way Functions. SIAM J. Comput. 42(3): 1405-1430 (2013) - [c58]Omer Reingold, Thomas Steinke, Salil P. Vadhan:
Pseudorandomness for Regular Branching Programs via Fourier Analysis. APPROX-RANDOM 2013: 655-670 - [i37]Omer Reingold, Thomas Steinke, Salil P. Vadhan:
Pseudorandomness for Regular Branching Programs via Fourier Analysis. CoRR abs/1306.3004 (2013) - [i36]Omer Reingold, Thomas Steinke, Salil P. Vadhan:
Pseudorandomness for Regular Branching Programs via Fourier Analysis. Electronic Colloquium on Computational Complexity (ECCC) 20: 86 (2013) - 2012
- [c57]Parikshit Gopalan, Raghu Meka, Omer Reingold:
DNF Sparsification and a Faster Deterministic Counting Algorithm. IEEE Conference on Computational Complexity 2012: 126-135 - [c56]Ilya Mironov, Omkant Pandey, Omer Reingold, Gil Segev:
Incremental Deterministic Public-Key Encryption. EUROCRYPT 2012: 628-644 - [c55]Parikshit Gopalan, Raghu Meka, Omer Reingold, Luca Trevisan, Salil P. Vadhan:
Better Pseudorandom Generators from Milder Pseudorandom Restrictions. FOCS 2012: 120-129 - [c54]Cynthia Dwork, Moritz Hardt, Toniann Pitassi, Omer Reingold, Richard S. Zemel:
Fairness through awareness. ITCS 2012: 214-226 - [i35]Parikshit Gopalan, Raghu Meka, Omer Reingold:
DNF Sparsification and a Faster Deterministic Counting Algorithm. CoRR abs/1205.3534 (2012) - [i34]Parikshit Gopalan, Raghu Meka, Omer Reingold, Luca Trevisan, Salil P. Vadhan:
Better Pseudorandom Generators from Milder Pseudorandom Restrictions. CoRR abs/1210.0049 (2012) - [i33]Parikshit Gopalan, Raghu Meka, Omer Reingold:
DNF Sparsification and a Faster Deterministic Counting. Electronic Colloquium on Computational Complexity (ECCC) 19: 60 (2012) - [i32]Parikshit Gopalan, Raghu Meka, Omer Reingold, Luca Trevisan, Salil P. Vadhan:
Better pseudorandom generators from milder pseudorandom restrictions. Electronic Colloquium on Computational Complexity (ECCC) 19: 123 (2012) - [i31]Ilya Mironov, Omkant Pandey, Omer Reingold, Gil Segev:
Incremental Deterministic Public-Key Encryption. IACR Cryptology ePrint Archive 2012: 47 (2012) - 2011
- [j20]Iftach Haitner, Danny Harnik, Omer Reingold:
On the Power of the Randomized Iterate. SIAM J. Comput. 40(6): 1486-1528 (2011) - [j19]Kai-Min Chung, Omer Reingold, Salil P. Vadhan:
S-T connectivity on digraphs with a known stationary distribution. ACM Trans. Algorithms 7(3): 30:1-30:21 (2011) - [c53]L. Elisa Celis, Omer Reingold, Gil Segev, Udi Wieder:
Balls and Bins: Smaller Hash Families and Faster Evaluation. FOCS 2011: 599-608 - [c52]Moshe Babaioff, Liad Blumrosen, Nicolas S. Lambert, Omer Reingold:
Only valuable experts can be valued. EC 2011: 221-222 - [c51]Parikshit Gopalan, Raghu Meka, Omer Reingold, David Zuckerman:
Pseudorandom generators for combinatorial shapes. STOC 2011: 253-262 - [i30]Cynthia Dwork, Moritz Hardt, Toniann Pitassi, Omer Reingold, Richard S. Zemel:
Fairness Through Awareness. CoRR abs/1104.3913 (2011) - [i29]L. Elisa Celis, Omer Reingold, Gil Segev, Udi Wieder:
Balls and Bins: Smaller Hash Families and Faster Evaluation. Electronic Colloquium on Computational Complexity (ECCC) 18: 68 (2011) - [i28]Andrew McGregor, Ilya Mironov, Toniann Pitassi, Omer Reingold, Kunal Talwar, Salil P. Vadhan:
The Limits of Two-Party Differential Privacy. Electronic Colloquium on Computational Complexity (ECCC) 18: 106 (2011) - 2010
- [j18]Ronen Gradwohl, Omer Reingold:
Partial exposure in large games. Games and Economic Behavior 68(2): 602-613 (2010) - [c50]Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee:
Universal One-Way Hash Functions via Inaccessible Entropy. EUROCRYPT 2010: 616-637 - [c49]Andrew McGregor, Ilya Mironov, Toniann Pitassi, Omer Reingold, Kunal Talwar, Salil P. Vadhan:
The Limits of Two-Party Differential Privacy. FOCS 2010: 81-90 - [c48]Iftach Haitner, Omer Reingold, Salil P. Vadhan:
Efficiency improvements in constructing pseudorandom generators from one-way functions. STOC 2010: 437-446 - [i27]Iftach Haitner, Omer Reingold, Salil P. Vadhan:
Efficiency Improvements in Constructing Pseudorandom Generators from One-way Functions. Electronic Colloquium on Computational Complexity (ECCC) 17: 89 (2010) - [i26]Parikshit Gopalan, Raghu Meka, Omer Reingold, David Zuckerman:
Pseudorandom Generators for Combinatorial Shapes. Electronic Colloquium on Computational Complexity (ECCC) 17: 176 (2010) - [i25]Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee:
Universal One-Way Hash Functions via Inaccessible Entropy. IACR Cryptology ePrint Archive 2010: 120 (2010)
2000 – 2009
- 2009
- [j17]Eyal Kaplan, Moni Naor, Omer Reingold:
Derandomized Constructions of k-Wise (Almost) Independent Permutations. Algorithmica 55(1): 113-133 (2009) - [j16]Ronen Gradwohl, Omer Reingold, Ariel Yadin, Amir Yehudayoff:
Players' Effects Under Limited Independence. Math. Oper. Res. 34(4): 971-980 (2009) - [j15]Iftach Haitner, Minh-Huyen Nguyen, Shien Jin Ong, Omer Reingold, Salil P. Vadhan:
Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function. SIAM J. Comput. 39(3): 1153-1218 (2009) - [c47]
- [c46]Shachar Lovett, Omer Reingold, Luca Trevisan, Salil P. Vadhan:
Pseudorandom Bit Generators That Fool Modular Sums. APPROX-RANDOM 2009: 615-630 - [c45]Ilya Mironov, Omkant Pandey, Omer Reingold, Salil P. Vadhan:
Computational Differential Privacy. CRYPTO 2009: 126-142 - [c44]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 - [c43]Iftach Haitner, Omer Reingold, Salil P. Vadhan, Hoeteck Wee:
Inaccessible entropy. STOC 2009: 611-620 - [e2]Omer Reingold:
Theory of Cryptography, 6th Theory of Cryptography Conference, TCC 2009, San Francisco, CA, USA, March 15-17, 2009. Proceedings. Lecture Notes in Computer Science 5444, Springer 2009, ISBN 978-3-642-00456-8 [contents] - [i24]Iftach Haitner, Omer Reingold, Salil P. Vadhan, Hoeteck Wee:
Inaccessible Entropy. Electronic Colloquium on Computational Complexity (ECCC) 16: 45 (2009) - 2008
- [j14]
- [c42]Omer Reingold, Luca Trevisan, Madhur Tulsiani, Salil P. Vadhan:
Dense Subsets of Pseudorandom Sets. FOCS 2008: 76-85 - [c41]
- [i23]Omer Reingold, Luca Trevisan, Madhur Tulsiani, Salil P. Vadhan:
Dense Subsets of Pseudorandom Sets. Electronic Colloquium on Computational Complexity (ECCC) 15(045) (2008) - 2007
- [c40]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 - [c39]Iftach Haitner, Omer Reingold:
A New Interactive Hashing Theorem. IEEE Conference on Computational Complexity 2007: 319-332 - [c38]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 - [c37]Iftach Haitner, Omer Reingold:
Statistically-hiding commitment from any one-way function. STOC 2007: 1-10 - [e1]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. Lecture Notes in Computer Science 4627, Springer 2007, ISBN 978-3-540-74207-4 [contents] - [i22]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) - [i21]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) - [i20]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. IACR Cryptology ePrint Archive 2007: 145 (2007) - 2006
- [j13]Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen:
Completeness in Two-Party Secure Computation: A Computational View. J. Cryptology 19(4): 521-552 (2006) - [j12]Omer Reingold, Ronen Shaltiel, Avi Wigderson:
Extracting Randomness via Repeated Condensing. SIAM J. Comput. 35(5): 1185-1209 (2006) - [j11]Irit Dinur, Omer Reingold:
Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem. SIAM J. Comput. 36(4): 975-1024 (2006) - [c36]Iftach Haitner, Danny Harnik, Omer Reingold:
On the Power of the Randomized Iterate. CRYPTO 2006: 22-40 - [c35]Iftach Haitner, Danny Harnik, Omer Reingold:
Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions. ICALP (2) 2006: 228-239 - [c34]Omer Reingold, Luca Trevisan, Salil P. Vadhan:
Pseudorandom walks on regular digraphs and the RL vs. L problem. STOC 2006: 457-466 - [i19]Eyal Kaplan, Moni Naor, Omer Reingold:
Derandomized Constructions of k-Wise (Almost) Independent Permutations. Electronic Colloquium on Computational Complexity (ECCC)(002) (2006) - [i18]Iftach Haitner, Omer Reingold:
A New Interactive Hashing Theorem. Electronic Colloquium on Computational Complexity (ECCC) 13(096) (2006) - [i17]Iftach Haitner, Omer Reingold:
Statistically-Hiding Commitment from Any One-Way Function. IACR Cryptology ePrint Archive 2006: 436 (2006) - 2005
- [j10]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) - [c33]Ronen Gradwohl, Guy Kindler, Omer Reingold, Amnon Ta-Shma:
On the Error Parameter of Dispersers. APPROX-RANDOM 2005: 294-305 - [c32]Eyal Kaplan, Moni Naor, Omer Reingold:
Derandomized Constructions of k-Wise (Almost) Independent Permutations. APPROX-RANDOM 2005: 354-365 - [c31]Danny Harnik, Joe Kilian, Moni Naor, Omer Reingold, Alon Rosen:
On Robust Combiners for Oblivious Transfer and Other Primitives. EUROCRYPT 2005: 96-113 - [c30]
- [c29]Michael J. Freedman, Yuval Ishai, Benny Pinkas, Omer Reingold:
Keyword Search and Oblivious Pseudorandom Functions. TCC 2005: 303-324 - [i16]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) - [i15]Ronen Gradwohl, Guy Kindler, Omer Reingold, Amnon Ta-Shma:
On the Error Parameter of Dispersers. Electronic Colloquium on Computational Complexity (ECCC)(061) (2005) - [i14]Iftach Haitner, Danny Harnik, Omer Reingold:
On the Power of the Randomized Iterate. Electronic Colloquium on Computational Complexity (ECCC)(135) (2005) - 2004
- [j9]Moni Naor, Omer Reingold:
Number-theoretic constructions of efficient pseudo-random functions. J. ACM 51(2): 231-262 (2004) - [j8]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) - [c28]Cynthia Dwork, Moni Naor, Omer Reingold:
Immunizing Encryption Schemes from Decryption Errors. EUROCRYPT 2004: 342-360 - [c27]Irit Dinur, Omer Reingold:
Assignment Testers: Towards a Combinatorial Proof of the PCP-Theorem. FOCS 2004: 155-164 - [c26]Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen:
Completeness in two-party secure computation: a computational view. STOC 2004: 252-261 - [c25]Omer Reingold, Luca Trevisan, Salil P. Vadhan:
Notions of Reducibility between Cryptographic Primitives. TCC 2004: 1-20 - [i13]Omer Reingold:
Undirected ST-Connectivity in Log-Space. Electronic Colloquium on Computational Complexity (ECCC)(094) (2004) - 2003
- [j7]Cynthia Dwork, Moni Naor, Omer Reingold, Larry J. Stockmeyer:
Magic Functions. J. ACM 50(6): 852-921 (2003) - [c24]Chi-Jen Lu, Omer Reingold, Salil P. Vadhan, Avi Wigderson:
Extractors: optimal up to constant factors. STOC 2003: 602-611 - [i12]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) - 2002
- [j6]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) - [j5]Moni Naor, Omer Reingold:
Constructing Pseudo-Random Permutations with a Prescribed Structure. J. Cryptology 15(2): 97-102 (2002) - [j4]Moni Naor, Omer Reingold, Alon Rosen:
Pseudorandom Functions and Factoring. SIAM J. Comput. 31(5): 1383-1404 (2002) - [c23]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 - [c22]Michael R. Capalbo, Omer Reingold, Salil P. Vadhan, Avi Wigderson:
Randomness Conductors and Constant-Degree Lossless Expanders. IEEE Conference on Computational Complexity 2002: 15 - [c21]Ziv Bar-Yossef, Luca Trevisan, Omer Reingold, Ronen Shaltiel:
Streaming Computation of Combinatorial Objects. IEEE Conference on Computational Complexity 2002: 165-174 - [c20]Michael R. Capalbo, Omer Reingold, Salil P. Vadhan, Avi Wigderson:
Randomness conductors and constant-degree lossless expanders. STOC 2002: 659-668 - [c19]Michael Merritt, Omer Reingold, Gadi Taubenfeld, Rebecca N. Wright:
Tight Bounds for Shared Memory Systems Accessed by Byzantine Processes. DISC 2002: 222-236 - 2001
- [c18]William Aiello, Yuval Ishai, Omer Reingold:
Priced Oblivious Transfer: How to Sell Digital Goods. EUROCRYPT 2001: 119-135 - [c17]Yael Gertner, Tal Malkin, Omer Reingold:
On the Impossibility of Basing Trapdoor Functions on Trapdoor Predicates. FOCS 2001: 126-135 - [c16]
- [c15]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 - [i11]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) - [i10]Moni Naor, Omer Reingold, Alon Rosen:
Pseudo-Random Functions and Factoring. Electronic Colloquium on Computational Complexity (ECCC) 8(064) (2001) - [i9]Moni Naor, Omer Reingold, Alon Rosen:
Pseudo-Random Functions and Factoring. IACR Cryptology ePrint Archive 2001: 75 (2001) - 2000
- [c14]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 - [c13]Omer Reingold, Ronen Shaltiel, Avi Wigderson:
Extracting Randomness via Repeated Condensing. FOCS 2000: 22-31 - [c12]