Interactive Proof Verification

Interactive Proof Verification is an academic construct within computational complexity theory that distinguishes itself by formalizing the process through which a verifier probabilistically checks the correctness of a claimed solution via interaction with a prover, ensuring soundness and completeness within a bounded number of rounds.

38

Publications

3.3K

Citations

72

Authors

55

Institutions

Publications per year

2017–2026

11

Authors

72

  1. SG
    Shafi Goldwasser

    Massachusetts Institute of Technology, United States

    3 publications · 739 citations

    3

    h-index

  2. SG
    Siddharth Garg

    New York University, United States

    3 publications · 174 citations

    3

    h-index

  3. JT
    Justin Thaler

    Harvard University, United States

    3 publications · 273 citations

    3

    h-index

  4. GN
    Guy N. Rothblum

    Weizmann Institute of Science, Israel

    2 publications · 682 citations

    2

    h-index

  5. ZG
    Zahra Ghodsi

    New York University, United States

    2 publications · 109 citations

    2

    h-index

1–5 of 72

Venues

  1. 2

    h-index

  2. Computational Complexity

    CC · 2 publications · 97 citations

    2

    h-index

  3. arXiv (Cornell University)

    Repository · 2 publications · 108 citations

    2

    h-index

  4. Journal of the ACM

    JACM · 2 publications · 907 citations

    2

    h-index

  5. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

    Repository · 2 publications · 26 citations

    2

    h-index

1–5