Non-interactive Zero-knowledge Proofs

Non-Interactive Zero-Knowledge Proofs is a cryptographic proof system in which a prover can convince a verifier of the truth of a statement without interaction and without revealing any information beyond the validity of the statement, distinguished from interactive zero-knowledge proofs by relying on a common reference string or the random oracle model to eliminate the need for multi-round communication.

250

Publications

19.9K

Citations

531

Authors

232

Institutions

Publications per year

2017–2026

91

Variants

Non-interactive Zero-knowledge

Authors

531

  1. JK
    Joe Kilian

    Princeton University, United States

    10 publications · 637 citations

    10

    h-index

  2. AS
    Amit Sahai

    University of California, Los Angeles, United States

    8 publications · 1.5K citations

    8

    h-index

  3. RO
    Rafail Ostrovsky

    University of California, Los Angeles, United States

    8 publications · 1K citations

    8

    h-index

  4. EP
    Erez Petrank

    Technion – Israel Institute of Technology, Israel

    7 publications · 372 citations

    7

    h-index

  5. YI
    Yuval Ishai

    Technion – Israel Institute of Technology, Israel

    6 publications · 1.1K citations

    6

    h-index

1–5 of 531

Venues

  1. Proceedings of the National Academy of Sciences

    PNAS · 55 publications · 3.7K citations

    32

    h-index

  2. Journal of Cryptology

    14 publications · 1.4K citations

    13

    h-index

  3. IACR Cryptology ePrint Archive

    Repository · 12 publications · 222 citations

    11

    h-index

  4. SIAM Journal on Computing

    7 publications · 907 citations

    7

    h-index

  5. IEEE Transactions on Dependable and Secure Computing

    TDSC · 5 publications · 246 citations

    6

    h-index

1–5