Cited by 759Cryptography and Data SecurityAdvanced Authentication Protocols SecurityCoding theory and cryptography

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 access

Merkle, Ralph C.·1978·Communications of the ACM

Open this paper in CoChat — free account Open PDF

Abstract

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.

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

Crossref · 10.1145/359460.359473

Cites

8 of 8 references verified0 citation errors · 0 not checkable

Statistics

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?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

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]).”
Background
The Wire-Tap Channel
Wyner, 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-citation
A 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

Show all 7 references

Research works printed but not linked: 1

Kahn , D. The Codebreakers . MacMillan , New York , 1976 . Kahn, D. The Codebreakers. MacMillan, New York, 1976.

Sorted by citations

Items 601–700 of 759

Prevention of Selective Jamming Attacks by Using Packet Hiding Methods
(2013) · IOSR Journal of Computer Engineering · doi:10.9790/0661-1514245
Studies in the efficiency and (versus) security of cryptographic tasks
Barak, B., & Mahmoody, M. (2010)
EFFICIENT JAMMING AND ANTICIPATION OF WIRELESS SENSORS NETWORKS
Kiran, B. K., Lavanya, M., & Student, M. T. (2013)
An Ecient Agent e-Voting System with Distributed Trust
Zwierko, A., & Kotulski, Z. (2006)
Information Security (Part I)
Maurer, U. M. (2013)
Packet Concealing From Discriminating Selective Jamming Attacks Using Prevention Methods
Kumar, A., Bharathi, R., Scholar, P. G., & Kumarasamy, M. (2014)
Distributed Computing Column 59
Welch, J. L. (2015) · ACM SIGACT News · doi:10.1145/2818936.2818948
À LA FACULTÉ INFORMATIQUE ET COMMUNICATIONS LABORATOIRE DE SÉCURITÉ ET DE CRYPTOGRAPHIE PROGRAMME DOCTORAL EN INFORMATIQUE, COMMUNICATIONS ET INFORMATION
Pasini, S. (2009)
Jamming Anticipation and Convolution through Immaculate Hiding Process of Packets
Sandeep, T. (2013) · IOSR Journal of Computer Engineering · doi:10.9790/0661-1325759
Key Exchange : Advent of Modern Cryptography and Its Advance
Okamoto, T. (2008) · IEICE ESS FUNDAMENTALS REVIEW · doi:10.1587/essfr.1.4_70
The Moderately Hard DoS-Resistant Authentication Protocol on Client Puzzles
Hwang, M., Chong, S., & Ou, H. (2016) · Informatica · doi:10.15388/informatica.2016.75
Query and data security in the data outsourcing model
George Kollios, D., & Li, F. (2008)
Needles in a Haystack: the Class NP
Moore, C., & Mertens, S. (2011) · Oxford University Press eBooks · doi:10.1093/acprof:oso/9780199233212.003.0004
The Deep Question: P vs. NP
Moore, C., & Mertens, S. (2011) · Oxford University Press eBooks · doi:10.1093/acprof:oso/9780199233212.003.0006
Counting, Sampling, and Statistical Physics
Moore, C., & Mertens, S. (2011) · Oxford University Press eBooks · doi:10.1093/acprof:oso/9780199233212.003.0013 · Cited by 1
Insights and Algorithms
Moore, C., & Mertens, S. (2011) · Oxford University Press eBooks · doi:10.1093/acprof:oso/9780199233212.003.0003
The Grand Unified Theory of Computation
Cristopher, M. (2011) · Oxford University Press eBooks · doi:10.1093/acprof:oso/9780199233212.003.0007
Sustainability of Public Key Cryptosystem in Quantum Computing Paradigm
Asawa, K., & Bhardwaj, A. (2016) · Advances in computational intelligence and robotics book series · doi:10.4018/978-1-5225-0058-2.ch027
Interaction and Pseudorandomness
Moore, C., & Mertens, S. (2011) · Oxford University Press eBooks · doi:10.1093/acprof:oso/9780199233212.003.0011
Who is the Hardest One of All? NP-Completeness
Moore, C., & Mertens, S. (2011) · Oxford University Press eBooks · doi:10.1093/acprof:oso/9780199233212.003.0005
When Formulas Freeze: Phase Transitions in Computation
Moore, C., & Mertens, S. (2011) · Oxford University Press eBooks · doi:10.1093/acprof:oso/9780199233212.003.0014
Key Generation for Wireless Sensor Networks Using Symmetric Balanced Incomplete Block Design
Srinivasa, K. G., Archana, V., Poornima, V., & Reshma, C. R. (2012) · IGI Global eBooks · doi:10.4018/978-1-4666-0321-9.ch012
Memory, Paths, and Games
Moore, C., & Mertens, S. (2011) · Oxford University Press eBooks · doi:10.1093/acprof:oso/9780199233212.003.0008
European E-Signatures Solutions on the Basis of PKI Authentication Technology
Chochliouros, I. P., Spiliopoulou, A. S., Chochliouros, S. P., & Voudouris, K. N. (2009) · IGI Global eBooks · doi:10.4018/978-1-60566-204-6.ch018
Einführung in die asymmetrische Kryptografie
Pelzl, J., & Paar, C. (2016) · eXamen.press · doi:10.1007/978-3-662-49297-0_6
Preface
Misa, T. J. (2016) · doi:10.1145/2973856.2973857
Architecting Information Security Services for Federated Satellite Systems
Net, M. S., del Portillo, I., Cameron, B. G., & Crawley, E. F. (2016) · Journal of Aerospace Information Systems · doi:10.2514/1.i010425
A Survey - Security Layer For Smartphone -To-VehicleCommunication Over Bluetooth
Jadhav, Y., & Wayal, G. (2013) · International Journal of Innovative Research in Computer and Communication Engineering
The History and Purpose of Computing Curricula (1960s–2000s)
Misa, T. J. (2016) · doi:10.1145/2973856.2973862
SAFE: A Declarative Trust-Agile System with Linked Credentials
Thummala, V. (2016) · DukeSpace (Duke University)
The Development of Computer Professionalization in Canada
Misa, T. J. (2016) · doi:10.1145/2973856.2973865
ACM and the Computing Revolution
Misa, T. J. (2016) · doi:10.1145/2973856.2973858
Cryptography from quantum uncertainty in the presence of quantum side information
Bouman, N. J. (2008) · Leiden Repository (Leiden University)
Privacy Preservation in the Presence of Advanced Threats
Moore, W. B. (2016) · DigitalGeorgetown (Georgetown University Library)
An analysis of modern cryptosystems
Sauder, T. G. (1993)
p-adic number theory and its applications in a cryptographic form
Naguib, R. N. G. (1986) · Spiral (Imperial College London)
PREVENTION TECHNIQUES FOR JAMMING INTRUSIONS IN WIRELESS NETWORKS
Ravi, M., Reddy, K. P., & Sundarkumar, P. N. (2013)
Practical privacy enhancing technologies for mobile systems
Lindqvist, J. (2009) · Aaltodoc (Aalto University)
Implementation of SHCS and AONT Methods for Hiding Packets in Wireless Networks
Rasheed, S. M., & Singh, M. G. (2017) · IJARCCE · doi:10.17148/ijarcce.2017.6145
dynamique pour la grille
Contes, A. (2008)
Basic key exchange protocols for secret key cryptosystems under CRYMPIX library
Uslu, S. (2007) · İYTE (İZMİR YÜKSEK TEKNOLOJİ ENSTİTÜSÜ)
Rationality and Efficient Verifiable Computation
Campanelli, M. (2018) · CUNY Academic Works (City University of New York)
Cryptographic Foundations
Desmedt, Y. (1998) · Chapman & Hall/CRC applied algorithms and data structures series · doi:10.1201/9781420049503-c39
Enhanced Packet Delivery Techniques Using Packet Hiding Schemes on Jamming Attacks
Surya, N. (2018)
Efficient Authentication of Approximate Record Matching for Outsourced Databases
Dong, B., & Wang, H. W. (2019) · Advances in intelligent systems and computing · doi:10.1007/978-3-319-98056-0_6
CRYPTOGRAPHIC TRANSFORMATIONS
Hsiao, D. K., Kerr, D. S., & Madnick, S. (1979) · Elsevier eBooks · doi:10.1016/b978-0-12-357650-7.50013-2
MC-PKS: A Collaboration Public Key Services System for Mobile Applications
Sun, T., Chen, S., Huang, J., Wen, Y., Ma, C., & Gong, Z. (2020) · Advances in intelligent systems and computing · doi:10.1007/978-981-15-3753-0_66
Pandora’s Blocks
Parkin, J. (2020) · Oxford University Press eBooks · doi:10.1093/oso/9780197515075.003.0002
Follow the Digital Thing
Parkin, J. (2020) · Oxford University Press eBooks · doi:10.1093/oso/9780197515075.003.0004
CETUS: Towards Proportional Capacity Provisioning and Cost-Effectiveness in Frontend Servers
Zhang, X., Zhang, Y., Jiang, X., Chen, J., Long, X., Cao, Z., & Liu, Q. (2020) · IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS) · doi:10.1109/ispass48437.2020.00044
Plactic key agreement.Preprint
Brown, D. R. L. (2021) · IACR Cryptology ePrint Archive
Smart Authentication based on Modified Merkle Puzzles
Ande, A., Nair, V. N., Ahmed, S. A., Reddy, A. G., Nkenyereye, L., & Kim, H. (2021) · IEEE Region 10 Symposium (TENSYMP) · doi:10.1109/tensymp52854.2021.9550956
On the comparison of methods for asymmetric execution of cryptographic primitives and protocols in the context of using small parameters and short keys
Varfolomeev, A. A. (2021) · Journal of Computer Virology and Hacking Techniques · doi:10.1007/s11416-021-00407-w
Bibliography
(2021) · Information Security · doi:10.1002/9781119505877.refs
Building the Future
Parkin, J. (2020) · Oxford University Press eBooks · doi:10.1093/oso/9780197515075.003.0005
Introduction
Parkin, J. (2020) · Oxford University Press eBooks · doi:10.1093/oso/9780197515075.003.0001
Grounding Cryptocurrencies
Parkin, J. (2020) · Oxford University Press eBooks · doi:10.1093/oso/9780197515075.003.0007
Conclusion
Parkin, J. (2020) · Oxford University Press eBooks · doi:10.1093/oso/9780197515075.003.0010
Embedded Centralism
Parkin, J. (2020) · Oxford University Press eBooks · doi:10.1093/oso/9780197515075.003.0008
Programming Politics
Parkin, J. (2020) · Oxford University Press eBooks · doi:10.1093/oso/9780197515075.003.0006
Blueprinting BlockchainsIntroduction
Parkin, J. (2020) · Oxford University Press eBooks · doi:10.1093/oso/9780197515075.003.0009
Cryptography
Desmedt, Y. (1999) · Wiley eBooks · doi:10.1002/047134608x.w4202
Literatur
Schwenk, J. (2005) · Vieweg+Teubner eBooks · doi:10.1007/978-3-322-95321-6_11
References
Schneier, B. (2015) · Wiley eBooks · doi:10.1002/9781119183471.refs
Literaturverzeichnis
Furrer, F. J. (1981) · Birkhäuser Basel eBooks · doi:10.1007/978-3-0348-5818-2_9
Literatur
Schwenk, J. (2002) · Vieweg+Teubner eBooks · doi:10.1007/978-3-322-93903-6_9
Annotated Bibliography
Stamp, M. (2011) · Information Security · doi:10.1002/9781118027974.biblio
Bibliography
Stancil, D. D., & Byrd, G. T. (2022) · Wiley eBooks · doi:10.1002/9781119750758.biblio
IEEE Pervasive Computing Call for Articles
(2019) · IEEE Security & Privacy · doi:10.1109/msec.2019.2900896
Prologue
Moore, C., & Mertens, S. (2011) · Oxford University Press eBooks · doi:10.1093/acprof:oso/9780199233212.003.0001
References
Misa, T. J. (2016) · doi:10.1145/2973856.2973871
Quantum Computation
Moore, C., & Mertens, S. (2011) · Oxford University Press eBooks · doi:10.1093/acprof:oso/9780199233212.003.0015
Secret‐Key Cryptography
Yan, S. Y. (2012) · Wiley eBooks · doi:10.1002/9781118188606.ch6
Introduction
Djordjević, I. B. (2019) · Springer eBooks · doi:10.1007/978-3-030-27565-5_1
C
Hazewinkel, M. (1988) · Springer eBooks · doi:10.1007/978-94-009-6000-8_1
Back Matter
Eckert, C. M. (2013) · Oldenbourg Wissenschaftsverlag Verlag eBooks · doi:10.1524/9783486735871.bm
Sustainability of Public Key Cryptosystem in Quantum Computing Paradigm
Asawa, K., & Bhardwaj, A. (2018) · IGI Global eBooks · doi:10.4018/978-1-5225-5634-3.ch030
Denial of Service Resilience of Authentication Systems
Bocan, V., & Fǎgǎdar-Cosma, M. (2011) · IGI Global eBooks · doi:10.4018/978-1-61350-498-7.ch011
The Basics
Moore, C., & Mertens, S. (2011) · Oxford University Press eBooks · doi:10.1093/acprof:oso/9780199233212.003.0002
Computer Science & Information Technology ( CS & IT )
(2016) · doi:10.5121/csit.2016.60700
C
Sobolev, A. I., Kurbatov, A. M., Ermilov, A. N., Холево, А. С., Prokhorov, A. V., Sokolov, D. D., Tsalenko, M. S., Pagurova, V. I., Gor’kov, Y. A., Voĭtsekhovskiĭ, M. I., et al. (1995) · Springer eBooks · doi:10.1007/978-1-4899-3795-7_1
References
(2015) · Elsevier eBooks · doi:10.1016/b978-0-12-805391-1.00006-7
Analyzing the Security of Three-State Protocols Using Information-TheoreticPreprint
Du, Z., & Yang, Y. (2022) · SSRN Electronic Journal · doi:10.2139/ssrn.4117404
Vom Fragen und vom Staunen in der Mathematik
Hungerbühler, N. (2022) · Konzepte und Studien zur Hochschuldidaktik und Lehrerbildung Mathematik · doi:10.1007/978-3-658-34067-4_1
DAKEs: Decentralized Authenticated Key Exchange Protocols via Blockchain for Smart City
Wu, Q., Luo, Y., Zhao, Y., Qian, B., & Guo, B. (2022) · Wireless Communications and Mobile Computing · doi:10.1155/2022/3314051
Le chiffrement, ou l’apport de la cryptologie à la sécurisation du stockage, de la transmission et du traitement des données
Goubin, L. (2022) · Annales des Mines - Réalités industrielles · doi:10.3917/rindu1.223.0049
Annotated Bibliography
Stamp, M. (2005) · Information Security · doi:10.1002/0471744190.biblio
Healthor: Heterogeneity-aware Flow Control in DLTs to Increase Performance and Decentralization
Theis, J., Vigneri, L., Wang, L., & Trivedi, A. (2022) · Distributed Ledger Technologies Research and Practice · doi:10.1145/3555676 · Cited by 3
Software Tool for Parallel Generation of Cryptographic Keys Based on Elliptic Curves
Lisicic, M., & Mišić, M. J. (2022) · Telecommunications Forum (TELFOR) · doi:10.1109/telfor56187.2022.9983729
Appendices
Parkin, J. (2020) · Oxford University Press eBooks · doi:10.1093/oso/9780197515075.005.0001
Time-Lock Encryption for Multiple Consecutive Periods and its Application
Lian, Y., Zhan, H., Zhang, P., & Zhang, M. (2022) · IEEE International Conference on Data Science in Cyberspace · doi:10.1109/dsc55868.2022.00094
Preface
(2020) · Oxford University Press eBooks · doi:10.1093/oso/9780197515075.002.0007
Notes
(2020) · Oxford University Press eBooks · doi:10.1093/oso/9780197515075.002.0009
Dedication
(2020) · Oxford University Press eBooks · doi:10.1093/oso/9780197515075.002.0005
Copyright Page
(2020) · Oxford University Press eBooks · doi:10.1093/oso/9780197515075.002.0004
Preface
(2011) · Oxford University Press eBooks · doi:10.1093/acprof:oso/9780199233212.002.0007
Dedication
(2011) · Oxford University Press eBooks · doi:10.1093/acprof:oso/9780199233212.002.0004
Copyright Page
(2011) · Oxford University Press eBooks · doi:10.1093/acprof:oso/9780199233212.002.0003
Mathematical Tools
(2011) · Oxford University Press eBooks · doi:10.1093/acprof:oso/9780199233212.005.0001
Figure Credits
(2011) · Oxford University Press eBooks · doi:10.1093/acprof:oso/9780199233212.002.0006

Authors: Merkle, R. C.
Affiliations: University of California, Berkeley (US)
Corresponding author: Merkle, Ralph C.
Venue: Communications of the ACM
Publisher: Association for Computing Machinery (ACM)
Published: 1978-04
Volume: 21
Issue: 4
Pages: 294-299
ISSN: 0001-0782 (ISSN-L)
1557-7317
DOI: 10.1145/359460.359473
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
Licence: www.acm.org/publications/policies/copyright_policy#Background (vor)
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

Secure communications over insecure channels

Abstract

Overview

Integrity signals

Verification

Claims the paper makes

Claims other papers make about this one

Self-check

Citations

Cites

Cited by

Related

Metadata

Record

About these checks