Omer Reingold - Publications

Affiliations: 
APM Applied Mathematics Weizmann Institute of Science, Rehovot, Israel 
Area:
Applied Mathematics, Computer Science, Statistics

43 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2019 Reingold O, Rothblum GN, Rothblum RD. Constant-Round Interactive Proofs for Delegating Computation Siam Journal On Computing. DOI: 10.1137/16M1096773  0.362
2018 Reingold O, Rothblum GN, Rothblum RD. Efficient batch verification for UP Electronic Colloquium On Computational Complexity. 25: 22. DOI: 10.4230/Lipics.Ccc.2018.22  0.318
2018 Mironov I, Pandey O, Reingold O, Segev G. Incremental Deterministic Public-Key Encryption Journal of Cryptology. 31: 134-161. DOI: 10.1007/S00145-017-9252-1  0.672
2016 Reingold O, Vardi S. New techniques and tighter bounds for local computation algorithms Journal of Computer and System Sciences. 82: 1180-1200. DOI: 10.1016/J.Jcss.2016.05.007  0.355
2015 Haitner I, Hoch JJ, Reingold O, Segev G. Finding collisions in interactive protocols - Tight lower bounds on the round and communication complexities of statistically hiding commitments Siam Journal On Computing. 44: 193-242. DOI: 10.1137/130938438  0.768
2015 Dwork C, Naor M, Reingold O, Rothblum GN. Pure differential privacy for rectangle queries via private partitions Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9453: 735-751. DOI: 10.1007/978-3-662-48800-3_30  0.515
2014 Haitner I, Reingold O. A new interactive hashing theorem Journal of Cryptology. 27: 109-138. DOI: 10.1007/S00145-012-9139-0  0.734
2013 Celis LE, Reingold O, Segev G, Wieder U. Balls and bins: Smaller hash families and faster evaluation Siam Journal On Computing. 42: 1030-1050. DOI: 10.1137/120871626  0.593
2013 Gopalan P, Meka R, Reingold O, Zuckerman D. Pseudorandom generators for combinatorial shapes Siam Journal On Computing. 42: 1051-1076. DOI: 10.1137/110854990  0.345
2013 Haitner I, Reingold O, Vadhan S. Efficiency improvements in constructing pseudorandom generators from one-way functions Siam Journal On Computing. 42: 1405-1430. DOI: 10.1137/100814421  0.758
2013 Gopalan P, Meka R, Reingold O. DNF sparsification and a faster deterministic counting algorithm Computational Complexity. 22: 275-310. DOI: 10.1007/S00037-013-0068-6  0.343
2012 Mironov I, Pandey O, Reingold O, Segev G. Incremental deterministic public-key encryption Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7237: 628-644. DOI: 10.1007/978-3-642-29011-4_37  0.544
2011 Haitner I, Harnik D, Reingold O. On the power of the randomized iterate Siam Journal On Computing. 40: 1486-1528. DOI: 10.1137/080721820  0.762
2010 Haitner I, Holenstein T, Reingold O, Vadhan S, Wee H. Universal one-way hash functions via inaccessible entropy Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6110: 616-637. DOI: 10.1007/978-3-642-13190-5_31  0.738
2009 Gradwohl R, Reingold O, Yadin A, Yehudayoff A. Players' effects under limited independence Mathematics of Operations Research. 34: 971-980. DOI: 10.1287/Moor.1090.0413  0.385
2009 Haitner I, Vadhan S, Reingold O, Wee H. Inaccessible entropy Proceedings of the Annual Acm Symposium On Theory of Computing. 611-620. DOI: 10.1145/1536414.1536497  0.748
2009 Dwork C, Naor M, Reingold O, Rothblum GN, Vadhan S. On the complexity of differentially private data release :Efficient algorithms and hardness results Proceedings of the Annual Acm Symposium On Theory of Computing. 381-390. DOI: 10.1145/1536414.1536467  0.485
2009 Haitner I, Nguyen M, Ong SJ, Reingold O, Vadhan S. Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function Siam Journal On Computing. 39: 1153-1218. DOI: 10.1137/080725404  0.746
2009 Kaplan E, Naor M, Reingold O. Derandomized constructions of k-wise (almost) independent permutations Algorithmica (New York). 55: 113-133. DOI: 10.1007/s00453-008-9267-y  0.483
2009 Lovett S, Reingold O, Trevisan L, Vadhan S. Pseudorandom bit generators that fool modular sums Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5687: 615-630. DOI: 10.1007/978-3-642-03685-9_46  0.573
2009 Mironov I, Pandey O, Reingold O, Vadhan S. Computational differential privacy Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5677: 126-142. DOI: 10.1007/978-3-642-03356-8_8  0.308
2008 Reingold O. Undirected connectivity in log-space Journal of the Acm. 55. DOI: 10.1145/1391289.1391291  0.316
2007 Haitner I, Reingold O. Statistically-hiding commitment from any one-way function Proceedings of the Annual Acm Symposium On Theory of Computing. 1-10. DOI: 10.1145/1250790.1250792  0.748
2007 Haitner I, Hoch JJ, Reingold O, Segev G. Finding collisions in interactive protocols - A tight lower bound on the round complexity of statistically-hiding commitments Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 669-679. DOI: 10.1109/FOCS.2007.4389535  0.771
2006 Dinur I, Reingold O. Assignment testers: Towards a combinatorial proof of the PCP theorem Siam Journal On Computing. 36: 975-1024. DOI: 10.1137/S0097539705446962  0.394
2006 Reingold O, Shaltiel R, Wigderson A. Extracting randomness via repeated condensing Siam Journal On Computing. 35: 1185-1209. DOI: 10.1137/S0097539703431032  0.395
2006 Harnik D, Naor M, Reingold O, Rosen A. Completeness in two-party secure computation: A computational view Journal of Cryptology. 19: 521-552. DOI: 10.1007/S00145-006-0346-4  0.778
2006 Haitner I, Harnik D, Reingold O. Efficient pseudorandom generators from exponentially hard one-way functions Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4052: 228-239. DOI: 10.1007/11787006_20  0.752
2005 Harnik D, Kilian J, Naor M, Reingold O, Rosen A. On robust combiners for Oblivious Transfer and other primitives Lecture Notes in Computer Science. 3494: 96-113.  0.477
2004 Aiello W, Bellovin SM, Blaze M, Canetti R, Ioannidis J, Keromytis AD, Reingold O. Just fast keying: Key agreement in a hostile internet Acm Transactions On Information and System Security. 7: 242-273. DOI: 10.1145/996943.996946  0.394
2004 Naor M, Reingold O. Number-theoretic constructions of efficient pseudo-random functions Journal of the Acm. 51: 231-262. DOI: 10.1145/972639.972643  0.693
2004 Harnik D, Naor M, Reingold O, Rosen A. Completeness in two-party secure computation - A computational view Conference Proceedings of the Annual Acm Symposium On Theory of Computing. 252-261.  0.569
2004 Dwork C, Naor M, Reingold O. Immunizing encryption schemes from decryption errors Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3027: 342-360.  0.546
2003 Dwork C, Naor M, Reingold O, Stockmeyer L. Magic functions Journal of the Acm. 50: 852-921. DOI: 10.1145/950620.950623  0.587
2002 Naor M, Reingold O, Rosen A. Pseudorandom functions and factoring Siam Journal On Computing. 31: 1383-1404. DOI: 10.1137/S0097539701389257  0.766
2001 Gertner Y, Malkin T, Reingold O. On the impossibility of basing trapdoor functions on trapdoor predicates Annual Symposium On Foundations of Computer Science - Proceedings. 126-135.  0.337
2001 Naor M, Reingold O. Constructing pseudo-random permutations with a prescribed structure Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 458-459.  0.503
2000 Naor M, Reingold O, Rosen A. Pseudo-random functions and factoring Conference Proceedings of the Annual Acm Symposium On Theory of Computing. 11-20.  0.616
1999 Biham E, Boneh D, Reingold O. Breaking generalized Diffie-Hellman modulo a composite is no easier than factoring Information Processing Letters. 70: 83-87. DOI: 10.1016/S0020-0190(99)00047-2  0.505
1999 Naor M, Reingold O. On the construction of pseudorandom permutations: luby-rackoff revisited Journal of Cryptology. 12: 29-66. DOI: 10.1007/Pl00003817  0.677
1999 Naor M, Pinkas B, Reingold O. Distributed pseudo-random functions and KDCs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1592: 327-346. DOI: 10.1007/3-540-48910-X_23  0.612
1999 Naor M, Reingold O. Synthesizers and their application to the parallel construction of pseudo-random functions Journal of Computer and System Sciences. 58: 336-375. DOI: 10.1006/jcss.1998.1618  0.664
1998 Naor M, Reingold O. From unpredictability to indistinguishability: A simple construction of pseudo-random functions from MACs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1462: 267-282. DOI: 10.1007/BFb0055734  0.641
Show low-probability matches.