Moni Naor

According to our database, Moni Naor authored at least 215 papers between 1987 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2024

Adjacency Sketches in Adversarial Environments.

Moni Naor, Eugene Pekel

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023

Mirror games against an open book player.

Roey Magen, Moni Naor

Theor. Comput. Sci., October, 2023

That's not my signature! Fail-stop signatures for a post-quantum world.

Cecilia Boschini, Hila Dahari, Moni Naor, Eyal Ronen

IACR Cryptol. ePrint Arch., 2023

Does Prior Knowledge Help Detect Collisions?

Omri Ben-Eliezer, Tomer Grossman, Moni Naor

Electron. Colloquium Comput. Complex., 2023

Private Everlasting Prediction.

Moni Naor, Kobbi Nissim, Uri Stemmer, Chao Yan

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

New Algorithms and Applications for Risk-Limiting Audits.

Bar Karov, Moni Naor

Proceedings of the 4th Symposium on Foundations of Responsible Computing, 2023

Resistance to Timing Attacks for Sampling and Privacy Preserving Schemes.

Yoav Ben Dov, Liron David, Moni Naor, Elad Tzalik

Proceedings of the 4th Symposium on Foundations of Responsible Computing, 2023

2022

Bet-or-Pass: Adversarially Robust Bloom Filters.

Moni Naor, Noa Oved

IACR Cryptol. ePrint Arch., 2022

Low Communication Complexity Protocols, Collision Resistant Hash Functions and Secret Key-Agreement Protocols.

Shahar P. Cohen, Moni Naor

IACR Cryptol. ePrint Arch., 2022

MPC for Tech Giants (GMPC): Enabling Gulliver and the Lilliputians to Cooperate Amicably.

Bar Alon, Moni Naor, Eran Omri, Uri Stemmer

IACR Cryptol. ePrint Arch., 2022

CHIP and CRISP: Protecting All Parties Against Compromise Through Identity-Binding PAKEs.

Cas Cremers, Moni Naor, Shahar Paz, Eyal Ronen

Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

2021

Keep That Card in Mind: Card Guessing with Limited Memory.

Boaz Menuhin, Moni Naor

Electron. Colloquium Comput. Complex., 2021

Adversarial laws of large numbers and optimal regret in online classification.

Noga Alon, Omri Ben-Eliezer, Yuval Dagan, Shay Moran, Moni Naor, Eylon Yogev

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

2020

The Security of Lazy Users in Out-of-Band Authentication.

Moni Naor, Lior Rotem, Gil Segev

ACM Trans. Priv. Secur., 2020

CRISP: Compromise Resilient Identity-based Symmetric PAKE.

Moni Naor, Shahar Paz, Eyal Ronen

IACR Cryptol. ePrint Arch., 2020

Can Two Walk Together: Privacy Enhancing Methods and Preventing Tracking of Users.

Moni Naor, Neil Vexler

Proceedings of the 1st Symposium on Foundations of Responsible Computing, 2020

Privately Learning Thresholds: Closing the Exponential Gap.

Haim Kaplan, Katrina Ligett, Yishay Mansour, Moni Naor, Uri Stemmer

Proceedings of the Conference on Learning Theory, 2020

2019

Bloom Filters in Adversarial Environments.

Moni Naor, Eylon Yogev

ACM Trans. Algorithms, 2019

Hardness-Preserving Reductions via Cuckoo Hashing.

Itay Berman, Iftach Haitner, Ilan Komargodski, Moni Naor

J. Cryptol., 2019

White-Box vs. Black-Box Complexity of Search Problems: Ramsey and Graph Property Testing.

Ilan Komargodski, Moni Naor, Eylon Yogev

J. ACM, 2019

Out-of-Band Authenticated Group Key Exchange: From Strong Authentication to Immediate Key Delivery.

Moni Naor, Lior Rotem, Gil Segev

IACR Cryptol. ePrint Arch., 2019

Incrementally Verifiable Computation via Incremental PCPs.

Moni Naor, Omer Paneth, Guy N. Rothblum

IACR Cryptol. ePrint Arch., 2019

Instance Complexity and Unlabeled Certificates in the Decision Tree Model.

Tomer Grossman, Ilan Komargodski, Moni Naor

Electron. Colloquium Comput. Complex., 2019

2018

