Moni Naor

Zvika Brakerski, Moni Naor: Fast Algorithms for Interactive Coding. SODA 2013: 443-456

Itay Berman, Iftach Haitner, Ilan Komargodski, Moni Naor: Hardness Preserving Reductions via Cuckoo Hashing. TCC 2013: 40-59

Moni Naor, Eylon Yogev: Sliding Bloom Filters. CoRR abs/1304.5872 (2013)

Zvika Brakerski, Moni Naor: Fast Algorithms for Interactive Coding. Electronic Colloquium on Computational Complexity (ECCC) 20: 14 (2013)

Moni Naor, Gil Segev: Public-Key Cryptosystems Resilient to Key Leakage. SIAM J. Comput. 41(4): 772-814 (2012)

Cynthia Dwork, Moni Naor, Salil P. Vadhan: The Privacy of the Analyst and the Power of the State. FOCS 2012: 400-409

Itay Berman, Iftach Haitner, Ilan Komargodski, Moni Naor: Hardness Preserving Reductions via Cuckoo Hashing. Electronic Colloquium on Computational Complexity (ECCC) 19: 182 (2012)

Mihir Bellare, Zvika Brakerski, Moni Naor, Thomas Ristenpart, Gil Segev, Hovav Shacham, Scott Yilek: Hedged Public-key Encryption: How to Protect against Bad Randomness. IACR Cryptology ePrint Archive 2012: 220 (2012)

Itay Berman, Iftach Haitner, Ilan Komargodski, Moni Naor: Hardness Preserving Reductions via Cuckoo Hashing. IACR Cryptology ePrint Archive 2012: 722 (2012)

Ilya Mironov, Moni Naor, Gil Segev: Sketching in Adversarial Environments. SIAM J. Comput. 40(6): 1845-1870 (2011)

Ran Halprin, Moni Naor: Games for extracting randomness. ACM Crossroads 17(2): 44-48 (2010)

Moni Naor, Benny Pinkas: Efficient trace and revoke schemes. Int. J. Inf. Sec. 9(6): 411-424 (2010)

Danny Harnik, Moni Naor: On the Compressibility of NP Instances and Cryptographic Applications. SIAM J. Comput. 39(5): 1667-1713 (2010)

Tal Moran, Moni Naor: Basing cryptographic protocols on tamper-evident seals. Theor. Comput. Sci. 411(10): 1283-1310 (2010)

Tal Moran, Moni Naor: Split-ballot voting: Everlasting privacy with distributed trust. ACM Trans. Inf. Syst. Secur. 13(2) (2010)

Moni Naor: The privacy of tracing traitors. Digital Rights Management Workshop 2010: 1-2

Joël Alwen, Yevgeniy Dodis, Moni Naor, Gil Segev, Shabsi Walfish, Daniel Wichs: Public-Key Encryption in the Bounded-Retrieval Model. EUROCRYPT 2010: 113-134

Yuriy Arbitman, Moni Naor, Gil Segev: Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation. FOCS 2010: 787-796

Cynthia Dwork, Moni Naor, Toniann Pitassi, Guy N. Rothblum, Sergey Yekhanin: Pan-Private Streaming Algorithms. ICS 2010: 66-80

Cynthia Dwork, Moni Naor, Toniann Pitassi, Guy N. Rothblum: Differential privacy under continual observation. STOC 2010: 715-724

Eyal Kaplan, Moni Naor, Omer Reingold: Derandomized Constructions of k-Wise (Almost) Independent Permutations. Algorithmica 55(1): 113-133 (2009)

Moni Naor, Guy N. Rothblum: The complexity of online memory checking. J. ACM 56(1) (2009)

Ronen Gradwohl, Moni Naor, Benny Pinkas, Guy N. Rothblum: Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles. Theory Comput. Syst. 44(2): 245-268 (2009)

Tal Moran, Moni Naor, Gil Segev: Deterministic History-Independent Strategies for Storing Information on Write-Once Memories. Theory of Computing 5(1): 43-67 (2009)

Mihir Bellare, Zvika Brakerski, Moni Naor, Thomas Ristenpart, Gil Segev, Hovav Shacham, Scott Yilek: Hedged Public-Key Encryption: How to Protect against Bad Randomness. ASIACRYPT 2009: 232-249

Moni Naor, Gil Segev: Public-Key Cryptosystems Resilient to Key Leakage. CRYPTO 2009: 18-35

