Moni Naor - RankMe

351 papers A* 115A 15B 10Misc 2Journal 173Unranked 36

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Adversarially Robust Bloom Filters: Monotonicity and Betting. IACR Commun. Cryptol. Chen Lotan, Moni Naor
2025	J	`jnl`	ColliderVM: Stateful Computation on Bitcoin without Fraud Proofs. IACR Cryptol. ePrint Arch. Victor I. Kolobov, Avihu M. Levy, Moni Naor
2025	A*	`conf`	On the Instance Optimality of Detecting Collisions and Subgraphs. ICALP Omri Ben-Eliezer, Tomer Grossman, Moni Naor
2025	A	`conf`	Shared Randomness in Locally Checkable Problems: The Role of Computational Assumptions. APPROX/RANDOM Adar Hadad, Moni Naor
2025	J	`jnl`	Shared Randomness in Locally Checkable Problems: The Role of Computational Assumptions. CoRR Adar Hadad, Moni Naor
2025	A*	`conf`	Shuffling Cards When You Are of Very Little Brain: Low Memory Generation of Permutations. FOCS Boaz Menuhin, Moni Naor
2025	J	`jnl`	Shuffling Cards When You Are of Very Little Brain: Low Memory Generation of Permutations. CoRR Boaz Menuhin, Moni Naor
2024	A*	`conf`	Adjacency Sketches in Adversarial Environments. SODA Moni Naor, Eugene Pekel
2024	A	`conf`	Are Your Keys Protected? Time Will Tell. ITC Yoav Ben Dov, Liron David, Moni Naor, Elad Tzalik
2024	J	`jnl`	Are Your Keys Protected? Time will Tell. IACR Cryptol. ePrint Arch. Yoav Ben Dov, Liron David, Moni Naor, Elad Tzalik
2024	A	`conf`	From Donkeys to Kings in Tournaments. ESA Amir Abboud, Tomer Grossman, Moni Naor, Tomer Solomon
2024	J	`jnl`	From Donkeys to Kings in Tournaments. CoRR Amir Abboud, Tomer Grossman, Moni Naor, Tomer Solomon
2024	—	`conf`	MPC for Tech Giants (GMPC): Enabling Gulliver and the Lilliputians to Cooperate Amicably. CRYPTO (8) Bar Alon, Moni Naor, Eran Omri, Uri Stemmer
2024	—	`conf`	That's Not My Signature! Fail-Stop Signatures for a Post-quantum World. CRYPTO (1) Cecilia Boschini, Hila Dahari, Moni Naor, Eyal Ronen
2023	J	`jnl`	Adjacency Sketches in Adversarial Environments. CoRR Moni Naor, Eugene Pekel
2023	J	`jnl`	Does Prior Knowledge Help Detect Collisions? CoRR Omri Ben-Eliezer, Tomer Grossman, Moni Naor
2023	J	`jnl`	Does Prior Knowledge Help Detect Collisions? Electron. Colloquium Comput. Complex. Omri Ben-Eliezer, Tomer Grossman, Moni Naor
2023	J	`jnl`	Mirror games against an open book player. Theor. Comput. Sci. Roey Magen, Moni Naor
2023	—	`conf`	New Algorithms and Applications for Risk-Limiting Audits. FORC Bar Karov, Moni Naor
2023	J	`jnl`	New Algorithms and Applications for Risk-Limiting Audits. CoRR Bar Karov, Moni Naor
2023	A*	`conf`	Private Everlasting Prediction. NeurIPS Moni Naor, Kobbi Nissim, Uri Stemmer, Chao Yan
2023	J	`jnl`	Private Everlasting Prediction. CoRR Moni Naor, Kobbi Nissim, Uri Stemmer, Chao Yan
2023	—	`conf`	Resistance to Timing Attacks for Sampling and Privacy Preserving Schemes. FORC Yoav Ben Dov, Liron David, Moni Naor, Elad Tzalik
2023	J	`jnl`	That's not my signature! Fail-stop signatures for a post-quantum world. IACR Cryptol. ePrint Arch. Cecilia Boschini, Hila Dahari, Moni Naor, Eyal Ronen
2022	—	`conf`	Bet-or-Pass: Adversarially Robust Bloom Filters. TCC (2) Moni Naor, Noa Oved
2022	J	`jnl`	Bet-or-Pass: Adversarially Robust Bloom Filters. IACR Cryptol. ePrint Arch. Moni Naor, Noa Oved
2022	—	`conf`	CHIP and CRISP: Protecting All Parties Against Compromise Through Identity-Binding PAKEs. CRYPTO (2) Cas Cremers, Moni Naor, Shahar Paz, Eyal Ronen
2022	A	`conf`	Keep That Card in Mind: Card Guessing with Limited Memory. ITCS Boaz Menuhin, Moni Naor
2022	—	`conf`	Low Communication Complexity Protocols, Collision Resistant Hash Functions and Secret Key-Agreement Protocols. CRYPTO (3) Shahar P. Cohen, Moni Naor
2022	J	`jnl`	Low Communication Complexity Protocols, Collision Resistant Hash Functions and Secret Key-Agreement Protocols. IACR Cryptol. ePrint Arch. Shahar P. Cohen, Moni Naor
2022	J	`jnl`	MPC for Tech Giants (GMPC): Enabling Gulliver and the Lilliputians to Cooperate Amicably. CoRR Bar Alon, Moni Naor, Eran Omri, Uri Stemmer
2022	J	`jnl`	MPC for Tech Giants (GMPC): Enabling Gulliver and the Lilliputians to Cooperate Amicably. IACR Cryptol. ePrint Arch. Bar Alon, Moni Naor, Eran Omri, Uri Stemmer
2022	Misc	`conf`	Mirror Games Against an Open Book Player. FUN Roey Magen, Moni Naor
2022	J	`jnl`	Mirror Games Against an Open Book Player. CoRR Roey Magen, Moni Naor
2022	J	`jnl`	One-Way Functions and (Im)perfect Obfuscation. SIAM J. Comput. Ilan Komargodski, Tal Moran, Moni Naor, Rafael Pass, Alon Rosen, Eylon Yogev
2021	J	`jnl`	Adversarial Laws of Large Numbers and Optimal Regret in Online Classification. CoRR Noga Alon, Omri Ben-Eliezer, Yuval Dagan, Shay Moran, Moni Naor, Eylon Yogev
2021	A*	`conf`	Adversarial laws of large numbers and optimal regret in online classification. STOC Noga Alon, Omri Ben-Eliezer, Yuval Dagan, Shay Moran, Moni Naor, Eylon Yogev
2021	J	`jnl`	Hardness-Preserving Reductions via Cuckoo Hashing. CoRR Itay Berman, Iftach Haitner, Ilan Komargodski, Moni Naor
2021	J	`jnl`	Keep That Card in Mind: Card Guessing with Limited Memory. CoRR Boaz Menuhin, Moni Naor
2021	J	`jnl`	Keep That Card in Mind: Card Guessing with Limited Memory. Electron. Colloquium Comput. Complex. Boaz Menuhin, Moni Naor
2021	J	`jnl`	Searchable Symmetric Encryption: Optimal Locality in Linear Space via Two-Dimensional Balanced Allocations. SIAM J. Comput. Gilad Asharov, Moni Naor, Gil Segev, Ido Shahaf
2020	J	`jnl`	CRISP: Compromise Resilient Identity-based Symmetric PAKE. IACR Cryptol. ePrint Arch. Moni Naor, Shahar Paz, Eyal Ronen
2020	—	`conf`	Can Two Walk Together: Privacy Enhancing Methods and Preventing Tracking of Users. FORC Moni Naor, Neil Vexler
2020	J	`jnl`	Can Two Walk Together: Privacy Enhancing Methods and Preventing Tracking of Users. CoRR Moni Naor, Neil Vexler
2020	A	`conf`	Instance Complexity and Unlabeled Certificates in the Decision Tree Model. ITCS Tomer Grossman, Ilan Komargodski, Moni Naor
2020	A	`conf`	Out-Of-Band Authenticated Group Key Exchange: From Strong Authentication to Immediate Key Delivery. ITC Moni Naor, Lior Rotem, Gil Segev
2020	A*	`conf`	Privately Learning Thresholds: Closing the Exponential Gap. COLT Haim Kaplan, Katrina Ligett, Yishay Mansour, Moni Naor, Uri Stemmer
2020	A*	`conf`	The Power of Distributed Verifiers in Interactive Proofs. SODA Moni Naor, Merav Parter, Eylon Yogev
2020	J	`jnl`	The Security of Lazy Users in Out-of-Band Authentication. ACM Trans. Priv. Secur. Moni Naor, Lior Rotem, Gil Segev
2019	J	`jnl`	Bloom Filters in Adversarial Environments. ACM Trans. Algorithms Moni Naor, Eylon Yogev
2019	J	`jnl`	Hardness-Preserving Reductions via Cuckoo Hashing. J. Cryptol. Itay Berman, Iftach Haitner, Ilan Komargodski, Moni Naor
2019	A*	`conf`	How to (not) Share a Password: Privacy Preserving Protocols for Finding Heavy Hitters with Adversarial Behavior. CCS Moni Naor, Benny Pinkas, Eyal Ronen
2019	—	`conf`	Incrementally Verifiable Computation via Incremental PCPs. TCC (2) Moni Naor, Omer Paneth, Guy N. Rothblum
2019	J	`jnl`	Incrementally Verifiable Computation via Incremental PCPs. IACR Cryptol. ePrint Arch. Moni Naor, Omer Paneth, Guy N. Rothblum
2019	J	`jnl`	Instance Complexity and Unlabeled Certificates in the Decision Tree Model. Electron. Colloquium Comput. Complex. Tomer Grossman, Ilan Komargodski, Moni Naor
2019	J	`jnl`	Out-of-Band Authenticated Group Key Exchange: From Strong Authentication to Immediate Key Delivery. IACR Cryptol. ePrint Arch. Moni Naor, Lior Rotem, Gil Segev
2019	J	`jnl`	Privately Learning Thresholds: Closing the Exponential Gap. CoRR Haim Kaplan, Katrina Ligett, Yishay Mansour, Moni Naor, Uri Stemmer
2019	J	`jnl`	White-Box vs. Black-Box Complexity of Search Problems: Ramsey and Graph Property Testing. J. ACM Ilan Komargodski, Moni Naor, Eylon Yogev
2018	—	`conf`	Collision Resistant Hashing for Paranoids: Dealing with Multiple Collisions. EUROCRYPT (2) Ilan Komargodski, Moni Naor, Eylon Yogev
2018	J	`jnl`	How to (not) share a password: Privacy preserving protocols for finding heavy hitters with adversarial behavior. IACR Cryptol. ePrint Arch. Moni Naor, Benny Pinkas, Eyal Ronen
2018	J	`jnl`	How to Share a Secret, Infinitely. IEEE Trans. Inf. Theory Ilan Komargodski, Moni Naor, Eylon Yogev
2018	J	`jnl`	The Power of Distributed Verifiers in Interactive Proofs. CoRR Moni Naor, Merav Parter, Eylon Yogev
2018	J	`jnl`	The Power of Distributed Verifiers in Interactive Proofs. Electron. Colloquium Comput. Complex. Moni Naor, Merav Parter, Eylon Yogev
2018	—	`conf`	The Security of Lazy Users in Out-of-Band Authentication. TCC (2) Moni Naor, Lior Rotem, Gil Segev
2018	J	`jnl`	The Security of Lazy Users in Out-of-Band Authentication. IACR Cryptol. ePrint Arch. Moni Naor, Lior Rotem, Gil Segev
2017	J	`jnl`	Can NSEC5 be practical for DNSSEC deployments? IACR Cryptol. ePrint Arch. Dimitrios Papadopoulos, Duane Wessels, Shumon Huque, Moni Naor, Jan Vcelák, Leonid Reyzin, Sharon Goldberg
2017	J	`jnl`	Collision Resistant Hashing for Paranoids: Dealing with Multiple Collisions. IACR Cryptol. ePrint Arch. Ilan Komargodski, Moni Naor, Eylon Yogev
2017	J	`jnl`	Secret-Sharing for NP. J. Cryptol. Ilan Komargodski, Moni Naor, Eylon Yogev
2017	A	`conf`	The Journey from NP to TFNP Hardness. ITCS Pavel Hubácek, Moni Naor, Eylon Yogev
2017	A*	`conf`	White-Box vs. Black-Box Complexity of Search Problems: Ramsey and Graph Property Testing. FOCS Ilan Komargodski, Moni Naor, Eylon Yogev
2017	J	`jnl`	White-Box vs. Black-Box Complexity of Search Problems: Ramsey and Graph Property Testing. Electron. Colloquium Comput. Complex. Ilan Komargodski, Moni Naor, Eylon Yogev
2016	J	`jnl`	An Optimally Fair Coin Toss. J. Cryptol. Tal Moran, Moni Naor, Gil Segev
2016	—	`conf`	How to Share a Secret, Infinitely. TCC (B2) Ilan Komargodski, Moni Naor, Eylon Yogev
2016	J	`jnl`	How to Share a Secret, Infinitely. Electron. Colloquium Comput. Complex. Ilan Komargodski, Moni Naor, Eylon Yogev
2016	J	`jnl`	How to Share a Secret, Infinitely. IACR Cryptol. ePrint Arch. Ilan Komargodski, Moni Naor, Eylon Yogev
2016	A	`conf`	Is There an Oblivious RAM Lower Bound? ITCS Elette Boyle, Moni Naor
2016	J	`jnl`	NSEC5 from Elliptic Curves: Provably Preventing DNSSEC Zone Enumeration with Shorter Responses. IACR Cryptol. ePrint Arch. Sharon Goldberg, Moni Naor, Dimitrios Papadopoulos, Leonid Reyzin
2016	J	`jnl`	Searchable Symmetric Encryption: Optimal Locality in Linear Space via Two-Dimensional Balanced Allocations. IACR Cryptol. ePrint Arch. Gilad Asharov, Moni Naor, Gil Segev, Ido Shahaf
2016	A*	`conf`	Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations. STOC Gilad Asharov, Moni Naor, Gil Segev, Ido Shahaf
2016	—	`conf`	Spooky Interaction and Its Discontents: Compilers for Succinct Two-Message Argument Systems. CRYPTO (3) Cynthia Dwork, Moni Naor, Guy N. Rothblum
2016	J	`jnl`	Spooky Interaction and its Discontents: Compilers for Succinct Two-Message Argument Systems. Electron. Colloquium Comput. Complex. Cynthia Dwork, Moni Naor, Guy N. Rothblum
2016	J	`jnl`	Spooky Interaction and its Discontents: Compilers for Succinct Two-Message Argument Systems. IACR Cryptol. ePrint Arch. Cynthia Dwork, Moni Naor, Guy N. Rothblum
2016	B	`conf`	The Family Holiday Gathering Problem or Fair and Periodic Scheduling of Independent Sets. SPAA Amihood Amir, Oren Kapah, Tsvi Kopelowitz, Moni Naor, Ely Porat
2016	J	`jnl`	The Journey from NP to TFNP Hardness. Electron. Colloquium Comput. Complex. Pavel Hubácek, Moni Naor, Eylon Yogev
2016	—	`conf`	Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption. CRYPTO (2) Prabhanjan Ananth, Aayush Jain, Moni Naor, Amit Sahai, Eylon Yogev
2016	J	`jnl`	Universal Obfuscation and Witness Encryption: Boosting Correctness and Combining Security. IACR Cryptol. ePrint Arch. Prabhanjan Ananth, Aayush Jain, Moni Naor, Amit Sahai, Eylon Yogev
2016	J	`jnl`	When Can Limited Randomness Be Used in Repeated Games? Theory Comput. Syst. Pavel Hubácek, Moni Naor, Jonathan R. Ullman
2015	—	`conf`	Bloom Filters in Adversarial Environments. CRYPTO (2) Moni Naor, Eylon Yogev
2015	J	`jnl`	Bloom Filters in Adversarial Environments. IACR Cryptol. ePrint Arch. Moni Naor, Eylon Yogev
2015	J	`jnl`	Is There an Oblivious RAM Lower Bound? Electron. Colloquium Comput. Complex. Elette Boyle, Moni Naor
2015	J	`jnl`	Is There an Oblivious RAM Lower Bound? IACR Cryptol. ePrint Arch. Elette Boyle, Moni Naor
2015	A*	`conf`	NSEC5: Provably Preventing DNSSEC Zone Enumeration. NDSS Sharon Goldberg, Moni Naor, Dimitrios Papadopoulos, Leonid Reyzin, Sachin Vasant, Asaf Ziv
2015	—	`conf`	Primary-Secondary-Resolver Membership Proof Systems. TCC (2) Moni Naor, Asaf Ziv
2015	—	`conf`	Pure Differential Privacy for Rectangle Queries via Private Partitions. ASIACRYPT (2) Cynthia Dwork, Moni Naor, Omer Reingold, Guy N. Rothblum
2015	—	`conf`	Secure Physical Computation Using Disposable Circuits. TCC (1) Ben A. Fisch, Daniel Freund, Moni Naor
2015	J	`jnl`	Secure Physical Computation using Disposable Circuits. IACR Cryptol. ePrint Arch. Ben Fisch, Daniel Freund, Moni Naor
2015	J	`jnl`	Tight Bounds for Sliding Bloom Filters. Algorithmica Moni Naor, Eylon Yogev
2015	B	`conf`	When Can Limited Randomness Be Used in Repeated Games? SAGT Pavel Hubácek, Moni Naor, Jonathan R. Ullman
2015	J	`jnl`	When Can Limited Randomness Be Used in Repeated Games? CoRR Pavel Hubácek, Moni Naor, Jonathan R. Ullman
2014	J	`jnl`	Bloom Filters in Adversarial Environments. CoRR Moni Naor, Eylon Yogev
2014	J	`jnl`	Fast Interactive Coding against Adversarial Noise. J. ACM Zvika Brakerski, Yael Tauman Kalai, Moni Naor
2014	A	`ed.`	Innovations in Theoretical Computer Science, ITCS'14, Princeton, NJ, USA, January 12-14, 2014 ITCS Moni Naor
2014	J	`jnl`	NSEC5: Provably Preventing DNSSEC Zone Enumeration. IACR Cryptol. ePrint Arch. Sharon Goldberg, Moni Naor, Dimitrios Papadopoulos, Leonid Reyzin, Sachin Vasant, Asaf Ziv
2014	A*	`conf`	One-Way Functions and (Im)Perfect Obfuscation. FOCS Ilan Komargodski, Tal Moran, Moni Naor, Rafael Pass, Alon Rosen, Eylon Yogev
2014	J	`jnl`	One-Way Functions and (Im)perfect Obfuscation. IACR Cryptol. ePrint Arch. Ilan Komargodski, Tal Moran, Moni Naor, Rafael Pass, Alon Rosen, Eylon Yogev
2014	—	`conf`	Physical Zero-Knowledge Proofs of Physical Properties. CRYPTO (2) Ben Fisch, Daniel Freund, Moni Naor
2014	J	`jnl`	Primary-Secondary-Resolver Membership Proof Systems. IACR Cryptol. ePrint Arch. Moni Naor, Asaf Ziv
2014	J	`jnl`	Secret-Sharing for NP from Indistinguishability Obfuscation. CoRR Ilan Komargodski, Moni Naor, Eylon Yogev
2014	J	`jnl`	Secret-Sharing for NP from Indistinguishability Obfuscation. IACR Cryptol. ePrint Arch. Ilan Komargodski, Moni Naor, Eylon Yogev
2014	—	`conf`	Secret-Sharing for NP. ASIACRYPT (2) Ilan Komargodski, Moni Naor, Eylon Yogev
2014	J	`jnl`	The Family Holiday Gathering Problem or Fair and Periodic Scheduling of Independent Sets. CoRR Amihood Amir, Oren Kapah, Tsvi Kopelowitz, Moni Naor, Ely Porat
2013	A*	`conf`	Fast Algorithms for Interactive Coding. SODA Zvika Brakerski, Moni Naor
2013	J	`jnl`	Fast Algorithms for Interactive Coding. Electron. Colloquium Comput. Complex. Zvika Brakerski, Moni Naor
2013	B	`conf`	Hardness Preserving Reductions via Cuckoo Hashing. TCC Itay Berman, Iftach Haitner, Ilan Komargodski, Moni Naor
2013	J	`jnl`	Sliding Bloom Filters CoRR Moni Naor, Eylon Yogev
2013	B	`conf`	Sliding Bloom Filters. ISAAC Moni Naor, Eylon Yogev
2012	J	`jnl`	Hardness Preserving Reductions via Cuckoo Hashing. Electron. Colloquium Comput. Complex. Itay Berman, Iftach Haitner, Ilan Komargodski, Moni Naor
2012	J	`jnl`	Hardness Preserving Reductions via Cuckoo Hashing. IACR Cryptol. ePrint Arch. Itay Berman, Iftach Haitner, Ilan Komargodski, Moni Naor
2012	J	`jnl`	Hedged Public-key Encryption: How to Protect against Bad Randomness. IACR Cryptol. ePrint Arch. Mihir Bellare, Zvika Brakerski, Moni Naor, Thomas Ristenpart, Gil Segev, Hovav Shacham, Scott Yilek
2012	J	`jnl`	Public-Key Cryptosystems Resilient to Key Leakage. SIAM J. Comput. Moni Naor, Gil Segev
2012	A*	`conf`	The Privacy of the Analyst and the Power of the State. FOCS Cynthia Dwork, Moni Naor, Salil P. Vadhan
2011	J	`jnl`	Sketching in Adversarial Environments. SIAM J. Comput. Ilya Mironov, Moni Naor, Gil Segev
2010	A*	`conf`	Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation. FOCS Yuriy Arbitman, Moni Naor, Gil Segev
2010	J	`jnl`	Basing cryptographic protocols on tamper-evident seals. Theor. Comput. Sci. Tal Moran, Moni Naor
2010	A*	`conf`	Differential privacy under continual observation. STOC Cynthia Dwork, Moni Naor, Toniann Pitassi, Guy N. Rothblum
2010	J	`jnl`	Efficient trace and revoke schemes. Int. J. Inf. Sec. Moni Naor, Benny Pinkas
2010	J	`jnl`	Games for extracting randomness. XRDS Ran Halprin, Moni Naor
2010	J	`jnl`	On the Compressibility of SIAM J. Comput. Danny Harnik, Moni Naor
2010	J	`jnl`	On the Difficulties of Disclosure Prevention in Statistical Databases or The Case for Differential Privacy. J. Priv. Confidentiality Cynthia Dwork, Moni Naor
2010	A	`conf`	Pan-Private Streaming Algorithms. ICS Cynthia Dwork, Moni Naor, Toniann Pitassi, Guy N. Rothblum, Sergey Yekhanin
2010	A*	`conf`	Public-Key Encryption in the Bounded-Retrieval Model. EUROCRYPT Joël Alwen, Yevgeniy Dodis, Moni Naor, Gil Segev, Shabsi Walfish, Daniel Wichs
2010	J	`jnl`	Split-ballot voting: Everlasting privacy with distributed trust. ACM Trans. Inf. Syst. Secur. Tal Moran, Moni Naor
2010	—	`conf`	The privacy of tracing traitors. Digital Rights Management Workshop Moni Naor
2009	B	`conf`	An Optimally Fair Coin Toss. TCC Tal Moran, Moni Naor, Gil Segev
2009	J	`jnl`	An Optimally Fair Coin Toss. IACR Cryptol. ePrint Arch. Tal Moran, Moni Naor, Gil Segev
2009	J	`jnl`	Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation CoRR Yuriy Arbitman, Moni Naor, Gil Segev
2009	J	`jnl`	Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles. Theory Comput. Syst. Ronen Gradwohl, Moni Naor, Benny Pinkas, Guy N. Rothblum
2009	J	`jnl`	De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results CoRR Yuriy Arbitman, Moni Naor, Gil Segev
2009	—	`conf`	De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results. ICALP (1) Yuriy Arbitman, Moni Naor, Gil Segev
2009	J	`jnl`	Derandomized Constructions of Algorithmica Eyal Kaplan, Moni Naor, Omer Reingold
2009	J	`jnl`	Deterministic History-Independent Strategies for Storing Information on Write-Once Memories. Theory Comput. Tal Moran, Moni Naor, Gil Segev
2009	A	`conf`	Games for extracting randomness. SOUPS Ran Halprin, Moni Naor
2009	A	`conf`	Hedged Public-Key Encryption: How to Protect against Bad Randomness. ASIACRYPT Mihir Bellare, Zvika Brakerski, Moni Naor, Thomas Ristenpart, Gil Segev, Hovav Shacham, Scott Yilek
2009	B	`conf`	How Efficient Can Memory Checking Be?. TCC Cynthia Dwork, Moni Naor, Guy N. Rothblum, Vinod Vaikuntanathan
2009	A*	`conf`	On the complexity of differentially private data release: efficient algorithms and hardness results. STOC Cynthia Dwork, Moni Naor, Omer Reingold, Guy N. Rothblum, Salil P. Vadhan
2009	A*	`conf`	Public-Key Cryptosystems Resilient to Key Leakage. CRYPTO Moni Naor, Gil Segev
2009	J	`jnl`	Public-Key Cryptosystems Resilient to Key Leakage. IACR Cryptol. ePrint Arch. Moni Naor, Gil Segev
2009	J	`jnl`	Public-Key Encryption in the Bounded-Retrieval Model. IACR Cryptol. ePrint Arch. Joël Alwen, Yevgeniy Dodis, Moni Naor, Gil Segev, Shabsi Walfish, Daniel Wichs
2009	J	`jnl`	The complexity of online memory checking. J. ACM Moni Naor, Guy N. Rothblum
2008	B	`conf`	Cryptography and Game Theory: Designing Protocols for Exchanging Information. TCC Gillat Kol, Moni Naor
2008	A*	`conf`	Games for exchanging information. STOC Gillat Kol, Moni Naor
2008	—	`conf`	History-Independent Cuckoo Hashing. ICALP (2) Moni Naor, Gil Segev, Udi Wieder
2008	J	`jnl`	History-Independent Cuckoo Hashing. IACR Cryptol. ePrint Arch. Moni Naor, Gil Segev, Udi Wieder
2008	A*	`conf`	Informational overhead of incentive compatibility. EC Moshe Babaioff, Liad Blumrosen, Moni Naor, Michael Schapira
2008	A*	`conf`	Sketching in adversarial environments. STOC Ilya Mironov, Moni Naor, Gil Segev
2008	J	`jnl`	Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models. IEEE Trans. Inf. Theory Moni Naor, Gil Segev, Adam D. Smith
2008	A*	`conf`	Traitor tracing with constant size ciphertext. CCS Dan Boneh, Moni Naor
2007	A*	`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 EUROCRYPT Moni Naor
2007	Misc	`conf`	Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles. FUN Ronen Gradwohl, Moni Naor, Benny Pinkas, Guy N. Rothblum
2007	A*	`conf`	Deterministic History-Independent Strategies for Storing Information on Write-Once Memories. ICALP Tal Moran, Moni Naor, Gil Segev
2007	J	`jnl`	Deterministic History-Independent Strategies for Storing Information on Write-Once Memories. IACR Cryptol. ePrint Arch. Tal Moran, Moni Naor, Gil Segev
2007	—	`conf`	Implementing Huge Sparse Random Graphs. APPROX-RANDOM Moni Naor, Asaf Nussboim
2007	J	`jnl`	Novel architectures for P2P applications: The continuous-discrete approach. ACM Trans. Algorithms Moni Naor, Udi Wieder
2007	A*	`conf`	Split-ballot voting: everlasting privacy with distributed trust. CCS Tal Moran, Moni Naor
2007	J	`jnl`	Zaps and Their Applications. SIAM J. Comput. Cynthia Dwork, Moni Naor
2006	J	`jnl`	Completeness in Two-Party Secure Computation: A Computational View. J. Cryptol. Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen
2006	J	`jnl`	Derandomized Constructions of k-Wise (Almost) Independent Permutations Electron. Colloquium Comput. Complex. Eyal Kaplan, Moni Naor, Omer Reingold
2006	A*	`conf`	Learning to impersonate. ICML Moni Naor, Guy N. Rothblum
2006	J	`jnl`	Oblivious Polynomial Evaluation. SIAM J. Comput. Moni Naor, Benny Pinkas
2006	—	`conf`	On Everlasting Security in the ICALP (2) Danny Harnik, Moni Naor
2006	A*	`conf`	On the Compressibility of NP Instances and Cryptographic Applications. FOCS Danny Harnik, Moni Naor
2006	J	`jnl`	On the Compressibility of NP Instances and Cryptographic Applications. Electron. Colloquium Comput. Complex. Danny Harnik, Moni Naor
2006	A*	`conf`	Our Data, Ourselves: Privacy Via Distributed Noise Generation. EUROCRYPT Cynthia Dwork, Krishnaram Kenthapadi, Frank McSherry, Ilya Mironov, Moni Naor
2006	A*	`conf`	Polling with Physical Envelopes: A Rigorous Analysis of a Human-Centric Protocol. EUROCRYPT Tal Moran, Moni Naor
2006	A*	`conf`	Receipt-Free Universally-Verifiable Voting with Everlasting Privacy. CRYPTO Tal Moran, Moni Naor
2006	J	`jnl`	The Complexity of Online Memory Checking. Electron. Colloquium Comput. Complex. Moni Naor, Guy N. Rothblum
2006	J	`jnl`	The Complexity of Online Memory Checking. IACR Cryptol. ePrint Arch. Moni Naor, Guy N. Rothblum
2006	A*	`conf`	Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models. CRYPTO Moni Naor, Gil Segev, Adam D. Smith
2006	J	`jnl`	Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models. IACR Cryptol. ePrint Arch. Moni Naor, Gil Segev, Adam D. Smith
2005	A*	`conf`	Basing Cryptographic Protocols on Tamper-Evident Seals. ICALP Tal Moran, Moni Naor
2005	J	`jnl`	Computationally Secure Oblivious Transfer. J. Cryptol. Moni Naor, Benny Pinkas
2005	—	`conf`	Derandomized Constructions of k-Wise (Almost) Independent Permutations. APPROX-RANDOM Eyal Kaplan, Moni Naor, Omer Reingold
2005	B	`conf`	Efficiently Constructible Huge Graphs That Preserve First Order Properties of Random Graphs. TCC Moni Naor, Asaf Nussboim, Eran Tromer
2005	A*	`conf`	On Robust Combiners for Oblivious Transfer and Other Primitives. EUROCRYPT Danny Harnik, Joe Kilian, Moni Naor, Omer Reingold, Alon Rosen
2005	J	`jnl`	On fairness in the carpool problem. J. Algorithms Moni Naor
2005	A*	`conf`	Pebbling and Proofs of Work. CRYPTO Cynthia Dwork, Moni Naor, Hoeteck Wee
2005	J	`jnl`	Scalable and dynamic quorum systems. Distributed Comput. Moni Naor, Udi Wieder
2005	A*	`conf`	The Complexity of Online Memory Checking. FOCS Moni Naor, Guy N. Rothblum
2005	A	`conf`	The Dynamic And-Or Quorum System. DISC Uri Nadav, Moni Naor
2004	A*	`conf`	Completeness in two-party secure computation: a computational view. STOC Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen
2004	J	`jnl`	Concurrent zero-knowledge. J. ACM Cynthia Dwork, Moni Naor, Amit Sahai
2004	A	`conf`	Fault-Tolerant Storage in a Dynamic Environment. DISC Uri Nadav, Moni Naor
2004	A*	`conf`	Immunizing Encryption Schemes from Decryption Errors. EUROCRYPT Cynthia Dwork, Moni Naor, Omer Reingold
2004	—	`conf`	Know Thy Neighbor's Neighbor: Better Routing for Skip-Graphs and Small Worlds. IPTPS Moni Naor, Udi Wieder
2004	A*	`conf`	Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks. STOC Gurmeet Singh Manku, Moni Naor, Udi Wieder
2004	J	`jnl`	Number-theoretic constructions of efficient pseudo-random functions. J. ACM Moni Naor, Omer Reingold
2004	B	`ed.`	Theory of Cryptography, First Theory of Cryptography Conference, TCC 2004, Cambridge, MA, USA, February 19-21, 2004, Proceedings TCC Moni Naor
2003	—	`conf`	A Simple Fault Tolerant Distributed Hash Table. IPTPS Moni Naor, Udi Wieder
2003	J	`jnl`	Completeness in Two-Party Secure Computation - A Computational View Electron. Colloquium Comput. Complex. Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen
2003	J	`jnl`	Magic Functions. J. ACM Cynthia Dwork, Moni Naor, Omer Reingold, Larry J. Stockmeyer
2003	—	`conf`	Moderately Hard Functions: From Complexity to Spam Fighting. FSTTCS Moni Naor
2003	J	`jnl`	Nonmalleable Cryptography. SIAM Rev. Danny Dolev, Cynthia Dwork, Moni Naor
2003	B	`conf`	Novel architectures for P2P applications: the continuous-discrete approach. SPAA Moni Naor, Udi Wieder
2003	A*	`conf`	On Cryptographic Assumptions and Challenges. CRYPTO Moni Naor
2003	A*	`conf`	On Memory-Bound Functions for Fighting Spam. CRYPTO Cynthia Dwork, Andrew V. Goldberg, Moni Naor
2003	J	`jnl`	Optimal aggregation algorithms for middleware. J. Comput. Syst. Sci. Ronald Fagin, Amnon Lotem, Moni Naor
2003	J	`jnl`	Protecting Cryptographic Keys: The Trace-and-Revoke Approach. Computer Dalit Naor, Moni Naor
2003	A*	`conf`	Scalable and dynamic quorum systems. PODC Moni Naor, Udi Wieder
2002	J	`jnl`	Constructing Pseudo-Random Permutations with a Prescribed Structure. J. Cryptol. Moni Naor, Omer Reingold
2002	A*	`conf`	Deniable Ring Authentication. CRYPTO Moni Naor
2002	J	`jnl`	On Chosen Ciphertext Security of Multiple Encryptions. IACR Cryptol. ePrint Arch. Oded Goldreich, Yoad Lustig, Moni Naor
2002	J	`jnl`	Optimal Aggregation Algorithms for Middleware CoRR Ronald Fagin, Amnon Lotem, Moni Naor
2002	J	`jnl`	Pseudorandom Functions and Factoring. SIAM J. Comput. Moni Naor, Omer Reingold, Alon Rosen
2002	J	`jnl`	Revocation and Tracing Schemes for Stateless Receivers Electron. Colloquium Comput. Complex. Dalit Naor, Moni Naor, Jeffery Lotspiech
2002	A*	`conf`	Viceroy: a scalable and dynamic emulation of the butterfly. PODC Dahlia Malkhi, Moni Naor, David Ratajczak
2002	J	`jnl`	Zaps and Their Applications Electron. Colloquium Comput. Complex. Cynthia Dwork, Moni Naor
2001	J	`jnl`	Anti-persistence: History Independent Data Structures. IACR Cryptol. ePrint Arch. Moni Naor, Vanessa Teague
2001	A*	`conf`	Anti-presistence: history independent data structures. STOC Moni Naor, Vanessa Teague
2001	J	`jnl`	Communication Complexity and Secure Function Evaluation CoRR Moni Naor, Kobbi Nissim
2001	J	`jnl`	Communication Complexity and Secure Function Evaluation Electron. Colloquium Comput. Complex. Moni Naor, Kobbi Nissim
2001	J	`jnl`	Communication Complexity and Secure Function Evaluation. IACR Cryptol. ePrint Arch. Moni Naor, Kobbi Nissim
2001	A*	`conf`	Communication preserving protocols for secure function evaluation. STOC Moni Naor, Kobbi Nissim
2001	A*	`conf`	Constructing pseudo-random permutations with a prescribed structure. SODA Moni Naor, Omer Reingold
2001	A*	`conf`	Efficient oblivious transfer protocols. SODA Moni Naor, Benny Pinkas
2001	J	`jnl`	On the Decisional Complexity of Problems Over the Reals. Inf. Comput. Moni Naor, Sitvanit Ruah
2001	A*	`conf`	Optimal Aggregation Algorithms for Middleware. PODS Ronald Fagin, Amnon Lotem, Moni Naor
2001	J	`jnl`	Pseudo-Random Functions and Factoring Electron. Colloquium Comput. Complex. Moni Naor, Omer Reingold, Alon Rosen
2001	J	`jnl`	Pseudo-Random Functions and Factoring. IACR Cryptol. ePrint Arch. Moni Naor, Omer Reingold, Alon Rosen
2001	A*	`conf`	Rank aggregation methods for the Web. WWW Cynthia Dwork, Ravi Kumar, Moni Naor, D. Sivakumar
2001	A*	`conf`	Revocation and Tracing Schemes for Stateless Receivers. CRYPTO Dalit Naor, Moni Naor, Jeffery Lotspiech
2001	J	`jnl`	Revocation and Tracing Schemes for Stateless Receivers. IACR Cryptol. ePrint Arch. Dalit Naor, Moni Naor, Jeffrey B. Lotspiech
2000	J	`jnl`	Certificate revocation and certificate update. IEEE J. Sel. Areas Commun. Moni Naor, Kobbi Nissim
2000	J	`jnl`	Constructing Pseudo-Random Permutations with a Prescribed Structure. IACR Cryptol. ePrint Arch. Moni Naor, Omer Reingold
2000	A	`conf`	Distributed Oblivious Transfer. ASIACRYPT Moni Naor, Benny Pinkas
2000	—	`conf`	Efficient Trace and Revoke Schemes. Financial Cryptography Moni Naor, Benny Pinkas
2000	J	`jnl`	Nonmalleable Cryptography. SIAM J. Comput. Danny Dolev, Cynthia Dwork, Moni Naor
2000	A*	`conf`	Pseudo-random functions and factoring (extended abstract). STOC Moni Naor, Omer Reingold, Alon Rosen
2000	A*	`conf`	Timed Commitments. CRYPTO Dan Boneh, Moni Naor
2000	J	`jnl`	Tracing traitors. IEEE Trans. Inf. Theory Benny Chor, Amos Fiat, Moni Naor, Benny Pinkas
2000	J	`jnl`	Visual cryptography for grey level images. Inf. Process. Lett. Carlo Blundo, Alfredo De Santis, Moni Naor
2000	A*	`conf`	Zaps and Their Applications. FOCS Cynthia Dwork, Moni Naor
1999	A*	`conf`	A Formal Treatment of Remotely Keyed Encryption. SODA Matt Blaze, Joan Feigenbaum, Moni Naor
1999	J	`jnl`	Concurrent Zero-Knowledge. IACR Cryptol. ePrint Arch. Cynthia Dwork, Moni Naor, Amit Sahai
1999	A*	`conf`	Distributed Pseudo-random Functions and KDCs. EUROCRYPT Moni Naor, Benny Pinkas, Omer Reingold
1999	A*	`conf`	Magic Functions. FOCS Cynthia Dwork, Moni Naor, Omer Reingold, Larry J. Stockmeyer
1999	A*	`conf`	Multicast Security: A Taxonomy and Some Efficient Constructions. INFOCOM Ran Canetti, Juan A. Garay, Gene Itkis, Daniele Micciancio, Moni Naor, Benny Pinkas
1999	A*	`conf`	Oblivious Transfer and Polynomial Evaluation. STOC Moni Naor, Benny Pinkas
1999	A*	`conf`	Oblivious Transfer with Adaptive Queries. CRYPTO Moni Naor, Benny Pinkas
1999	J	`jnl`	On the Construction of Pseudorandom Permutations: Luby-Rackoff Revisited. J. Cryptol. Moni Naor, Omer Reingold
1999	A*	`conf`	Privacy preserving auctions and mechanism design. EC Moni Naor, Benny Pinkas, Reuban Sumner
1999	J	`jnl`	Rigorous Time/Space Trade-offs for Inverting Functions. SIAM J. Comput. Amos Fiat, Moni Naor
1999	J	`jnl`	Synthesizers and Their Application to the Parallel Construction of Pseudo-Random Functions. J. Comput. Syst. Sci. Moni Naor, Omer Reingold
1998	A*	`conf`	A Formal Treatment of Remotely Keyed Encryption. EUROCRYPT Matt Blaze, Joan Feigenbaum, Moni Naor
1998	J	`jnl`	Access Control and Signatures via Quorum Secret Sharing. IEEE Trans. Parallel Distributed Syst. Moni Naor, Avishai Wool
1998	J	`jnl`	An Efficient Existentially Unforgeable Signature Scheme and Its Applications. J. Cryptol. Cynthia Dwork, Moni Naor
1998	A*	`conf`	Certificate Revocation and Certificate Update. USENIX Security Symposium Kobbi Nissim, Moni Naor
1998	A*	`conf`	Concurrent Zero-Knowledge. STOC Cynthia Dwork, Moni Naor, Amit Sahai
1998	J	`jnl`	Fairness in Scheduling J. Algorithms Miklós Ajtai, James Aspnes, Moni Naor, Yuval Rabani, Leonard J. Schulman, Orli Waarts
1998	A*	`conf`	From Unpredictability to Indistinguishability: A Simple Construction of Pseudo-Random Functions from MACs (Extended Abstract). CRYPTO Moni Naor, Omer Reingold
1998	J	`jnl`	Perfect Zero-Knowledge Arguments for J. Cryptol. Moni Naor, Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yung
1998	J	`jnl`	Private Information Retrieval by Keywords. IACR Cryptol. ePrint Arch. Benny Chor, Niv Gilboa, Moni Naor
1998	J	`jnl`	Secure Accounting and Auditing on the Web. Comput. Networks Moni Naor, Benny Pinkas
1998	A*	`conf`	Secure and Efficient Metering. EUROCRYPT Moni Naor, Benny Pinkas
1998	J	`jnl`	The Load, Capacity, and Availability of Quorum Systems. SIAM J. Comput. Moni Naor, Avishai Wool
1998	A*	`conf`	Threshold Traitor Tracing. CRYPTO Moni Naor, Benny Pinkas
1997	A*	`conf`	Deniable Encryption. CRYPTO Ran Canetti, Cynthia Dwork, Moni Naor, Rafail Ostrovsky
1997	A*	`conf`	Does Parallel Repetition Lower the Error in Computationally Sound Protocols? FOCS Mihir Bellare, Russell Impagliazzo, Moni Naor
1997	A*	`conf`	Number-theoretic Constructions of Efficient Pseudo-random Functions. FOCS Moni Naor, Omer Reingold
1997	J	`jnl`	On the Construction of Pseudo-Random Permutations: Luby-Rackoff Revisited Electron. Colloquium Comput. Complex. Moni Naor, Omer Reingold
1997	A*	`conf`	On the Construction of Pseudo-Random Permutations: Luby-Rackoff Revisited (Extended Abstract). STOC Moni Naor, Omer Reingold
1997	A*	`conf`	Visual Authentication and Identification. CRYPTO Moni Naor, Benny Pinkas
1997	J	`jnl`	Visual Authentication and Identification. IACR Cryptol. ePrint Arch. Moni Naor, Benny Pinkas
1996	A*	`conf`	Access Control and Signatures via Quorum Secret Sharing. CCS Moni Naor, Avishai Wool
1996	J	`jnl`	Access Control and Signatures via Quorum Secret Sharing. IACR Cryptol. ePrint Arch. Moni Naor, Avishai Wool
1996	A*	`conf`	Adaptively Secure Multi-Party Computation. STOC Ran Canetti, Uriel Feige, Oded Goldreich, Moni Naor
1996	J	`jnl`	Comparing Information Without Leaking It. Commun. ACM Ronald Fagin, Moni Naor, Peter Winkler
1996	J	`jnl`	Deniable Encryption. IACR Cryptol. ePrint Arch. Ran Canetti, Cynthia Dwork, Moni Naor, Rafail Ostrovsky
1996	J	`jnl`	Derandomization, Witnesses for Boolean Matrix Multiplication and Construction of Perfect Hash Functions. Algorithmica Noga Alon, Moni Naor
1996	A*	`conf`	Digital Signets: Self-Enforcing Protection of Digital Information (Preliminary Version). STOC Cynthia Dwork, Jeffrey B. Lotspiech, Moni Naor
1996	J	`jnl`	Efficient Cryptographic Schemes Provably as Secure as Subset Sum. J. Cryptol. Russell Impagliazzo, Moni Naor
1996	A*	`conf`	Evaluation May Be Easier Than Generation (Extended Abstract). STOC Moni Naor
1996	J	`jnl`	On the Construction of Pseudo-Random Permutations: Luby-Rackoff Revisited. IACR Cryptol. ePrint Arch. Moni Naor, Omer Reingold
1996	—	`conf`	On the Decisional Complexity of Problems Over the Reals. ISTCS Moni Naor, Sitvanit Ruah
1996	—	`conf`	Visual Cryptography II: Improving the Contrast Via the Cover Base. Security Protocols Workshop Moni Naor, Adi Shamir
1996	J	`jnl`	Visual Cryptography II: Improving the Contrast Via the Cover Base. IACR Cryptol. ePrint Arch. Moni Naor, Adi Shamir
1995	J	`jnl`	Amortized Communication Complexity. SIAM J. Comput. Tomás Feder, Eyal Kushilevitz, Moni Naor, Noam Nisan
1995	A*	`conf`	Fairness in Scheduling. SODA Miklós Ajtai, James Aspnes, Moni Naor, Yuval Rabani, Leonard J. Schulman, Orli Waarts
1995	—	`conf`	Local Computations on Static and Dynamic Graphs (Preliminary Version). ISTCS Alain J. Mayer, Moni Naor, Larry J. Stockmeyer
1995	—	`conf`	On the Complexity of Statistical Reasoning (extended abtract). ISTCS Joe Kilian, Moni Naor
1995	J	`jnl`	Optimal File Sharing in Distributed Networks. SIAM J. Comput. Moni Naor, Ron M. Roth
1995	J	`jnl`	Search Problems in the Decision Tree Model. SIAM J. Discret. Math. László Lovász, Moni Naor, Ilan Newman, Avi Wigderson
1995	A*	`conf`	Splitters and Near-Optimal Derandomization. FOCS Moni Naor, Leonard J. Schulman, Aravind Srinivasan
1995	J	`jnl`	Synthesizers and Their Application to the Parallel Construction of Pseudo-random Functions Electron. Colloquium Comput. Complex. Moni Naor, Omer Reingold
1995	A*	`conf`	Synthesizers and Their Application to the Parallel Construction of Psuedo-Random Functions. FOCS Moni Naor, Omer Reingold
1995	J	`jnl`	What Can be Computed Locally? SIAM J. Comput. Moni Naor, Larry J. Stockmeyer
1994	A*	`conf`	A minimal model for secure computation (extended abstract). STOC Uriel Feige, Joe Kilian, Moni Naor
1994	A*	`conf`	An Efficient Existentially Unforgeable Signature Scheme and its Applications. CRYPTO Cynthia Dwork, Moni Naor
1994	J	`jnl`	Checking the Correctness of Memories. Algorithmica Manuel Blum, William S. Evans, Peter Gemmell, Sampath Kannan, Moni Naor
1994	A*	`conf`	Matching Nuts and Bolts. SODA Noga Alon, Manuel Blum, Amos Fiat, Sampath Kannan, Moni Naor, Rafail Ostrovsky
1994	A*	`conf`	The Load, Capacity and Availability of Quorum Systems FOCS Moni Naor, Avishai Wool
1994	J	`jnl`	The Probabilistic Method Yields Deterministic Parallel Algorithms. J. Comput. Syst. Sci. Rajeev Motwani, Joseph Naor, Moni Naor
1994	A*	`conf`	Tracing Traitors. CRYPTO Benny Chor, Amos Fiat, Moni Naor
1994	A*	`conf`	Visual Cryptography. EUROCRYPT Moni Naor, Adi Shamir
1993	A*	`conf`	Broadcast Encryption. CRYPTO Amos Fiat, Moni Naor
1993	A*	`conf`	Codes for Interactive Authentication. CRYPTO Peter Gemmell, Moni Naor
1993	J	`jnl`	Coin-Flipping Games Immune Against Linear-Sized Coalitions. SIAM J. Comput. Noga Alon, Moni Naor
1993	J	`jnl`	Implicit O(1) Probe Search. SIAM J. Comput. Amos Fiat, Moni Naor
1993	J	`jnl`	On Dice and Coins: Models of Computation for Random Generation Inf. Comput. David Feldman, Russell Impagliazzo, Moni Naor, Noam Nisan, Steven Rudich, Adi Shamir
1993	J	`jnl`	Small-Bias Probability Spaces: Efficient Constructions and Applications. SIAM J. Comput. Joseph Naor, Moni Naor
1993	—	`conf`	The Minimum Reservation Rate Problem in Digital Audio/Video Systems. ISTCS Nimrod Megiddo, Moni Naor, David P. Anderson
1993	J	`jnl`	Three results on interactive communication. IEEE Trans. Inf. Theory Moni Naor, Alon Orlitsky, Peter W. Shor
1993	A*	`conf`	What can be computed locally? STOC Moni Naor, Larry J. Stockmeyer
1992	J	`jnl`	Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs. IEEE Trans. Inf. Theory Noga Alon, Jehoshua Bruck, Joseph Naor, Moni Naor, Ron M. Roth
1992	A*	`conf`	Fault Tolerant Graphs, Perfect Hash Functions and Disjoint Paths FOCS Miklós Ajtai, Noga Alon, Jehoshua Bruck, Robert Cypher, Ching-Tien Ho, Moni Naor, Endre Szemerédi
1992	J	`jnl`	Implicit Representation of Graphs. SIAM J. Discret. Math. Sampath Kannan, Moni Naor, Steven Rudich
1992	A*	`conf`	Low Communication 2-Prover Zero-Knowledge Proofs for NP. CRYPTO Cynthia Dwork, Uriel Feige, Joe Kilian, Moni Naor, Shmuel Safra
1992	J	`jnl`	Nonoblivious Hashing. J. ACM Amos Fiat, Moni Naor, Jeanette P. Schmidt, Alan Siegel
1992	J	`jnl`	On the Time and Space Complexity of Computation Using Write-Once Memory Or Is Pen Really Much Worse Than Pencil? Math. Syst. Theory Sandy Irani, Moni Naor, Ronitt Rubinfeld
1992	A*	`conf`	Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions (Extended Abstract). CRYPTO Moni Naor, Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yung
1992	A*	`conf`	Pricing via Processing or Combatting Junk Mail. CRYPTO Cynthia Dwork, Moni Naor
1992	A*	`conf`	Witnesses for Boolean Matrix Multiplication and for Shortest Paths FOCS Noga Alon, Zvi Galil, Oded Margalit, Moni Naor
1991	J	`jnl`	A Lower Bound on Probabilistic Algorithms for Distributive Ring Coloring. SIAM J. Discret. Math. Moni Naor
1991	A*	`conf`	Amortized Communication Complexity (Preliminary Version) FOCS Tomás Feder, Eyal Kushilevitz, Moni Naor
1991	J	`jnl`	An Implicit Data Structure for Searching a Multikey Table in Logarithmic Time. J. Comput. Syst. Sci. Amos Fiat, J. Ian Munro, Moni Naor, Alejandro A. Schäffer, Jeanette P. Schmidt, Alan Siegel
1991	J	`jnl`	Bit Commitment Using Pseudorandomness. J. Cryptol. Moni Naor
1991	A*	`conf`	Checking the Correctness of Memories FOCS Manuel Blum, William S. Evans, Peter Gemmell, Sampath Kannan, Moni Naor
1991	A*	`conf`	Non-Malleable Cryptography (Extended Abstract) STOC Danny Dolev, Cynthia Dwork, Moni Naor
1991	A*	`conf`	Optimal File Sharing in Distributed Networks (Preliminary Version) FOCS Moni Naor, Ron M. Roth
1991	A*	`conf`	Rigorous Time/Space Tradeoffs for Inverting Functions STOC Amos Fiat, Moni Naor
1991	A*	`conf`	Search Problems in the Decision Tree Model (Preliminary Version) FOCS László Lovász, Moni Naor, Ilan Newman, Avi Wigderson
1991	A*	`conf`	String Matching with Preprocessing of Text and Pattern. ICALP Moni Naor
1990	A*	`conf`	Coin-Flipping Games Immune against Linear-Sized Coalitions (Extended Abstract) FOCS Noga Alon, Moni Naor
1990	J	`jnl`	One-Bit Algorithms. Distributed Comput. Amotz Bar-Noy, Joseph Naor, Moni Naor
1990	A*	`conf`	Public-key Cryptosystems Provably Secure against Chosen Ciphertext Attacks STOC Moni Naor, Moti Yung
1990	A*	`conf`	Small-bias Probability Spaces: Efficient Constructions and Applications STOC Joseph Naor, Moni Naor
1990	J	`jnl`	Succinct representation of general unlabeled graphs. Discret. Appl. Math. Moni Naor
1990	J	`jnl`	The hardness of decoding linear codes with preprocessing. IEEE Trans. Inf. Theory Jehoshua Bruck, Moni Naor
1989	A*	`conf`	Bit Commitment Using Pseudo-Randomness. CRYPTO Moni Naor
1989	A*	`conf`	Efficient Cryptographic Schemes Provably as Secure as Subset Sum FOCS Russell Impagliazzo, Moni Naor
1989	J	`jnl`	Fast Parallel Algorithms for Chordal Graphs. SIAM J. Comput. Joseph Naor, Moni Naor, Alejandro A. Schäffer
1989	A*	`conf`	Implicit O(1) Probe Search STOC Amos Fiat, Moni Naor
1989	A*	`conf`	On Dice and Coins: Models of Computation for Random Generation. ICALP David Feldman, Russell Impagliazzo, Moni Naor, Noam Nisan, Steven Rudich, Adi Shamir
1989	A*	`conf`	The Probabilistic Method Yields Deterministic Parallel Algorithms FOCS Rajeev Motwani, Joseph Naor, Moni Naor
1989	A*	`conf`	Universal One-Way Hash Functions and their Cryptographic Applications STOC Moni Naor, Moti Yung
1988	—	`conf`	Decision trees and downward closures. SCT Russell Impagliazzo, Moni Naor
1988	A*	`conf`	Implicit Representation of Graphs STOC Sampath Kannan, Moni Naor, Steven Rudich
1988	A*	`conf`	Non-Oblivious Hashing (Extended Abstract) STOC Amos Fiat, Moni Naor, Jeanette P. Schmidt, Alan Siegel
1988	A*	`conf`	One Bit Algorithms. PODC Amotz Bar-Noy, Joseph Naor, Moni Naor
1988	A*	`conf`	Storing and Searching a Multikey Table (Extended Abstract) STOC Amos Fiat, Moni Naor, Alejandro A. Schäffer, Jeanette P. Schmidt, Alan Siegel
1988	A*	`conf`	Untraceable Electronic Cash. CRYPTO David Chaum, Amos Fiat, Moni Naor
1987	A*	`conf`	Fast Parallel Algorithms for Chordal Graphs (Extended Abstract) STOC Joseph Naor, Moni Naor, Alejandro A. Schäffer