How to (not) share a password: Privacy preserving protocols for finding heavy hitters with adversarial behavior.

Moni Naor, Benny Pinkas, Eyal Ronen

IACR Cryptol. ePrint Arch., 2018

The Power of Distributed Verifiers in Interactive Proofs.

Moni Naor, Merav Parter, Eylon Yogev

Electron. Colloquium Comput. Complex., 2018

2017

Secret-Sharing for NP.

Ilan Komargodski, Moni Naor, Eylon Yogev

J. Cryptol., 2017

Can NSEC5 be practical for DNSSEC deployments?

Dimitrios Papadopoulos, Duane Wessels, Shumon Huque, Moni Naor, Jan Vcelák, Leonid Reyzin, Sharon Goldberg

IACR Cryptol. ePrint Arch., 2017

Collision Resistant Hashing for Paranoids: Dealing with Multiple Collisions.

Ilan Komargodski, Moni Naor, Eylon Yogev

IACR Cryptol. ePrint Arch., 2017

2016

When Can Limited Randomness Be Used in Repeated Games?

Pavel Hubácek, Moni Naor, Jonathan R. Ullman

Theory Comput. Syst., 2016

An Optimally Fair Coin Toss.

Tal Moran, Moni Naor, Gil Segev

J. Cryptol., 2016

NSEC5 from Elliptic Curves: Provably Preventing DNSSEC Zone Enumeration with Shorter Responses.

Sharon Goldberg, Moni Naor, Dimitrios Papadopoulos, Leonid Reyzin

IACR Cryptol. ePrint Arch., 2016

Searchable Symmetric Encryption: Optimal Locality in Linear Space via Two-Dimensional Balanced Allocations.

Gilad Asharov, Moni Naor, Gil Segev, Ido Shahaf

IACR Cryptol. ePrint Arch., 2016

Universal Obfuscation and Witness Encryption: Boosting Correctness and Combining Security.

Prabhanjan Ananth, Aayush Jain, Moni Naor, Amit Sahai, Eylon Yogev

IACR Cryptol. ePrint Arch., 2016

How to Share a Secret, Infinitely.

Ilan Komargodski, Moni Naor, Eylon Yogev

Electron. Colloquium Comput. Complex., 2016

The Journey from NP to TFNP Hardness.

Pavel Hubácek, Moni Naor, Eylon Yogev

Electron. Colloquium Comput. Complex., 2016

Spooky Interaction and its Discontents: Compilers for Succinct Two-Message Argument Systems.

Cynthia Dwork, Moni Naor, Guy N. Rothblum

Electron. Colloquium Comput. Complex., 2016

The Family Holiday Gathering Problem or Fair and Periodic Scheduling of Independent Sets.

Amihood Amir, Oren Kapah, Tsvi Kopelowitz, Moni Naor, Ely Porat

Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption.

Prabhanjan Ananth, Aayush Jain, Moni Naor, Amit Sahai, Eylon Yogev

Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

2015

Secure Physical Computation using Disposable Circuits.

Ben Fisch, Daniel Freund, Moni Naor

IACR Cryptol. ePrint Arch., 2015

Is There an Oblivious RAM Lower Bound?

Elette Boyle, Moni Naor

Electron. Colloquium Comput. Complex., 2015

Tight Bounds for Sliding Bloom Filters.

Moni Naor, Eylon Yogev

Algorithmica, 2015

Pure Differential Privacy for Rectangle Queries via Private Partitions.

Cynthia Dwork, Moni Naor, Omer Reingold, Guy N. Rothblum

Proceedings of the Advances in Cryptology - ASIACRYPT 2015 - 21st International Conference on the Theory and Application of Cryptology and Information Security, Auckland, New Zealand, November 29, 2015

2014

Fast Interactive Coding against Adversarial Noise.

Zvika Brakerski, Yael Tauman Kalai, Moni Naor

J. ACM, 2014

Primary-Secondary-Resolver Membership Proof Systems.

Moni Naor, Asaf Ziv

IACR Cryptol. ePrint Arch., 2014

Secret-Sharing for NP from Indistinguishability Obfuscation.

Ilan Komargodski, Moni Naor, Eylon Yogev

IACR Cryptol. ePrint Arch., 2014

One-Way Functions and (Im)perfect Obfuscation.