Yuriy Arbitman, Moni Naor, Gil Segev: De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results. ICALP (1) 2009: 107-118

Ran Halprin, Moni Naor: Games for extracting randomness. SOUPS 2009

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

Tal Moran, Moni Naor, Gil Segev: An Optimally Fair Coin Toss. TCC 2009: 1-18

Cynthia Dwork, Moni Naor, Guy N. Rothblum, Vinod Vaikuntanathan: How Efficient Can Memory Checking Be?. TCC 2009: 503-520

Yuriy Arbitman, Moni Naor, Gil Segev: De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results. CoRR abs/0903.0391 (2009)

Yuriy Arbitman, Moni Naor, Gil Segev: Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation. CoRR abs/0912.5424 (2009)

Moni Naor, Gil Segev: Public-Key Cryptosystems Resilient to Key Leakage. IACR Cryptology ePrint Archive 2009: 105 (2009)

Tal Moran, Moni Naor, Gil Segev: An Optimally Fair Coin Toss. IACR Cryptology ePrint Archive 2009: 214 (2009)

Joël Alwen, Yevgeniy Dodis, Moni Naor, Gil Segev, Shabsi Walfish, Daniel Wichs: Public-Key Encryption in the Bounded-Retrieval Model. IACR Cryptology ePrint Archive 2009: 512 (2009)

Moni Naor, Gil Segev, Adam Smith: Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models. IEEE Transactions on Information Theory 54(6): 2408-2425 (2008)

Dan Boneh, Moni Naor: Traitor tracing with constant size ciphertext. ACM Conference on Computer and Communications Security 2008: 501-510

Moni Naor, Gil Segev, Udi Wieder: History-Independent Cuckoo Hashing. ICALP (2) 2008: 631-642

Moshe Babaioff, Liad Blumrosen, Moni Naor, Michael Schapira: Informational overhead of incentive compatibility. ACM Conference on Electronic Commerce 2008: 88-97

Gillat Kol, Moni Naor: Games for exchanging information. STOC 2008: 423-432

Ilya Mironov, Moni Naor, Gil Segev: Sketching in adversarial environments. STOC 2008: 651-660

Gillat Kol, Moni Naor: Cryptography and Game Theory: Designing Protocols for Exchanging Information. TCC 2008: 320-339

Moni Naor, Gil Segev, Udi Wieder: History-Independent Cuckoo Hashing. IACR Cryptology ePrint Archive 2008: 358 (2008)

Cynthia Dwork, Moni Naor: Zaps and Their Applications. SIAM J. Comput. 36(6): 1513-1543 (2007)

Moni Naor, Udi Wieder: Novel architectures for P2P applications: The continuous-discrete approach. ACM Transactions on Algorithms 3(3) (2007)

Moni Naor, Asaf Nussboim: Implementing Huge Sparse Random Graphs. APPROX-RANDOM 2007: 596-608

Tal Moran, Moni Naor: Split-ballot voting: everlasting privacy with distributed trust. ACM Conference on Computer and Communications Security 2007: 246-255

Ronen Gradwohl, Moni Naor, Benny Pinkas, Guy N. Rothblum: Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles. FUN 2007: 166-182

Tal Moran, Moni Naor, Gil Segev: Deterministic History-Independent Strategies for Storing Information on Write-Once Memories. ICALP 2007: 303-315

Moni Naor (Ed.): Advances in Cryptology - EUROCRYPT 2007, 26th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Barcelona, Spain, May 20-24, 2007, Proceedings. Lecture Notes in Computer Science 4515, Springer 2007, isbn 978-3-540-72539-8

Tal Moran, Moni Naor, Gil Segev: Deterministic History-Independent Strategies for Storing Information on Write-Once Memories. IACR Cryptology ePrint Archive 2007: 151 (2007)

Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen: Completeness in Two-Party Secure Computation: A Computational View. J. Cryptology 19(4): 521-552 (2006)

Moni Naor, Benny Pinkas: Oblivious Polynomial Evaluation. SIAM J. Comput. 35(5): 1254-1281 (2006)

Moni Naor, Gil Segev, Adam Smith: Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models. CRYPTO 2006: 214-231

Tal Moran, Moni Naor: Receipt-Free Universally-Verifiable Voting with Everlasting Privacy. CRYPTO 2006: 373-392

Tal Moran, Moni Naor: Polling with Physical Envelopes: A Rigorous Analysis of a Human-Centric Protocol. EUROCRYPT 2006: 88-108

