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 401–500 of 759
Quantum Secure Multiparty Computation of Phylogenetic Trees of SARS-CoV-2 Genome
Santos, M. B., Gomes, A. C., Pinto, A. N., & Mateus, P. (2021) · Telecoms Conference (ConfTELE) · doi:10.1109/conftele50222.2021.9435479 · Cited by 3
Dinur, I., & Hasson, B. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-90453-1_11 · Cited by 3
Design and Analysis of Multi-Block-Length Hash Functions
Özen, O. (2012) · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · doi:10.5075/epfl-thesis-5333 · Cited by 3
Data confidentiality service on top of transmission control protocol/internet protocol
Ramaswamy, R. (2002) · IEEE Computer Society European Conference (CompEuro) · doi:10.1109/cmpeur.1990.113657 · Cited by 3
Aı̈meur, E., Gilles Brassard, A., & Onana, F. S. M. (2006) · Journal of Computer Security · doi:10.3233/jcs-2006-14603 · Cited by 3
Privacy addressing and autoconfiguration for mobile ad hoc networks
Li, L., Mao, Y., & Leng, S. (2010) · Computer Communications · doi:10.1016/j.comcom.2010.06.023 · Cited by 3
Wu, C.-H. J., Huang, C.-C. A., & Irwin, J. D. (2007) · Spring Simulation Multiconference · doi:10.5555/1404803.1404806 · Cited by 3
Optimal implementation of elliptic curve cryptography
Lv, H., Li, H., Yi, J., & Lü, H. (2013) · IEEE International Conference on Service Operations and Logistics, and Informatics (SOLI) · doi:10.1109/soli.2013.6611377 · Cited by 3
Decentralized certification scheme for secure admission in on-the-fly peer-to-peer systems
Suárez, D., Camara, J. M. S., & Soriano, M. (2011) · Peer-to-Peer Networking and Applications · doi:10.1007/s12083-011-0113-7 · Cited by 3
Authenticated key exchange with group support for wireless sensor networks
Švenda, P., & Matyáš, V. (2007) · IEEE International Conference on Mobile Ad-Hoc and Sensor Systems (MASS) · doi:10.1109/mobhoc.2007.4428767 · Cited by 3
Using Merkle's Puzzle for key agreement with low-end devices
Armknecht, F., & Westhoff, D. (2009) · Conference on Local Computer Networks · doi:10.1109/lcn.2009.5355012 · Cited by 3
A Novel Symmetric Key Cryptography using Multiple Random Secret Keys
Chakravarthy, A. S. N., & Anjikumar, T. (2013) · International Journal of Computer Applications · doi:10.5120/13954-1890 · Cited by 3
Securing User-Controlled Routing Infrastructures
Lakshminarayanan, K., Adkins, D., Perrig, A., & Stoica, I. G. (2008) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2007.903980 · Cited by 3
What is the Future of Cryptography?
Desmedt, Y. (2016) · Lecture notes in computer science · doi:10.1007/978-3-662-49301-4_7 · Cited by 3
A study of prime numbers distribution based on support vector domain description
Boujnouni, M. E. (2021) · Journal of Information and Optimization Sciences · doi:10.1080/02522667.2020.1833457 · Cited by 3
Anonymous Whistleblowing over Authenticated Channels
Agrikola, T., Couteau, G., & Maier, S. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-22365-5_24 · Cited by 3
Vathsan, R. (2015) · CRC Press eBooks · doi:10.1201/b18767-17 · Cited by 3
Quantum Computing for Discrete Logarithms
Yan, S. Y. (2015) · Springer eBooks · doi:10.1007/978-3-319-25823-2_4 · Cited by 3
Three-Tier Satellite Multicast Security Protocol Based on ECMQV and IMC Methods
Yavuz, A. A., Alagöz, F., & Anarım, E. (2006) · IEEE International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD) · doi:10.1109/camad.2006.1649729 · Cited by 3
Vandewalle, J. P. L., Govaerts, R., Becker, W. D., & Decroos, M. (1986) · Lecture notes in computer science · doi:10.1007/3-540-39805-8_6 · Cited by 3
A Formal Semantics for Evaluating Cryptographic Protocols
Yasinsac, A. (1996) · doi:10.18130/v3c85c · Cited by 3
Key Establishment Protocols and Timed-Release Encryption Schemes
Tang, Q. (2007) · OpenGrey (Institut de l'Information Scientifique et Technique) · Cited by 3
Oblivious Transfer Protocol with VerificationPreprint
Kak, S. C. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1504.00601 · Cited by 3
Algorithms for Public Key Cryptosystems: Theory and Application
Lakshmivarahan, S. (1983) · Advances in computers · doi:10.1016/s0065-2458(08)60127-8 · Cited by 3
Public key encryption using block ciphers
Mitchell, C. J. (2003) · Royal Holloway Digital Repository (Royal Holloway University of London) · Cited by 3
Balancing energy, security and circuit area in lightweight cryptographic hardware design
do Canto, R. P. (2016) · doi:10.70675/2bd1f905z512bz45cbzb346z52d6489202f3 · Cited by 3
Towards efficient arithmetic for Ring-LWE based homomorphic encryption
Zucca, V. (2018) · doi:10.70675/8966b36czb696z4648zaa9azd33fc8334966 · Cited by 3
Schwenk, J. (2022) · Information security and cryptography · doi:10.1007/978-3-031-19439-9_2 · Cited by 2
Chen, S., Xie, X. P., & Wang, X. (2023) · IEEE International Conference on Sensors, Electronics and Computer Engineering (ICSECE) · doi:10.1109/icsece58870.2023.10263473 · Cited by 2
Yu, Y., & Fortino, A. (2025) · Journal of Knowledge Management and Practice · doi:10.62477/jkmp.v25i4.536 · Cited by 2
A Technical Review of Quantum Computing Use Cases for Finance and Economics
Hlatshwayo, M. Q., Babel, M., Islas-Sanchez, D., & Γεωργόπουλος, Κ. (2026) · Quantum Reports · doi:10.3390/quantum8010026 · Cited by 3
Dolev, S., Korach, E., & Uzan, G. (2007) · Springer eBooks · doi:10.1007/978-3-540-76627-8_20 · Cited by 2
Multi-Issuer Attribute-based Anonymous Credential with Traceability and Revocation
Ye, Y. (2022) · Computer and Information Science · doi:10.5539/cis.v15n2p68 · Cited by 2
Madani, P., & McGregor, C. (2024) · IEEE Aerospace Conference (AERO) · doi:10.1109/aero58975.2024.10521087 · Cited by 2
On Bounded Storage Key Agreement and One-Way Functions
Brzuska, C., Couteau, G., Egger, C., & Quach, W. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-78011-0_10 · Cited by 2
Yoon, Y., & Kim, W. (2018) · IEEE Access · doi:10.1109/access.2018.2828840 · Cited by 2
Verifiable Capacity-Bound Functions: A New Primitive from Kolmogorov Complexity
Ateniese, G., Chen, L. F., Francati, D., Papadopoulos, D., & Tang, Q. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-31371-4_3 · Cited by 2
Hybrid Semantic/Bit Communication Based Networking Problem Optimization
Xia, L., Sun, Y., Niyato, D. T., Zhang, L., Zhang, L., & Imran, M. A. (2024) · Globecom · doi:10.1109/globecom52923.2024.10901670 · Cited by 2
Discrete Logarithms and Diffie–Hellman
Hoffstein, J., Pipher, J. C., & Silverman, J. H. (2014) · Undergraduate texts in mathematics · doi:10.1007/978-1-4939-1711-2_2 · Cited by 2
Cryptography Based Data Security
Davida, G. I., & Desmedt, Y. (1990) · Advances in computers · doi:10.1016/s0065-2458(08)60300-9 · Cited by 2
Secure distributed intelligent networks
Kotzanikolaou, P., Mavropodi, R., Douligeris, C., & Chrissikopoulos, V. (2005) · Computer Communications · doi:10.1016/j.comcom.2004.12.012 · Cited by 2
The RSA Public Key Crypto-System
Bressoud, D. M. (1989) · Undergraduate texts in mathematics · doi:10.1007/978-1-4612-4544-5_4 · Cited by 2
Study on Dynamic Key Management of Clustered Sensor Networks
Wang, H., Luo, D., Chen, F., & Li, Z. (2006) · Cited by 2
Wu, C. H. J., Liu, T., Huang, C. C., & Irwin, J. D. (2009) · International Journal of Information and Computer Security · doi:10.1504/ijics.2009.028813 · Cited by 2
A time-luck tradeoff in cryptography
Gilles Brassard, A. (1980) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1980.9 · Cited by 2
Distribution function based efficient secure group communication using key tree
Shanu, P. K., & Chandrasekaran, K. (2016) · International Conference on Recent Trends in Information Technology · doi:10.1109/icrtit.2016.7569579 · Cited by 2
TLS protocol: Secure protocol with Client Puzzles
Raluca, C., & Monica, B. (2010) · International Symposium on Electronics and Telecommunications (ISETC) · doi:10.1109/isetc.2010.5679263 · Cited by 2
Computer network security: Then and now
Witzke, E. L. (2016) · IEEE International Carnahan Conference on Security Technology (ICCST) · doi:10.1109/ccst.2016.7815710 · Cited by 2
FastRank: Practical lightweight tolerance to rational behavior in edge assisted streaming
Vilaça, X., Rodrigues, L., Silva, J., Miranda, H., Correia, G., & Maurício, T. (2018) · Pervasive and Mobile Computing · doi:10.1016/j.pmcj.2018.02.005 · Cited by 2
Cyberspace Security and Cryptography
Yan, S. Y. (2018) · Springer eBooks · doi:10.1007/978-3-319-72536-9_1 · Cited by 2
Yan, S. Y. (2018) · Springer eBooks · doi:10.1007/978-3-319-72536-9_6 · Cited by 2
FAST ALGORITHMS AND COMPUTING MEANS OF CRYPTOLOGICAL FUNCTIONS
Horpenyuk, A. (2014) · International Journal of Computing · doi:10.47839/ijc.4.2.339 · Cited by 2
Orion: A Centralized Blockchain Database with Multi-Party Data Access Control
Barger, A., Funaro, L., Laventman, G., Meir, H., Moshkovich, D., Natarajan, S., & Tock, Y. (2023) · IEEE International Conference on Blockchain and Cryptocurrency (ICBC) · doi:10.1109/icbc56567.2023.10174914 · Cited by 2
Post Quantum Communication Over the Internet Infrastructure
Dolev, S. (2024) · International Conference on Distributed Computing and Networking (ICDCN) · doi:10.1145/3631461.3632514 · Cited by 2
A modified scheme for privacy-preserving data aggregation in WSNs
Guo, H. (2012) · International Conference on Consumer Electronics, Communications and Networks (CECNet) · doi:10.1109/cecnet.2012.6201726 · Cited by 2
Key Establishment à la Merkle in a Quantum World
Brassard, G., Høyer, P., Kalach, K., Kaplan, M., Laplante, S., & Salvail, L. (2019) · Journal of Cryptology · doi:10.1007/s00145-019-09317-z · Cited by 9
A Secure Digital Signature Scheme with Fault Tolerance Based on The Improved RSA System
Elkamchouchi, H., Mohamed, H. G., Ahmed, F., & Elkamchouchi, D. H. (2016) · doi:10.5121/csit.2016.60704 · Cited by 2
Many-to-many information flow policies
Baldan, P., & Lafuente, A. L. (2018) · Science of Computer Programming · doi:10.1016/j.scico.2018.08.003 · Cited by 2
Overlay Security: Quantum-Safe Communication over the Internet Infrastructure
Dolev, S. (2019) · IntechOpen eBooks · doi:10.5772/intechopen.86179 · Cited by 2
A key agreement protocol based on group actions
Çağman, A., Polat, K., & Taş, S. (2020) · Numerical Methods for Partial Differential Equations · doi:10.1002/num.22569 · Cited by 2
Pixy: A Privacy-Increasing Group Creation Scheme
Mödinger, D., Fröhlich, N., & Hauck, F. J. (2020) · International Conference on Networks, Communication and Computing (ICNCC) · doi:10.1145/3447654.3447671 · Cited by 2
A versatile secure protocol for anonymous timed-release encryption
Hristu‐Varsakelis, D., Chalkias, K., & Stephanides, G. (2008) · Cited by 2
Florence and a Leap in Cryptography: The Leon Battista Alberti Cypher Disk
Pelosi, G., & Selleri, S. (2021) · IEEE History of Electrotechnology Conference (HISTELCON) · doi:10.1109/histelcon52394.2021.9787316 · Cited by 2
Electronic Commerce: Privacy, Security, and Control
Conway, D., & Kœhler, G. J. (2000) · Springer eBooks · doi:10.1007/978-3-642-58327-8_31 · Cited by 2
Scaling issues in large PKI communities
Varvitsiotis, A. P. (2000) · Future Generation Computer Systems · doi:10.1016/s0167-739x(99)00060-6 · Cited by 3
Securing routing protocols through information corroboration
Wan, T. (2006) · doi:10.22215/etd/2006-06164 · Cited by 2
Using an identity-based dynamic access control filter (IDF) to defend against DoS attacks
Wang, C.-C., Wu, C.-H. J., & Irwin, J. D. (2004) · IEEE Wireless Communications and Networking Conference · doi:10.1109/wcnc.2004.1311621 · Cited by 2
Breaking One-Round Key-Agreement Protocols in the RandomPreprint
Model, O., & Sotáková, M. (2008) · arXiv (Cornell University) · Cited by 2
Mitigating Network-Based Denial-of-Service Attacks with Client Puzzles
McNevin, T. J. (2005) · VTechWorks (Virginia Tech) · Cited by 2
Book Review: RSA and Public-Key Cryptography
Landau, S. M. (2004) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-04-01011-0 · Cited by 2
A generalized linear complexity
Stamp, M. (1992) · ThinkTech (Texas Tech University) · Cited by 2
Design of a Resilient and Customizable Routing Architecture
Lakshminarayanan, K. (2007) · UC Berkeley · Cited by 2
Asynchronous Operations on Qubits in Distributed Simulation Environments using QooSimPreprint
vanBrandwijk, J. J., & Parakh, A. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1612.08609 · Cited by 2
Cyber-Risks in Paper VotingPreprint
Sommer, D., Schneider, M., Gut, J. A., & Čapkun, S. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1906.07532 · Cited by 2
Information Theory and Coding Theory
Berger, T. (2005) · Wiley eBooks · doi:10.1002/0471667196.ess1244.pub2 · Cited by 2
Information Theory and Coding Theory
Berger, T. (2004) · Wiley eBooks · doi:10.1002/0471667196.ess1244 · Cited by 2
A Dynamic Coding Scheme for Preventing Controllable Cyber-Attacks in Cyber-Physical Systems
Taheri, M., Khorasani, K., & Meskin, N. (2024) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc56724.2024.10886237 · Cited by 1
Symmetric Key Encryption Using Modular Traversal of Ananta-Graphs
Vidyashree, H. R. (2025) · Journal of Information Systems Engineering & Management · doi:10.52783/jisem.v10i44s.8673 · Cited by 1
Conventional Cryptography Fundamentals
Djordjević, I. B. (2025) · Springer eBooks · doi:10.1007/978-3-031-88372-9_3 · Cited by 1
Lower Bounds on Inner-Product Functional Encryption from All-or-Nothing Encryption Primitives
He, J., Li, S., & Lin, W.-K. (2025) · Lecture notes in computer science · doi:10.1007/978-3-032-12293-3_5 · Cited by 1
Truncated Modular Exponentiation Operators: A Strategy for Quantum Factoring
Singleton, R. (2024) · Quanta · doi:10.12743/quanta.v13i1.277 · Cited by 1
Radanliev, P. (2025) · The Journal of Defense Modeling and Simulation Applications Methodology Technology · doi:10.1177/15485129251364901 · Cited by 1
Recipe: Hardware-Accelerated Replication Protocols
Giantsidi, D., Giortamis, E., Pritzi, J., Bailleu, M., Kapritsos, M., & Bhatotia, P. (2025) · International Middleware Conference · doi:10.1145/3721462.3770763 · Cited by 1
Pamula, N. B., Khan, A. K., & Sarkar, A. (2026) · International Journal of Information Technology and Computer Science · doi:10.5815/ijitcs.2026.02.12 · Cited by 1
Nested Merkle’s Puzzles against Sampling Attacks
Dolev, S., Fandina, O. N., & Li, X. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-38519-3_11 · Cited by 1
Tamura, Y., & Yamada, S. (2014) · Journal of Software · doi:10.4304/jsw.9.10.2546-2556 · Cited by 1
Battle, R. K. (1984) · International Journal of Project Management · doi:10.1016/s0263-7863(84)80008-3 · Cited by 1
Stini, M., & Martin Mauve, A. (2009) · International Wireless Communications and Mobile Computing Conference (IWCMC) · doi:10.1145/1582379.1582592 · Cited by 1
A key agreement protocol based-on object identifier for Internet of Things
Wang, Y., & Wen, Q. (2011) · Procedia Engineering · doi:10.1016/j.proeng.2011.08.332 · Cited by 1
Equitability in Retroactive Data Confiscation versus Proactive Key Escrow
Desmedt, Y., Burmester, M. V. D., & Seberry, J. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44586-2_20 · Cited by 1
Modern Cryptography, Probabilistic Proofs and Pseudorandomness (Second Edition - author's copy)
Goldreich, O. (2000) · Cited by 1
Adaptive Client Puzzle Scheme Against Denial-of-Service Attacks
Chen, R., Guo, W., Tang, L., & Chen, Z. (2009) · Journal of Software · doi:10.3724/sp.j.1001.2009.00575 · Cited by 1
Dolev, S., Korach, E., Li, X., Li, Y., & Uzan, G. (2016) · Theoretical Computer Science · doi:10.1016/j.tcs.2016.04.032 · Cited by 1
An Empirical Study on Key Management Schemes of Wireless Sensor Network
Islam, N., & A., M. (2016) · International Journal of Computer Applications · doi:10.5120/ijca2016908118 · Cited by 1
Efficient Anonymous and Non-Repudiation E-Payment Protocol
Aboud, S. J. (2010) · Advances in electronic commerce (AEC) book series/Advances in electronic commerce series · doi:10.4018/978-1-61520-635-3.ch002 · Cited by 1
Denial of Service Resilience of Authentication Systems
Bocan, V., & Fǎgǎdar-Cosma, M. (2013) · IGI Global eBooks · doi:10.4018/978-1-4666-2919-6.ch021 · Cited by 1
Hypertext, Digital Libraries, and Beyond: A History of ACM SIGWEB
Misa, T. J. (2016) · doi:10.1145/2973856.2973870 · Cited by 1
Integrating security and privacy protection into a mobility-centric internet architecture
Liu, X. (2016) · doi:10.7282/t3f76fp5 · Cited by 1
Ferradi, H., Géraud, R., & Naccache, D. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-61273-7_26 · Cited by 1
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