Ilan Komargodski, Tal Moran, Moni Naor, Rafael Pass, Alon Rosen, Eylon Yogev

IACR Cryptol. ePrint Arch., 2014

NSEC5: Provably Preventing DNSSEC Zone Enumeration.

Sharon Goldberg, Moni Naor, Dimitrios Papadopoulos, Leonid Reyzin, Sachin Vasant, Asaf Ziv

IACR Cryptol. ePrint Arch., 2014

Physical Zero-Knowledge Proofs of Physical Properties.

Ben Fisch, Daniel Freund, Moni Naor

Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

2013

Fast Algorithms for Interactive Coding.

Zvika Brakerski, Moni Naor

Electron. Colloquium Comput. Complex., 2013

Sliding Bloom Filters.

Moni Naor, Eylon Yogev

Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

2012

Hedged Public-key Encryption: How to Protect against Bad Randomness.

Mihir Bellare, Zvika Brakerski, Moni Naor, Thomas Ristenpart, Gil Segev, Hovav Shacham, Scott Yilek

IACR Cryptol. ePrint Arch., 2012

The Privacy of the Analyst and the Power of the State.

Cynthia Dwork, Moni Naor, Salil P. Vadhan

Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

2011

Sketching in Adversarial Environments.

Ilya Mironov, Moni Naor, Gil Segev

SIAM J. Comput., 2011

2010

Split-ballot voting: Everlasting privacy with distributed trust.

Tal Moran, Moni Naor

ACM Trans. Inf. Syst. Secur., 2010

Basing cryptographic protocols on tamper-evident seals.

Tal Moran, Moni Naor

Theor. Comput. Sci., 2010

On the Compressibility of <i>NP</i> Instances and Cryptographic Applications.

Danny Harnik, Moni Naor

SIAM J. Comput., 2010

On the Difficulties of Disclosure Prevention in Statistical Databases or The Case for Differential Privacy.

Cynthia Dwork, Moni Naor

J. Priv. Confidentiality, 2010

Efficient trace and revoke schemes.

Moni Naor, Benny Pinkas

Int. J. Inf. Sec., 2010

Games for extracting randomness.

Ran Halprin, Moni Naor

XRDS, 2010

Differential privacy under continual observation.

Cynthia Dwork, Moni Naor, Toniann Pitassi, Guy N. Rothblum

Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

Pan-Private Streaming Algorithms.

Cynthia Dwork, Moni Naor, Toniann Pitassi, Guy N. Rothblum, Sergey Yekhanin

Proceedings of the Innovations in Computer Science, 2010

Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation.

Yuriy Arbitman, Moni Naor, Gil Segev

Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

The privacy of tracing traitors.

Moni Naor

Proceedings of the 10th ACM Workshop on Digital Rights Management, 2010

2009

Deterministic History-Independent Strategies for Storing Information on Write-Once Memories.

Tal Moran, Moni Naor, Gil Segev

Theory Comput., 2009

Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles.

Ronen Gradwohl, Moni Naor, Benny Pinkas, Guy N. Rothblum

Theory Comput. Syst., 2009

The complexity of online memory checking.

Moni Naor, Guy N. Rothblum

J. ACM, 2009

Public-Key Cryptosystems Resilient to Key Leakage.

Moni Naor, Gil Segev

IACR Cryptol. ePrint Arch., 2009

Public-Key Encryption in the Bounded-Retrieval Model.

Joël Alwen, Yevgeniy Dodis, Moni Naor, Gil Segev, Shabsi Walfish, Daniel Wichs

IACR Cryptol. ePrint Arch., 2009

Derandomized Constructions of <i>k</i>-Wise (Almost) Independent Permutations.

Eyal Kaplan, Moni Naor, Omer Reingold

Algorithmica, 2009

How Efficient Can Memory Checking Be?.

Cynthia Dwork, Moni Naor, Guy N. Rothblum, Vinod Vaikuntanathan

Proceedings of the Theory of Cryptography, 6th Theory of Cryptography Conference, 2009

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

Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results.

Yuriy Arbitman, Moni Naor, Gil Segev

Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

2008

Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models.

Moni Naor, Gil Segev, Adam D. Smith

IEEE Trans. Inf. Theory, 2008

History-Independent Cuckoo Hashing.

Moni Naor, Gil Segev, Udi Wieder