Cynthia Dwork, Krishnaram Kenthapadi, Frank McSherry, Ilya Mironov, Moni Naor: Our Data, Ourselves: Privacy Via Distributed Noise Generation. EUROCRYPT 2006: 486-503

Danny Harnik, Moni Naor: On the Compressibility of NP Instances and Cryptographic Applications. FOCS 2006: 719-728

Danny Harnik, Moni Naor: On Everlasting Security in the Hybrid Bounded Storage Model. ICALP (2) 2006: 192-203

Moni Naor, Guy N. Rothblum: Learning to impersonate. ICML 2006: 649-656

Eyal Kaplan, Moni Naor, Omer Reingold: Derandomized Constructions of k-Wise (Almost) Independent Permutations. Electronic Colloquium on Computational Complexity (ECCC)(002) (2006)

Danny Harnik, Moni Naor: On the Compressibility of NP Instances and Cryptographic Applications. Electronic Colloquium on Computational Complexity (ECCC) 13(022) (2006)

Moni Naor, Guy N. Rothblum: The Complexity of Online Memory Checking. Electronic Colloquium on Computational Complexity (ECCC) 13(034) (2006)

Moni Naor, Guy N. Rothblum: The Complexity of Online Memory Checking. IACR Cryptology ePrint Archive 2006: 91 (2006)

Moni Naor, Gil Segev, Adam Smith: Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models. IACR Cryptology ePrint Archive 2006: 175 (2006)

Moni Naor, Udi Wieder: Scalable and dynamic quorum systems. Distributed Computing 17(4): 311-322 (2005)

Moni Naor: On fairness in the carpool problem. J. Algorithms 55(1): 93-98 (2005)

Moni Naor, Benny Pinkas: Computationally Secure Oblivious Transfer. J. Cryptology 18(1): 1-35 (2005)

Eyal Kaplan, Moni Naor, Omer Reingold: Derandomized Constructions of k-Wise (Almost) Independent Permutations. APPROX-RANDOM 2005: 354-365

Cynthia Dwork, Moni Naor, Hoeteck Wee: Pebbling and Proofs of Work. CRYPTO 2005: 37-54

Danny Harnik, Joe Kilian, Moni Naor, Omer Reingold, Alon Rosen: On Robust Combiners for Oblivious Transfer and Other Primitives. EUROCRYPT 2005: 96-113

Moni Naor, Guy N. Rothblum: The Complexity of Online Memory Checking. FOCS 2005: 573-584

Tal Moran, Moni Naor: Basing Cryptographic Protocols on Tamper-Evident Seals. ICALP 2005: 285-297

Moni Naor, Asaf Nussboim, Eran Tromer: Efficiently Constructible Huge Graphs That Preserve First Order Properties of Random Graphs. TCC 2005: 66-85

Uri Nadav, Moni Naor: The Dynamic And-Or Quorum System. DISC 2005: 472-486

Moni Naor, Omer Reingold: Number-theoretic constructions of efficient pseudo-random functions. J. ACM 51(2): 231-262 (2004)

Cynthia Dwork, Moni Naor, Amit Sahai: Concurrent zero-knowledge. J. ACM 51(6): 851-898 (2004)

Cynthia Dwork, Moni Naor, Omer Reingold: Immunizing Encryption Schemes from Decryption Errors. EUROCRYPT 2004: 342-360

Moni Naor, Udi Wieder: Know Thy Neighbor's Neighbor: Better Routing for Skip-Graphs and Small Worlds. IPTPS 2004: 269-277

Gurmeet Singh Manku, Moni Naor, Udi Wieder: Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks. STOC 2004: 54-63

Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen: Completeness in two-party secure computation: a computational view. STOC 2004: 252-261

Uri Nadav, Moni Naor: Fault-Tolerant Storage in a Dynamic Environment. DISC 2004: 390-404

Moni Naor (Ed.): Theory of Cryptography, First Theory of Cryptography Conference, TCC 2004, Cambridge, MA, USA, February 19-21, 2004, Proceedings. Lecture Notes in Computer Science 2951, Springer 2004, isbn 3-540-21000-8

Dalit Naor, Moni Naor: Protecting Cryptographic Keys: The Trace-and-Revoke Approach. IEEE Computer 36(7): 47-53 (2003)

Cynthia Dwork, Moni Naor, Omer Reingold, Larry J. Stockmeyer: Magic Functions. J. ACM 50(6): 852-921 (2003)

