Hash Function Security Proofs

Hash Function Security Proofs is a theoretical framework in cryptography that formally establishes the resistance of hash functions against specific adversarial attacks by mathematically proving their security properties within a defined computational model.

17

Publications

632

Citations

55

Authors

32

Institutions

Publications per year

2017–2026

2

Authors

55

  1. SH
    Shai Halevi

    IBM (United States), United States

    2 publications · 129 citations

    2

    h-index

  2. YT
    Yael Tauman Kalai

    Microsoft (United States), United States

    1 publications · 62 citations

    1

    h-index

  3. CC
    Christophe Clavier

    Université de Limoges, France

    1 publications · 14 citations

    1

    h-index

  4. SV
    Salil Vadhan

    Harvard University Press, United States

    1 publications · 87 citations

    1

    h-index

  5. TP
    Thomas Pornin

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

    1 publications · 14 citations

    1

    h-index

1–5 of 55

Venues

  1. IACR Cryptology ePrint Archive

    Repository · 6 publications · 182 citations

    6

    h-index

  2. 1

    h-index

  3. Journal of Mathematical Cryptology

    JMC · 1 publications · 23 citations

    1

    h-index

  4. HAL (Le Centre pour la Communication Scientifique Directe)

    Repository · 1 publications · 14 citations

    1

    h-index

  5. Autonomous Agents and Multi-Agent Systems

    1 publications · 15 citations

    1

    h-index

1–5