Computational Security Proofs

Computational Security Proofs is a formal method in cryptography that constitutes a mathematical argument demonstrating the security of a protocol under well-defined computational assumptions, distinguishing it from heuristic or symbolic approaches by relying on the conjectured hardness of computational problems within a probabilistic polynomial-time adversarial model.

131

Publications

10.9K

Citations

286

Authors

148

Institutions

Publications per year

2017–2026

38

Authors

286

  1. VC
    Véronique Cortier

    Laboratoire Lorrain de Recherche en Informatique et ses Applications, France

    5 publications · 160 citations

    5

    h-index

  2. RR
    Renato Renner

    ETH Zurich, Switzerland

    5 publications · 1.1K citations

    5

    h-index

  3. GB
    Gilles Barthe

    IMDEA Software Institute, Spain

    4 publications · 90 citations

    4

    h-index

  4. OG
    Oded Goldreich

    Weizmann Institute of Science, Israel

    4 publications · 627 citations

    4

    h-index

  5. BW
    Bogdan Warinschi

    University of Bristol, United Kingdom

    4 publications · 75 citations

    4

    h-index

1–5 of 286

Venues

  1. IACR Cryptology ePrint Archive

    Repository · 15 publications · 1.5K citations

    12

    h-index

  2. Journal of Cryptology

    6 publications · 901 citations

    6

    h-index

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

    Repository · 4 publications · 81 citations

    4

    h-index

  4. IEEE Transactions on Information Theory

    4 publications · 346 citations

    4

    h-index

  5. Nature Communications

    2 publications · 689 citations

    2

    h-index

1–5