IACR Cryptol. ePrint Arch., 2008

Cryptography and Game Theory: Designing Protocols for Exchanging Information.

Gillat Kol, Moni Naor

Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008

Games for exchanging information.

Gillat Kol, Moni Naor

Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008

Informational overhead of incentive compatibility.

Moshe Babaioff, Liad Blumrosen, Moni Naor, Michael Schapira

Proceedings of the Proceedings 9th ACM Conference on Electronic Commerce (EC-2008), 2008

Traitor tracing with constant size ciphertext.

Dan Boneh, Moni Naor

Proceedings of the 2008 ACM Conference on Computer and Communications Security, 2008

2007

Novel architectures for P2P applications: The continuous-discrete approach.

Moni Naor, Udi Wieder

ACM Trans. Algorithms, 2007

Implementing Huge Sparse Random Graphs.

Moni Naor, Asaf Nussboim

Proceedings of the Approximation, 2007

2006

Oblivious Polynomial Evaluation.

Moni Naor, Benny Pinkas

SIAM J. Comput., 2006

Completeness in Two-Party Secure Computation: A Computational View.

Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen

J. Cryptol., 2006

On the Compressibility of NP Instances and Cryptographic Applications.

Danny Harnik, Moni Naor

Electron. Colloquium Comput. Complex., 2006

Derandomized Constructions of k-Wise (Almost) Independent Permutations

Eyal Kaplan, Moni Naor, Omer Reingold

Electron. Colloquium Comput. Complex., 2006

Learning to impersonate.

Moni Naor, Guy N. Rothblum

Proceedings of the Machine Learning, 2006

On Everlasting Security in the <i>Hybrid</i> Bounded Storage Model.

Danny Harnik, Moni Naor

Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

Polling with Physical Envelopes: A Rigorous Analysis of a Human-Centric Protocol.

Tal Moran, Moni Naor

Proceedings of the Advances in Cryptology - EUROCRYPT 2006, 25th Annual International Conference on the Theory and Applications of Cryptographic Techniques, St. Petersburg, Russia, May 28, 2006

Our Data, Ourselves: Privacy Via Distributed Noise Generation.

Cynthia Dwork, Krishnaram Kenthapadi, Frank McSherry, Ilya Mironov, Moni Naor

Proceedings of the Advances in Cryptology - EUROCRYPT 2006, 25th Annual International Conference on the Theory and Applications of Cryptographic Techniques, St. Petersburg, Russia, May 28, 2006

Receipt-Free Universally-Verifiable Voting with Everlasting Privacy.

Tal Moran, Moni Naor

Proceedings of the Advances in Cryptology, 2006

2005

Computationally Secure Oblivious Transfer.

Moni Naor, Benny Pinkas

J. Cryptol., 2005

On fairness in the carpool problem.

Moni Naor

J. Algorithms, 2005

Scalable and dynamic quorum systems.

Moni Naor, Udi Wieder

Distributed Comput., 2005

The Dynamic And-Or Quorum System.

Uri Nadav, Moni Naor

Proceedings of the Distributed Computing, 19th International Conference, 2005

Efficiently Constructible Huge Graphs That Preserve First Order Properties of Random Graphs.

Moni Naor, Asaf Nussboim, Eran Tromer

Proceedings of the Theory of Cryptography, Second Theory of Cryptography Conference, 2005

On Robust Combiners for Oblivious Transfer and Other Primitives.

Danny Harnik, Joe Kilian, Moni Naor, Omer Reingold, Alon Rosen

Proceedings of the Advances in Cryptology, 2005

Pebbling and Proofs of Work.

Cynthia Dwork, Moni Naor, Hoeteck Wee

Proceedings of the Advances in Cryptology, 2005

2004

Number-theoretic constructions of efficient pseudo-random functions.

Moni Naor, Omer Reingold

J. ACM, 2004

Concurrent zero-knowledge.

Cynthia Dwork, Moni Naor, Amit Sahai

J. ACM, 2004

Fault-Tolerant Storage in a Dynamic Environment.

Uri Nadav, Moni Naor

Proceedings of the Distributed Computing, 18th International Conference, 2004

Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks.

Gurmeet Singh Manku, Moni Naor, Udi Wieder

Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

Know Thy Neighbor's Neighbor: Better Routing for Skip-Graphs and Small Worlds.

