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

Authors

127

  1. BB
    Bruno Blanchet

    Institut national de recherche en sciences et technologies du numérique, France

    6 publications · 524 citations

    6

    h-index

  2. MB
    Michael Backes

    Saarland University, Germany

    5 publications · 159 citations

    5

    h-index

  3. DU
    Dominique Unruh

    University of Tartu, Estonia

    4 publications · 140 citations

    4

    h-index

  4. BG
    Benjamin Grégoire

    IMDEA Software Institute, Spain

    3 publications · 105 citations

    3

    h-index

  5. MA
    Mihhail Aizatulin

    The Open University, United Kingdom

    3 publications · 106 citations

    3

    h-index

1–5 of 127

Venues

  1. IACR Cryptology ePrint Archive

    Repository · 2 publications · 41 citations

    2

    h-index

  2. SIAM Journal on Computing

    2 publications · 507 citations

    2

    h-index

  3. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

    Repository · 2 publications · 42 citations

    2

    h-index

  4. IEEE Computational Science and Engineering

    1 publications · 11 citations

    1

    h-index

  5. Networked Systems Design and Implementation

    Conference · 1 publications · 52 citations

    1

    h-index

1–5