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
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 201–300 of 759
An Improved RSA Cryptographic System
Somani, N., & Mangal, D. (2014) · Cited by 16
Error-correcting pairs for a public-key cryptosystem
Pellikaan, R., & Márquez-Corbella, I. (2017) · Journal of Physics Conference Series · doi:10.1088/1742-6596/855/1/012032 · Cited by 16
A key distribution scheme for secure communication in acoustic sensor networks
Hamid, M. A., Abdullah-Al-Wadud, M., Hassan, M. M., Almogren, A., Alamri, A. M., Kamal, A. R. M., & Mamun-Or-Rashid, M. (2017) · Future Generation Computer Systems · doi:10.1016/j.future.2017.07.025 · Cited by 16
Quisquater, J.-J., Desmedt, Y., & Davio, M. (2007) · Springer eBooks · doi:10.1007/3-540-39799-x_43 · Cited by 16
Timed Release Cryptography from Bilinear Pairings Using Hash Chains
Chalkias, K., & Stephanides, G. (2006) · Lecture notes in computer science · doi:10.1007/11909033_12 · Cited by 16
Limits on the Usefulness of Random Oracles
Haitner, I., Omri, E., & Zarosim, H. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-36594-2_25 · Cited by 15
Location Authentication Methods for Wireless Network Access Control
Bao, L. (2008) · IEEE International Performance, Computing, and Communications Conference · doi:10.1109/pccc.2008.4745118 · Cited by 15
The Future of Cryptography Under Quantum Computers
Barreno, M. A. (2002) · Cited by 15
Fine-Grained Secure Computation
Campanelli, M., & Gennaro, R. (2018) · Lecture notes in computer science · doi:10.1007/978-3-030-03810-6_3 · Cited by 15
An Overview of Quantum Security for Distributed Energy Resources
Ahn, J., Chung, J., Kim, T., Ahn, B., & Choi, J. (2021) · IEEE International Symposium on Power Electronics for Distributed Generation Systems (PEDG) · doi:10.1109/pedg51384.2021.9494203 · Cited by 15
Allowing Continuous Evaluation of Citizen Opinions through Social Networks
Buccafurri, F., Fotia, L., & Lax, G. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-32701-8_21 · Cited by 15
A privacy-preserving e-participation framework allowing citizen opinion analysis
Buccafurri, F., Fotia, L., & Lax, G. (2015) · Electronic Government an International Journal · doi:10.1504/eg.2015.070131 · Cited by 15
Barak, B., & Mahmoody, M. (2016) · Journal of Cryptology · doi:10.1007/s00145-016-9233-9 · Cited by 15
Privacy and Authentication: An Introduction to Cryptography
Diffie, W., & Hellman, M. E. (2022) · ACM eBooks · doi:10.1145/3549993.3550010 · Cited by 15
NeoBFT: Accelerating Byzantine Fault Tolerance Using Authenticated In-Network Ordering
Sun, G., Jiang, M., Khooi, X. Z., Li, Y., & Li, J. (2023) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/3603269.3604874 · Cited by 14
Flexible Hardware-Managed Isolated Execution: Architecture, Software Support and Applications
Evtyushkin, D., Elwell, J., Özsoy, M., Ponomarev, D., Abu‐Ghazaleh, N., & Riley, R. D. (2016) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2016.2596287 · Cited by 14
Efficient Hardware Implementation of 256-bit ECC Processor Over Prime Field
Rahman, M. S., Hossain, M. S., Rahat, E. H., Dipta, D. R., Faruque, H. M. R., & Fattah, F. K. (2019) · International Conference on Electrical, Computer and Communication Engineering · doi:10.1109/ecace.2019.8679184 · Cited by 14
A Hybrid Key Agreement Scheme for Smart Homes Using the Merkle Puzzle
Zhang, Y., Huang, X., Chen, X., Zhang, L. Y., Zhang, J., & Xiang, Y. (2019) · IEEE Internet of Things Journal · doi:10.1109/jiot.2019.2949407 · Cited by 14
AnyLog: a Grand Unification of the Internet of Things.
Abadi, D. J., Arden, O., Nawab, F., & Shadmon, M. (2020) · Conference on Innovative Data Systems Research · Cited by 14
Fine-Grained Secure Attribute-Based Encryption
Wang, Y., Pan, J., & Chen, Y. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-84259-8_7 · Cited by 14
Towards High-performance X25519/448 Key Agreement in General Purpose GPUs
Dong, J., Zheng, F., Cheng, J., Lin, J., Pan, W., & Wang, Z. (2018) · IEEE Conference on Communications and Network Security · doi:10.1109/cns.2018.8433161 · Cited by 14
Cryptanalysis and design of block ciphers
Nakahara, J. (2003) · Cited by 14
Information Theory and Coding Theory
Berger, T. (2014) · Wiley eBooks · doi:10.1002/9781118445112.stat00078 · Cited by 14
Message authentication by integrity with public corroboration
van Oorschot, P. C. (2005) · New Security Paradigms Workshop · doi:10.1145/1146269.1146283 · Cited by 14
Survey of Attacks and Defenses on P2PSIP Communications
Suárez, D., Sierra, J. M., Izquierdo, A. Y., & Schulzrinne, H. G. (2011) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2011.060711.00152 · Cited by 13
Fine-Grained Cryptography Revisited
Egashira, S., Wang, Y., & Tanaka, K. (2021) · Journal of Cryptology · doi:10.1007/s00145-021-09390-3 · Cited by 13
Privacy-preserving resource evaluation in social networks
Buccafurri, F., Fotia, L., & Lax, G. (2012) · Conference on Privacy, Security and Trust · doi:10.1109/pst.2012.6297919 · Cited by 13
Public-key encryption based on generalized synchronization of coupled map lattices
Wang, X., Gong, X., Zhan, M., & Lai, C. H. (2005) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.1916207 · Cited by 13
Zhu, J., Hou, R., Wang, X., Wang, W., Cao, J., Zhao, L., Yuan, F., Li, P., Wang, Z., Zhao, B., et al. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1904.04782 · Cited by 13
Revisiting the Security Model for Timed-Release Public-Key Encryption with Pre-Open Capability.Preprint
Dent, A. W., & Tang, Q. (2006) · IACR Cryptology ePrint Archive · Cited by 13
Parkin, J. (2020) · doi:10.1093/oso/9780197515075.001.0001 · Cited by 13
Non-Interactive Zero-Knowledge Proofs with Fine-Grained Security
Wang, Y., & Pan, J. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-07085-3_11 · Cited by 12
An Effective Secure Routing for False Data Injection Attack in Wireless Sensor Network
Zhu, Z., Tan, Q., & Zhu, P. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-75476-3_46 · Cited by 12
Moore, C., & Mertens, S. (2011) · Oxford University Press eBooks · doi:10.1093/acprof:oso/9780199233212.003.0010 · Cited by 12
Improved Methods to Perform Threshold RSA
King, B. (2000) · Lecture notes in computer science · doi:10.1007/3-540-44448-3_27 · Cited by 12
Pseudonymous Broadcast and Secure Computation from Cryptographic PuzzlesPreprint
Katz, J. I., Miller, A. E., & Shi, E. (2014) · IACR Cryptology ePrint Archive · Cited by 12
Shor's Factoring Algorithm and Modular Exponentiation Operators
Singleton, R. (2023) · Quanta · doi:10.12743/quanta.v12i1.235 · Cited by 11
Temporarily hidden bit commitment and lottery applications
Goldschlag, D. M., Stubblebine, S. G., & Syverson, P. F. (2009) · International Journal of Information Security · doi:10.1007/s10207-009-0094-1 · Cited by 11
On the method of puzzles for key distribution
Kak, S. C. (1984) · International Journal of Parallel Programming · doi:10.1007/bf00978711 · Cited by 11
On Non-Parallelizable Deterministic Client Puzzle Scheme with Batch Verification Modes
Tang, Q., & Jeckmans, A. J. P. (2010) · Cited by 11
Chen, K., & Shen, H. (2016) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2016.2623521 · Cited by 11
CryptoEyes: Privacy Preserving Classification over Encrypted Images
He, W., Li, S., Wang, W., Wei, M., & Qiu, B. (2021) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infocom42981.2021.9488738 · Cited by 11
A GENERALIZED AGENT BASED FRAMEWORK FOR MODELING A BLOCKCHAIN SYSTEM
Kaligotla, C., & Macal, C. M. (2018) · Winter Simulation Conference · doi:10.1109/wsc.2018.8632374 · Cited by 11
Programmable Photonic Solver for Computationally Complex Problems
Jiang, X., He, Z., Wu, B., Cheng, J., Xu, J., Zhou, H., Dong, J., Qiu, C., & Zhang, X. (2023) · ACS Photonics · doi:10.1021/acsphotonics.3c01164 · Cited by 11
Limits on the Usefulness of Random Oracles
Haitner, I., Omri, E., & Zarosim, H. (2014) · Journal of Cryptology · doi:10.1007/s00145-014-9194-9 · Cited by 11
MITM Attack on Modification of Diffie-Hellman Key Exchange Algorithm
Yadav, V. K., Yadav, R. K., Chaurasia, B. K., Verma, S., & Venkatesan, S. (2021) · Communications in computer and information science · doi:10.1007/978-981-16-8896-6_12 · Cited by 11
Low-cost Anonymous Timed-Release Encryption
Hristu‐Varsakelis, D., Chalkias, K., & Stephanides, G. (2007) · International Conference on Information Assurance and Security (IAS) · doi:10.1109/ias.2007.10 · Cited by 11
Probabilistic Key Management Practical Concerns in Wireless Sensor Networks
Silva, R. M. S., Pereira, N. S. A., & Nunes, M. S. (2008) · Journal of Networks · doi:10.4304/jnw.3.2.29-37 · Cited by 11
DAM: A Theoretical Framework for SensorSecurity in IoT Applications
Gulzar, B., & Gupta, A. K. (2021) · INTERNATIONAL JOURNAL OF NEXT-GENERATION COMPUTING · doi:10.47164/ijngc.v12i3.830 · Cited by 10
Algebraic generalization of Diffie–Hellman key exchange
Partala, J. (2017) · Journal of Mathematical Cryptology · doi:10.1515/jmc-2017-0015 · Cited by 10
Learning-based optical authentication in complex scattering media
Zhou, L., Xiao, Y., & Chen, W. (2021) · Optics and Lasers in Engineering · doi:10.1016/j.optlaseng.2021.106570 · Cited by 10
Implementing Secure RSA Cryptosystems Using Your Own Cryptographic JCE Provider
Rabah, K. (2006) · Journal of Applied Sciences · doi:10.3923/jas.2006.482.510 · Cited by 10
A resource-competitive jamming defense
King, V., Pettie, S., Saia, J., & Young, M. (2017) · Distributed Computing · doi:10.1007/s00446-017-0313-3 · Cited by 10
Blockchain: Capabilities, Economic Viability, and the Socio-Technical Environment
Braun-Dubler, N., Gier, H.-P., Bulatnikova, T., Langhart, M., Merki, M., Roth, F., Burret, A., & Perdrisat, S. (2020) · vdf Hochschulverlag AG an der ETH Zürich eBooks · doi:10.3218/4017-3 · Cited by 10
Secure discrete-cosine-transform-based technique for recoverable tamper proofing
Hung, K.-L., Chang, C., & Chen, T.-S. (2001) · Optical Engineering · doi:10.1117/1.1391435 · Cited by 10
High-speed SABER key encapsulation mechanism in 65nm CMOS
Imran, M., Almeida, F., Basso, A., Roy, S. S., & Pagliarini, S. (2023) · Journal of Cryptographic Engineering · doi:10.1007/s13389-023-00316-2 · Cited by 9
Digital Signature Schemes with Domain Parameters
Serge Vaudenay, B. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-27800-9_17 · Cited by 11
Cryptographic key exchange based on locationing information
Naik, P., Ravichandran, K., & Sivalingam, K. M. (2006) · Pervasive and Mobile Computing · doi:10.1016/j.pmcj.2006.07.005 · Cited by 9
Security of eGovernment Systems
Weber, A., Kool, L., Munnichs, G. M., & Jacobi, A. (2013) · TATuP Zeitschrift für Technikfolgenabschätzung in Theorie und Praxis · doi:10.14512/tatup.22.3.49 · Cited by 9
Guleria, V., & Mishra, D. C. (2020) · Multimedia Tools and Applications · doi:10.1007/s11042-020-09615-w · Cited by 9
On Building Fine-Grained One-Way Functions from Strong Average-Case Hardness
Brzuska, C., & Couteau, G. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-07085-3_20 · Cited by 9
Analytical study of implementation issues of NTRU
Tata, P. G., Narumanchi, H., & Emmadi, N. (2014) · International Conference on Advances in Computing, Communications and Informatics (ICACCI) · doi:10.1109/icacci.2014.6968468 · Cited by 9
Rasheed, A. A., & Mahapatra, R. (2008) · IEEE International Performance, Computing, and Communications Conference · doi:10.1109/pccc.2008.4745135 · Cited by 9
Novel Lightweight Signcryption-Based Key Distribution Mechanisms for MIKEY
Nguyen, K. T., Oualha, N., & Laurent, M. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-45931-8_2 · Cited by 9
Attribute-based authorization for structured Peer-to-Peer (P2P) networks
Suárez, D., Camara, J. M. S., Zeadally, S., & Soriano, M. (2015) · Computer Standards & Interfaces · doi:10.1016/j.csi.2015.04.007 · Cited by 9
On Bluetooth Repairing: Key Agreement Based on Symmetric-Key Cryptography
Serge Vaudenay, B. (2005) · Lecture notes in computer science · doi:10.1007/11599548_1 · Cited by 9
Silva, R. M. S., Pereira, N. S. A., & Nunes, M. S. (2007) · International Conference on Wireless and Mobile Communications · doi:10.1109/icwmc.2007.24 · Cited by 9
Radanliev, P., Roure, D. D., & Santos, O. (2023) · SSRN Electronic Journal · doi:10.2139/ssrn.4574446 · Cited by 9
Yadav, A., Sharma, P., & Gigras, Y. (2024) · International Conference on Intelligent Systems for Cybersecurity (ISCS) · doi:10.1109/iscs61804.2024.10581015 · Cited by 8
Taheri, M., Khorasani, K., & Meskin, N. (2024) · IEEE/CAA Journal of Automatica Sinica · doi:10.1109/jas.2024.124692 · Cited by 8
Lightweight and Efficient Post Quantum Key Encapsulation Mechanism Based on Q-Problem
Kara, M., Κarampidis, K., Panagiotakis, S., Hammoudeh, M. A. A., Felemban, M., & Papadourakis, G. M. (2025) · Electronics · doi:10.3390/electronics14040728 · Cited by 8
Cryptography as information control
West, S. M. (2022) · Social Studies of Science · doi:10.1177/03063127221078314 · Cited by 8
Fine-Grained Secure Attribute-Based Encryption
Wang, Y., Pan, J., & Chen, Y. (2023) · Journal of Cryptology · doi:10.1007/s00145-023-09479-x · Cited by 8
Study of necessary conditions of perfectly stable encryption algorithms
Umarov, S. (2024) · AIP conference proceedings · doi:10.1063/5.0210221 · Cited by 8
The State of Cryptocurrencies, Their Issues and Policy Interactions
Subramanian, R., & Chino, T. (2015) · Journal of international technology and information management · doi:10.58729/1941-6679.1045 · Cited by 8
A New Approach to Anonymous Multicast Routing in Ad Hoc Networks
Bao, L. (2007) · International Conference on Communications and Networking in China (ChinaCom) · doi:10.1109/chinacom.2007.4469554 · Cited by 8
Thwarting The Sybil Attack in Wireless Ad Hoc Networks
Mónica, D. (2009) · Cited by 8
SYSLOC: Hybrid Key Generation in Sensor Network
Ambika, N. (2020) · Advances in intelligent systems and computing · doi:10.1007/978-3-030-40305-8_16 · Cited by 8
Secure and efficient multifunctional data aggregation without trusted authority in edge-enhanced IoT
Wu, Q., Zhou, F., Xu, J. F., Wang, Q., & Feng, D. (2022) · Journal of Information Security and Applications · doi:10.1016/j.jisa.2022.103270 · Cited by 8
Light-Weight Security Protocol and Data Model for Chip-to-Chip Zero-Trust
Ahmed, A., Shoufan, A., & Belwafi, K. (2023) · IEEE Access · doi:10.1109/access.2023.3285630 · Cited by 8
Advantages of identity certificate segregation in P2PSIP systems
Touceda, D. S., Cámara, J. M. S., Villalba, L. J. G., & Márquez, J. T. (2011) · IET Communications · doi:10.1049/iet-com.2010.0442 · Cited by 8
Random channel hopping schemes for key agreement in wireless networks
Zan, B., & Gruteser, M. (2009) · IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC) · doi:10.1109/pimrc.2009.5450011 · Cited by 8
Tsiamis, A., Alexandru, A. B., & Pappas, G. J. (2019) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2019.8814478 · Cited by 8
Yeniaras, E., & Cenk, M. (2022) · Journal of Cryptographic Engineering · doi:10.1007/s13389-021-00282-7 · Cited by 9
Unconditionally Secure Group Authentication
van Dijk, M., Gehrmann, C., & Smeets, B. (1998) · Designs Codes and Cryptography · doi:10.1023/a:1008261021505 · Cited by 8
Efficient trapdoor-based client puzzle system against DoS attacks
Gao, Y. F. (2005) · Research Online (University of Wollongong) · Cited by 8
Approximate Matching for Peer-to-Peer Overlays with Cubit
Wong, B., Slivkins, A., & Sirer, E. G. (2008) · eCommons (Cornell University) · Cited by 8
A secure distance-based RFID identification protocol with an off-line back-end database
Lopez, P. P., Orfila, A., Palomar, E., & Hernandez-Castro, J. C. (2011) · Personal and Ubiquitous Computing · doi:10.1007/s00779-011-0396-y · Cited by 7
Lossy Chains and Fractional Secret Sharing
Ishai, Y., Eyal Kushilevitz, Z., & Strulovich, O. (2013) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.stacs.2013.160 · Cited by 7
A rational framework for secure communication
Tian, Y., Ma, J., Peng, C., Wang, Y., & Zhang, L. (2013) · Information Sciences · doi:10.1016/j.ins.2013.06.027 · Cited by 7
A practical quantum public-key encryption model
Wang, Y., & She, K. (2017) · International Conference on Information Management · doi:10.1109/infoman.2017.7950410 · Cited by 7
Cryptography from Planted Graphs: Security with Logarithmic-Size Messages
Abram, D., Beimel, A., Ishai, Y., Eyal Kushilevitz, Z., & Narayanan, V. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-48615-9_11 · Cited by 7
Yan, S. Y. (2018) · Springer eBooks · doi:10.1007/978-3-319-72536-9_4 · Cited by 7
SocialMesh: Can networks of meshed smartphones ensure public access to twitter during an attack?
Srikrishna, D., & Krishnamoorthy, R. (2012) · IEEE Communications Magazine · doi:10.1109/mcom.2012.6211492 · Cited by 7
Cryptography in a Quantum World
Brassard, G. (2016) · Lecture notes in computer science · doi:10.1007/978-3-662-49192-8_1 · Cited by 7
A New Key Agreement Scheme Based on the Triple Decomposition Problem
Peker, Y. K. (2014) · International journal of network security · doi:10.6633/ijns.201411.16(6).04 · Cited by 7
Mobile Agents: Preserving Privacy and Anonymity
Zwierko, A., & Kotulski, Z. (2005) · Lecture notes in computer science · doi:10.1007/11558637_25 · Cited by 7
An Evenhanded Certified Email System for Contract Signing
Imamoto, K., Zhou, J., & Sakurai, K. (2005) · Lecture notes in computer science · doi:10.1007/11602897_1 · Cited by 7
A New Method of Isolation of Isoflavones from Glycine max (Soya Beans) by Complexation Technique
Rao, P. R., Kumar, K. G., & Narayanan, M. C. (2008) · Asian Journal of Scientific Research · doi:10.3923/ajsr.2008.176.179 · Cited by 7
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
