The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
A Messy State of the Union: Taming the Composite State Machines of TLS
Open accessAbstract
Implementations of the Transport Layer Security (TLS) protocol must handle a variety of protocol versions and extensions, authentication modes, and key exchange methods. Confusingly, each combination may prescribe a different message sequence between the client and the server. We address the problem of designing a robust composite state machine that correctly multiplexes between these different protocol modes. We systematically test popular open-source TLS implementations for state machine bugs and discover several critical security vulnerabilities that have lain hidden in these libraries for years, and have now finally been patched due to our disclosures. Several of these vulnerabilities, including the recently publicized FREAK flaw, enable a network attacker to break into TLS connections between authenticated clients and servers. We argue that state machine bugs stem from incorrect compositions of individually correct state machines. We present the first verified implementation of a composite TLS state machine in C that can be embedded into OpenSSL and accounts for all its supported cipher suites. Our attacks expose the need for the formal verification of core components in cryptographic protocol libraries, our implementation demonstrates that such mechanized proofs are within reach, even for mainstream TLS implementations.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
The Transport Layer Security (TLS) Protocol Version 1.3
Rescorla, E. (2018) · doi:10.17487/rfc8446 · Cited by 1,897
Cited by
A Search Engine Backed by Internet-Wide Scanning
Durumeric, Z., Adrian, D., Mirian, A., Bailey, M., & Halderman, J. A. (2015) · Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2810103.2813703 · Cited by 439
SoK: Security Evaluation of Home-Based IoT Deployments
Alrawi, O., Lever, C., Antonakakis, M., & Monrose, F. (2019) · 2019 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp.2019.00013 · Cited by 391
Key Reinstallation Attacks: Forcing Nonce Reuse in WPA2
Vanhoef, M., & Piessens, F. (2017) · Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3133956.3134027 · Cited by 380
Imperfect Forward Secrecy: How Diffie-Hellman Fails in Practice
Adrian, D., Bhargavan, K., Durumeric, Z., Gaudry, P., Green, M., Halderman, J. A., Heninger, N., Springall, D., Thomé, E., Valenta, L., et al. (2015) · Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2810103.2813707 · Cited by 348
Self-citationModeling and Verifying Security Protocols with the Applied Pi Calculus and ProVerif
Blanchet, B. (2016) · Foundations and Trends® in Privacy and Security · doi:10.1561/3300000004 · Cited by 321
SoK: Computer-Aided Cryptography
Barbosa, M., Barthe, G., Bhargavan, K., Blanchet, B., Cremers, C., Liao, K., & Parno, B. (2021) · 2021 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp40001.2021.00008 · Cited by 143
Self-citationTowards a Complete View of the Certificate Ecosystem
VanderSloot, B., Amann, J., Bernhard, M., Durumeric, Z., Bailey, M., & Halderman, J. A. (2016) · Proceedings of the 2016 Internet Measurement Conference · doi:10.1145/2987443.2987462 · Cited by 82
FIDO Gets Verified: A Formal Analysis of the Universal Authentication Framework Protocol
Feng, H., Guan, J., Li, H., Pan, X., & Zhao, Z. (2023) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2022.3217259 · Cited by 13
Metadata
- Authors
- Beurdouche, B., Bhargavan, K., Delignat-Lavaud, A., Fournet, C., Kohlweiss, M., Pironti, A., Strub, P.-Y., & Zinzindohoue, J. K.
- Venue
- 2015 IEEE Symposium on Security and Privacy
- Publisher
- IEEE
- Published
- 2015-05
- Pages
- 535-552
- ISSN
- 1081-6011 (ISSN-L)
- OpenAlex
- W1495444061
- Cited by
- 218
- References
- 1
- FWCI
- 20.26
- Type
- conference paper
- Language
- en
- Open access
- bronze
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
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.