Cited by 143Cryptographic Implementations and SecurityCryptography and Data SecuritySecurity and Verification in Computing

SoK: Computer-Aided Cryptography

Open access
Barbosa, Manuel, Barthe, Gilles, Bhargavan, Karthik, Blanchet, Bruno, Cremers, Cas, Liao, Kevin, Parno, Bryan·2021·2021 IEEE Symposium on Security and Privacy (SP)

Abstract

Computer-aided cryptography is an active area of research that develops and applies formal, machine-checkable approaches to the design, analysis, and implementation of cryptography. We present a cross-cutting systematization of the computer-aided cryptography literature, focusing on three main areas: (i) design-level security (both symbolic security and computational security), (ii) functional correctness and efficiency, and (iii) implementation-level security (with a focus on digital side-channel resistance). In each area, we first clarify the role of computer-aided cryptography—how it can help and what the caveats are—in addressing current challenges. We next present a taxonomy of state-of-the-art tools, comparing their accuracy, scope, trustworthiness, and usability. Then, we highlight their main achievements, trade-offs, and research challenges. After covering the three main areas, we present two case studies. First, we study efforts in combining tools focused on different areas to consolidate the guarantees they can provide. Second, we distill the lessons learned from the computer-aided cryptography community’s involvement in the TLS 1.3 standardization effort. Finally, we conclude with recommendations to paper authors, tool developers, and standardization bodies moving forward.

Integrity signals

Registry

Crossref · 10.1109/sp40001.2021.00008

Cites

4 of 4 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

  • Cryptography is a prime target for formal verification.

    “simplified versions of 13 functions often used in cryptography which is a prime target for formal verification (Barbosa et al., 2021).”

    From A benchmark for vericoding: formally verified program synthesis (2025) · cites this paper as Barbosa et al., 2021

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Barbosa, M., Barthe, G., Bhargavan, K., Blanchet, B., Cremers, C., Liao, K., & Parno, B.
Affiliations
  • Universidade do Porto (PT)
  • Max Planck Institute for Security and Privacy (DE)
  • INRIA,Paris
  • Institut national de recherche en sciences et technologies du numérique (FR)
  • Helmholtz Center for Information Security (DE)
  • Carnegie Mellon University (US)
Venue
2021 IEEE Symposium on Security and Privacy (SP)
Publisher
IEEE
Published
2021-05
Volume
2019
Pages
777-795
ISSN
1081-6011 (ISSN-L)
OpenAlex
W3003637591
Cited by
143
References
4
Citations by year
2026: 18 · 2025: 24 · 2024: 29 · 2023: 27 · 2022: 20 · 2021: 20 · 2020: 5
FWCI
11.09
Type
conference paper
Language
en
Open access
Locations
  • IEEE Symposium on Security and Privacy (S&P) (publishedVersion)
  • IACR Cryptology ePrint Archive (submittedVersion)
  • HAL (submittedVersion, other-oa)
  • Figshare (submittedVersion, cc-by)
  • CISPA Helmholtz Center
Funders
  • Foundation for Science and Technology
  • Office of Naval Research
  • European Research Council
  • National Science Foundation
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Cryptographic Implementations and Security
  • Physical Sciences › Computer Science › Artificial Intelligence › Cryptography and Data Security
  • Physical Sciences › Computer Science › Artificial Intelligence › Security and Verification in Computing
Keywords
formal verification, computational security, functional correctness, side-channel attack resistance, cryptographic protocol design

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