The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Secure communications over insecure channels
Open accessAbstract
According to traditional conceptions of cryptographic security, it is necessary to transmit a key, by secret means, before encrypted massages can be sent securely. This paper shows that it is possible to select a key over open communications channels in such a fashion that communications security can be maintained. A method is described which forces any enemy to expend an amount of work which increases as the square of the work required of the two communicants to select the key. The method provides a logically new kind of protection against the passive eavesdropper. It suggests that further research on this topic will be highly rewarding, both in a theoretical and a practical sense.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“it has its privacy roots in the 1970s by the introduction of Diffie-Hellman k ey-exchange p rotocol t hat a llows u sers protect their privacy in the digital environment using public key cryptography [64].”
From A Survey of Self-Sovereign Identity Ecosystem (2021) · cites this paper as [64]
Experimental — accuracy not yet measured
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1983) · Communications of the ACM · doi:10.1145/357980.358017 · Cited by 13,012
Communication Theory of Secrecy Systems
Shannon, C. E. (1949) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1949.tb00928.x · Cited by 9,440 · cited 1×
“The paradigm, as stated so far, is not new, and has appeared previously in the literature (see, for example, Shannon [6]).”
BackgroundWyner, A. D. (1975) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1975.tb02040.x · Cited by 7,064
Cryptography and Computer Privacy
Feistel, H. (1973) · Scientific American · doi:10.1038/scientificamerican0573-15 · Cited by 894
Hiding information and signatures in trapdoor knapsacks
Merkle, R. C., & Hellman, M. E. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055927 · Cited by 825
Self-citationA Method for Obtaining Digital Signatures and Public-Key Cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1978) · doi:10.21236/ada606588
Flagged first, then by citations
Research works printed but not linked: 1
- Kahn , D. The Codebreakers . MacMillan , New York , 1976 . Kahn, D. The Codebreakers. MacMillan, New York, 1976.
Cited by
Sorted by citations
Items 501–600 of 759
Parkin, J. (2020) · Oxford University Press eBooks · doi:10.1093/oso/9780197515075.003.0003 · Cited by 1
Vollala, S., Ramasubramanian, N., & Tiwari, U. (2021) · Springer eBooks · doi:10.1007/978-3-030-74524-0_1 · Cited by 1
Differential Privacy Mechanisms: A State-of-the-Art Survey
Patil, S. P., & Parmar, K. (2022) · Lecture notes in electrical engineering · doi:10.1007/978-981-19-5037-7_75 · Cited by 1
A Multifunctional Modular Implementation of Grover’s Algorithm
Mina, M.-Z., & Simion, E. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-17510-7_16 · Cited by 1
Extractable Witness Encryption for the Homogeneous Linear Equations Problem
Tran, B., & Serge Vaudenay, B. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-41326-1_9 · Cited by 1
Lightweight Public Key Encryption in Post-Quantum Computing Era
Hillmann, P. (2023) · doi:10.5121/csit.2023.132101 · Cited by 1
Signcryption with Matrix Modification of RSA Digital Signature Scheme and Cayley-Purser Algorithm
Ginting, C. L., Budiman, M. A., & Nasution, S. (2024) · Data Science Journal of Computing and Applied Informatics · doi:10.32734/jocai.v8.i1-12226 · Cited by 1
Acki Nacki: A Probabilistic Proof-of-Stake Consensus Protocol with Fast Finality and Parallelisation
Goroshevsky, M., Sattarov, N., & Trepacheva, A. V. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-61486-6_4 · Cited by 1
Fine-Grained Non-interactive Key Exchange, Revisited
Bauer, B., Couteau, G., & Sadeghi, E. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-68379-4_9 · Cited by 1
User-Guided Verification of Security Protocols via Sound Animation
Ye, K., Metere, R., & Yadav, P. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-77382-2_3 · Cited by 1
Quantum Communication and Quantum Cryptography
Simon, D. S. (2025) · Undergraduate texts in physics · doi:10.1007/978-3-031-81315-3_18 · Cited by 1
Yan, S. Y. (2008) · Advances in information security · doi:10.1007/978-0-387-77268-4_4 · Cited by 1
Quantum Attacks on ECDLP-Based Cryptosystems
Yan, S. Y. (2013) · Springer eBooks · doi:10.1007/978-1-4419-7722-9_4 · Cited by 1
An Efficient Implementation of a Threshold RSA Signature Scheme
King, B. (2005) · Lecture notes in computer science · doi:10.1007/11506157_32 · Cited by 1
Modular Integer Arithmetic for Public Key Cryptography
Güneysu, T. E., & Paar, C. (2009) · Integrated circuits and systems · doi:10.1007/978-0-387-71829-3_1 · Cited by 1
Phagocytes: A Holistic Defense and Protection Against Active P2P Worms
Chen, R., Lua, E. K., Crowcroft, J., Tang, L., & Chen, Z. (2011) · Cambridge University Engineering Department Publications Database · doi:10.48550/arxiv.1108.1350 · Cited by 1
Computationally efficient algorithms for a one-time pad scheme
Akritas, A. G., Iyengar, S. S., & Rampuria, A. (1983) · International Journal of Parallel Programming · doi:10.1007/bf00991623 · Cited by 1
Public-Key Cryptography from Different Assumptions (Extended Abstract)
Applebaum, B., Barak, B., & Wigderson, A. (2010) · Cited by 1
Moore, C., & Mertens, S. (2011) · Oxford University Press eBooks · doi:10.1093/acprof:oso/9780199233212.003.0012 · Cited by 1
Misa, T. J. (2016) · doi:10.1145/2973856.2973867 · Cited by 1
Other Places of Invention: Computer Graphics at the University of Utah
Misa, T. J. (2016) · doi:10.1145/2973856.2973868 · Cited by 1
Multilinear mappings based on weil pairing over elliptic curves
Tran, M. H. T., Ton, T. T., Nguyen, T. D., Nguyen, N. T., Nguyen, N. V., & Nguyen, B. T. (2017) · NAFOSTED Conference on Information and Computer Science (NICS) · doi:10.1109/nafosted.2017.8108053 · Cited by 1
Bi-symmetric Key Exchange: A Novel Cryptographic Key Exchanging Algorithm
Sonthalia, S., Mandal, T., & Chakraborty, M. (2018) · Advances in intelligent systems and computing · doi:10.1007/978-981-13-1544-2_8 · Cited by 1
Crossing Hands in the Russian Cards Problem
Hagland, T., & Ågotnes, T. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-88708-7_8 · Cited by 1
Industry Trusted Network Communication Based on Quantum Encryption
Yang, W., Pei-song, Y., & Qianchuan, Z. (2019) · Chinese Control Conference (CCC) · doi:10.23919/chicc.2019.8865710 · Cited by 1
A Privacy Enhancing Scheme for Mobile Devices Based Secure Multi-party Computation System
Yang, X., Lv, N., Chen, T., Ma, C., & Liu, L. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-42921-8_17 · Cited by 1
THE IMPROVEMENT OF NTRUENCRYPT PUBLIC KEY CRYPTOSYSTEM: DESIGN AND PERFORMANCE EVALUATION
Ilyenko, A., Ilyenko, S., & Prokopenko, O. (2020) · Cybersecurity Education Science Technique · doi:10.28925/2663-4023.2020.10.123134 · Cited by 1
Revisiting the Security Model for Timed-Release Encryption with Pre-Open Capability
Dent, A. W., & Tang, Q. (2007) · Cited by 1
FRACTAL MAGMAS AND PUBLIC-KEY CRYPTOGRAPHY
Tsvetov, V. P. (2021) · Vestnik of Samara University Natural Science Series · doi:10.18287/2541-7525-2020-26-2-23-49 · Cited by 1
Privacy Increase in VLC System Based on Hyperchaotic Map
Silvério, T., Figueiredo, G., André, P. S. D. B., & Ferreira, R. A. S. (2021) · Telecoms Conference (ConfTELE) · doi:10.1109/conftele50222.2021.9435485 · Cited by 1
The Biometric Signature as a Blockchain Application
Koltuksuz, A. H. (2021) · EAI/Springer Innovations in Communication and Computing · doi:10.1007/978-3-030-65691-1_11 · Cited by 1
Limiting Exposure by Hiding the Identity
Adams, C. M. (2021) · Springer eBooks · doi:10.1007/978-3-030-81043-6_3 · Cited by 1
An Application of Interior and Closure in General Topology: A Key Agreement Protocol
Polat, K. (2021) · Turkish Journal of Science · doi:10.66833/tjos-2021-0007 · Cited by 1
A new kind of encryption and decryption of RGB colour image using permutation matrix multiplication
Avinash, N., Jaraldpushparaj, S., Sathinathan, T., & Britto Antony Xavier, G. (2022) · AIP conference proceedings · doi:10.1063/5.0070915 · Cited by 1
Quantum Attacks on DLP-Based Cryptosystems
Yan, S. Y. (2013) · Springer eBooks · doi:10.1007/978-1-4419-7722-9_3 · Cited by 1
SEMIGROUPS OF BINARY OPERATIONS AND MAGMA-BASED CRYPTOGRAPHY
Tsvetov, V. P. (2020) · Vestnik of Samara University Natural Science Series · doi:10.18287/2541-7525-2020-26-1-23-51 · Cited by 1
Introduction: The Early Lives and Lasting Legacies of Whitfield Diffie and Martin Hellman
Slayton, R. M. (2022) · ACM eBooks · doi:10.1145/3549993.3549996 · Cited by 1
Public Key Cryptography in Computer and Network Security
Kocher, P. C. (2022) · ACM eBooks · doi:10.1145/3549993.3549998 · Cited by 1
Nejad, B. (2022) · Space technology library · doi:10.1007/978-3-031-15900-8_16 · Cited by 1
Plactic key agreement (insecure?)
Brown, D. R. L. (2023) · Journal of Mathematical Cryptology · doi:10.1515/jmc-2022-0010 · Cited by 1
Multiplication polynomials for elliptic curves over finite local rings
Invernizzi, R., & Taufer, D. (2023) · International Symposium on Symbolic and Algebraic Computation · doi:10.1145/3597066.3597068 · Cited by 1
On the Importance of Memory Resources in the Security of Key Exchange Protocols
Davida, G. I., Desmedt, Y., & Peralta, R. (1991) · Lecture notes in computer science · doi:10.1007/3-540-46877-3_2 · Cited by 1
Guyot, V. (2007) · Wiley eBooks · doi:10.1002/9780470612118.ch16 · Cited by 1
Experimental realization of quantum key distribution.
Kabeya, M. (2009) · Cited by 1
Discrete Logarithm Based Cryptography
Yan, S. Y. (2012) · Wiley eBooks · doi:10.1002/9781118188606.ch8 · Cited by 1
Key Management Schemes in Sensor Networks
Rayi, V. K., Xiao, Y., Sun, B., Du, X., & Hu, F. (2007) · Springer eBooks · doi:10.1007/978-0-387-33112-6_14 · Cited by 1
Stabell-Kute, T., Helme, A., & Dini, G. (1998) · Lecture notes in computer science · doi:10.1007/bfb0053747 · Cited by 1
Oblivious Transfer à la Merkle
Brassard, G., Salvail, L., & Tapp, A. (2009) · International Conference on Quantum, Nano and Micro Technologies (ICQNM) · doi:10.1109/icqnm.2009.28 · Cited by 1
A nonlinear public key cryptosystem
Webb, W. A. (1988) · Computers & Mathematics with Applications · doi:10.1016/0898-1221(88)90077-6 · Cited by 1
An anonymous and undeniable payment scheme
Chen, L., & Mitchell, C. J. (1997) · Lecture notes in computer science · doi:10.1007/bfb0028504 · Cited by 1
Laur, S. (2008) · Aaltodoc (Aalto University) · Cited by 1
New Approaches to Mitigate Network Denial-of-Service Problems
Bencsáth, B. (2009) · Cited by 1
A key distribution system based on any one-way function (extended abstract)
Davida, G. I., Desmedt, Y., & Peralta, R. (1990) · UCL Discovery (University College London) · Cited by 1
Impacts of Federal Policy Options for Nonmilitary Cryptography
Walling, V. C. (1981) · Cited by 1
Optimization and Approximation
Moore, C., & Mertens, S. (2011) · Oxford University Press eBooks · doi:10.1093/acprof:oso/9780199233212.003.0009 · Cited by 1
St-Jules, M. (2016) · uO Research (University of Ottawa) · doi:10.20381/ruor-329 · Cited by 1
Authentication and Data Protection under Strong Adversarial Model
Zhao, L. (2018) · Spectrum Research Repository (Concordia University) · Cited by 1
From Information Theory Puzzles in Deletion Channels to Deniability in Quantum CryptographyPreprint
Atashpendar, A. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2003.11663 · Cited by 1
Proof of All: Verifiable Computation in a NutshellPreprint
Barbara, M. A. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1908.02327 · Cited by 1
A diagrammatic approach to information flow in encrypted communication (extended version)Preprint
Hines, P. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2008.05840 · Cited by 1
SonicChain: A Wait-free, Pseudo-Static Approach Toward Concurrency in BlockchainsPreprint
Paimani, K. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2102.09073 · Cited by 1
Further Applications of Fields and Groups
Lidl, R., & Pilz, G. F. (1984) · Undergraduate texts in mathematics · doi:10.1007/978-1-4615-6465-2_5 · Cited by 1
Hershey, J. E., & Yarlagadda, R. (1986) · Springer eBooks · doi:10.1007/978-1-4613-2195-8_10 · Cited by 1
Itier, V., Puteaux, P., & Puech, W. (2022) · Wiley eBooks · doi:10.1002/9781119987390.ch4 · Cited by 1
Off-Memory Decryption of Classified DocumentsPreprint
Süzer, M. H. (2022) · Research Square · doi:10.21203/rs.3.rs-2338645/v1 · Cited by 1
Radanliev, P., Roure, D. D., & Santos, O. (2023) · doi:10.36227/techrxiv.24153183.v1 · Cited by 1
Radanliev, P., Roure, D. D., & Santos, O. (2023) · doi:10.36227/techrxiv.24153183 · Cited by 1
Advances in public-key cryptology and computer exploitation
Géraud, R. (2017) · theses.fr (ABES) · doi:10.70675/990b2e4ez19fcz4589z9730z1849d78815d4 · Cited by 1
Discrete Logarithm Cryptanalyses : Number Field Sieve and Lattice Tools for Side-Channel Attacks
Micheli, G. D. (2021) · doi:10.70675/03e70022z3b51z4264z86ffz300c571650d3 · Cited by 1
Requirements for Group Independent Linear Threshold Secret Sharing Schemes
King, B. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45450-0_7
Weak Oblivious Transfer from Strong One-Way Functions
Tanaka, K., Yamada, A., & Yasunaga, K. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-24316-5_5
Schmidt, M., Schunter, M., & Weber, A. (1998) · FreiDok plus (Universitätsbibliothek Freiburg) · doi:10.22028/d291-25800
Preventing Real-time Packet Classification in Wireless Networks
G., J., & Raju, R. (2013)
Yu, C.-M., Lu, C.-S., & Kuo, S. (2008)
User Identity Protection in Wireless Local Area Networks
Kurt, C., & Özdemi̇r, S. (2013) · DergiPark (Istanbul University)
Volcans d'isogènies de corbes el·líptique : aplicacions criptogràfiques en targetes intel·ligents
Cuñat, T., & Ana, R. (2011) · Repositori ObertUDL (University of Lleida)
Evaluating Packet Hiding Methods In Wireless Networks
Sagarika .Saka; Dept.of Computer Science and EngineeringKakinada Institute of Engineering & Technology, & Srinivas, D. (2013)
Security of Video in Converged Networks
Paul, S. K. (2010) · Wiley eBooks · doi:10.1002/9780470972915.ch19
TOWARDS FAULT-TOLERANT AND SECURE ON-LINE
Zhou, L. (2001)
Security Protocols for Wireless Networks and their Formal Analysis
Schaller, P. (2010) · Repository for Publications and Research Data (ETH Zurich) · doi:10.3929/ethz-a-006092449
Architecture de sécurité pour les grands systèmes, ouverts, répartis et hétérogènes
Naqvi, S. S. H. (2005) · OpenGrey (Institut de l'Information Scientifique et Technique)
Key distribution and distributed intrusion detection system in wireless sensor network
Techateerawat, P. (2010) · RMIT Research Repository (RMIT University Library) · doi:10.25439/rmt.27340122
C2Puzzle: A Novel Computational Client Puzzle for Network Security
Wan, M., Shang, W. L., Zhao, J. M., & Zhang, S. S. (2013) · Advanced materials research · doi:10.4028/www.scientific.net/amr.846-847.1615
Trusted Puzzle Solvers without Clock Support against Spam and Denial-of-Service Attacks
Deng, R., & Chen, Z. (2014) · Journal of Software · doi:10.4304/jsw.9.10.2538-2545
A note on the method of puzzles for key distribution
Chan, B., & Meijer, H. (1985) · International Journal of Parallel Programming · doi:10.1007/bf00997020
Some Open Problems In Cryptography
Leung, C.-M. (1978) · ACM Annual Conference · doi:10.1145/800127.804151
Securing Wireless Sensor Network based solutions
Nallusamy, R., Varadharajan, V., & Vuppala, S. K. (2012) · World Congress on Information and Communication Technologies · doi:10.1109/wict.2012.6409144
A model to order the encryption algorithms according to their quality
Prieto, A. R., & Tomas, J. G. (1987) · ACM SIGCOMM Computer Communication Review · doi:10.1145/36727.36732
Improved Merkle Cryptosystem (IMC)
Yavuz, A. A., Anarım, E., & Alagöz, F. (2006) · Lecture notes in computer science · doi:10.1007/11902140_96
Attribute Based Encryption with Pattern-awareness
Shi, W., & Zhang, Z. (2012) · International Journal of Digital Content Technology and its Applications · doi:10.4156/jdcta.vol6.issue5.38
The security properties of in-network aggression
Jónsson, K. V. (2013) · KTH Publication Database DiVA (KTH Royal Institute of Technology)
A key exchange scheme based-on product code and performance simulation
Wang, Y., & Wen, Q. (2011) · IEEE International Conference on Information and Automation (ICIA) · doi:10.1109/icinfa.2011.5948998
Short Undeniable Signatures: Design, Analysis, and Applications
Lausanne, E. D. (2006)
Addressing Automated Adversaries of Network Applications
Kaiser, E. (2000) · doi:10.15760/etd.4
The new high-speed digital signature
Moon, P. J., Lee, J. W., Jun, M. S., & Lee, C. H. (2003) · Conference on Local Computer Networks · doi:10.1109/lcn.1992.228123
Game Theory based Defense Mechanism against Flooding Attack using Puzzle
Neyyan, R., Paul, A., & Deshwal, M. (2012)
Review of 'Secure Communications and Asymmetric Cryptosystems' (Simmons, G.J., Ed.; 1982)
Sloane, N. J. A. (1984) · IEEE Transactions on Information Theory · doi:10.1109/tit.1984.1056922
Cryptographic Protection Of Information In Communication Networks
Hellman, M. E. (2005) · Asilomar Conference on Signals, Systems and Computers (ACSSC) · doi:10.1109/acssc.1977.729507
ID-based cryptography using symmetric primitives
Mitchell, C. J., Piper, F. C., & Wild, P. (2007) · Designs Codes and Cryptography · doi:10.1007/s10623-007-9095-0
Preventing Jamming Attacks in Wireless Sensor Networks Through Cryptography
Kumar, H., Prasad, P. B. K., & Dasu, G. G. K. (2013)
Metadata
- Authors
- Merkle, R. C.
- Affiliations
- University of California, Berkeley (US)
- Corresponding author
- Merkle, Ralph C.
- Venue
- Communications of the ACM
- Published
- 1978-04
- Volume
- 21
- Issue
- 4
- Pages
- 294-299
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W2047925852
- Cited by
- 757
- References
- 7
- Citations by year
- 2026: 11 · 2025: 20 · 2024: 35 · 2023: 26 · 2022: 31 · 2021: 38 · 2020: 45 · 2019: 25 · 2018: 27 · 2017: 22 · 2016: 49 · 2015: 13 · 2014: 17 · 2013: 27 · 2012: 18
- FWCI
- 10.92
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Locations
- Communications of the ACM (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Cryptography and Data Security
- Physical Sciences › Computer Science › Computer Networks and Communications › Advanced Authentication Protocols Security
- Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Coding theory and cryptography
- Keywords
- key establishment, secure communication, eavesdropping, passive attacks, cryptographic security, computational complexity
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