Ronald Fagin, Amnon Lotem, Moni Naor: Optimal aggregation algorithms for middleware. J. Comput. Syst. Sci. 66(4): 614-656 (2003)

Moni Naor: On Cryptographic Assumptions and Challenges. CRYPTO 2003: 96-109

Cynthia Dwork, Andrew Goldberg, Moni Naor: On Memory-Bound Functions for Fighting Spam. CRYPTO 2003: 426-444

Moni Naor: Moderately Hard Functions: From Complexity to Spam Fighting. FSTTCS 2003: 434-442

Moni Naor, Udi Wieder: A Simple Fault Tolerant Distributed Hash Table. IPTPS 2003: 88-97

Moni Naor, Udi Wieder: Scalable and dynamic quorum systems. PODC 2003: 114-122

Moni Naor, Udi Wieder: Novel architectures for P2P applications: the continuous-discrete approach. SPAA 2003: 50-59

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)

Moni Naor, Omer Reingold: Constructing Pseudo-Random Permutations with a Prescribed Structure. J. Cryptology 15(2): 97-102 (2002)

Moni Naor, Omer Reingold, Alon Rosen: Pseudorandom Functions and Factoring. SIAM J. Comput. 31(5): 1383-1404 (2002)

Moni Naor: Deniable Ring Authentication. CRYPTO 2002: 481-498

Dahlia Malkhi, Moni Naor, David Ratajczak: Viceroy: a scalable and dynamic emulation of the butterfly. PODC 2002: 183-192

Ronald Fagin, Amnon Lotem, Moni Naor: Optimal Aggregation Algorithms for Middleware. CoRR cs.DB/0204046 (2002)

Cynthia Dwork, Moni Naor: Zaps and Their Applications. Electronic Colloquium on Computational Complexity (ECCC)(001) (2002)

Dalit Naor, Moni Naor, Jeffery Lotspiech: Revocation and Tracing Schemes for Stateless Receivers. Electronic Colloquium on Computational Complexity (ECCC)(043) (2002)

Oded Goldreich, Yoad Lustig, Moni Naor: On Chosen Ciphertext Security of Multiple Encryptions. IACR Cryptology ePrint Archive 2002: 89 (2002)

Moni Naor, Sitvanit Ruah: On the Decisional Complexity of Problems Over the Reals. Inf. Comput. 167(1): 27-45 (2001)

Dalit Naor, Moni Naor, Jeffery Lotspiech: Revocation and Tracing Schemes for Stateless Receivers. CRYPTO 2001: 41-62

Ronald Fagin, Amnon Lotem, Moni Naor: Optimal Aggregation Algorithms for Middleware. PODS 2001

Moni Naor, Benny Pinkas: Efficient oblivious transfer protocols. SODA 2001: 448-457

Moni Naor, Omer Reingold: Constructing pseudo-random permutations with a prescribed structure. SODA 2001: 458-459

Moni Naor, Vanessa Teague: Anti-presistence: history independent data structures. STOC 2001: 492-501

Moni Naor, Kobbi Nissim: Communication preserving protocols for secure function evaluation. STOC 2001: 590-599

Cynthia Dwork, Ravi Kumar, Moni Naor, D. Sivakumar: Rank aggregation methods for the Web. WWW 2001: 613-622

Moni Naor, Kobbi Nissim: Communication Complexity and Secure Function Evaluation. CoRR cs.CR/0109011 (2001)

Moni Naor, Kobbi Nissim: Communication Complexity and Secure Function Evaluation. Electronic Colloquium on Computational Complexity (ECCC) 8(062) (2001)

Moni Naor, Omer Reingold, Alon Rosen: Pseudo-Random Functions and Factoring. Electronic Colloquium on Computational Complexity (ECCC) 8(064) (2001)

Moni Naor, Vanessa Teague: Anti-persistence: History Independent Data Structures. IACR Cryptology ePrint Archive 2001: 36 (2001)

Dalit Naor, Moni Naor, Jeffrey B. Lotspiech: Revocation and Tracing Schemes for Stateless Receivers. IACR Cryptology ePrint Archive 2001: 59 (2001)

Moni Naor, Omer Reingold, Alon Rosen: Pseudo-Random Functions and Factoring. IACR Cryptology ePrint Archive 2001: 75 (2001)

Moni Naor, Kobbi Nissim: Communication Complexity and Secure Function Evaluation. IACR Cryptology ePrint Archive 2001: 76 (2001)

