Multi-prover Interactive Proofs

Multi-Prover Interactive Proofs is an interactive proof system in which a probabilistic polynomial-time verifier interacts with multiple provers who are computationally unbounded but unable to communicate with one another, thereby enabling stronger verification power through spatially separated cooperation.

26

Publications

2.4K

Citations

41

Authors

28

Institutions

Publications per year

2017–2026

2

Authors

41

  1. HK
    Hirotada Kobayashi

    National Institute of Informatics, Japan

    5 publications · 267 citations

    5

    h-index

  2. TV
    Thomas Vidick

    California Institute of Technology, United States

    4 publications · 154 citations

    4

    h-index

  3. KM
    Keiji Matsumoto

    National Institute of Informatics, Japan

    4 publications · 240 citations

    4

    h-index

  4. TI
    Tsuyoshi Ito

    The University of Tokyo, Japan

    3 publications · 156 citations

    3

    h-index

  5. JW
    John Watrous

    University of Calgary, Canada

    3 publications · 211 citations

    3

    h-index

1–5 of 41

Venues

  1. ArXiv.org

    Repository · 2 publications · 32 citations

    2

    h-index

  2. Journal of Computer and System Sciences

    1 publications · 100 citations

    1

    h-index

  3. Structure in Complexity Theory Annual Conference

    Conference · 1 publications · 16 citations

    1

    h-index

  4. Theoretical Computer Science

    1 publications · 190 citations

    1

    h-index

  5. SIAM Journal on Computing

    1 publications · 45 citations

    1

    h-index

1–5