Moni Naor, Udi Wieder

Proceedings of the Peer-to-Peer Systems III, Third International Workshop, 2004

Immunizing Encryption Schemes from Decryption Errors.

Cynthia Dwork, Moni Naor, Omer Reingold

Proceedings of the Advances in Cryptology, 2004

2003

Nonmalleable Cryptography.

Danny Dolev, Cynthia Dwork, Moni Naor

SIAM Rev., 2003

Optimal aggregation algorithms for middleware.

Ronald Fagin, Amnon Lotem, Moni Naor

J. Comput. Syst. Sci., 2003

Magic Functions.

Cynthia Dwork, Moni Naor, Omer Reingold, Larry J. Stockmeyer

J. ACM, 2003

Protecting Cryptographic Keys: The Trace-and-Revoke Approach.

Dalit Naor, Moni Naor

Computer, 2003

A Simple Fault Tolerant Distributed Hash Table.

Moni Naor, Udi Wieder

Proceedings of the Peer-to-Peer Systems II, Second International Workshop, 2003

Moderately Hard Functions: From Complexity to Spam Fighting.

Moni Naor

Proceedings of the FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2003

On Cryptographic Assumptions and Challenges.

Moni Naor

Proceedings of the Advances in Cryptology, 2003

On Memory-Bound Functions for Fighting Spam.

Cynthia Dwork, Andrew V. Goldberg, Moni Naor

Proceedings of the Advances in Cryptology, 2003

2002

Pseudorandom Functions and Factoring.

Moni Naor, Omer Reingold, Alon Rosen

SIAM J. Comput., 2002

Constructing Pseudo-Random Permutations with a Prescribed Structure.

Moni Naor, Omer Reingold

J. Cryptol., 2002

On Chosen Ciphertext Security of Multiple Encryptions.

Oded Goldreich, Yoad Lustig, Moni Naor

IACR Cryptol. ePrint Arch., 2002

Revocation and Tracing Schemes for Stateless Receivers

Dalit Naor, Moni Naor, Jeffery Lotspiech

Electron. Colloquium Comput. Complex., 2002

Zaps and Their Applications

Cynthia Dwork, Moni Naor

Electron. Colloquium Comput. Complex., 2002

Viceroy: a scalable and dynamic emulation of the butterfly.

Dahlia Malkhi, Moni Naor, David Ratajczak

Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, 2002

Deniable Ring Authentication.

Moni Naor

Proceedings of the Advances in Cryptology, 2002

2001

On the Decisional Complexity of Problems Over the Reals.

Moni Naor, Sitvanit Ruah

Inf. Comput., 2001

Anti-persistence: History Independent Data Structures.

Moni Naor, Vanessa Teague

IACR Cryptol. ePrint Arch., 2001

Pseudo-Random Functions and Factoring

Moni Naor, Omer Reingold, Alon Rosen

Electron. Colloquium Comput. Complex., 2001

Communication Complexity and Secure Function Evaluation

Moni Naor, Kobbi Nissim

Electron. Colloquium Comput. Complex., 2001

Rank aggregation methods for the Web.

Cynthia Dwork, Ravi Kumar, Moni Naor, D. Sivakumar

Proceedings of the Tenth International World Wide Web Conference, 2001

Anti-presistence: history independent data structures.

Moni Naor, Vanessa Teague

Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

Communication preserving protocols for secure function evaluation.

Moni Naor, Kobbi Nissim

Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

Efficient oblivious transfer protocols.

Moni Naor, Benny Pinkas

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

2000

Tracing traitors.

Benny Chor, Amos Fiat, Moni Naor, Benny Pinkas

IEEE Trans. Inf. Theory, 2000

Certificate revocation and certificate update.

Moni Naor, Kobbi Nissim

IEEE J. Sel. Areas Commun., 2000

Visual cryptography for grey level images.

Carlo Blundo, Alfredo De Santis, Moni Naor

Inf. Process. Lett., 2000

Pseudo-random functions and factoring (extended abstract).

Moni Naor, Omer Reingold, Alon Rosen

Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

Timed Commitments.

Dan Boneh, Moni Naor

Proceedings of the Advances in Cryptology, 2000

Distributed Oblivious Transfer.

Moni Naor, Benny Pinkas

Proceedings of the Advances in Cryptology, 2000

1999

