SoK: Computer-Aided Cryptography - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2021

SoK: Computer-Aided Cryptography


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.
Fichier principal
Vignette du fichier
BarbosaetalOakland21.pdf (310.35 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-03046757 , version 1 (08-12-2020)


  • HAL Id : hal-03046757 , version 1


Manuel Barbosa, Gilles Barthe, Karthik Bhargavan, Bruno Blanchet, Cas Cremers, et al.. SoK: Computer-Aided Cryptography. SP 2021 - 42nd IEEE Symposium on Security and Privacy, May 2021, Virtual Conference, United States. ⟨hal-03046757⟩


997 View
1599 Download


Gmail Mastodon Facebook X LinkedIn More