Carlo Blundo, Alfredo De Santis, Moni Naor: Visual cryptography for grey level images. Inf. Process. Lett. 75(6): 255-259 (2000)

Moni Naor, Kobbi Nissim: Certificate revocation and certificate update. IEEE Journal on Selected Areas in Communications 18(4): 561-570 (2000)

Danny Dolev, Cynthia Dwork, Moni Naor: Nonmalleable Cryptography. SIAM J. Comput. 30(2): 391-437 (2000)

Benny Chor, Amos Fiat, Moni Naor, Benny Pinkas: Tracing traitors. IEEE Transactions on Information Theory 46(3): 893-910 (2000)

Moni Naor, Benny Pinkas: Distributed Oblivious Transfer. ASIACRYPT 2000: 205-219

Dan Boneh, Moni Naor: Timed Commitments. CRYPTO 2000: 236-254

Moni Naor, Benny Pinkas: Efficient Trace and Revoke Schemes. Financial Cryptography 2000: 1-20

Cynthia Dwork, Moni Naor: Zaps and Their Applications. FOCS 2000: 283-293

Moni Naor, Omer Reingold, Alon Rosen: Pseudo-random functions and factoring (extended abstract). STOC 2000: 11-20

Moni Naor, Omer Reingold: Constructing Pseudo-Random Permutations with a Prescribed Structure. IACR Cryptology ePrint Archive 2000: 42 (2000)

Moni Naor, Omer Reingold: Synthesizers and Their Application to the Parallel Construction of Pseudo-Random Functions. J. Comput. Syst. Sci. 58(2): 336-375 (1999)

Moni Naor, Omer Reingold: On the Construction of Pseudorandom Permutations: Luby-Rackoff Revisited. J. Cryptology 12(1): 29-66 (1999)

Amos Fiat, Moni Naor: Rigorous Time/Space Trade-offs for Inverting Functions. SIAM J. Comput. 29(3): 790-803 (1999)

Moni Naor, Benny Pinkas: Oblivious Transfer with Adaptive Queries. CRYPTO 1999: 573-590

Moni Naor, Benny Pinkas, Omer Reingold: Distributed Pseudo-random Functions and KDCs. EUROCRYPT 1999: 327-346

Cynthia Dwork, Moni Naor, Omer Reingold, Larry J. Stockmeyer: Magic Functions. FOCS 1999: 523-534

Ran Canetti, Juan A. Garay, Gene Itkis, Daniele Micciancio, Moni Naor, Benny Pinkas: Multicast Security: A Taxonomy and Some Efficient Constructions. INFOCOM 1999: 708-716

Moni Naor, Benny Pinkas, Reuban Sumner: Privacy preserving auctions and mechanism design. ACM Conference on Electronic Commerce 1999: 129-139

Matt Blaze, Joan Feigenbaum, Moni Naor: A Formal Treatment of Remotely Keyed Encryption. SODA 1999: 868-869

Moni Naor, Benny Pinkas: Oblivious Transfer and Polynomial Evaluation. STOC 1999: 245-254

Moni Naor, Benny Pinkas: Secure Accounting and Auditing on the Web. Computer Networks 30(1-7): 541-550 (1998)

Miklós Ajtai, James Aspnes, Moni Naor, Yuval Rabani, Leonard J. Schulman, Orli Waarts: Fairness in Scheduling. J. Algorithms 29(2): 306-357 (1998)

Moni Naor, Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yung: Perfect Zero-Knowledge Arguments for NP Using Any One-Way Permutation. J. Cryptology 11(2): 87-108 (1998)

Cynthia Dwork, Moni Naor: An Efficient Existentially Unforgeable Signature Scheme and Its Applications. J. Cryptology 11(3): 187-208 (1998)

Moni Naor, Avishai Wool: The Load, Capacity, and Availability of Quorum Systems. SIAM J. Comput. 27(2): 423-447 (1998)

Moni Naor, Avishai Wool: Access Control and Signatures via Quorum Secret Sharing. IEEE Trans. Parallel Distrib. Syst. 9(9): 909-922 (1998)

Moni Naor, Omer Reingold: From Unpredictability to Indistinguishability: A Simple Construction of Pseudo-Random Functions from MACs (Extended Abstract). CRYPTO 1998: 267-282

Moni Naor, Benny Pinkas: Threshold Traitor Tracing. CRYPTO 1998: 502-517