Rigorous Time/Space Trade-offs for Inverting Functions.

Amos Fiat, Moni Naor

SIAM J. Comput., 1999

On the Construction of Pseudorandom Permutations: Luby-Rackoff Revisited.

Moni Naor, Omer Reingold

J. Cryptol., 1999

Synthesizers and Their Application to the Parallel Construction of Pseudo-Random Functions.

Moni Naor, Omer Reingold

J. Comput. Syst. Sci., 1999

Oblivious Transfer and Polynomial Evaluation.

Moni Naor, Benny Pinkas

Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

A Formal Treatment of Remotely Keyed Encryption.

Matt Blaze, Joan Feigenbaum, Moni Naor

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Privacy preserving auctions and mechanism design.

Moni Naor, Benny Pinkas, Reuban Sumner

Proceedings of the First ACM Conference on Electronic Commerce (EC-99), 1999

Multicast Security: A Taxonomy and Some Efficient Constructions.

Ran Canetti, Juan A. Garay, Gene Itkis, Daniele Micciancio, Moni Naor, Benny Pinkas

Proceedings of the Proceedings IEEE INFOCOM '99, 1999

Distributed Pseudo-random Functions and KDCs.

Moni Naor, Benny Pinkas, Omer Reingold

Proceedings of the Advances in Cryptology, 1999

Oblivious Transfer with Adaptive Queries.

Moni Naor, Benny Pinkas

Proceedings of the Advances in Cryptology, 1999

1998

Access Control and Signatures via Quorum Secret Sharing.

Moni Naor, Avishai Wool

IEEE Trans. Parallel Distributed Syst., 1998

The Load, Capacity, and Availability of Quorum Systems.

Moni Naor, Avishai Wool

SIAM J. Comput., 1998

Perfect Zero-Knowledge Arguments for <i>NP</i> Using Any One-Way Permutation.

Moni Naor, Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yung

J. Cryptol., 1998

An Efficient Existentially Unforgeable Signature Scheme and Its Applications.

Cynthia Dwork, Moni Naor

J. Cryptol., 1998

Fairness in Scheduling

Miklós Ajtai, James Aspnes, Moni Naor, Yuval Rabani, Leonard J. Schulman, Orli Waarts

J. Algorithms, 1998

Private Information Retrieval by Keywords.

Benny Chor, Niv Gilboa, Moni Naor

IACR Cryptol. ePrint Arch., 1998

Secure Accounting and Auditing on the Web.

Moni Naor, Benny Pinkas

Comput. Networks, 1998

Secure and Efficient Metering.

Moni Naor, Benny Pinkas

Proceedings of the Advances in Cryptology - EUROCRYPT '98, International Conference on the Theory and Application of Cryptographic Techniques, Espoo, Finland, May 31, 1998

From Unpredictability to Indistinguishability: A Simple Construction of Pseudo-Random Functions from MACs (Extended Abstract).

Moni Naor, Omer Reingold

Proceedings of the Advances in Cryptology, 1998

Threshold Traitor Tracing.

Moni Naor, Benny Pinkas

Proceedings of the Advances in Cryptology, 1998

1997

Visual Authentication and Identification.

Moni Naor, Benny Pinkas

IACR Cryptol. ePrint Arch., 1997

On the Construction of Pseudo-Random Permutations: Luby-Rackoff Revisited

Moni Naor, Omer Reingold

Electron. Colloquium Comput. Complex., 1997

On the Construction of Pseudo-Random Permutations: Luby-Rackoff Revisited (Extended Abstract).

Moni Naor, Omer Reingold

Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

Does Parallel Repetition Lower the Error in Computationally Sound Protocols?

Mihir Bellare, Russell Impagliazzo, Moni Naor

Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

1996

Efficient Cryptographic Schemes Provably as Secure as Subset Sum.

Russell Impagliazzo, Moni Naor

J. Cryptol., 1996

Visual Cryptography II: Improving the Contrast Via the Cover Base.

Moni Naor, Adi Shamir

IACR Cryptol. ePrint Arch., 1996

Deniable Encryption.

Ran Canetti, Cynthia Dwork, Moni Naor, Rafail Ostrovsky

IACR Cryptol. ePrint Arch., 1996

Comparing Information Without Leaking It.

Ronald Fagin, Moni Naor, Peter Winkler

