Interactive Proof Systems

Interactive Proof Systems is a computational model in complexity theory where a computationally bounded verifier interacts with one or more powerful provers through message exchange to probabilistically determine the truth of a statement, distinguished from static proof systems by the dynamic, round-based communication protocol between the participants.

558

Publications

43.4K

Citations

914

Authors

360

Institutions

Publications per year

2017–2026

95

Authors

914

  1. JW
    John Watrous

    University of Calgary, Canada

    19 publications · 1.3K citations

    16

    h-index

  2. LF
    Lance Fortnow

    University of Chicago, United States

    14 publications · 2.8K citations

    14

    h-index

  3. OG
    Oded Goldreich

    Weizmann Institute of Science, Israel

    12 publications · 1.6K citations

    11

    h-index

  4. SG
    Shafi Goldwasser

    Massachusetts Institute of Technology, United States

    11 publications · 5.3K citations

    11

    h-index

  5. YT
    Yael Tauman Kalai

    Microsoft (United States), United States

    10 publications · 1.1K citations

    10

    h-index

1–5 of 914

Venues

  1. Proceedings of the National Academy of Sciences

    PNAS · 28 publications · 2.2K citations

    22

    h-index

  2. Electronic Notes in Theoretical Computer Science

    ENTCS · 16 publications · 349 citations

    13

    h-index

  3. arXiv (Cornell University)

    Repository · 14 publications · 280 citations

    11

    h-index

  4. SIAM Journal on Computing

    10 publications · 5.1K citations

    10

    h-index

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

    Repository · 10 publications · 254 citations

    10

    h-index

1–5