Matt Blaze, Joan Feigenbaum, Moni Naor: A Formal Treatment of Remotely Keyed Encryption. EUROCRYPT 1998: 251-265

Moni Naor, Benny Pinkas: Secure and Efficient Metering. EUROCRYPT 1998: 576-590

Cynthia Dwork, Moni Naor, Amit Sahai: Concurrent Zero-Knowledge. STOC 1998: 409-418

Ran Canetti, Cynthia Dwork, Moni Naor, Rafail Ostrovsky: Deniable Encryption. CRYPTO 1997: 90-104

Moni Naor, Benny Pinkas: Visual Authentication and Identification. CRYPTO 1997: 322-336

Mihir Bellare, Russell Impagliazzo, Moni Naor: Does Parallel Repetition Lower the Error in Computationally Sound Protocols? FOCS 1997: 374-383

Moni Naor, Omer Reingold: Number-theoretic Constructions of Efficient Pseudo-random Functions. FOCS 1997: 458-467

Moni Naor, Omer Reingold: On the Construction of Pseudo-Random Permutations: Luby-Rackoff Revisited (Extended Abstract). STOC 1997: 189-199

Moni Naor, Omer Reingold: On the Construction of Pseudo-Random Permutations: Luby-Rackoff Revisited. Electronic Colloquium on Computational Complexity (ECCC) 4(5) (1997)

Noga Alon, Moni Naor: Derandomization, Witnesses for Boolean Matrix Multiplication and Construction of Perfect Hash Functions. Algorithmica 16(4/5): 434-449 (1996)

Ronald Fagin, Moni Naor, Peter Winkler: Comparing Information Without Leaking It. Commun. ACM 39(5): 77-85 (1996)

Russell Impagliazzo, Moni Naor: Efficient Cryptographic Schemes Provably as Secure as Subset Sum. J. Cryptology 9(4): 199-216 (1996)

Moni Naor, Avishai Wool: Access Control and Signatures via Quorum Secret Sharing. ACM Conference on Computer and Communications Security 1996: 157-168

Moni Naor, Sitvanit Ruah: On the Decisional Complexity of Problems Over the Reals. ISTCS 1996: 176-187

Moni Naor, Adi Shamir: Visual Cryptography II: Improving the Contrast Via the Cover Base. Security Protocols Workshop 1996: 197-202

Moni Naor: Evaluation May Be Easier Than Generation (Extended Abstract). STOC 1996: 74-83

Cynthia Dwork, Jeffrey B. Lotspiech, Moni Naor: Digital Signets: Self-Enforcing Protection of Digital Information (Preliminary Version). STOC 1996: 489-498

Ran Canetti, Uriel Feige, Oded Goldreich, Moni Naor: Adaptively Secure Multi-Party Computation. STOC 1996: 639-648

Moni Naor, Ron M. Roth: Optimal File Sharing in Distributed Networks. SIAM J. Comput. 24(1): 158-183 (1995)

Tomás Feder, Eyal Kushilevitz, Moni Naor, Noam Nisan: Amortized Communication Complexity. SIAM J. Comput. 24(4): 736-750 (1995)

Moni Naor, Larry J. Stockmeyer: What Can be Computed Locally? SIAM J. Comput. 24(6): 1259-1277 (1995)

László Lovász, Moni Naor, Ilan Newman, Avi Wigderson: Search Problems in the Decision Tree Model. SIAM J. Discrete Math. 8(1): 119-132 (1995)

Moni Naor, Omer Reingold: Synthesizers and Their Application to the Parallel Construction of Psuedo-Random Functions. FOCS 1995: 170-181

Moni Naor, Leonard J. Schulman, Aravind Srinivasan: Splitters and Near-Optimal Derandomization. FOCS 1995: 182-191

Joe Kilian, Moni Naor: On the Complexity of Statistical Reasoning (extended abtract). ISTCS 1995: 209-217

Alain J. Mayer, Moni Naor, Larry J. Stockmeyer: Local Computations on Static and Dynamic Graphs (Preliminary Version). ISTCS 1995: 268-278

Miklós Ajtai, James Aspnes, Moni Naor, Yuval Rabani, Leonard J. Schulman, Orli Waarts: Fairness in Scheduling. SODA 1995: 477-485

Moni Naor, Omer Reingold: Synthesizers and Their Application to the Parallel Construction of Pseudo-random Functions. Electronic Colloquium on Computational Complexity (ECCC) 2(45) (1995)

