| 2025 | FOCS | Shuffling Cards When You Are of Very Little Brain: Low Memory Generation of Permutations. | Boaz Menuhin, Moni Naor |
| 2025 | ICALP | On the Instance Optimality of Detecting Collisions and Subgraphs. | Omri Ben-Eliezer, Tomer Grossman, Moni Naor |
| 2024 | CRYPTO | MPC for Tech Giants (GMPC): Enabling Gulliver and the Lilliputians to Cooperate Amicably. | Bar Alon, Moni Naor, Eran Omri, Uri Stemmer |
| 2024 | CRYPTO | That's Not My Signature! Fail-Stop Signatures for a Post-quantum World. | Cecilia Boschini, Hila Dahari, Moni Naor, Eyal Ronen |
| 2024 | ESA | From Donkeys to Kings in Tournaments. | Amir Abboud, Tomer Grossman, Moni Naor, Tomer Solomon |
| 2024 | SODA | Adjacency Sketches in Adversarial Environments. | Moni Naor, Eugene Pekel |
| 2022 | CRYPTO | Low Communication Complexity Protocols, Collision Resistant Hash Functions and Secret Key-Agreement Protocols. | Shahar P. Cohen, Moni Naor |
| 2022 | CRYPTO | CHIP and CRISP: Protecting All Parties Against Compromise Through Identity-Binding PAKEs. | Cas Cremers, Moni Naor, Shahar Paz, Eyal Ronen |
| 2022 | FUN | Mirror Games Against an Open Book Player. | Roey Magen, Moni Naor |
| 2022 | TCC | Bet-or-Pass: Adversarially Robust Bloom Filters. | Moni Naor, Noa Oved |
| 2021 | STOC | Adversarial laws of large numbers and optimal regret in online classification. | Noga Alon, Omri Ben-Eliezer, Yuval Dagan, Shay Moran, Moni Naor, Eylon Yogev |
| 2020 | COLT | Privately Learning Thresholds: Closing the Exponential Gap. | Haim Kaplan, Katrina Ligett, Yishay Mansour, Moni Naor, Uri Stemmer |
| 2020 | SODA | The Power of Distributed Verifiers in Interactive Proofs. | Moni Naor, Merav Parter, Eylon Yogev |
| 2019 | CCS | How to (not) Share a Password: Privacy Preserving Protocols for Finding Heavy Hitters with Adversarial Behavior. | Moni Naor, Benny Pinkas, Eyal Ronen |
| 2019 | TCC | Incrementally Verifiable Computation via Incremental PCPs. | Moni Naor, Omer Paneth, Guy N. Rothblum |
| 2018 | EuroCrypt | Collision Resistant Hashing for Paranoids: Dealing with Multiple Collisions. | Ilan Komargodski, Moni Naor, Eylon Yogev |
| 2018 | TCC | The Security of Lazy Users in Out-of-Band Authentication. | Moni Naor, Lior Rotem, Gil Segev |
| 2017 | FOCS | White-Box vs. Black-Box Complexity of Search Problems: Ramsey and Graph Property Testing. | Ilan Komargodski, Moni Naor, Eylon Yogev |
| 2016 | CRYPTO | Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption. | Prabhanjan Ananth, Aayush Jain, Moni Naor, Amit Sahai, Eylon Yogev |
| 2016 | CRYPTO | Spooky Interaction and Its Discontents: Compilers for Succinct Two-Message Argument Systems. | Cynthia Dwork, Moni Naor, Guy N. Rothblum |
| 2016 | STOC | Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations. | Gilad Asharov, Moni Naor, Gil Segev, Ido Shahaf |
| 2016 | SPAA | The Family Holiday Gathering Problem or Fair and Periodic Scheduling of Independent Sets. | Amihood Amir, Oren Kapah, Tsvi Kopelowitz, Moni Naor, Ely Porat |
| 2016 | TCC | How to Share a Secret, Infinitely. | Ilan Komargodski, Moni Naor, Eylon Yogev |
| 2015 | ASIACRYPT | Pure Differential Privacy for Rectangle Queries via Private Partitions. | Cynthia Dwork, Moni Naor, Omer Reingold, Guy N. Rothblum |
| 2015 | CRYPTO | Bloom Filters in Adversarial Environments. | Moni Naor, Eylon Yogev |
| 2015 | NDSS | NSEC5: Provably Preventing DNSSEC Zone Enumeration. | Sharon Goldberg, Moni Naor, Dimitrios Papadopoulos, Leonid Reyzin, Sachin Vasant, Asaf Ziv |
| 2015 | SAGT | When Can Limited Randomness Be Used in Repeated Games? | Pavel Hubcek, Moni Naor, Jonathan R. Ullman |
| 2015 | TCC | Secure Physical Computation Using Disposable Circuits. | Ben A. Fisch, Daniel Freund, Moni Naor |
| 2015 | TCC | Primary-Secondary-Resolver Membership Proof Systems. | Moni Naor, Asaf Ziv |
| 2014 | ASIACRYPT | Secret-Sharing for NP. | Ilan Komargodski, Moni Naor, Eylon Yogev |
| 2014 | CRYPTO | Physical Zero-Knowledge Proofs of Physical Properties. | Ben Fisch, Daniel Freund, Moni Naor |
| 2014 | FOCS | One-Way Functions and (Im)Perfect Obfuscation. | Ilan Komargodski, Tal Moran, Moni Naor, Rafael Pass, Alon Rosen, Eylon Yogev |
| 2013 | ISAAC | Sliding Bloom Filters. | Moni Naor, Eylon Yogev |
| 2013 | SODA | Fast Algorithms for Interactive Coding. | Zvika Brakerski, Moni Naor |
| 2013 | TCC | Hardness Preserving Reductions via Cuckoo Hashing. | Itay Berman, Iftach Haitner, Ilan Komargodski, Moni Naor |
| 2012 | FOCS | The Privacy of the Analyst and the Power of the State. | Cynthia Dwork, Moni Naor, Salil P. Vadhan |
| 2010 | EuroCrypt | Public-Key Encryption in the Bounded-Retrieval Model. | Jol Alwen, Yevgeniy Dodis, Moni Naor, Gil Segev, Shabsi Walfish, Daniel Wichs |
| 2010 | FOCS | Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation. | Yuriy Arbitman, Moni Naor, Gil Segev |
| 2010 | STOC | Differential privacy under continual observation. | Cynthia Dwork, Moni Naor, Toniann Pitassi, Guy N. Rothblum |
| 2009 | ASIACRYPT | Hedged Public-Key Encryption: How to Protect against Bad Randomness. | Mihir Bellare, Zvika Brakerski, Moni Naor, Thomas Ristenpart, Gil Segev, Hovav Shacham, Scott Yilek |
| 2009 | CRYPTO | Public-Key Cryptosystems Resilient to Key Leakage. | Moni Naor, Gil Segev |
| 2009 | ICALP | De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results. | Yuriy Arbitman, Moni Naor, Gil Segev |
| 2009 | STOC | On the complexity of differentially private data release: efficient algorithms and hardness results. | Cynthia Dwork, Moni Naor, Omer Reingold, Guy N. Rothblum, Salil P. Vadhan |
| 2009 | SOUPS | Games for extracting randomness. | Ran Halprin, Moni Naor |
| 2009 | TCC | How Efficient Can Memory Checking Be?. | Cynthia Dwork, Moni Naor, Guy N. Rothblum, Vinod Vaikuntanathan |
| 2009 | TCC | An Optimally Fair Coin Toss. | Tal Moran, Moni Naor, Gil Segev |
| 2008 | CCS | Traitor tracing with constant size ciphertext. | Dan Boneh, Moni Naor |
| 2008 | ICALP | History-Independent Cuckoo Hashing. | Moni Naor, Gil Segev, Udi Wieder |
| 2008 | STOC | Games for exchanging information. | Gillat Kol, Moni Naor |
| 2008 | STOC | Sketching in adversarial environments. | Ilya Mironov, Moni Naor, Gil Segev |
| 2008 | TCC | Cryptography and Game Theory: Designing Protocols for Exchanging Information. | Gillat Kol, Moni Naor |
| 2007 | CCS | Split-ballot voting: everlasting privacy with distributed trust. | Tal Moran, Moni Naor |
| 2007 | FUN | Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles. | Ronen Gradwohl, Moni Naor, Benny Pinkas, Guy N. Rothblum |
| 2007 | ICALP | Deterministic History-Independent Strategies for Storing Information on Write-Once Memories. | Tal Moran, Moni Naor, Gil Segev |
| 2006 | CRYPTO | Receipt-Free Universally-Verifiable Voting with Everlasting Privacy. | Tal Moran, Moni Naor |
| 2006 | CRYPTO | Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models. | Moni Naor, Gil Segev, Adam D. Smith |
| 2006 | EuroCrypt | Our Data, Ourselves: Privacy Via Distributed Noise Generation. | Cynthia Dwork, Krishnaram Kenthapadi, Frank McSherry, Ilya Mironov, Moni Naor |
| 2006 | EuroCrypt | Polling with Physical Envelopes: A Rigorous Analysis of a Human-Centric Protocol. | Tal Moran, Moni Naor |
| 2006 | FOCS | On the Compressibility of NP Instances and Cryptographic Applications. | Danny Harnik, Moni Naor |
| 2006 | ICALP | On Everlasting Security in the | Danny Harnik, Moni Naor |
| 2006 | ICML | Learning to impersonate. | Moni Naor, Guy N. Rothblum |
| 2005 | CRYPTO | Pebbling and Proofs of Work. | Cynthia Dwork, Moni Naor, Hoeteck Wee |
| 2005 | EuroCrypt | On Robust Combiners for Oblivious Transfer and Other Primitives. | Danny Harnik, Joe Kilian, Moni Naor, Omer Reingold, Alon Rosen |
| 2005 | FOCS | The Complexity of Online Memory Checking. | Moni Naor, Guy N. Rothblum |
| 2005 | ICALP | Basing Cryptographic Protocols on Tamper-Evident Seals. | Tal Moran, Moni Naor |
| 2005 | TCC | Efficiently Constructible Huge Graphs That Preserve First Order Properties of Random Graphs. | Moni Naor, Asaf Nussboim, Eran Tromer |
| 2004 | EuroCrypt | Immunizing Encryption Schemes from Decryption Errors. | Cynthia Dwork, Moni Naor, Omer Reingold |
| 2004 | STOC | Completeness in two-party secure computation: a computational view. | Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen |
| 2004 | STOC | Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks. | Gurmeet Singh Manku, Moni Naor, Udi Wieder |
| 2003 | CRYPTO | On Memory-Bound Functions for Fighting Spam. | Cynthia Dwork, Andrew V. Goldberg, Moni Naor |
| 2003 | CRYPTO | On Cryptographic Assumptions and Challenges. | Moni Naor |
| 2003 | PODC | Scalable and dynamic quorum systems. | Moni Naor, Udi Wieder |
| 2003 | SPAA | Novel architectures for P2P applications: the continuous-discrete approach. | Moni Naor, Udi Wieder |
| 2002 | CRYPTO | Deniable Ring Authentication. | Moni Naor |
| 2002 | PODC | Viceroy: a scalable and dynamic emulation of the butterfly. | Dahlia Malkhi, Moni Naor, David Ratajczak |
| 2001 | CRYPTO | Revocation and Tracing Schemes for Stateless Receivers. | Dalit Naor, Moni Naor, Jeffery Lotspiech |
| 2001 | PODS | Optimal Aggregation Algorithms for Middleware. | Ronald Fagin, Amnon Lotem, Moni Naor |
| 2001 | WWW | Rank aggregation methods for the Web. | Cynthia Dwork, Ravi Kumar, Moni Naor, D. Sivakumar |
| 2001 | SODA | Efficient oblivious transfer protocols. | Moni Naor, Benny Pinkas |
| 2001 | SODA | Constructing pseudo-random permutations with a prescribed structure. | Moni Naor, Omer Reingold |
| 2001 | STOC | Communication preserving protocols for secure function evaluation. | Moni Naor, Kobbi Nissim |
| 2001 | STOC | Anti-presistence: history independent data structures. | Moni Naor, Vanessa Teague |
| 2000 | ASIACRYPT | Distributed Oblivious Transfer. | Moni Naor, Benny Pinkas |
| 2000 | CRYPTO | Timed Commitments. | Dan Boneh, Moni Naor |
| 2000 | FC | Efficient Trace and Revoke Schemes. | Moni Naor, Benny Pinkas |
| 2000 | FOCS | Zaps and Their Applications. | Cynthia Dwork, Moni Naor |
| 2000 | STOC | Pseudo-random functions and factoring (extended abstract). | Moni Naor, Omer Reingold, Alon Rosen |
| 1999 | CRYPTO | Oblivious Transfer with Adaptive Queries. | Moni Naor, Benny Pinkas |
| 1999 | EuroCrypt | Distributed Pseudo-random Functions and KDCs. | Moni Naor, Benny Pinkas, Omer Reingold |
| 1999 | FOCS | Magic Functions. | Cynthia Dwork, Moni Naor, Omer Reingold, Larry J. Stockmeyer |
| 1999 | INFOCOM | Multicast Security: A Taxonomy and Some Efficient Constructions. | Ran Canetti, Juan A. Garay, Gene Itkis, Daniele Micciancio, Moni Naor, Benny Pinkas |
| 1999 | SODA | A Formal Treatment of Remotely Keyed Encryption. | Matt Blaze, Joan Feigenbaum, Moni Naor |
| 1999 | STOC | Oblivious Transfer and Polynomial Evaluation. | Moni Naor, Benny Pinkas |
| 1998 | CRYPTO | Threshold Traitor Tracing. | Moni Naor, Benny Pinkas |
| 1998 | CRYPTO | From Unpredictability to Indistinguishability: A Simple Construction of Pseudo-Random Functions from MACs (Extended Abstract). | Moni Naor, Omer Reingold |
| 1998 | EuroCrypt | A Formal Treatment of Remotely Keyed Encryption. | Matt Blaze, Joan Feigenbaum, Moni Naor |
| 1998 | EuroCrypt | Secure and Efficient Metering. | Moni Naor, Benny Pinkas |
| 1998 | STOC | Concurrent Zero-Knowledge. | Cynthia Dwork, Moni Naor, Amit Sahai |
| 1997 | CRYPTO | Deniable Encryption. | Ran Canetti, Cynthia Dwork, Moni Naor, Rafail Ostrovsky |
| 1997 | CRYPTO | Visual Authentication and Identification. | Moni Naor, Benny Pinkas |
| 1997 | FOCS | Does Parallel Repetition Lower the Error in Computationally Sound Protocols? | Mihir Bellare, Russell Impagliazzo, Moni Naor |
| 1997 | FOCS | Number-theoretic Constructions of Efficient Pseudo-random Functions. | Moni Naor, Omer Reingold |
| 1997 | STOC | On the Construction of Pseudo-Random Permutations: Luby-Rackoff Revisited (Extended Abstract). | Moni Naor, Omer Reingold |
| 1996 | CCS | Access Control and Signatures via Quorum Secret Sharing. | Moni Naor, Avishai Wool |
| 1996 | STOC | Adaptively Secure Multi-Party Computation. | Ran Canetti, Uriel Feige, Oded Goldreich, Moni Naor |
| 1996 | STOC | Digital Signets: Self-Enforcing Protection of Digital Information (Preliminary Version). | Cynthia Dwork, Jeffrey B. Lotspiech, Moni Naor |
| 1996 | STOC | Evaluation May Be Easier Than Generation (Extended Abstract). | Moni Naor |
| 1995 | FOCS | Synthesizers and Their Application to the Parallel Construction of Psuedo-Random Functions. | Moni Naor, Omer Reingold |
| 1995 | FOCS | Splitters and Near-Optimal Derandomization. | Moni Naor, Leonard J. Schulman, Aravind Srinivasan |
| 1995 | SODA | Fairness in Scheduling. | Mikls Ajtai, James Aspnes, Moni Naor, Yuval Rabani, Leonard J. Schulman, Orli Waarts |
| 1994 | CRYPTO | Tracing Traitors. | Benny Chor, Amos Fiat, Moni Naor |
| 1994 | CRYPTO | An Efficient Existentially Unforgeable Signature Scheme and its Applications. | Cynthia Dwork, Moni Naor |
| 1994 | EuroCrypt | Visual Cryptography. | Moni Naor, Adi Shamir |
| 1994 | FOCS | The Load, Capacity and Availability of Quorum Systems | Moni Naor, Avishai Wool |
| 1994 | SODA | Matching Nuts and Bolts. | Noga Alon, Manuel Blum, Amos Fiat, Sampath Kannan, Moni Naor, Rafail Ostrovsky |
| 1994 | STOC | A minimal model for secure computation (extended abstract). | Uriel Feige, Joe Kilian, Moni Naor |
| 1993 | CRYPTO | Broadcast Encryption. | Amos Fiat, Moni Naor |
| 1993 | CRYPTO | Codes for Interactive Authentication. | Peter Gemmell, Moni Naor |
| 1993 | STOC | What can be computed locally? | Moni Naor, Larry J. Stockmeyer |
| 1992 | CRYPTO | Low Communication 2-Prover Zero-Knowledge Proofs for NP. | Cynthia Dwork, Uriel Feige, Joe Kilian, Moni Naor, Shmuel Safra |
| 1992 | CRYPTO | Pricing via Processing or Combatting Junk Mail. | Cynthia Dwork, Moni Naor |
| 1992 | CRYPTO | Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions (Extended Abstract). | Moni Naor, Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yung |
| 1992 | FOCS | Fault Tolerant Graphs, Perfect Hash Functions and Disjoint Paths | Mikls Ajtai, Noga Alon, Jehoshua Bruck, Robert Cypher, Ching-Tien Ho, Moni Naor, Endre Szemerdi |
| 1992 | FOCS | Witnesses for Boolean Matrix Multiplication and for Shortest Paths | Noga Alon, Zvi Galil, Oded Margalit, Moni Naor |
| 1991 | FOCS | Checking the Correctness of Memories | Manuel Blum, William S. Evans, Peter Gemmell, Sampath Kannan, Moni Naor |
| 1991 | FOCS | Amortized Communication Complexity (Preliminary Version) | Toms Feder, Eyal Kushilevitz, Moni Naor |
| 1991 | FOCS | Search Problems in the Decision Tree Model (Preliminary Version) | Lszl Lovsz, Moni Naor, Ilan Newman, Avi Wigderson |
| 1991 | FOCS | Optimal File Sharing in Distributed Networks (Preliminary Version) | Moni Naor, Ron M. Roth |
| 1991 | ICALP | String Matching with Preprocessing of Text and Pattern. | Moni Naor |
| 1991 | STOC | Non-Malleable Cryptography (Extended Abstract) | Danny Dolev, Cynthia Dwork, Moni Naor |
| 1991 | STOC | Rigorous Time/Space Tradeoffs for Inverting Functions | Amos Fiat, Moni Naor |
| 1990 | FOCS | Coin-Flipping Games Immune against Linear-Sized Coalitions (Extended Abstract) | Noga Alon, Moni Naor |
| 1990 | STOC | Small-bias Probability Spaces: Efficient Constructions and Applications | Joseph Naor, Moni Naor |
| 1990 | STOC | Public-key Cryptosystems Provably Secure against Chosen Ciphertext Attacks | Moni Naor, Moti Yung |
| 1989 | CRYPTO | Bit Commitment Using Pseudo-Randomness. | Moni Naor |
| 1989 | FOCS | Efficient Cryptographic Schemes Provably as Secure as Subset Sum | Russell Impagliazzo, Moni Naor |
| 1989 | FOCS | The Probabilistic Method Yields Deterministic Parallel Algorithms | Rajeev Motwani, Joseph Naor, Moni Naor |
| 1989 | ICALP | On Dice and Coins: Models of Computation for Random Generation. | David Feldman, Russell Impagliazzo, Moni Naor, Noam Nisan, Steven Rudich, Adi Shamir |
| 1989 | STOC | Implicit O(1) Probe Search | Amos Fiat, Moni Naor |
| 1989 | STOC | Universal One-Way Hash Functions and their Cryptographic Applications | Moni Naor, Moti Yung |
| 1988 | CRYPTO | Untraceable Electronic Cash. | David Chaum, Amos Fiat, Moni Naor |
| 1988 | PODC | One Bit Algorithms. | Amotz Bar-Noy, Joseph Naor, Moni Naor |
| 1988 | STOC | Non-Oblivious Hashing (Extended Abstract) | Amos Fiat, Moni Naor, Jeanette P. Schmidt, Alan Siegel |
| 1988 | STOC | Storing and Searching a Multikey Table (Extended Abstract) | Amos Fiat, Moni Naor, Alejandro A. Schffer, Jeanette P. Schmidt, Alan Siegel |
| 1988 | STOC | Implicit Representation of Graphs | Sampath Kannan, Moni Naor, Steven Rudich |
| 1987 | STOC | Fast Parallel Algorithms for Chordal Graphs (Extended Abstract) | Joseph Naor, Moni Naor, Alejandro A. Schffer |