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.
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
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?
SSI has its privacy roots in the 1970s by the introduction of the Diffie-Hellman key-exchange protocol that allows users to protect their privacy in the digital environment using public key cryptography.
“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]
The Introduction and Abstract describe selecting a key over an open channel while keeping communications secure. The Addenda cite Diffie and Hellman's 1976 paper and relate Merkle's own puzzle method to public-key cryptography, but do not identify that method as the Diffie–Hellman key-exchange protocol or discuss SSI's privacy roots. (LLM, conf=0.85)
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.
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 · see citing works
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 · see citing works
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 · see citing works
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× · see citing works
“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,203 · see citing works
Cryptography and Computer Privacy
Feistel, H. (1973) · Scientific American · doi:10.1038/scientificamerican0573-15 · Cited by 894 · see citing works
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 · see citing works
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
- Merkle, R., and Hellman, M. Hiding information and receipts in trap door knapsacks. To appear, IEEE Trans. on Inform.
Cited by
Sorted by citations
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713 · see citing works
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 · see citing works
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 · see citing works
Douceur, J. R. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45748-8_24 · Cited by 4,419 · see citing works
Untraceable electronic mail, return addresses, and digital pseudonyms
Chaum, D. (1981) · Communications of the ACM · doi:10.1145/358549.358563 · Cited by 4,299 · see citing works
Guide to Elliptic Curve Cryptography
Hankerson, D., Menezes, A., & Vanstone, S. A. (2004) · Springer eBooks · doi:10.1007/b97644 · Cited by 3,102 · see citing works
Random key predistribution schemes for sensor networks
Chan, H., Perrig, A., & Song, D. S. (2004) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/secpri.2003.1199337 · Cited by 2,837 · see citing works
Merkle, R. C. (2007) · Springer eBooks · doi:10.1007/0-387-34805-0_21 · Cited by 1,706 · see citing works
Self-citationA Randomized Protocol for Signing Contracts
Even, S., Goldreich, O., & Lempel, A. (1983) · Springer eBooks · doi:10.1007/978-1-4757-0602-4_19 · Cited by 1,438 · see citing works
The dining cryptographers problem: Unconditional sender and recipient untraceability
Chaum, D. (1988) · Journal of Cryptology · doi:10.1007/bf00206326 · Cited by 1,419 · see citing works
Protocols for Public Key Cryptosystems
Merkle, R. C. (1980) · 1980 IEEE Symposium on Security and Privacy · doi:10.1109/sp.1980.10006 · Cited by 1,418 · see citing works
Self-citationPohlig, S., & Hellman, M. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055817 · Cited by 1,199 · see citing works
Perfectly-Secure Key Distribution for Dynamic Conferences
Blundo, C., Santis, A. D., Herzberg, A., Kutten, S., Vaccaro, U., & Yung, M. M. (1993) · Lecture notes in computer science · doi:10.1007/3-540-48071-4_33 · Cited by 1,030 · see citing works
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 · see citing works
Self-citationDesignated Verifier Proofs and Their Applications
Jakobsson, M., Sako, K., & Impagliazzo, R. (1996) · Lecture notes in computer science · doi:10.1007/3-540-68339-9_13 · Cited by 824 · see citing works
Secure routing for structured peer-to-peer overlay networks
Castro, M., Druschel, P., Ganesh, A. J., Rowstron, A. I. T., & Wallach, D. S. (2002) · ACM SIGOPS Operating Systems Review · doi:10.1145/844128.844156 · Cited by 747 · see citing works
Limits on the provable consequences of one-way permutations
Impagliazzo, R., & Rudich, S. (1989) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/73007.73012 · Cited by 580 · see citing works
A survey of key management schemes in wireless sensor networks
Xiao, Y., Rayi, V. K., Sun, B., Du, X., Hu, F., & Galloway, M. (2007) · Computer Communications · doi:10.1016/j.comcom.2007.04.009 · Cited by 578 · see citing works
Privacy and authentication: An introduction to cryptography
Diffie, W., & Hellman, M. E. (1979) · Proceedings of the IEEE · doi:10.1109/proc.1979.11256 · Cited by 468 · see citing works
Shared generation of authenticators and signatures
Desmedt, Y., & Frankel, Y. (2007) · Springer eBooks · doi:10.1007/3-540-46766-1_37 · Cited by 392 · see citing works
Combinatorial Design of Key Distribution Mechanisms for Wireless Sensor Networks
Camtepe, S. A., & Yener, B. (2007) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2007.892879 · Cited by 361 · see citing works
ELK, a new protocol for efficient large-group key distribution
Penrig, A., Song, D. X., & Tygar, D. (2002) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/secpri.2001.924302 · Cited by 356 · see citing works
Moore, C., & Mertens, S. (2011) · doi:10.1093/acprof:oso/9780199233212.001.0001 · Cited by 342 · see citing works
Quantum computation and quantum information
Nagy, M., & Akl, S. G. (2005) · International Journal of Parallel Emergent and Distributed Systems · doi:10.1080/17445760500355678 · Cited by 320 · see citing works
An introduction to contemporary cryptology
Massey, J. L. (1988) · Proceedings of the IEEE · doi:10.1109/5.4440 · Cited by 252 · see citing works
Symmetric and Asymmetric Encryption
Simmons, G. J. (1979) · ACM Computing Surveys · doi:10.1145/356789.356793 · Cited by 246 · see citing works
Quantum cryptography beyond quantum key distribution
Broadbent, A., & Schaffner, C. (2015) · Designs Codes and Cryptography · doi:10.1007/s10623-015-0157-4 · Cited by 241 · see citing works
Secure Communications over Insecure Channels Based on Short Authenticated Strings
Serge Vaudenay, B. (2005) · Lecture notes in computer science · doi:10.1007/11535218_19 · Cited by 240 · see citing works
A Survey of Peer-to-Peer Security Issues
Wallach, D. S. (2003) · Lecture notes in computer science · doi:10.1007/3-540-36532-x_4 · Cited by 232 · see citing works
Unconventional cryptographic keying variable management
Hershey, J. E., Hassan, A. A., & Yarlagadda, R. (1995) · IEEE Transactions on Communications · doi:10.1109/26.385951 · Cited by 231 · see citing works
Using client puzzles to protect TLS
Dean, D., & Stubblefield, A. (2001) · USENIX Security Symposium · Cited by 222 · see citing works
The first ten years of public-key cryptography
Diffie, W. (1988) · Proceedings of the IEEE · doi:10.1109/5.4442 · Cited by 219 · see citing works
Moderately hard, memory-bound functions
Abadi, M., Burrows, M., Manasse, M., & Wobber, T. (2005) · ACM Transactions on Internet Technology · doi:10.1145/1064340.1064341 · Cited by 218 · see citing works
An overview of public key cryptography
Hellman, M. E. (2002) · IEEE Communications Magazine · doi:10.1109/mcom.2002.1006971 · Cited by 215 · see citing works
Combinatorial Design of Key Distribution Mechanisms for Wireless Sensor Networks
Camtepe, S. A., & Yener, B. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-30108-0_18 · Cited by 212 · see citing works
Defending against denial-of-service attacks with puzzle auctions
Wang, X., & Reiter, M. K. (2004) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/secpri.2003.1199329 · Cited by 209 · see citing works
A survey on key management mechanisms for distributed Wireless Sensor Networks
Junior, M. A. S., Barreto, P. S. L. M., Margi, C. B., & Carvalho, T. C. M. D. B. (2010) · Computer Networks · doi:10.1016/j.comnet.2010.04.010 · Cited by 203 · see citing works
New client puzzle outsourcing techniques for DoS resistance
Waters, B. R., Juels, A., Halderman, J. A., & Felten, E. W. (2004) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/1030083.1030117 · Cited by 185 · see citing works
Hiding the hidden: A software system for concealing ciphertext as innocuous text
Chapman, M., & Davida, G. I. (1997) · Lecture notes in computer science · doi:10.1007/bfb0028489 · Cited by 169 · see citing works
Public-key cryptography from different assumptions
Applebaum, B., Barak, B., & Wigderson, A. (2010) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1806689.1806715 · Cited by 144 · see citing works
A Security Framework for the Internet of Things in the Future Internet Architecture
Liu, X., Zhao, M., Li, S., Zhang, F., & Trappe, W. K. (2017) · Future Internet · doi:10.3390/fi9030027 · Cited by 135 · see citing works
HAVAL - A One-Way Hashing Algorithm with Variable Length of Output
Yuliang Zheng, A., Pieprzyk, J., & Seberry, J. (1992) · Research Online (University of Wollongong) · Cited by 135 · see citing works
A Survey of Self-Sovereign Identity Ecosystem
Soltani, R., Nguyen, U. T., & An, A. (2021) · Security and Communication Networks · doi:10.1155/2021/8873429 · Cited by 131 · see citing works
“While SSI has been gaining recognition in the recent years [61–63], it has its privacy roots in the 1970s by the introduction of Diffie–Hellman key-exchange protocol that allows users to protect their privacy in the digital environment using public key cryptography [64].”
BackgroundTaming IP packet flooding attacks
Lakshminarayanan, K., Adkins, D., Perrig, A., & Stoica, I. G. (2004) · ACM SIGCOMM Computer Communication Review · doi:10.1145/972374.972383 · Cited by 124 · see citing works
Penrose tiles to trapdoor ciphers
Gardner, M. (1988) · CERN Document Server (European Organization for Nuclear Research) · Cited by 123 · see citing works
Dinger, J., & Hannes Hartenstein, B. (2006) · International Conference on Availability, Reliability and Security (ARES) · doi:10.1109/ares.2006.45 · Cited by 122 · see citing works
Limits on the Provable Consequences of One-way Permutations
Impagliazzo, R., & Rudich, S. (1990) · Lecture notes in computer science · doi:10.1007/0-387-34799-2_2 · Cited by 116 · see citing works
A Practical Protocol for Large Group Oriented Networks
Frankel, Y. (2007) · Springer eBooks · doi:10.1007/3-540-46885-4_8 · Cited by 116 · see citing works
Encryption and Secure Computer Networks
Popek, G. J., & Kline, C. S. (1979) · ACM Computing Surveys · doi:10.1145/356789.356794 · Cited by 116 · see citing works
A survey of key distribution in wireless sensor networks
Chen, C., & Chao, H. (2011) · Security and Communication Networks · doi:10.1002/sec.354 · Cited by 115 · see citing works
On the Origins and Variations of Blockchain Technologies
Sherman, A. T., Javani, F., Zhang, H., & Golaszewski, E. (2019) · IEEE Security & Privacy · doi:10.1109/msec.2019.2893730 · Cited by 115 · see citing works
Wahono (2007) · doi:10.3923/jse.2007.1.12 · Cited by 113 · see citing works
Tanenbaum, A. S. (1981) · ACM Computing Surveys · doi:10.1145/356859.356864 · Cited by 111 · see citing works
Packet-Hiding Methods for Preventing Selective Jamming Attacks
Proaño, A., & Lazos, L. (2011) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2011.41 · Cited by 110 · see citing works
Limiting Sybil Attacks in Structured P2P Networks
Rowaihy, H., Enck, W., McDaniel, P. D., & Porta, T. L. (2007) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2007.328 · Cited by 110 · see citing works
Conditional Oblivious Transfer and Timed-Release Encryption
Crescenzo, G. D., Ostrovsky, R., & Rajagopalan, S. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48910-x_6 · Cited by 110 · see citing works
On the Security Properties of OAEP as an All-or-Nothing Transform
Boyko, V. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48405-1_32 · Cited by 106 · see citing works
Efficient and secure conference-key distribution
Burmester, M. V. D., & Desmedt, Y. (1997) · Lecture notes in computer science · doi:10.1007/3-540-62494-5_12 · Cited by 101 · see citing works
On the Sybil attack detection in VANET
Guette, G., & Ducourthial, B. (2007) · IEEE International Conference on Mobile Ad-Hoc and Sensor Systems (MASS) · doi:10.1109/mobhoc.2007.4428742 · Cited by 100 · see citing works
The design and implementation of network puzzles
Feng, W.-C., Kaiser, E., Feng, W., & Luu, A. (2005) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2005.1498523 · Cited by 96 · see citing works
Brahms: Byzantine resilient random membership sampling
Bortnikov, E., Gurevich, M., Keidar, I., Kliot, G., & Shraer, A. (2009) · Computer Networks · doi:10.1016/j.comnet.2009.03.008 · Cited by 92 · see citing works
Time-Lock Puzzles in the Random Oracle Model
Mahmoody, M., Moran, T., & Vadhan, S. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-22792-9_3 · Cited by 92 · see citing works
Architecture and protocols of the future European quantum key distribution network
Dianati, M., Alléaume, R., Gagnaire, M., & Shen, X. (2008) · Security and Communication Networks · doi:10.1002/sec.13 · Cited by 89 · see citing works
Selective Jamming Attacks in Wireless Networks
Proaño, A., & Lazos, L. (2010) · International Conference on Communications · doi:10.1109/icc.2010.5502322 · Cited by 87 · see citing works
TARP: Ticket-based address resolution protocol
Lootah, W., Enck, W., & McDaniel, P. D. (2007) · Computer Networks · doi:10.1016/j.comnet.2007.05.007 · Cited by 80 · see citing works
An Efficient and Robust Data Aggregation Scheme Without a Trusted Authority for Smart Grid
Xue, K., Zhu, B., Yang, Q., Wei, D. S. L., & Guizani, M. (2019) · IEEE Internet of Things Journal · doi:10.1109/jiot.2019.2961966 · Cited by 79 · see citing works
Cross-Layer Jamming Detection and Mitigation in Wireless Broadcast Networks
Chiang, J. T., & Hu, Y. (2010) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2010.2068576 · Cited by 79 · see citing works
Merkle Puzzles Are Optimal — An O(n2)-Query Attack on Any Key Exchange from a Random Oracle
Barak, B., & Mahmoody, M. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-03356-8_22 · Cited by 79 · see citing works
Why and how to establish a private code on a public network
Goldwasser, S., Micali, S. M., & Tong, P. (1982) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1982.100 · Cited by 79 · see citing works
The physics of information technology
(2001) · Choice Reviews Online · doi:10.5860/choice.38-5598 · Cited by 79 · see citing works
ODAR: On-Demand Anonymous Routing in Ad Hoc Networks
Sy, D., Chen, R., & Bao, L. (2006) · IEEE International Conference on Mobile Ad-Hoc and Sensor Systems (MASS) · doi:10.1109/mobhoc.2006.278565 · Cited by 77 · see citing works
Key Distribution Techniques for Sensor Networks
Chan, H., Perrig, A., & Song, D. X. (2006) · Kluwer Academic Publishers eBooks · doi:10.1007/1-4020-7884-6_13 · Cited by 77 · see citing works
Iso-X: A Flexible Architecture for Hardware-Managed Isolated Execution
Evtyushkin, D., Elwell, J., Özsoy, M., Ponomarev, D., Abu‐Ghazaleh, N., & Riley, R. D. (2014) · IEEE/ACM International Symposium on Microarchitecture (MICRO) · doi:10.1109/micro.2014.25 · Cited by 76 · see citing works
Hybrid low-voltage physical unclonable function based on inkjet-printed metal-oxide transistors
Scholz, A. S., Zimmermann, L., Gengenbach, U. K., Koker, L., Chen, Z., Hahn, H., Sikora, A., Tahoori, M. B., & Aghassi‐Hagmann, J. (2020) · Nature Communications · doi:10.1038/s41467-020-19324-5 · Cited by 75 · see citing works
Sybil Nodes Detection Based on Received Signal Strength Variations within VANET
Bouassida, M. S., Guette, G., & Shawky, M. (2007) · Cited by 75 · see citing works
Scalable, Server-Passive, User-Anonymous Timed Release Cryptography
Chan, A. C.-F., & Blake, I. F. (2005) · IEEE International Conference on Distributed Computing Systems (ICDCS) · doi:10.1109/icdcs.2005.72 · Cited by 75 · see citing works
Lempel, A. (1979) · ACM Computing Surveys · doi:10.1145/356789.356792 · Cited by 75 · see citing works
Papaya: Practical, Private, and Scalable Federated LearningPreprint
Huba, D., Nguyen, J., Malik, K., Zhu, R., Rabbat, M., Yousefpour, A., Wu, C.-J., Zhan, H., Ustinov, P., Srinivas, H., et al. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2111.04877 · Cited by 75 · see citing works
Publicly verifiable lotteries: Applications of delaying functions
Goldschlag, D. M., & Stubblebine, S. G. (1998) · Lecture notes in computer science · doi:10.1007/bfb0055485 · Cited by 74 · see citing works
Threshold DSS Signatures without a Trusted Party
Langford, S. K. (1995) · Lecture notes in computer science · doi:10.1007/3-540-44750-4_32 · Cited by 73 · see citing works
Quantum Advantage in Cryptography
Renner, R., & Wolf, R. (2023) · AIAA Journal · doi:10.2514/1.j062267 · Cited by 72 · see citing works
Cross-layer jamming detection and mitigation in wireless broadcast networks
Chiang, J. T., & Hu, Y. (2007) · ACM Annual International Conference on Mobile Computing and Networking (MobiCom) · doi:10.1145/1287853.1287901 · Cited by 71 · see citing works
DoS-resistant ID-based password authentication scheme using smart cards
Hwang, M., Chong, S., & Chen, T.-Y. (2009) · Journal of Systems and Software · doi:10.1016/j.jss.2009.07.050 · Cited by 67 · see citing works
A Simple Protocol for Signing Contracts
Goldreich, O. (1984) · Springer eBooks · doi:10.1007/978-1-4684-4730-9_11 · Cited by 66 · see citing works
Untraceable Electronic Mail, Return Addresses and Digital Pseudonyms
Chaum, D. (2003) · Advances in information security · doi:10.1007/978-1-4615-0239-5_14 · Cited by 65 · see citing works
Rivest, R. L. (1990) · Elsevier eBooks · doi:10.1016/b978-0-444-88071-0.50018-7 · Cited by 65 · see citing works
Entity authentication and authenticated key transport protocols employing asymmetric techniques
Blake-Wilson⋆⋆, S., & Menezes, A. (1998) · Lecture notes in computer science · doi:10.1007/bfb0028166 · Cited by 65 · see citing works
Quantum Attacks on Public-Key Cryptosystems
Yan, S. Y. (2013) · Springer eBooks · doi:10.1007/978-1-4419-7722-9 · Cited by 64 · see citing works
Authenticated data structures, generically
Miller, A. E., Hicks, M., Katz, J. I., & Shi, E. (2014) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/2535838.2535851 · Cited by 63 · see citing works
Requirements for Secure Clock Synchronization
Narula, L., & Humphreys, T. E. (2018) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2018.2835772 · Cited by 63 · see citing works
Key Predistribution Schemes for Establishing Pairwise Keys with a Mobile Sink in Sensor Networks
Rasheed, A. A., & Mahapatra, R. (2010) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2010.57 · Cited by 58 · see citing works
Rabin, M. O., & Thorpe, C. (2006) · Digital Access to Scholarship at Harvard (DASH) (Harvard University) · Cited by 58 · see citing works
Peer-to-Peer-Based Social Networks: A Comprehensive Survey
Masinde, N. W., & Graffi, K. (2020) · SN Computer Science · doi:10.1007/s42979-020-00315-8 · Cited by 57 · see citing works
A Control-Plane Perspective on Reducing Data Access Latency in LTE Networks
Li, Y., Yuan, Z., & Peng, C. (2017) · ACM Annual International Conference on Mobile Computing and Networking (MobiCom) · doi:10.1145/3117811.3117838 · Cited by 57 · see citing works
An overview of public key cryptography
Hellman, M. E. (1978) · Communications Society · doi:10.1109/mcom.1978.1089772 · Cited by 57 · see citing works
Efficient Fair Exchange with Verifiable Confirmation of Signatures
Chen, L. (1998) · Lecture notes in computer science · doi:10.1007/3-540-49649-1_23 · Cited by 57 · see citing works
Secure and reliable clustering in wireless sensor networks: A critical survey
Schaffer, P., Farkas, K., Horváth, Á., Holczer, T., & Buttyán, L. (2012) · Computer Networks · doi:10.1016/j.comnet.2012.03.021 · Cited by 56 · see citing works
SROS2: Usable Cyber Security Tools for ROS 2
Mayoral-Vilches, V., White, R., Caiazza, G., & Arguedas, M. (2022) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros47612.2022.9982129 · Cited by 55 · see citing works
Aslam, M. M., Tufail, A., Apong, R. A. A. H. M., Silva, L. C. D., & Raza, M. T. (2024) · IEEE Access · doi:10.1109/access.2024.3394848 · Cited by 54 · see citing works
Machine-learning attacks on interference-based optical encryption: experimental demonstration
Zhou, L., Xiao, Y., & Chen, W. (2019) · Optics Express · doi:10.1364/oe.27.026143 · Cited by 54 · see citing works
- 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 › Artificial Intelligence › Cryptography and Data Security
- Physical Sciences › Computer Science › Computer Networks and Communications › Advanced Authentication Protocols Security
- Physical Sciences › Computer Science › Artificial Intelligence › 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