Manuel Blum, William S. Evans, Peter Gemmell, Sampath Kannan, Moni Naor: Checking the Correctness of Memories. Algorithmica 12(2/3): 225-244 (1994)

Rajeev Motwani, Joseph Naor, Moni Naor: The Probabilistic Method Yields Deterministic Parallel Algorithms. J. Comput. Syst. Sci. 49(3): 478-516 (1994)

Cynthia Dwork, Moni Naor: An Efficient Existentially Unforgeable Signature Scheme and its Applications. CRYPTO 1994: 234-246

Benny Chor, Amos Fiat, Moni Naor: Tracing Traitors. CRYPTO 1994: 257-270

Moni Naor, Adi Shamir: Visual Cryptography. EUROCRYPT 1994: 1-12

Moni Naor, Avishai Wool: The Load, Capacity and Availability of Quorum Systems. FOCS 1994: 214-225

Noga Alon, Manuel Blum, Amos Fiat, Sampath Kannan, Moni Naor, Rafail Ostrovsky: Matching Nuts and Bolts. SODA 1994: 690-696

Uriel Feige, Joe Kilian, Moni Naor: A minimal model for secure computation (extended abstract). STOC 1994: 554-563

David Feldman, Russell Impagliazzo, Moni Naor, Noam Nisan, Steven Rudich, Adi Shamir: On Dice and Coins: Models of Computation for Random Generation. Inf. Comput. 104(2): 159-174 (1993)

Amos Fiat, Moni Naor: Implicit O(1) Probe Search. SIAM J. Comput. 22(1): 1-10 (1993)

Noga Alon, Moni Naor: Coin-Flipping Games Immune Against Linear-Sized Coalitions. SIAM J. Comput. 22(2): 403-417 (1993)

Joseph Naor, Moni Naor: Small-Bias Probability Spaces: Efficient Constructions and Applications. SIAM J. Comput. 22(4): 838-856 (1993)

Moni Naor, Alon Orlitsky, Peter W. Shor: Three results on interactive communication. IEEE Transactions on Information Theory 39(5): 1608-1615 (1993)

Peter Gemmell, Moni Naor: Codes for Interactive Authentication. CRYPTO 1993: 355-367

Amos Fiat, Moni Naor: Broadcast Encryption. CRYPTO 1993: 480-491

Nimrod Megiddo, Moni Naor, David P. Anderson: The Minimum Reservation Rate Problem in Digital Audio/Video Systems. ISTCS 1993: 43-48

Moni Naor, Larry J. Stockmeyer: What can be computed locally? STOC 1993: 184-193

Amos Fiat, Moni Naor, Jeanette P. Schmidt, Alan Siegel: Nonoblivious Hashing. J. ACM 39(4): 764-782 (1992)

Sandy Irani, Moni Naor, Ronitt Rubinfeld: On the Time and Space Complexity of Computation Using Write-Once Memory Or Is Pen Really Much Worse Than Pencil? Mathematical Systems Theory 25(2): 141-159 (1992)

Sampath Kannan, Moni Naor, Steven Rudich: Implicit Representation of Graphs. SIAM J. Discrete Math. 5(4): 596-603 (1992)

Noga Alon, Jehoshua Bruck, Joseph Naor, Moni Naor, Ron M. Roth: Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs. IEEE Transactions on Information Theory 38(2): 509-516 (1992)

Cynthia Dwork, Moni Naor: Pricing via Processing or Combatting Junk Mail. CRYPTO 1992: 139-147

Moni Naor, Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yung: Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions (Extended Abstract). CRYPTO 1992: 196-214

Cynthia Dwork, Uriel Feige, Joe Kilian, Moni Naor, Shmuel Safra: Low Communication 2-Prover Zero-Knowledge Proofs for NP. CRYPTO 1992: 215-227

Noga Alon, Zvi Galil, Oded Margalit, Moni Naor: Witnesses for Boolean Matrix Multiplication and for Shortest Paths. FOCS 1992: 417-426

Miklós Ajtai, Noga Alon, Jehoshua Bruck, Robert Cypher, Ching-Tien Ho, Moni Naor, Endre Szemerédi: Fault Tolerant Graphs, Perfect Hash Functions and Disjoint Paths. FOCS 1992: 693-702

Amos Fiat, J. Ian Munro, Moni Naor, Alejandro A. Schäffer, Jeanette P. Schmidt, Alan Siegel: An Implicit Data Structure for Searching a Multikey Table in Logarithmic Time. J. Comput. Syst. Sci. 43(3): 406-424 (1991)