Commun. ACM, 1996

Derandomization, Witnesses for Boolean Matrix Multiplication and Construction of Perfect Hash Functions.

Noga Alon, Moni Naor

Algorithmica, 1996

Evaluation May Be Easier Than Generation (Extended Abstract).

Moni Naor

Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

Digital Signets: Self-Enforcing Protection of Digital Information (Preliminary Version).

Cynthia Dwork, Jeffrey B. Lotspiech, Moni Naor

Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

Adaptively Secure Multi-Party Computation.

Ran Canetti, Uriel Feige, Oded Goldreich, Moni Naor

Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

1995

Search Problems in the Decision Tree Model.

László Lovász, Moni Naor, Ilan Newman, Avi Wigderson

SIAM J. Discret. Math., 1995

What Can be Computed Locally?

Moni Naor, Larry J. Stockmeyer

SIAM J. Comput., 1995

Optimal File Sharing in Distributed Networks.

Moni Naor, Ron M. Roth

SIAM J. Comput., 1995

Amortized Communication Complexity.

Tomás Feder, Eyal Kushilevitz, Moni Naor, Noam Nisan

SIAM J. Comput., 1995

Local Computations on Static and Dynamic Graphs (Preliminary Version).

Alain J. Mayer, Moni Naor, Larry J. Stockmeyer

Proceedings of the Third Israel Symposium on Theory of Computing and Systems, 1995

On the Complexity of Statistical Reasoning (extended abtract).

Joe Kilian, Moni Naor

Proceedings of the Third Israel Symposium on Theory of Computing and Systems, 1995

Splitters and Near-Optimal Derandomization.

Moni Naor, Leonard J. Schulman, Aravind Srinivasan

Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

Synthesizers and Their Application to the Parallel Construction of Psuedo-Random Functions.

Moni Naor, Omer Reingold

Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

1994

The Probabilistic Method Yields Deterministic Parallel Algorithms.

Rajeev Motwani, Joseph Naor, Moni Naor

J. Comput. Syst. Sci., 1994

Checking the Correctness of Memories.

Manuel Blum, William S. Evans, Peter Gemmell, Sampath Kannan, Moni Naor

Algorithmica, 1994

A minimal model for secure computation (extended abstract).

Uriel Feige, Joe Kilian, Moni Naor

Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

Matching Nuts and Bolts.

Noga Alon, Manuel Blum, Amos Fiat, Sampath Kannan, Moni Naor, Rafail Ostrovsky

Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

Visual Cryptography.

Moni Naor, Adi Shamir

Proceedings of the Advances in Cryptology, 1994

Tracing Traitors.

Benny Chor, Amos Fiat, Moni Naor

Proceedings of the Advances in Cryptology, 1994

1993

On Dice and Coins: Models of Computation for Random Generation

David Feldman, Russell Impagliazzo, Moni Naor, Noam Nisan, Steven Rudich, Adi Shamir

Inf. Comput., June, 1993

Three results on interactive communication.

Moni Naor, Alon Orlitsky, Peter W. Shor

IEEE Trans. Inf. Theory, 1993

Small-Bias Probability Spaces: Efficient Constructions and Applications.

Joseph Naor, Moni Naor

SIAM J. Comput., 1993

Implicit O(1) Probe Search.

Amos Fiat, Moni Naor

SIAM J. Comput., 1993

Coin-Flipping Games Immune Against Linear-Sized Coalitions.

Noga Alon, Moni Naor

SIAM J. Comput., 1993

The Minimum Reservation Rate Problem in Digital Audio/Video Systems.

Nimrod Megiddo, Moni Naor, David P. Anderson

Proceedings of the Second Israel Symposium on Theory of Computing Systems, 1993

Codes for Interactive Authentication.

Peter Gemmell, Moni Naor

Proceedings of the Advances in Cryptology, 1993

Broadcast Encryption.

Amos Fiat, Moni Naor

Proceedings of the Advances in Cryptology, 1993

1992

Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs.

Noga Alon, Jehoshua Bruck, Joseph Naor, Moni Naor, Ron M. Roth

IEEE Trans. Inf. Theory, 1992

Implicit Representation of Graphs.

Sampath Kannan, Moni Naor, Steven Rudich

SIAM J. Discret. Math., 1992

