Hardness Assumptions

Hardness Assumptions is a foundational premise in computational complexity theory that posits the intractability of specific mathematical problems over lattices, distinguishing it from other cryptographic assumptions by its reliance on worst-case or average-case hardness of lattice problems such as Learning With Errors or Shortest Vector Problem.

122

Publications

8.8K

Citations

263

Authors

156

Institutions

Publications per year

2017–2026

41

Authors

263

  1. RP
    Rafael Pass

    Cornell University, United States

    7 publications · 585 citations

    7

    h-index

  2. HL
    Huijia Lin

    Cornell University, United States

    5 publications · 528 citations

    5

    h-index

  3. RC
    Ran Canetti

    IBM (United States), United States

    4 publications · 310 citations

    4

    h-index

  4. VK
    Valentine Kabanets

    Simon Fraser University, Canada

    4 publications · 167 citations

    4

    h-index

  5. RI
    Russell Impagliazzo

    University of California San Diego, United States

    3 publications · 166 citations

    3

    h-index

1–5 of 263

Venues

  1. arXiv (Cornell University)

    Repository · 6 publications · 177 citations

    6

    h-index

  2. SIAM Journal on Computing

    5 publications · 540 citations

    5

    h-index

  3. Theoretical Computer Science

    3 publications · 119 citations

    3

    h-index

  4. IACR Cryptology ePrint Archive

    Repository · 3 publications · 99 citations

    3

    h-index

  5. Journal of the ACM

    JACM · 3 publications · 330 citations

    3

    h-index

1–5