Probabilistically Checkable Proofs

Probabilistically Checkable Proofs is a computational proof system in which a probabilistic verifier can check the validity of a proof by examining only a constant number of bits from it, with high confidence, distinguishing correct proofs from incorrect ones with high probability based on limited, randomized queries.

74

Publications

7K

Citations

97

Authors

59

Institutions

Publications per year

2017–2026

6

Authors

97

  1. EB
    Eli Ben‐Sasson

    Technion – Israel Institute of Technology, Israel

    14 publications · 901 citations

    13

    h-index

  2. MS
    Madhu Sudan

    Massachusetts Institute of Technology, United States

    14 publications · 1.5K citations

    13

    h-index

  3. CL
    Carsten Lund

    AT&T (United States), United States

    6 publications · 470 citations

    6

    h-index

  4. ID
    Irit Dinur

    Weizmann Institute of Science, Israel

    6 publications · 398 citations

    6

    h-index

  5. AW
    Avi Wigderson

    Hebrew University of Jerusalem, Israel

    6 publications · 290 citations

    6

    h-index

1–5 of 97

Venues

  1. SIAM Journal on Computing

    13 publications · 1.6K citations

    13

    h-index

  2. Journal of the ACM

    JACM · 3 publications · 1.4K citations

    3

    h-index

  3. IACR Cryptology ePrint Archive

    Repository · 3 publications · 71 citations

    3

    h-index

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

    Repository · 3 publications · 182 citations

    3

    h-index

  5. ArXiv.org

    Repository · 2 publications · 51 citations

    2

    h-index

1–5