Moni Naor: Bit Commitment Using Pseudorandomness. J. Cryptology 4(2): 151-158 (1991)

Moni Naor: A Lower Bound on Probabilistic Algorithms for Distributive Ring Coloring. SIAM J. Discrete Math. 4(3): 409-412 (1991)

Manuel Blum, William S. Evans, Peter Gemmell, Sampath Kannan, Moni Naor: Checking the Correctness of Memories. FOCS 1991: 90-99

Tomás Feder, Eyal Kushilevitz, Moni Naor: Amortized Communication Complexity (Preliminary Version). FOCS 1991: 239-248

Moni Naor, Ron M. Roth: Optimal File Sharing in Distributed Networks (Preliminary Version). FOCS 1991: 515-525

László Lovász, Moni Naor, Ilan Newman, Avi Wigderson: Search Problems in the Decision Tree Model (Preliminary Version). FOCS 1991: 576-585

Moni Naor: String Matching with Preprocessing of Text and Pattern. ICALP 1991: 739-750

Amos Fiat, Moni Naor: Rigorous Time/Space Tradeoffs for Inverting Functions. STOC 1991: 534-541

Danny Dolev, Cynthia Dwork, Moni Naor: Non-Malleable Cryptography (Extended Abstract). STOC 1991: 542-552

Moni Naor: Succinct representation of general unlabeled graphs. Discrete Applied Mathematics 28(3): 303-307 (1990)

Amotz Bar-Noy, Joseph Naor, Moni Naor: One-Bit Algorithms. Distributed Computing 4: 3-8 (1990)

Jehoshua Bruck, Moni Naor: The hardness of decoding linear codes with preprocessing. IEEE Transactions on Information Theory 36(2): 381-385 (1990)

Noga Alon, Moni Naor: Coin-Flipping Games Immune against Linear-Sized Coalitions (Extended Abstract). FOCS 1990: 46-54

Joseph Naor, Moni Naor: Small-bias Probability Spaces: Efficient Constructions and Applications. STOC 1990: 213-223

Moni Naor, Moti Yung: Public-key Cryptosystems Provably Secure against Chosen Ciphertext Attacks. STOC 1990: 427-437

Joseph Naor, Moni Naor, Alejandro A. Schäffer: Fast Parallel Algorithms for Chordal Graphs. SIAM J. Comput. 18(2): 327-349 (1989)

Moni Naor: Bit Commitment Using Pseudo-Randomness. CRYPTO 1989: 128-136

Rajeev Motwani, Joseph Naor, Moni Naor: The Probabilistic Method Yields Deterministic Parallel Algorithms. FOCS 1989: 8-13

Russell Impagliazzo, Moni Naor: Efficient Cryptographic Schemes Provably as Secure as Subset Sum. FOCS 1989: 236-241

David Feldman, Russell Impagliazzo, Moni Naor, Noam Nisan, Steven Rudich, Adi Shamir: On Dice and Coins: Models of Computation for Random Generation. ICALP 1989: 319-340

Moni Naor, Moti Yung: Universal One-Way Hash Functions and their Cryptographic Applications. STOC 1989: 33-43

Amos Fiat, Moni Naor: Implicit O(1) Probe Search. STOC 1989: 336-344

Russell Impagliazzo, Moni Naor: Decision trees and downward closures. Structure in Complexity Theory Conference 1988: 29-38

David Chaum, Amos Fiat, Moni Naor: Untraceable Electronic Cash. CRYPTO 1988: 319-327

Amotz Bar-Noy, Joseph Naor, Moni Naor: One Bit Algorithms. PODC 1988: 66-76

Sampath Kannan, Moni Naor, Steven Rudich: Implicit Representation of Graphs. STOC 1988: 334-343

Amos Fiat, Moni Naor, Alejandro A. Schäffer, Jeanette P. Schmidt, Alan Siegel: Storing and Searching a Multikey Table (Extended Abstract). STOC 1988: 344-353

Amos Fiat, Moni Naor, Jeanette P. Schmidt, Alan Siegel: Non-Oblivious Hashing (Extended Abstract). STOC 1988: 367-376

Joseph Naor, Moni Naor, Alejandro A. Schäffer: Fast Parallel Algorithms for Chordal Graphs (Extended Abstract). STOC 1987: 355-364