☰

Moni Naor - Publications

Affiliations: 
Computer Science and Applied Mathematics Weizmann Institute of Science, Rehovot, Israel 
Area:
Computer Science
Tree Info Similar researchers PubMed Report error

71 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 Komargodski I, Naor M, Yogev E. White-Box vs. Black-Box Complexity of Search Problems: Ramsey and Graph Property Testing Journal of the Acm. 66: 34. DOI: 10.1145/3341106  0.349
2018 Komargodski I, Naor M, Yogev E. How to Share a Secret, Infinitely Ieee Transactions On Information Theory. 64: 4179-4190. DOI: 10.1109/Tit.2017.2779121  0.327
2016 HubáăźEk P, Naor M, Ullman J. When Can Limited Randomness Be Used in Repeated Games Theory of Computing Systems \/ Mathematical Systems Theory. 59: 722-746. DOI: 10.1007/S00224-016-9690-4  0.32
2015 Naor M, Yogev E. Bloom filters in adversarial environments Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9216: 565-584. DOI: 10.1145/3306193  0.38
2015 Naor M, Yogev E. Tight Bounds for Sliding Bloom Filters Algorithmica. 73: 652-672. DOI: 10.1007/S00453-015-0007-9  0.32
2015 Moran T, Naor M, Segev G. An Optimally Fair Coin Toss Journal of Cryptology. DOI: 10.1007/S00145-015-9199-Z  0.634
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.586
2015 Naor M, Ziv A. Primary-secondary-resolver membership proof systems Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9015: 199-228.  0.307
2014 Brakerski Z, Kalai YT, Naor M. Fast interactive coding against adversarial noise Journal of the Acm. 61. DOI: 10.1145/2661628  0.313
2014 Komargodski I, Naor M, Yogev E. Secret-sharing for NP Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8874: 254-273. DOI: 10.1007/S00145-015-9226-0  0.389
2013 Berman I, Haitner I, Komargodski I, Naor M. Hardness preserving reductions via cuckoo hashing Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7785: 40-59. DOI: 10.1007/S00145-018-9293-0  0.714
2012 Naor M, Segev G. Public-key cryptosystems resilient to key leakage Siam Journal On Computing. 41: 772-814. DOI: 10.1137/100813464  0.597
2011 Mironov I, Naor M, Segev G. Sketching in adversarial environments Siam Journal On Computing. 40: 1845-1870. DOI: 10.1137/080733772  0.652
2010 Moran T, Naor M. Split-ballot voting: Everlasting privacy with distributed trust Acm Transactions On Information and System Security. 13. DOI: 10.1145/1698750.1698756  0.397
2010 Harnik D, Naor M. On the Compressibility of $\mathcal{NP}$ Instances and Cryptographic Applications Siam Journal On Computing. 39: 1667-1713. DOI: 10.1137/060668092  0.319
2010 Arbitman Y, Naor M, Segev G. Backyard cuckoo hashing: Constant worst-case operations with a succinct representation Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 787-796. DOI: 10.1109/FOCS.2010.80  0.507
2010 Alwen J, Dodis Y, Naor M, Segev G, Walfish S, Wichs D. Public-key encryption in the bounded-retrieval model Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6110: 113-134. DOI: 10.1007/978-3-642-13190-5_6  0.561
2009 Halprin R, Naor M. Games for extracting randomness Soups 2009 - Proceedings of the 5th Symposium On Usable Privacy and Security. DOI: 10.1145/1869086.1869101  0.318
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.561
2009 Naor M, Rothblum GN. The complexity of online memory checking Journal of the Acm. 56. DOI: 10.1145/1462153.1462155  0.392
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.554
2009 Bellare M, Brakerski Z, Naor M, Ristenpart T, Segev G, Shacham H, Yilek S. Hedged public-key encryption: How to protect against bad randomness Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5912: 232-249. DOI: 10.1007/978-3-642-10366-7_14  0.605
2009 Arbitman Y, Naor M, Segev G. De-amortized cuckoo hashing: Provable worst-case performance and experimental results Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5555: 107-118. DOI: 10.1007/978-3-642-02927-1_11  0.608
2008 Naor M, Segev G, Smith A. Tight bounds for unconditional authentication protocols in the manual channel and shared key models Ieee Transactions On Information Theory. 54: 2408-2425. DOI: 10.1109/Tit.2008.921691  0.632
2008 Naor M, Segev G, Wieder U. History-independent cuckoo hashing Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5126: 631-642. DOI: 10.1007/978-3-540-70583-3_51  0.586
2007 Moran T, Naor M, Segev G. Deterministic history-independent strategies for storing information on write-once memories Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4596: 303-315. DOI: 10.4086/Toc.2009.V005A002  0.557
2007 Naor M, Wieder U. Novel architectures for P2P applications: The continuous-discrete approach Acm Transactions On Algorithms. 3. DOI: 10.1145/1273340.1273350  0.331
2007 Dwork C, Naor M. Zaps and their applications Siam Journal On Computing. 36: 1513-1543. DOI: 10.1137/S0097539703426817  0.392
2007 Gradwohl R, Naor M, Pinkas B, Rothblum GN. Cryptographic and physical zero-knowledge proof systems for solutions of Sudoku puzzles Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4475: 166-182. DOI: 10.1007/S00224-008-9119-9  0.377
2006 Naor M, Pinkas B. Oblivious polynomial evaluation Siam Journal On Computing. 35: 1254-1281. DOI: 10.1137/S0097539704383633  0.354
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.76
2006 Harnik D, Naor M. On everlasting security in the hybrid bounded storage model Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4052: 192-203. DOI: 10.1007/11787006_17  0.306
2005 Moran T, Naor M. Basing cryptographic protocols on tamper-Evident seals Lecture Notes in Computer Science. 3580: 285-297. DOI: 10.1016/J.Tcs.2009.10.023  0.363
2005 Naor M, Pinkas B. Computationally secure oblivious transfer Journal of Cryptology. 18: 1-35. DOI: 10.1007/S00145-004-0102-6  0.361
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.545
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.695
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.617
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.601
2003 Dwork C, Naor M, Reingold O, Stockmeyer L. Magic functions Journal of the Acm. 50: 852-921. DOI: 10.1145/950620.950623  0.637
2002 Naor M, Reingold O, Rosen A. Pseudorandom functions and factoring Siam Journal On Computing. 31: 1383-1404. DOI: 10.1137/S0097539701389257  0.757
2001 Naor M, Pinkas B. Efficient trace and revoke schemes Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1962: 1-20. DOI: 10.1007/S10207-010-0121-2  0.344
2001 Naor M, Ruah S. On the decisional complexity of problems over the reals Information and Computation. 167: 27-45. DOI: 10.1006/Inco.2000.3012  0.351
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.573
2000 Dolev D, Dwork C, Naor M. Nonmalleable cryptography Siam Journal On Computing. 30: 391-437. DOI: 10.1137/S0097539795291562  0.389
2000 Naor M, Nissim K. Certificate revocation and certificate update Ieee Journal On Selected Areas in Communications. 18: 561-570. DOI: 10.1109/49.839932  0.302
2000 Chor B, Fiat A, Naor M, Pinkas B. Tracing traitors Ieee Transactions On Information Theory. 46: 893-910. DOI: 10.1109/18.841169  0.348
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.652
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.685
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.638
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.675
1998 Naor M, Wool A. Access control and signatures via quorum secret sharing Ieee Transactions On Parallel and Distributed Systems. 9: 909-922. DOI: 10.1109/71.722223  0.374
1998 Naor M. Perfect zero-knowledge arguments for NP using any one-way permutation Journal of Cryptology. 11: 87-108. DOI: 10.1007/S001459900037  0.392
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.663
1997 Canetti R, Dwork C, Naor M, Ostrovsky R. Deniable encryption Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1294: 90-104. DOI: 10.1007/BFb0052229  0.331
1996 Alon N, Naor M. Derandomization, Witnesses for Boolean Matrix Multiplication and Construction of Perfect Hash Functions Algorithmica (New York). 16: 434-449. DOI: 10.1007/Bf01940874  0.347
1996 Impagliazzo R, Naor M. Efficient cryptographic schemes provably as secure as subset sum Journal of Cryptology. 9: 199-216. DOI: 10.1007/Bf00189260  0.697
1995 Naor M, Roth RM. Optimal File Sharing in Distributed Networks Siam Journal On Computing. 24: 158-183. DOI: 10.1137/S0097539792237462  0.313
1994 Blum M, Evans W, Gemmell P, Kannan S, Naor M. Checking the correctness of memories Algorithmica. 12: 225-244. DOI: 10.1007/Bf01185212  0.601
1993 Naor J(, Naor M. Small-bias probability spaces: efficient constructions and applications Siam Journal On Computing. 22: 838-856. DOI: 10.1137/0222053  0.347
1993 Alon N, Naor M. Coin-flipping games immune against linear-sized coalitions Siam Journal On Computing. 22: 403-417. DOI: 10.1137/0222030  0.312
1993 Fiat A, Naor M. Implicit O (1) probe search Siam Journal On Computing. 22: 1-10. DOI: 10.1137/0222001  0.323
1993 Naor M, Orlitsky A, Shor P. Three Results on Interactive Communication Ieee Transactions On Information Theory. 39: 1608-1615. DOI: 10.1109/18.259644  0.343
1993 Feldman D, Impagliazzo R, Naor M, Nisan N, Rudich S, Shamir A. On Dice and Coins: Models of Computation for Random Generation Information and Computation. 104: 159-174. DOI: 10.1006/Inco.1993.1028  0.71
1992 Irani S, Naor M, Rubinfeld R. On the time and space complexity of computation using write-once memory or is pen really much worse than pencil? Mathematical Systems Theory. 25: 141-159. DOI: 10.1007/Bf02835833  0.606
1991 Naor M. A Lower Bound on Probabilistic Algorithms for Distributive Ring Coloring Siam Journal On Discrete Mathematics. 4: 409-412. DOI: 10.1137/0404036  0.307
1991 Fiat A, Ian Munro J, Naor M, Schäffer AA, Schmidt JP, Siegel A. An implicit data structure for searching a multikey table in logarithmic time Journal of Computer and System Sciences. 43: 406-424. DOI: 10.1016/0022-0000(91)90022-W  0.338
1991 Naor M. Bit commitment using pseudorandomness Journal of Cryptology. 4: 151-158. DOI: 10.1007/Bf00196774  0.304
1990 Bruck J, Naor M. The Hardness of Decoding Linear Codes with Preprocessing Ieee Transactions On Information Theory. 36: 381-385. DOI: 10.1109/18.52484  0.313
1990 Bar-Noy A, Naor J, Naor M. One-bit algorithms Distributed Computing. 4: 3-8. DOI: 10.1007/Bf01783661  0.311
1988 Fiat A, Naor M, Schmidt JP, Siegel A. Non-oblivious hashing Proceedings of the Annual Acm Symposium On Theory of Computing. 367-376. DOI: 10.1145/146585.146591  0.347
1988 Kannan S, Naor M, Rudich S. Implicit representation of graphs Proceedings of the Annual Acm Symposium On Theory of Computing. 334-343. DOI: 10.1137/0405049  0.562
Show low-probability matches.