Security Reductions

Security Reductions is a formal method in cryptography that belongs to the class of proof techniques used to establish the security of cryptographic schemes, distinguished by its demonstration that breaking the scheme’s security implies solving a computationally hard mathematical problem, thereby linking the scheme’s security to the assumed hardness of the underlying problem.

95

Publications

5.8K

Citations

209

Authors

122

Institutions

Publications per year

2017–2026

21

Authors

209

  1. AM
    Alfred Menezes

    University of Waterloo, Canada

    4 publications · 126 citations

    4

    h-index

  2. NK
    Neal Koblitz

    University of Washington, United States

    4 publications · 126 citations

    4

    h-index

  3. NW
    Nan Wang

    University of Maryland, College Park, United States

    3 publications · 408 citations

    3

    h-index

  4. JK
    Jonathan Katz

    University of Maryland, College Park, United States

    3 publications · 408 citations

    3

    h-index

  5. RI
    Russell Impagliazzo

    University of California San Diego, United States

    3 publications · 368 citations

    3

    h-index

1–5 of 209

Venues

  1. IACR Cryptology ePrint Archive

    Repository · 19 publications · 594 citations

    14

    h-index

  2. Journal of Cryptology

    11 publications · 1.4K citations

    11

    h-index

  3. IACR Transactions on Symmetric Cryptology

    ToSC · 3 publications · 53 citations

    3

    h-index

  4. Journal of Mathematical Cryptology

    JMC · 2 publications · 53 citations

    2

    h-index

  5. 2

    h-index

1–5