On the Time and Space Complexity of Computation Using Write-Once Memory Or Is Pen Really Much Worse Than Pencil?

Sandy Irani, Moni Naor, Ronitt Rubinfeld

Math. Syst. Theory, 1992

Nonoblivious Hashing.

Amos Fiat, Moni Naor, Jeanette P. Schmidt, Alan Siegel

J. ACM, 1992

Witnesses for Boolean Matrix Multiplication and for Shortest Paths

Noga Alon, Zvi Galil, Oded Margalit, Moni Naor

Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

Fault Tolerant Graphs, Perfect Hash Functions and Disjoint Paths

Miklós Ajtai, Noga Alon, Jehoshua Bruck, Robert Cypher, Ching-Tien Ho, Moni Naor, Endre Szemerédi

Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions (Extended Abstract).

Moni Naor, Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yung

Proceedings of the Advances in Cryptology, 1992

Pricing via Processing or Combatting Junk Mail.

Cynthia Dwork, Moni Naor

Proceedings of the Advances in Cryptology, 1992

Low Communication 2-Prover Zero-Knowledge Proofs for NP.

Cynthia Dwork, Uriel Feige, Joe Kilian, Moni Naor, Shmuel Safra

Proceedings of the Advances in Cryptology, 1992

1991

A Lower Bound on Probabilistic Algorithms for Distributive Ring Coloring.

Moni Naor

SIAM J. Discret. Math., 1991

Bit Commitment Using Pseudorandomness.

Moni Naor

J. Cryptol., 1991

An Implicit Data Structure for Searching a Multikey Table in Logarithmic Time.

Amos Fiat, J. Ian Munro, Moni Naor, Alejandro A. Schäffer, Jeanette P. Schmidt, Alan Siegel

J. Comput. Syst. Sci., 1991

Rigorous Time/Space Tradeoffs for Inverting Functions

Amos Fiat, Moni Naor

Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991

Non-Malleable Cryptography (Extended Abstract)

Danny Dolev, Cynthia Dwork, Moni Naor

Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991

String Matching with Preprocessing of Text and Pattern.

Moni Naor

Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991

Optimal File Sharing in Distributed Networks (Preliminary Version)

Moni Naor, Ron M. Roth

Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

Search Problems in the Decision Tree Model (Preliminary Version)

László Lovász, Moni Naor, Ilan Newman, Avi Wigderson

Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

Amortized Communication Complexity (Preliminary Version)

Tomás Feder, Eyal Kushilevitz, Moni Naor

Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

1990

The hardness of decoding linear codes with preprocessing.

Jehoshua Bruck, Moni Naor

IEEE Trans. Inf. Theory, 1990

One-Bit Algorithms.

Amotz Bar-Noy, Joseph Naor, Moni Naor

Distributed Comput., 1990

Succinct representation of general unlabeled graphs.

Moni Naor

Discret. Appl. Math., 1990

Public-key Cryptosystems Provably Secure against Chosen Ciphertext Attacks

Moni Naor, Moti Yung

Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

Coin-Flipping Games Immune against Linear-Sized Coalitions (Extended Abstract)

Noga Alon, Moni Naor

Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

1989

Fast Parallel Algorithms for Chordal Graphs.

Joseph Naor, Moni Naor, Alejandro A. Schäffer

SIAM J. Comput., 1989

Universal One-Way Hash Functions and their Cryptographic Applications

Moni Naor, Moti Yung

Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

Bit Commitment Using Pseudo-Randomness.

Moni Naor

Proceedings of the Advances in Cryptology, 1989

1988

Storing and Searching a Multikey Table (Extended Abstract)

Amos Fiat, Moni Naor, Alejandro A. Schäffer, Jeanette P. Schmidt, Alan Siegel

Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

Non-Oblivious Hashing (Extended Abstract)

Amos Fiat, Moni Naor, Jeanette P. Schmidt, Alan Siegel

Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

Untraceable Electronic Cash.

David Chaum, Amos Fiat, Moni Naor

Proceedings of the Advances in Cryptology, 1988

Decision trees and downward closures.

Russell Impagliazzo, Moni Naor

Proceedings of the Proceedings: Third Annual Structure in Complexity Theory Conference, 1988

1987

Fast Parallel Algorithms for Chordal Graphs (Extended Abstract)

Joseph Naor, Moni Naor, Alejandro A. Schäffer

Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987