Moni Naor

ORCID

Publication Activity (10 Years)

Years Active: 1987-2023
Publications (10 Years): 85

Top Venues

IACR Cryptol. ePrint Arch.

CoRR

Electron. Colloquium Comput. Complex.

TCC (2)

Publications

Moni Naor, Kobbi Nissim, Uri Stemmer, Chao Yan
Private Everlasting Prediction. CoRR (2023)
Omri Ben-Eliezer, Tomer Grossman, Moni Naor
Does Prior Knowledge Help Detect Collisions? CoRR (2023)
Omri Ben-Eliezer, Tomer Grossman, Moni Naor
Does Prior Knowledge Help Detect Collisions? Electron. Colloquium Comput. Complex. (2023)
Bar Karov, Moni Naor
New Algorithms and Applications for Risk-Limiting Audits. FORC (2023)
Bar Karov, Moni Naor
New Algorithms and Applications for Risk-Limiting Audits. CoRR (2023)
Moni Naor, Eugene Pekel
Adjacency Sketches in Adversarial Environments. CoRR (2023)
Roey Magen, Moni Naor
Mirror games against an open book player. Theor. Comput. Sci. 976 (2023)
Cecilia Boschini, Hila Dahari, Moni Naor, Eyal Ronen
That's not my signature! Fail-stop signatures for a post-quantum world. IACR Cryptol. ePrint Arch. 2023 (2023)
Yoav Ben Dov, Liron David, Moni Naor, Elad Tzalik
Resistance to Timing Attacks for Sampling and Privacy Preserving Schemes. FORC (2023)
Moni Naor, Kobbi Nissim, Uri Stemmer, Chao Yan
Private Everlasting Prediction. NeurIPS (2023)
Roey Magen, Moni Naor
Mirror Games Against an Open Book Player. FUN (2022)
Shahar P. Cohen, Moni Naor
Low Communication Complexity Protocols, Collision Resistant Hash Functions and Secret Key-Agreement Protocols. IACR Cryptol. ePrint Arch. 2022 (2022)
Roey Magen, Moni Naor
Mirror Games Against an Open Book Player. CoRR (2022)
Bar Alon, Moni Naor, Eran Omri, Uri Stemmer
MPC for Tech Giants (GMPC): Enabling Gulliver and the Lilliputians to Cooperate Amicably. IACR Cryptol. ePrint Arch. 2022 (2022)
Boaz Menuhin, Moni Naor
Keep That Card in Mind: Card Guessing with Limited Memory. ITCS (2022)
Cas Cremers, Moni Naor, Shahar Paz, Eyal Ronen
CHIP and CRISP: Protecting All Parties Against Compromise Through Identity-Binding PAKEs. CRYPTO (2) (2022)
Ilan Komargodski, Tal Moran, Moni Naor, Rafael Pass, Alon Rosen, Eylon Yogev
One-Way Functions and (Im)perfect Obfuscation. SIAM J. Comput. 51 (6) (2022)
Moni Naor, Noa Oved
Bet-or-Pass: Adversarially Robust Bloom Filters. IACR Cryptol. ePrint Arch. 2022 (2022)
Shahar P. Cohen, Moni Naor
Low Communication Complexity Protocols, Collision Resistant Hash Functions and Secret Key-Agreement Protocols. CRYPTO (3) (2022)
Moni Naor, Noa Oved
Bet-or-Pass: Adversarially Robust Bloom Filters. TCC (2) (2022)
Bar Alon, Moni Naor, Eran Omri, Uri Stemmer
MPC for Tech Giants (GMPC): Enabling Gulliver and the Lilliputians to Cooperate Amicably. CoRR (2022)
Boaz Menuhin, Moni Naor
Keep That Card in Mind: Card Guessing with Limited Memory. Electron. Colloquium Comput. Complex. 28 (2021)
Noga Alon, Omri Ben-Eliezer, Yuval Dagan, Shay Moran, Moni Naor, Eylon Yogev
Adversarial Laws of Large Numbers and Optimal Regret in Online Classification. CoRR (2021)
Itay Berman, Iftach Haitner, Ilan Komargodski, Moni Naor
Hardness-Preserving Reductions via Cuckoo Hashing. CoRR (2021)
Boaz Menuhin, Moni Naor
Keep That Card in Mind: Card Guessing with Limited Memory. CoRR (2021)
Noga Alon, Omri Ben-Eliezer, Yuval Dagan, Shay Moran, Moni Naor, Eylon Yogev
Adversarial laws of large numbers and optimal regret in online classification. STOC (2021)
Gilad Asharov, Moni Naor, Gil Segev, Ido Shahaf
Searchable Symmetric Encryption: Optimal Locality in Linear Space via Two-Dimensional Balanced Allocations. SIAM J. Comput. 50 (5) (2021)
Moni Naor, Merav Parter, Eylon Yogev
The Power of Distributed Verifiers in Interactive Proofs. SODA (2020)
Moni Naor, Shahar Paz, Eyal Ronen
CRISP: Compromise Resilient Identity-based Symmetric PAKE. IACR Cryptol. ePrint Arch. 2020 (2020)
Moni Naor, Neil Vexler
Can Two Walk Together: Privacy Enhancing Methods and Preventing Tracking of Users. CoRR (2020)
Haim Kaplan, Katrina Ligett, Yishay Mansour, Moni Naor, Uri Stemmer
Privately Learning Thresholds: Closing the Exponential Gap. COLT (2020)
Tomer Grossman, Ilan Komargodski, Moni Naor
Instance Complexity and Unlabeled Certificates in the Decision Tree Model. ITCS (2020)
Moni Naor, Lior Rotem, Gil Segev
The Security of Lazy Users in Out-of-Band Authentication. ACM Trans. Priv. Secur. 23 (2) (2020)
Moni Naor, Neil Vexler
Can Two Walk Together: Privacy Enhancing Methods and Preventing Tracking of Users. FORC (2020)
Moni Naor, Lior Rotem, Gil Segev
Out-Of-Band Authenticated Group Key Exchange: From Strong Authentication to Immediate Key Delivery. ITC (2020)
Moni Naor, Benny Pinkas, Eyal Ronen
How to (not) Share a Password: Privacy Preserving Protocols for Finding Heavy Hitters with Adversarial Behavior. CCS (2019)
Itay Berman, Iftach Haitner, Ilan Komargodski, Moni Naor
Hardness-Preserving Reductions via Cuckoo Hashing. J. Cryptol. 32 (2) (2019)
Haim Kaplan, Katrina Ligett, Yishay Mansour, Moni Naor, Uri Stemmer
Privately Learning Thresholds: Closing the Exponential Gap. CoRR (2019)
Moni Naor, Eylon Yogev
Bloom Filters in Adversarial Environments. ACM Trans. Algorithms 15 (3) (2019)
Tomer Grossman, Ilan Komargodski, Moni Naor
Instance Complexity and Unlabeled Certificates in the Decision Tree Model. Electron. Colloquium Comput. Complex. 26 (2019)
Moni Naor, Omer Paneth, Guy N. Rothblum
Incrementally Verifiable Computation via Incremental PCPs. IACR Cryptol. ePrint Arch. 2019 (2019)
Ilan Komargodski, Moni Naor, Eylon Yogev
White-Box vs. Black-Box Complexity of Search Problems: Ramsey and Graph Property Testing. J. ACM 66 (5) (2019)
Moni Naor, Omer Paneth, Guy N. Rothblum
Incrementally Verifiable Computation via Incremental PCPs. TCC (2) (2019)
Moni Naor, Lior Rotem, Gil Segev
Out-of-Band Authenticated Group Key Exchange: From Strong Authentication to Immediate Key Delivery. IACR Cryptol. ePrint Arch. 2019 (2019)
Moni Naor, Merav Parter, Eylon Yogev
The Power of Distributed Verifiers in Interactive Proofs. CoRR (2018)
Moni Naor, Lior Rotem, Gil Segev
The Security of Lazy Users in Out-of-Band Authentication. IACR Cryptol. ePrint Arch. 2018 (2018)
Ilan Komargodski, Moni Naor, Eylon Yogev
How to Share a Secret, Infinitely. IEEE Trans. Inf. Theory 64 (6) (2018)
Ilan Komargodski, Moni Naor, Eylon Yogev
Collision Resistant Hashing for Paranoids: Dealing with Multiple Collisions. EUROCRYPT (2) (2018)
Moni Naor, Lior Rotem, Gil Segev
The Security of Lazy Users in Out-of-Band Authentication. TCC (2) (2018)
Moni Naor, Merav Parter, Eylon Yogev
The Power of Distributed Verifiers in Interactive Proofs. Electron. Colloquium Comput. Complex. 25 (2018)
Moni Naor, Benny Pinkas, Eyal Ronen
How to (not) share a password: Privacy preserving protocols for finding heavy hitters with adversarial behavior. IACR Cryptol. ePrint Arch. 2018 (2018)
Dimitrios Papadopoulos, Duane Wessels, Shumon Huque, Moni Naor, Jan Vcelák, Leonid Reyzin, Sharon Goldberg
Can NSEC5 be practical for DNSSEC deployments? IACR Cryptol. ePrint Arch. 2017 (2017)
Ilan Komargodski, Moni Naor, Eylon Yogev
Secret-Sharing for NP. J. Cryptol. 30 (2) (2017)
Ilan Komargodski, Moni Naor, Eylon Yogev
Collision Resistant Hashing for Paranoids: Dealing with Multiple Collisions. IACR Cryptol. ePrint Arch. 2017 (2017)
Ilan Komargodski, Moni Naor, Eylon Yogev
White-Box vs. Black-Box Complexity of Search Problems: Ramsey and Graph Property Testing. FOCS (2017)
Pavel Hubácek, Moni Naor, Eylon Yogev
The Journey from NP to TFNP Hardness. ITCS (2017)
Ilan Komargodski, Moni Naor, Eylon Yogev
White-Box vs. Black-Box Complexity of Search Problems: Ramsey and Graph Property Testing. Electron. Colloquium Comput. Complex. 24 (2017)
Elette Boyle, Moni Naor
Is There an Oblivious RAM Lower Bound? ITCS (2016)
Prabhanjan Ananth, Aayush Jain, Moni Naor, Amit Sahai, Eylon Yogev
Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption. CRYPTO (2) (2016)
Cynthia Dwork, Moni Naor, Guy N. Rothblum
Spooky Interaction and its Discontents: Compilers for Succinct Two-Message Argument Systems. IACR Cryptol. ePrint Arch. 2016 (2016)
Prabhanjan Ananth, Aayush Jain, Moni Naor, Amit Sahai, Eylon Yogev
Universal Obfuscation and Witness Encryption: Boosting Correctness and Combining Security. IACR Cryptol. ePrint Arch. 2016 (2016)
Cynthia Dwork, Moni Naor, Guy N. Rothblum
Spooky Interaction and its Discontents: Compilers for Succinct Two-Message Argument Systems. Electron. Colloquium Comput. Complex. 23 (2016)
Gilad Asharov, Moni Naor, Gil Segev, Ido Shahaf
Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations. STOC (2016)
Amihood Amir, Oren Kapah, Tsvi Kopelowitz, Moni Naor, Ely Porat
The Family Holiday Gathering Problem or Fair and Periodic Scheduling of Independent Sets. SPAA (2016)
Ilan Komargodski, Moni Naor, Eylon Yogev
How to Share a Secret, Infinitely. Electron. Colloquium Comput. Complex. 23 (2016)
Ilan Komargodski, Moni Naor, Eylon Yogev
How to Share a Secret, Infinitely. IACR Cryptol. ePrint Arch. 2016 (2016)
Sharon Goldberg, Moni Naor, Dimitrios Papadopoulos, Leonid Reyzin
NSEC5 from Elliptic Curves: Provably Preventing DNSSEC Zone Enumeration with Shorter Responses. IACR Cryptol. ePrint Arch. 2016 (2016)
Gilad Asharov, Moni Naor, Gil Segev, Ido Shahaf
Searchable Symmetric Encryption: Optimal Locality in Linear Space via Two-Dimensional Balanced Allocations. IACR Cryptol. ePrint Arch. 2016 (2016)
Tal Moran, Moni Naor, Gil Segev
An Optimally Fair Coin Toss. J. Cryptol. 29 (3) (2016)
Cynthia Dwork, Moni Naor, Guy N. Rothblum
Spooky Interaction and Its Discontents: Compilers for Succinct Two-Message Argument Systems. CRYPTO (3) (2016)
Ilan Komargodski, Moni Naor, Eylon Yogev
How to Share a Secret, Infinitely. TCC (B2) (2016)
Pavel Hubácek, Moni Naor, Eylon Yogev
The Journey from NP to TFNP Hardness. Electron. Colloquium Comput. Complex. 23 (2016)
Pavel Hubácek, Moni Naor, Jonathan R. Ullman
When Can Limited Randomness Be Used in Repeated Games? Theory Comput. Syst. 59 (4) (2016)
Cynthia Dwork, Moni Naor, Omer Reingold, Guy N. Rothblum
Pure Differential Privacy for Rectangle Queries via Private Partitions. ASIACRYPT (2) (2015)
Pavel Hubácek, Moni Naor, Jonathan R. Ullman
When Can Limited Randomness Be Used in Repeated Games? SAGT (2015)
Moni Naor, Asaf Ziv
Primary-Secondary-Resolver Membership Proof Systems. TCC (2) (2015)
Sharon Goldberg, Moni Naor, Dimitrios Papadopoulos, Leonid Reyzin, Sachin Vasant, Asaf Ziv
NSEC5: Provably Preventing DNSSEC Zone Enumeration. NDSS (2015)
Elette Boyle, Moni Naor
Is There an Oblivious RAM Lower Bound? Electron. Colloquium Comput. Complex. 22 (2015)
Pavel Hubácek, Moni Naor, Jonathan R. Ullman
When Can Limited Randomness Be Used in Repeated Games? CoRR (2015)
Ben Fisch, Daniel Freund, Moni Naor
Secure Physical Computation using Disposable Circuits. IACR Cryptol. ePrint Arch. 2015 (2015)
Elette Boyle, Moni Naor
Is There an Oblivious RAM Lower Bound? IACR Cryptol. ePrint Arch. 2015 (2015)
Moni Naor, Eylon Yogev
Bloom Filters in Adversarial Environments. CRYPTO (2) (2015)
Moni Naor, Eylon Yogev
Tight Bounds for Sliding Bloom Filters. Algorithmica 73 (4) (2015)
Moni Naor, Eylon Yogev
Bloom Filters in Adversarial Environments. IACR Cryptol. ePrint Arch. 2015 (2015)
Ben A. Fisch, Daniel Freund, Moni Naor
Secure Physical Computation Using Disposable Circuits. TCC (1) (2015)
Ilan Komargodski, Tal Moran, Moni Naor, Rafael Pass, Alon Rosen, Eylon Yogev
One-Way Functions and (Im)Perfect Obfuscation. FOCS (2014)
Ilan Komargodski, Tal Moran, Moni Naor, Rafael Pass, Alon Rosen, Eylon Yogev
One-Way Functions and (Im)perfect Obfuscation. IACR Cryptol. ePrint Arch. 2014 (2014)
Ilan Komargodski, Moni Naor, Eylon Yogev
Secret-Sharing for NP. ASIACRYPT (2) (2014)
Ben Fisch, Daniel Freund, Moni Naor
Physical Zero-Knowledge Proofs of Physical Properties. CRYPTO (2) (2014)
Moni Naor, Eylon Yogev
Bloom Filters in Adversarial Environments. CoRR (2014)
Zvika Brakerski, Yael Tauman Kalai, Moni Naor
Fast Interactive Coding against Adversarial Noise. J. ACM 61 (6) (2014)
Amihood Amir, Oren Kapah, Tsvi Kopelowitz, Moni Naor, Ely Porat
The Family Holiday Gathering Problem or Fair and Periodic Scheduling of Independent Sets. CoRR (2014)
Moni Naor, Asaf Ziv
Primary-Secondary-Resolver Membership Proof Systems. IACR Cryptol. ePrint Arch. 2014 (2014)
Ilan Komargodski, Moni Naor, Eylon Yogev
Secret-Sharing for NP from Indistinguishability Obfuscation. IACR Cryptol. ePrint Arch. 2014 (2014)
Ilan Komargodski, Moni Naor, Eylon Yogev
Secret-Sharing for NP from Indistinguishability Obfuscation. CoRR (2014)
Sharon Goldberg, Moni Naor, Dimitrios Papadopoulos, Leonid Reyzin, Sachin Vasant, Asaf Ziv
NSEC5: Provably Preventing DNSSEC Zone Enumeration. IACR Cryptol. ePrint Arch. 2014 (2014)
Moni Naor, Eylon Yogev
Sliding Bloom Filters CoRR (2013)
Moni Naor, Eylon Yogev
Sliding Bloom Filters. ISAAC (2013)
Zvika Brakerski, Moni Naor
Fast Algorithms for Interactive Coding. Electron. Colloquium Comput. Complex. 20 (2013)
Zvika Brakerski, Moni Naor
Fast Algorithms for Interactive Coding. SODA (2013)

Moni Naor.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Moni Naor