Computationally Sound Verification
Computationally Sound Verification is a formal method for analyzing cryptographic protocols that belongs to the class of symbolic verification techniques but differs by rigorously accounting for computational security assumptions and bounds on adversarial capabilities in probabilistic polynomial time.
61
Publications
4.1K
Citations
127
Authors
91
Institutions
Publications per year
2017–2026
13
61
Silvio Micali · SIAM Journal on Computing · 2000 · 412 citations
A computationally sound mechanized prover for security protocols
Bruno Blanchet · 2006 · 219 citations
1–5 of 61
127
Institut national de recherche en sciences et technologies du numérique, France
6 publications · 524 citations
6
h-index
5
h-index
4
h-index
3
h-index
3
h-index
1–5 of 127
91
Microsoft (United States)
Redmond, United States
7 h-index
11 publications
697 citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
7 h-index
9 publications
292 citations
Massachusetts Institute of Technology
Cambridge, United States
6 h-index
10 publications
710 citations

Saarland University
Saarbrücken, Germany
5 h-index
10 publications
342 citations
Microsoft Research (United Kingdom)
Cambridge, United Kingdom
5 h-index
5 publications
239 citations
Max Planck Institute for Software Systems
Saarbrücken, Germany
5 h-index
5 publications
159 citations

Centre National de la Recherche Scientifique
Paris, France
4 h-index
4 publications
455 citations
IMDEA Software Institute
Pozuelo de Alarcón, Spain
3 h-index
5 publications
197 citations
1–8 of 91
Repository · 2 publications · 41 citations
2
h-index
2 publications · 507 citations
2
h-index
Repository · 2 publications · 42 citations
2
h-index
1 publications · 11 citations
1
h-index
Conference · 1 publications · 52 citations
1
h-index
1–5