Most cited papers in Cryptography and Data Security
What are the most cited papers in Cryptography and Data Security?
The most cited paper in Cryptography and Data Security is "How to share a secret" (Adi Shamir, 1979), with 13,673 citations. Next come "A method for obtaining digital signatures and public-key cryptosystems" (13,115) and "A public key cryptosystem and a signature scheme based on discrete logarithms" (8,095).
Showing 50 of 96 papers. Every paper with more than 1,481 citations is listed.
| # | Paper | ||
|---|---|---|---|
| 1 | How to share a secret Adi Shamir · Communications of the ACM | Nov 1979 | 13,673 |
| 2 | A method for obtaining digital signatures and public-key cryptosystems Ronald L. Rivest, Adi Shamir, Leonard M. Adleman · Communications of the ACM | 1983 | 13,115 |
| 3 | A public key cryptosystem and a signature scheme based on discrete logarithms Taher ElGamal · IEEE Transactions on Information Theory | Jul 1985 | 8,095 |
| 4 | Public-Key Cryptosystems Based on Composite Degree Residuosity Classes Pascal Paillier · Lecture notes in computer science | 10 Oct 2007 | 7,322 |
| 5 | Calibrating Noise to Sensitivity in Private Data Analysis Cynthia Dwork, Frank McSherry, Kobbi Nissim et al. · Lecture notes in computer science | 2006 | 7,243 |
| 6 | Identity-Based Encryption from the Weil Pairing Dan Boneh, Matthew K. Franklin · Lecture notes in computer science | 2001 | 7,095 |
| 7 | Fully homomorphic encryption using ideal lattices Craig Gentry | 31 May 2009 | 6,742 |
| 8 | Identity-Based Cryptosystems and Signature Schemes Adi Shamir · Lecture notes in computer science | 12 Aug 2007 | 6,693 |
| 9 | Federated Machine Learning Qiang Yang, Yang Liu, Tianjian Chen et al. · ACM Transactions on Intelligent Systems and Technology | 28 Jan 2019 | 6,287 |
| 10 | The Byzantine Generals Problem Leslie Lamport, Robert E. Shostak, Marshall C. Pease · ACM Transactions on Programming Languages and Systems | Jul 1982 | 6,065 |
| 11 | On the security of public key protocols Danny Dolev, A. C. Yao · IEEE Transactions on Information Theory | Mar 1983 | 5,851 |
| 12 | Advances and Open Problems in Federated Learning Peter Kairouz et al. · Foundations and Trends® in Machine Learning | 2 Dec 2020 | 5,510 |
| 13 | Differential Privacy Cynthia Dwork · Lecture notes in computer science | 2006 | 5,365 |
| 14 | Attribute-based encryption for fine-grained access control of encrypted data Vipul Goyal, Omkant Pandey, Amit Sahai et al. | 30 Oct 2006 | 5,045 |
| 15 | Ciphertext-Policy Attribute-Based Encryption John Bethencourt, Amit Sahai, Brent R. Waters | May 2007 | 5,026 |
| 16 | Random oracles are practical Mihir Bellare, Phillip Rogaway | 1993 | 4,745 |
| 17 | Blockchains and Smart Contracts for the Internet of Things Konstantinos Christidis, Michael Devetsikiotis · IEEE Access | 2016 | 4,565 |
| 18 | Membership Inference Attacks Against Machine Learning Models Reza Shokri, Marco Stronati, Congzheng Song et al. | May 2017 | 4,547 |
| 19 | Fuzzy Identity-Based Encryption Amit Sahai, Brent R. Waters · Lecture notes in computer science | 2005 | 4,488 |
| 20 | Untraceable electronic mail, return addresses, and digital pseudonyms David Chaum · Communications of the ACM | Feb 1981 | 4,322 |
| 21 | Use of Elliptic Curves in Cryptography Victor S. Miller · Lecture notes in computer science | 28 Feb 2007 | 3,968 |
| 22 | How To Prove Yourself: Practical Solutions to Identification and Signature Problems Amos Fiat, Adi Shamir · Lecture notes in computer science | 5 Apr 2007 | 3,943 |
| 23 | Practical Secure Aggregation for Privacy-Preserving Machine Learning Keith Bonawitz, Vladimir Ivanov, Ben Kreuter et al. | 27 Oct 2017 | 3,808 |
| 24 | L -diversity Ashwin Machanavajjhala, Daniel Kifer, Johannes E. Gehrke et al. · ACM Transactions on Knowledge Discovery from Data | Mar 2007 | 3,639 |
| 25 | A key-management scheme for distributed sensor networks Laurent Eschenauer, Virgil D. Gligor | 18 Nov 2002 | 3,565 |
| 26 | t-Closeness: Privacy Beyond k-Anonymity and l-Diversity Ninghui Li, Tiancheng Li, Suresh Venkatasubramanian | Apr 2007 | 3,408 |
| 27 | Differential Privacy: A Survey of Results Cynthia Dwork · Lecture notes in computer science | 29 Apr 2008 | 3,407 |
| 28 | Practical techniques for searches on encrypted data Dawn Xiaoding Song, David A. Wagner, Adrian Perrig | 7 Nov 2002 | 3,381 |
| 29 | Universally composable security: a new paradigm for cryptographic protocols Ran Canetti | 2001 | 3,349 |
| 30 | A survey of trust and reputation systems for online service provision Audun Jøsang, Roslan Ismail, Colin Boyd · Decision Support Systems | 6 Jul 2005 | 3,338 |
| 31 | Practical Byzantine fault tolerance Miguel Castro, Barbara H. Liskov · Operating Systems Design and Implementation | 22 Feb 1999 | 3,308 |
| 32 | The Knowledge Complexity of Interactive Proof Systems Shafi Goldwasser, Silvio Micali, Charles Rackoff · SIAM Journal on Computing | Feb 1989 | 3,305 |
| 33 | Public Key Encryption with Keyword Search Dan Boneh, Giovanni Di Crescenzo, Rafail Ostrovsky et al. · Lecture notes in computer science | 2004 | 3,167 |
| 34 | Protocols for secure computations Andrew Chi-Chih Yao | Nov 1982 | 3,089 |
| 35 | Short Signatures from the Weil Pairing Dan Boneh, Ben Lynn, Hovav Shacham · Lecture notes in computer science | 2001 | 3,006 |
| 36 | Efficient signature generation by smart cards Claus Peter Schnorr · Journal of Cryptology | 1991 | 2,796 |
| 37 | Provable data possession at untrusted stores Giuseppe Ateniese, Randal C. Burns, Reza Curtmola et al. | 28 Oct 2007 | 2,717 |
| 38 | Probabilistic encryption Shafi Goldwasser, Silvio Micali · Journal of Computer and System Sciences | Apr 1984 | 2,586 |
| 39 | Decentralizing Privacy: Using Blockchain to Protect Personal Data Guy Zyskind, Oz Nathan, Alex Pentland | May 2015 | 2,577 |
| 40 | Proposed NIST standard for role-based access control David F. Ferraiolo, Ravi S. Sandhu, Serban I. Gavrila et al. · ACM Transactions on Information and System Security | Aug 2001 | 2,548 |
| 41 | Completeness theorems for non-cryptographic fault-tolerant distributed computation Michael Ben-Or, Avi Wigderson | 1988 | 2,542 |
| 42 | A logic of authentication Michael T. Burrows, Martı́n Abadi, Roger M. Needham · ACM Transactions on Computer Systems | Feb 1990 | 2,541 |
| 43 | Practical byzantine fault tolerance and proactive recovery Miguel Castro, Barbara H. Liskov · ACM Transactions on Computer Systems | 7 Oct 2002 | 2,499 |
| 44 | Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing Torben Pryds Pedersen · Lecture notes in computer science | 11 Aug 2007 | 2,461 |
| 45 | L-diversity: privacy beyond k-anonymity Ashwin Machanavajjhala, Johannes E. Gehrke, Daniel Kifer et al. | 2006 | 2,392 |
| 46 | A fully homomorphic encryption scheme Dan Boneh, Craig Gentry | 2009 | 2,388 |
| 47 | Reaching Agreement in the Presence of Faults Marshall C. Pease, Robert E. Shostak, Leslie Lamport · Journal of the ACM | Apr 1980 | 2,386 |
| 48 | Federated Learning With Differential Privacy: Algorithms and Performance Analysis Kang Wei, Jun Li, Ming Ding et al. · IEEE Transactions on Information Forensics and Security | 2020 | 2,379 |
| 49 | Homomorphic Encryption for Arithmetic of Approximate Numbers Jung Hee Cheon, Andrey Kim, Miran Kim et al. · Lecture notes in computer science | 2017 | 2,376 |
| 50 | Using encryption for authentication in large networks of computers Roger M. Needham, Michael D. Schroeder · Communications of the ACM | Dec 1978 | 2,364 |
Citations are OpenAlex's own counts, from its 2026-09-23 snapshot, so the ranking can differ from Google Scholar or Web of Science. A paper is listed for a field when OpenAlex files it under one of the field's topics; retracted papers and papers whose citation count cannot be traced to citing works are left out, and a preprint and the article it became are shown once. Release dates are OpenAlex's: where a source gave only a month or a year, that is what is shown. How the lists are chosen.