Cryptographic Reductions

Cryptographic Reductions is a proof technique in computational complexity theory that establishes the relative security of cryptographic primitives by demonstrating that breaking one primitive can be efficiently transformed into breaking another, thereby equating their hardness assumptions.

74

Publications

6.5K

Citations

158

Authors

91

Institutions

Publications per year

2017–2026

10

Authors

158

  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. IV
    Ingrid Verbauwhede

    KU Leuven, Belgium

    3 publications · 99 citations

    3

    h-index

  4. OR
    Omer Reingold

    Weizmann Institute of Science, Israel

    3 publications · 332 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 158

Venues

  1. IACR Cryptology ePrint Archive

    Repository · 13 publications · 265 citations

    11

    h-index

  2. Journal of Cryptology

    6 publications · 959 citations

    6

    h-index

  3. Theoretical Computer Science

    4 publications · 210 citations

    4

    h-index

  4. Journal of Mathematical Cryptology

    JMC · 3 publications · 842 citations

    3

    h-index

  5. 2

    h-index

1–5