Moni Naor
Active 1987–2025
- 231
- Papers
- 34,837
- Citations
- 85
- h-index
- 174
- i10-index
Citations
Citation sources
Countries
Institutions
Fields
- Computer Science90.9%
- Engineering2.1%
- Economics, Econometrics and Finance1.5%
- Decision Sciences1.5%
- Physics and Astronomy0.9%
- Social Sciences0.9%
- Other2.2%
Topics
- Cryptography and Data Security16.9%
- Privacy-Preserving Technologies in Data7.6%
- Complexity and Algorithms in Graphs6.3%
- Cryptographic Implementations and Security4.7%
- Chaos-based Image/Signal Encryption4%
- Internet Traffic Analysis and Secure E-voting3.4%
- Other57.1%
Coauthors
- Cynthia Dwork25
- Omer Reingold20
- Benny Pinkas17
- Eylon Yogev14
- Gil Segev14
- Amos Fiat11
- Guy N. Rothblum11
- Tal Moran9
- Noga Alon8
- Udi Wieder8
- Ilan Komargodski7
- Alon Rosen6
- Joseph Naor6
- Danny Harnik5
- Alan Siegel4
- Alejandro A. Schäffer4
- Eyal Ronen4
- Jeanette P. Schmidt4
- Joe Kilian4
- Kobbi Nissim4
- Moti Yung4
- Rafail Ostrovsky4
- Russell Impagliazzo4
- Sampath Kannan4
All papers
- Our Data, Ourselves: Privacy Via Distributed Noise Generation
Authors: Cynthia Dwork, Krishnaram Kenthapadi, Frank McSherry, Ilya Mironov, Moni Naor - Lecture notes in computer science, EUROCRYPT 2006 cited by 1,802
- Differential privacy under continual observation
Authors: Cynthia Dwork, Moni Naor, Toniann Pitassi, Guy N. Rothblum - forty-second ACM symposium on Theory of computing, STOC 2010 cited by 585
- Pricing via Processing or Combatting Junk Mail
Authors: Cynthia Dwork, Moni Naor - Lecture notes in computer science, CRYPTO 1992 cited by 1,286
- Public-key Cryptosystems Provably Secure against Chosen Ciphertext Attacks
Authors: Moni Naor, Moti Yung - twenty-second annual ACM symposium on Theory of computing - STOC '90 1990 cited by 1,088
- Rank aggregation methods for the Web
Authors: Cynthia Dwork, Ravi Kumar, Moni Naor, D. Sivakumar - conference on World Wide Web, WWW 2001 cited by 1,823
- Privacy preserving auctions and mechanism design
Authors: Moni Naor, Benny Pinkas, Reuban Sumner - conference on Electronic commerce 1999 cited by 764
- Adaptively Secure Multi-Party Computation
Authors: Ran Canetti, Uriel Feige, Oded Goldreich, Moni Naor - twenty-eighth annual ACM symposium on Theory of computing - STOC '96 1996 cited by 553
- Number-theoretic Constructions of Efficient Pseudo-random Functions
Authors: Moni Naor, Omer Reingold - Journal of the ACM, FOCS 1997 cited by 369
- Bit Commitment Using Pseudorandomness
Authors: Moni Naor - Journal of Cryptology, J. Cryptol. 1991 cited by 815
- On Cryptographic Assumptions and Challenges
Authors: Moni Naor - Lecture notes in computer science, CRYPTO 2003 cited by 354
- On the complexity of differentially private data release: efficient algorithms and hardness results
Authors: Cynthia Dwork, Moni Naor, Omer Reingold, Guy N. Rothblum, Salil P. Vadhan - forty-first annual ACM symposium on Theory of computing, STOC 2009 cited by 381
- Timed Commitments
Authors: Dan Boneh, Moni Naor - Lecture notes in computer science, CRYPTO 2000 cited by 307
- Oblivious Transfer and Polynomial Evaluation
Authors: Moni Naor, Benny Pinkas - thirty-first annual ACM symposium on Theory of Computing, STOC 1999 cited by 630
- What Can be Computed Locally?
Authors: Moni Naor, Larry J. Stockmeyer - twenty-fifth annual ACM symposium on Theory of computing - STOC '93, SIAM J. Comput. 1993 cited by 317
- Untraceable Electronic Cash
Authors: David Chaum, Amos Fiat, Moni Naor - Lecture notes in computer science, CRYPTO 1988 cited by 1,116
- Universal One-Way Hash Functions and their Cryptographic Applications
Authors: Moni Naor, Moti Yung - twenty-first annual ACM symposium on Theory of computing - STOC '89 1989 cited by 968
- Distributed Pseudo-random Functions and KDCs
Authors: Moni Naor, Benny Pinkas, Omer Reingold - Lecture notes in computer science, EUROCRYPT 1999 cited by 203
- Non-Malleable Cryptography (Extended Abstract)
Authors: Danny Dolev, Cynthia Dwork, Moni Naor - twenty-third annual ACM symposium on Theory of computing - STOC '91 1991 cited by 994
- Optimal Aggregation Algorithms for Middleware
Authors: Ronald Fagin, Amnon Lotem, Moni Naor - Journal of Computer and System Sciences, J. Comput. Syst. Sci. 2001 cited by 1,084
- Splitters and Near-Optimal Derandomization
Authors: Moni Naor, Leonard J. Schulman, Aravind Srinivasan - Annual Foundations of Computer Science, FOCS 1995 cited by 306
- A minimal model for secure computation (extended abstract)
Authors: Uri Feige, J. L. Killian, Moni Naor - twenty-sixth annual ACM symposium on Theory of computing - STOC '94 1994 cited by 255
- Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation
Authors: Yuriy Arbitman, Moni Naor, Gil Segev - IEEE 51st Annual Symposium on Foundations of Computer Science, FOCS 2010 cited by 104
- Oblivious Polynomial Evaluation
Authors: Moni Naor, Benny Pinkas - SIAM Journal on Computing, SIAM J. Comput. 2006 cited by 145
- Bit Commitment Using Pseudo-Randomness
Authors: Moni Naor - Lecture notes in computer science, CRYPTO 1989 cited by 207
