Dan Boneh
Impact in
- Artificial Intelligence top 0.01%
- Cryptography and Data Security
- Privacy-Preserving Technologies in Data
- Cryptographic Implementations and Security
- Security and Verification in Computing
- Information Systems top 0.01%
- Cloud Data Security Solutions
- Cryptography and Residue Arithmetic
Papers in
-
- Cryptography and Data Security 183
- Cryptographic Implementations and Security 57
- Internet Traffic Analysis and Secure E-voting 49
- Coding theory and cryptography 40
- Privacy-Preserving Technologies in Data 35
-
- Cryptography and Residue Arithmetic 50
- Co-authors
- Matthew K. Franklin (8 shared papers)Xavier Boyen (16 shared papers)Hovav Shacham (10 shared papers)Brent R. Waters (23 shared papers)Craig Gentry (8 shared papers)Ben Lynn (3 shared papers)Eu-Jin Goh (8 shared papers)Richard J. Lipton (8 shared papers)
- Journals
- Lecture notes in computer science (114 papers)Journal of Cryptology (5 papers)Communications of the ACM (4 papers)ACM SIGPLAN Notices (2 papers)SIAM Journal on Computing (2 papers)
- Partner nations
- United StatesIsraelFrance
In The Last Decade
Dan Boneh
324 papers receiving 53.0k citations
Dan Boneh's Hit Papers
Peers
Comparison fields: 5 of 159
- Artificial Intelligence 48.1k
- Information Systems 22.7k
- Computational Theory and Mathematics 12.1k
- Computer Networks and Communications 13.3k
- Signal Processing 5.8k
Countries citing papers authored by Dan Boneh
This map shows the geographic impact of Dan Boneh'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 Dan Boneh with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Dan Boneh more than expected).
Fields of papers citing papers by Dan Boneh
This network shows the impact of papers produced by Dan Boneh. 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 Dan Boneh. The network helps show where Dan Boneh may publish in the future.
Co-authors
The 25 scholars most cited alongside Dan Boneh, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 331 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | Identity-Based Encryption from the Weil Pairing Hit paper breakdown → | 2001 | 5414 |
| 2 | Identity-Based Encryption from the Weil Pairing Hit paper breakdown → | 2003 | 2697 |
| 3 | Public Key Encryption with Keyword Search Hit paper breakdown → | 2004 | 2414 |
| 4 | Short Signatures from the Weil Pairing Hit paper breakdown → | 2001 | 2267 |
| 5 | Proceedings of the 11th USENIX Security Symposium Hit paper breakdown → | 2002 | 2233 |
| 6 | A fully homomorphic encryption scheme Hit paper breakdown → | 2009 | 1743 |
| 7 | Short Group Signatures Hit paper breakdown → | 2004 | 1594 |
| 8 | Aggregate and Verifiably Encrypted Signatures from Bilinear Maps Hit paper breakdown → | 2003 | 1420 |
| 9 | Efficient Selective-ID Secure Identity-Based Encryption Without Random Oracles Hit paper breakdown → | 2004 | 1390 |
| 10 | Evaluating 2-DNF Formulas on Ciphertexts Hit paper breakdown → | 2005 | 1295 |
| 11 | On the Importance of Checking Cryptographic Protocols for Faults Hit paper breakdown → | 1997 | 1136 |
| 12 | Conjunctive, Subset, and Range Queries on Encrypted Data Hit paper breakdown → | 2007 | 1130 |
| 13 | Short Signatures Without Random Oracles Hit paper breakdown → | 2004 | 1127 |
| 14 | Short Signatures from the Weil Pairing Hit paper breakdown → | 2004 | 1106 |
| 15 | Hierarchical Identity Based Encryption with Constant Size Ciphertext Hit paper breakdown → | 2005 | 1056 |
| 16 | Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys Hit paper breakdown → | 2005 | 823 |
| 17 | Bulletproofs: Short Proofs for Confidential Transactions and More Hit paper breakdown → | 2018 | 792 |
| 18 | Efficient Lattice (H)IBE in the Standard Model Hit paper breakdown → | 2010 | 738 |
| 19 | Collusion-secure fingerprinting for digital data Hit paper breakdown → | 1998 | 733 |
| 20 | Functional Encryption: Definitions and Challenges Hit paper breakdown → | 2011 | 730 |
About Dan Boneh
Dan Boneh is a scholar working on Artificial Intelligence, Information Systems, Signal Processing, Computational Theory and Mathematics and Computer Networks and Communications, having authored 331 papers that have together received 56.7k indexed citations. Recurring topics across this work include Cryptography and Data Security (183 papers), Complexity and Algorithms in Graphs (59 papers), Cryptographic Implementations and Security (57 papers), Cryptography and Residue Arithmetic (50 papers), Internet Traffic Analysis and Secure E-voting (49 papers), Advanced Malware Detection Techniques (43 papers), Coding theory and cryptography (40 papers) and Privacy-Preserving Technologies in Data (35 papers). The work is most often cited by research in Artificial Intelligence (48.1k citations), Information Systems (22.7k citations), Computational Theory and Mathematics (12.1k citations), Computer Networks and Communications (13.3k citations) and Signal Processing (5.8k citations). Dan Boneh has collaborated with scholars based in United States, Israel and France. Frequent co-authors include Matthew K. Franklin, Xavier Boyen, Hovav Shacham, Brent R. Waters, Craig Gentry, Ben Lynn, Eu-Jin Goh, Richard J. Lipton, Rafail Ostrovsky and Giuseppe Persiano. Their work appears in journals such as Lecture notes in computer science, Journal of Cryptology, Communications of the ACM, ACM SIGPLAN Notices and SIAM Journal on Computing.
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.