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 101–200 of 759
Non-Manipulable Aggregator Node Election Protocols for Wireless Sensor Networks
Sirivianos, M., Westhoff, D., Armknecht, F., & Girão, J. (2007) · International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt) · doi:10.1109/wiopt.2007.4480031 · Cited by 53
A protocol for signing contracts
Even, S. (1983) · ACM SIGACT News · doi:10.1145/1008908.1008913 · Cited by 51
Zhou, L., Xiao, Y., & Chen, W. (2019) · Optics Express · doi:10.1364/oe.380004 · Cited by 49
Randomized Encryption Techniques
Rivest, R. L., & Sherman, A. T. (1983) · Springer eBooks · doi:10.1007/978-1-4757-0602-4_14 · Cited by 49
Security Notions and Generic Constructions for Client Puzzles
Chen, L., Morrissey, P., Smart, N. P., & Warinschi, B. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-10366-7_30 · Cited by 48
TARP: Ticket-based Address Resolution Protocol
Lootah, W., Enck, W., & McDaniel, P. D. (2006) · Annual Computer Security Applications Conference · doi:10.1109/csac.2005.55 · Cited by 49
Low-coherence semiconductor light sources: devices and applications
Lu, H., Alkhazragi, O., Wang, Y., Almaymoni, N. K., Yan, W., Gunawan, W. H., Lin, H., Park, T., Ng, T. K., & Ooi, B. S. (2024) · npj Nanophotonics · doi:10.1038/s44310-024-00005-w · Cited by 48
Average-case fine-grained hardness
Ball, M., Rosen, A., Sabin, M., & Vasudevan, P. N. (2017) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3055399.3055466 · Cited by 46
Multiparty Secret Key Exchange Using a Random Deal of Cards
Fischer, M. J., & Wright, R. N. (2007) · Springer eBooks · doi:10.1007/3-540-46766-1_10 · Cited by 46
Foundations, Properties, and Security Applications of Puzzles
Ali, I. M., Caprolu, M., & Pietro, R. D. (2020) · ACM Computing Surveys · doi:10.1145/3396374 · Cited by 43
Multiplicative non-abelian sharing schemes and their application to threshold cryptography
Desmedt, Y., Crescenzo, G. D., & Burmester, M. V. D. (1995) · Lecture notes in computer science · doi:10.1007/bfb0000421 · Cited by 43
HAVAL — A one-way hashing algorithm with variable length of output (extended abstract)
Yuliang Zheng, A., Pieprzyk, J., & Seberry, J. (1993) · Lecture notes in computer science · doi:10.1007/3-540-57220-1_54 · Cited by 41
A distributed detection and prevention scheme from malicious nodes in vehicular networks
Bouali, T., Senouci, S., & Sedjelmaci, H. (2016) · International Journal of Communication Systems · doi:10.1002/dac.3106 · Cited by 41
Bortnikov, E., Gurevich, M., Keidar, I., Kliot, G., & Shraer, A. (2008) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/1400751.1400772 · Cited by 41
On Privacy Homomorphisms (Extended Abstract)
Brickell, E. F., & Yacobi, Y. (2010) · Lecture notes in computer science · doi:10.1007/3-540-39118-5_12 · Cited by 41
A Game Based Analysis of the Client Puzzle Approach to Defend Against DoS Attacks
Bencsáth, B., Vajda, I., & Buttyán, L. (2003) · Cited by 40
Introduction to Mathematical Cryptography
Adhikari, M. R., & Adhikari, A. (2013) · Springer eBooks · doi:10.1007/978-81-322-1599-8_12 · Cited by 39
Scalable, Server-Passive, User-Anonymous Timed Release Public Key Encryption from Bilinear Pairing.
Blake, I. F., & Chan, A. C.-F. (2004) · Cited by 39
Authenticated data structures, generically
Miller, A. E., Hicks, M., Katz, J. I., & Shi, E. (2014) · ACM SIGPLAN Notices · doi:10.1145/2578855.2535851 · Cited by 39
Securing Traceability of Ciphertexts — Towards a Secure Software Key Escrow System
Desmedt, Y. (1995) · Lecture notes in computer science · doi:10.1007/3-540-49264-x_12 · Cited by 39
On Quantum ObfuscationPreprint
Alagic, G., & Fefferman, B. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1602.01771 · Cited by 39
Diffie–Hellman technique: extended to multiple two-party keys and one multi-party key
Biswas, G. (2008) · IET Information Security · doi:10.1049/iet-ifs:20060142 · Cited by 38
The Trouble with Security Requirements
Türpe, S. (2017) · IEEE International Requirements Engineering Conference (RE) · doi:10.1109/re.2017.13 · Cited by 38
COVI White PaperPreprint
Alsdurf, H., Belliveau, E., Bengio, Y., Deleu, T., Gupta, P., Ippolito, D., Janda, R., Jarvie, M., Kolody, T., Krastev, S., et al. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2005.08502 · Cited by 38
Exploring the potential benefits of expanded rate limiting in Tor
Moore, W. B., Wacek, C., & Sherr, M. (2011) · Annual Computer Security Applications Conference · doi:10.1145/2076732.2076762 · Cited by 37
Survey on key revocation mechanisms in wireless sensor networks
Ge, M., Choo, K. R., Wu, H. Y., & Yu, Y. H. (2016) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2016.01.012 · Cited by 37
Quantum Cryptography—A Simplified Undergraduate Experiment and Simulation
Bloom, Y., Fields, I., Maslennikov, A., & Rozenman, G. G. (2022) · Physics · doi:10.3390/physics4010009 · Cited by 37
How to achieve blocking resistance for existing systems enabling anonymous web surfing
Köpsell, S., & Hillig, U. (2004) · ACM Workshop on Privacy in the Electronic Society (WPES) · doi:10.1145/1029179.1029197 · Cited by 37
Gilles Brassard, A. (1979) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1979.36 · Cited by 37
Desmedt, Y., & Yung, M. M. (2007) · Springer eBooks · doi:10.1007/3-540-38424-3_13 · Cited by 37
Nechvatal, J. (1991) · doi:10.6028/nist.sp.800-2 · Cited by 37
Strengthening key agreement using hard-core sets
Holenstein, T. (2006) · doi:10.3929/ethz-a-005205852 · Cited by 37
Practical secrecy-preserving, verifiably correct and trustworthy auctions
Parkes, D. C., Rabin, M. O., Shieber, S. M., & Thorpe, C. A. (2006) · International Conference on Electronic Commerce · doi:10.1145/1151454.1151478 · Cited by 37
Masking traveling beams: Optical solutions for NP-complete problems, trading space for time
Dolev, S., & Fitoussi, H. (2009) · Theoretical Computer Science · doi:10.1016/j.tcs.2009.06.030 · Cited by 36
Al-Asli, M., Elrabaa, M. E. S., & Abu-Amara, M. H. (2018) · IEEE Internet of Things Journal · doi:10.1109/jiot.2018.2864513 · Cited by 36
Weaknesses in Some Threshold Cryptosystems
Langford, S. K. (1996) · Lecture notes in computer science · doi:10.1007/3-540-68697-5_6 · Cited by 36
Formal and Computational Cryptography: Protocols, Hashes and Commitments
Garcia, F. D. (2008) · Radboud Repository (Radboud University) · Cited by 36
Noninteractive Pairwise Key Establishment for Sensor Networks
Yu, C.-M., Lu, C.-S., & Kuo, S. (2010) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2010.2050140 · Cited by 35
Theory and Implementation of Elliptic Curve Cryptography
Rabah, K. (2005) · Journal of Applied Sciences · doi:10.3923/jas.2005.604.633 · Cited by 35
Secure Distribution of Protected Content in Information-Centric Networking
Bilal, M., & Pack, S. (2019) · IEEE Systems Journal · doi:10.1109/jsyst.2019.2931813 · Cited by 34
Revisiting the Security Model for Timed-Release Encryption with Pre-open Capability
Dent, A. W., & Tang, Q. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-75496-1_11 · Cited by 34
Gilles Brassard, A. (1983) · IEEE Transactions on Information Theory · doi:10.1109/tit.1983.1056754 · Cited by 34
The Internet public key infrastructure
Benantar, M. (2001) · IBM Systems Journal · doi:10.1147/sj.403.0648 · Cited by 34
Modern Cryptography and Elliptic Curves
Shemanske, T. R. (2017) · Student mathematical library · doi:10.1090/stml/083 · Cited by 32
Merkle Puzzles in a Quantum World
Brassard, G., Høyer, P., Kalach, K., Kaplan, M., Laplante, S., & Salvail, L. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-22792-9_22 · Cited by 32
Using Simon's algorithm to attack symmetric-key cryptographic primitives
Santoli, T., & Schaffner, C. (2017) · Quantum Information and Computation · doi:10.26421/qic17.1-2-4 · Cited by 32
Communities of Computing: Computer Science and Society in the ACM
Misa, T. J. (2016) · doi:10.1145/2973856 · Cited by 31
Organized Advocacy for Professional Women in Computing: Comparing Histories of the AWC and ACM–W
Misa, T. J. (2016) · doi:10.1145/2973856.2973864 · Cited by 30
Liu, M., Zhang, X., Zhu, H., Zhang, Z., & Deng, R. (2024) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2024.3447235 · Cited by 30
Near optimal unconditionally secure authentication
Taylor, R. (1995) · Lecture notes in computer science · doi:10.1007/bfb0053440 · Cited by 30
Cryptography for Security in IoT
Carracedo, J. M., Milliken, M., Chouhan, P. K., Scotney, B. W., Lin, Z., Sajjad, A., & Shackleton, M. (2018) · International Conference on Internet of Things: Systems, Management and Security (IOTSMS) · doi:10.1109/iotsms.2018.8554634 · Cited by 29
Secure Key Exchange Against Man-in-the-Middle Attack: Modified Diffie-Hellman Protocol
Kara, M., Laouid, A., AlShaikh, M., Bounceur, A., & Hammoudeh, M. A. A. (2021) · Jurnal Ilmiah Teknik Elektro Komputer dan Informatika · doi:10.26555/jiteki.v7i3.22210 · Cited by 28
The Complexity of Public-Key Cryptography
Barak, B. (2017) · Information security and cryptography · doi:10.1007/978-3-319-57048-8_2 · Cited by 28
Throwing computing into reverse
Frank, M. P. (2017) · IEEE Spectrum · doi:10.1109/mspec.2017.8012237 · Cited by 27
Cryptography and Secure Communication
Blahut, R. E. (2014) · Cambridge University Press eBooks · doi:10.1017/cbo9781139013673 · Cited by 27
Basing Weak Public-Key Cryptography on Strong One-Way Functions
Biham, E., Goren, Y. J., & Ishai, Y. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-78524-8_4 · Cited by 27
DPKI: A Blockchain-Based Decentralized Public Key Infrastructure System
Papageorgiou, A., Mygiakis, A., Loupos, K., & Krousarlis, T. (2020) · Global Internet of Things Summit (GIoTS) · doi:10.1109/giots49054.2020.9119673 · Cited by 26
On the security of some variants of rsa
Hinek, M. J. (2007) · Cited by 26
Degwekar, A., Vaikuntanathan, V., & Vasudevan, P. N. (2016) · Lecture notes in computer science · doi:10.1007/978-3-662-53015-3_19 · Cited by 25
A Light-Weight e-Voting System with Distributed Trust
Zwierko, A., & Kotulski, Z. (2007) · Electronic Notes in Theoretical Computer Science · doi:10.1016/j.entcs.2006.12.004 · Cited by 25
Security in open networks and distributed systems
Janson, P. A., & Molva, R. A. (1991) · Computer Networks and ISDN Systems · doi:10.1016/0169-7552(91)90092-q · Cited by 25
Secure and Verifiable Data Collaboration with Low-Cost Zero-Knowledge Proofs
Zhu, Y., Wu, Y., Luo, Z., Ooi, B. C., & Xiao, X. (2024) · Proceedings of the VLDB Endowment · doi:10.14778/3665844.3665860 · Cited by 24
Simple analysis of security of the BB84 quantum key distribution protocol
Su, H.-Y. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02663-z · Cited by 24
A multi-layer framework for puzzle-based denial-of-service defense
Wang, X., & Reiter, M. K. (2007) · International Journal of Information Security · doi:10.1007/s10207-007-0042-x · Cited by 24
A new group Diffie-Hellman key generation proposal for secure VANET communications
Mejri, M. N., Achir, N., & Hamdi, M. (2016) · IEEE Consumer Communications and Networking Conference · doi:10.1109/ccnc.2016.7444925 · Cited by 24
Fair e-Lotteries and e-Casinos
Eyal Kushilevitz, Z., & Rabin, T. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45353-9_9 · Cited by 24
Secure personal computing in an insecure network
Denning, D. E. (1979) · Communications of the ACM · doi:10.1145/359138.359143 · Cited by 24
Resource-Competitive Algorithms
Bender, M. A., Fineman, J. T., Movahedi, M., Saia, J., Dani, V., Gilbert, S. L., Pettie, S., & Young, M. (2015) · ACM SIGACT News · doi:10.1145/2818936.2818949 · Cited by 23
An empirical study of tactical vulnerabilities
Santos, J. C. S., Tarrit, K., Sejfia, A., Mirakhorli, M. T., & Galster, M. (2018) · Journal of Systems and Software · doi:10.1016/j.jss.2018.10.030 · Cited by 23
A Critical Review of Receipt-Freeness and Coercion-Resistance
Meng, B. (2009) · Information Technology Journal · doi:10.3923/itj.2009.934.964 · Cited by 23
Cryptology: The Mathematics of Secure Communication
Simmons, G. J., Grattan-Guinness, I., Garder, A. O., & Poston, T. (1979) · The Mathematical Intelligencer · doi:10.1007/bf03028244 · Cited by 23
Anonymous Credentials for Privacy-Preserving E-learning
Aı̈meur, E., Hage, H., & Onana, F. S. M. (2008) · International MCETECH Conference on e-Technologies (MCETECH) · doi:10.1109/mcetech.2008.26 · Cited by 23
Efficient Memory Bound Puzzles Using Pattern Databases
Doshi, S., Monrose, F., & Rubin, A. D. (2006) · Lecture notes in computer science · doi:10.1007/11767480_7 · Cited by 23
Secure Computing Enclaves Using FPGAs
Elrabaa, M. E. S., Al-Asli, M., & Abu-Amara, M. H. (2019) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2019.2933214 · Cited by 22
Unconditionally Secure Authentication Schemes and Practical and Theoretical Consequences
Desmedt, Y. (2007) · Springer eBooks · doi:10.1007/3-540-39799-x_6 · Cited by 22
Brassard, G., & Salvail, L. (2008) · International Conference on Quantum, Nano and Micro Technologies (ICQNM) · doi:10.1109/icqnm.2008.16 · Cited by 22
An efficient random key distribution scheme for large‐scale distributed sensor networks
Das, A. K. (2009) · Security and Communication Networks · doi:10.1002/sec.123 · Cited by 22
New privacy-preserving architectures for identity-/attribute-based encryption
Dodis, Y., Shoup, V., & Chow, S. P. (2010) · Cited by 22
Gupta, T., Fingler, H., Alvisi, L., & Walfish, M. (2017) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/3098822.3098835 · Cited by 22
Conjugacy Systems Based on Nonabelian Factorization Problems and Their Applications in Cryptography
Gu, L., & Zheng, S. (2014) · Journal of Applied Mathematics · doi:10.1155/2014/630607 · Cited by 21
Crypto Crumple Zones: Enabling Limited Access without Mass Surveillance
Wright, C. V., & Varia, M. (2018) · IEEE European Symposium on Security and Privacy · doi:10.1109/eurosp.2018.00028 · Cited by 21
Secure multiparty privacy preserving data aggregation by modular arithmetic
Ukil, A., & Sen, J. (2010) · International Conference on Parallel, Distributed and Grid Computing (PDGC) · doi:10.1109/pdgc.2010.5679976 · Cited by 21
“Deeply Political and Social Issues”: Debates within ACM 1965–1985
Misa, T. J. (2016) · doi:10.1145/2973856.2973863 · Cited by 20
pTCP: A Client Puzzle Protocol For Defending Against Resource Exhaustion Denial of Service Attacks
McNevin, T. J., Park, J.-M. J., & Marchany, R. C. (2004) · Cited by 20
Public-Key Cryptography in the Fine-Grained Setting
LaVigne, R., Lincoln, A., & Williams, V. V. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-26954-8_20 · Cited by 20
What Happened with Knapsack Cryptographic Schemes?
Desmedt, Y. (1988) · Springer eBooks · doi:10.1007/978-94-009-2794-0_7 · Cited by 20
A Certified E-mail System with Receiver’s Selective Usage of Delivery Authority
Imamoto, K., & Sakurai, K. (2002) · Lecture notes in computer science · doi:10.1007/3-540-36231-2_26 · Cited by 20
Framing Computer Security and Privacy, 1967–1992
Misa, T. J. (2016) · doi:10.1145/2973856.2973869 · Cited by 19
An efficient protocol for unconditionally secure secret key exchange
Fischer, M. J., & Wright, R. N. (1993) · doi:10.5555/313559.313862 · Cited by 19
Misa, T. J. (2016) · doi:10.1145/2973856.2973866 · Cited by 18
Dordis: Efficient Federated Learning with Dropout-Resilient Differential Privacy
Jiang, Z., Wang, W., & Chen, R. (2024) · European Conference on Computer Systems · doi:10.1145/3627703.3629559 · Cited by 21
A Secure Authenticated Key Agreement Protocol For Wireless Security
Abi-Char, P. E., M’Hamed, A., & El-Hassan, B. (2007) · International Conference on Information Assurance and Security (IAS) · doi:10.1109/ias.2007.56 · Cited by 18
Anonymous, Zalcman, A., Gidney, C., Broughton, M., Khattar, T., Neven, H., Bergamaschi, T., Drake, J., & Boneh, D. (2026) · PRX Quantum · doi:10.1103/j3xf-bw18 · Cited by 58
New DoS Defense Method Based on Strong Designated Verifier Signatures
Almeida, M. P. D., de Sousa, R. T., Villalba, L. J. G., & Kim, T.-H. (2018) · Sensors · doi:10.3390/s18092813 · Cited by 17
Wireless Resource Optimization in Hybrid Semantic/Bit Communication Networks
Xia, L., Sun, Y., Niyato, D. T., Zhang, L., & Imran, M. A. (2024) · IEEE Transactions on Communications · doi:10.1109/tcomm.2024.3485582 · Cited by 20
BAP: Broadcast Authentication Using Cryptographic Puzzles
Schaller, P., Čapkun, S., & Basin, D. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-72738-5_26 · Cited by 17
A Simple Non-Interactive Pairwise Key Establishment Scheme in Sensor Networks
Yu, C.-M., Lu, C.-S., & Kuo, S. (2009) · IEEE International Conference on Sensing, Communication, and Networking (SECON) · doi:10.1109/sahcn.2009.5168906 · Cited by 17
Key Management Mechanisms in Wireless Sensor Networks
Barati, A., Dehghan, M., Barati, H., & Mazreah, A. A. (2008) · International Conference on Sensor Technologies and Applications · doi:10.1109/sensorcomm.2008.85 · Cited by 17
Secure Access Control for Location-Based Applications in WLAN Systems
Cho, Y., & Bao, L. (2006) · IEEE International Conference on Mobile Ad-Hoc and Sensor Systems (MASS) · doi:10.1109/mobhoc.2006.278664 · Cited by 17
Key establishment : proofs and refutations
Choo, K. R. (2006) · Cited by 17
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
