One-way Functions

One-Way Functions is a theoretical construct in computational complexity theory defined as a function that is easy to compute in one direction but computationally infeasible to invert for any probabilistic polynomial-time algorithm.

332

Publications

31.6K

Citations

554

Authors

280

Institutions

Publications per year

2017–2026

49

Authors

554

  1. RP
    Rafael Pass

    Cornell University, United States

    14 publications · 553 citations

    12

    h-index

  2. OG
    Oded Goldreich

    Weizmann Institute of Science, Israel

    10 publications · 4.1K citations

    10

    h-index

  3. RO
    Rafail Ostrovsky

    University of California, Los Angeles, United States

    10 publications · 1.1K citations

    10

    h-index

  4. RC
    Ran Canetti

    IBM (United States), United States

    9 publications · 652 citations

    10

    h-index

  5. IH
    Iftach Haitner

    Tel Aviv University, Israel

    9 publications · 390 citations

    9

    h-index

1–5 of 554

Venues

  1. SIAM Journal on Computing

    19 publications · 3K citations

    15

    h-index

  2. IACR Cryptology ePrint Archive

    Repository · 10 publications · 250 citations

    11

    h-index

  3. Chaos Solitons & Fractals

    5 publications · 359 citations

    5

    h-index

  4. Journal of the ACM

    JACM · 4 publications · 2.2K citations

    4

    h-index

  5. Journal of Computer and System Sciences

    4 publications · 432 citations

    4

    h-index

1–5