Moni Naor

35.0k total citations · 3 hit papers
168 papers, 11.3k citations indexed

About

Moni Naor is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Moni Naor has authored 168 papers receiving a total of 11.3k indexed citations (citations by other indexed papers that have themselves been cited), including 130 papers in Artificial Intelligence, 74 papers in Computational Theory and Mathematics and 40 papers in Computer Networks and Communications. Recurrent topics in Moni Naor's work include Cryptography and Data Security (94 papers), Complexity and Algorithms in Graphs (64 papers) and Cryptographic Implementations and Security (20 papers). Moni Naor is often cited by papers focused on Cryptography and Data Security (94 papers), Complexity and Algorithms in Graphs (64 papers) and Cryptographic Implementations and Security (20 papers). Moni Naor collaborates with scholars based in Israel, United States and United Kingdom. Moni Naor's co-authors include Cynthia Dwork, Benny Pinkas, Ronald Fagin, Amnon Lotem, Moti Yung, D. Sivakumar, Ravi Kumar, Joseph Naor, Omer Reingold and Danny Dolev and has published in prestigious journals such as SHILAP Revista de lepidopterología, IEEE Transactions on Information Theory and Communications of the ACM.

In The Last Decade

Moni Naor

166 papers receiving 10.3k citations

Hit Papers

align trajectories

What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

Rank aggregation methods for the Web

2001 1.1k citations Cynthia Dwork, Moni Naor et al. profile →
Optimal aggregation algorithms for middleware

2001 688 citations Ronald Fagin, Amnon Lotem et al. profile →
Optimal aggregation algorithms for middleware

2003 592 citations Ronald Fagin, Amnon Lotem et al. Journal of Computer and System Sciences profile →

Peers

Countries citing papers authored by Moni Naor

Since Specialization

Citations

This map shows the geographic impact of Moni Naor's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Moni Naor with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Moni Naor more than expected).

Fields of papers citing papers by Moni Naor

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Moni Naor. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Moni Naor. The network helps show where Moni Naor may publish in the future.

Co-authorship network of co-authors of Moni Naor

This figure shows the co-authorship network connecting the top 25 collaborators of Moni Naor. A scholar is included among the top collaborators of Moni Naor based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Moni Naor. Moni Naor is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

#	Work	Indexed citations
1	Can Two Walk Together: Privacy Enhancing Methods and Preventing Tracking of Users 2020 ·DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) ·Moni Naor, (unknown)	1
2	Instance Complexity and Unlabeled Certificates in the Decision Tree Model. 2019 ·(unknown), (unknown), Moni Naor	1
3	Is There an Oblivious RAM Lower Bound 2015 ·IACR Cryptology ePrint Archive ·Elette Boyle, Moni Naor	2
4	Fast algorithms for interactive coding 2013 ·Symposium on Discrete Algorithms ·Zvika Brakerski, Moni Naor	18
5	Pan-Private Streaming Algorithms 2010 ·Cynthia Dwork, Moni Naor, Toniann Pitassi, Guy N. Rothblum, Sergey Yekhanin	65
6	2009 ·Theory of Computing ·Tal Moran, Moni Naor, Gil Segev	2
7	Basing cryptographic protocols on tamper-evident seals 2009 ·Theoretical Computer Science ·Tal Moran, Moni Naor	13
8	Our Data, Ourselves: Privacy via Distributed Noise Generation 2006 ·Cynthia Dwork, Krishnaram Kenthapadi, Frank McSherry, Ilya Mironov, Moni Naor	2
9	Optimal aggregation algorithms for middleware breakdown → 2003 ·Journal of Computer and System Sciences ·Ronald Fagin, Amnon Lotem, Moni Naor	592
10	Constructing pseudo-random permutations with a prescribed structure 2001 ·Symposium on Discrete Algorithms ·Moni Naor, Omer Reingold	1
11	Efficient oblivious transfer protocols 2001 ·Symposium on Discrete Algorithms ·Moni Naor, Benny Pinkas	275
12	Cryptography and mechanism design 2001 ·Moni Naor	2
13	Synthesizers and Their Application to the Parallel Construction of Pseudo-Random Functions 1999 ·Journal of Computer and System Sciences ·Moni Naor, Omer Reingold	43
14	Threshold Traitor Tracing 1998 ·Moni Naor, Benny Pinkas	7
15	Private Information Retrieval by Keywords. 1998 ·IACR Cryptology ePrint Archive ·Benny Chor, Niv Gilboa, Moni Naor	85
16	Tracing Traitors 1994 ·Benny Chor, Amos Fiat, Moni Naor	215
17	Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions (Extended Abstract) 1992 ·Moni Naor, Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yung	12
18	Succinct representation of general unlabeled graphs 1990 ·Discrete Applied Mathematics ·Moni Naor	36
19	Bit commitment using pseudo-randomness (extended abstract) 1989 ·Moni Naor	10
20	Storing and Searching a Multikey Table (Extended Abstract) 1988 ·Amos Fiat, Moni Naor, Alejandro A. Schäffer, Jeanette P. Schmidt, Alan Siegel	1

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact