Verifiable Computation

Verifiable Computation is a cryptographic protocol that enables a prover to convince a verifier that a given computation was executed correctly, such that the correctness of the computation can be efficiently verified without re-executing it.

404

Publications

23K

Citations

1.2K

Authors

457

Institutions

Publications per year

2017–2026

214

Authors

1.2K

  1. MW
    Michael Walfish

    The University of Texas at Austin, United States

    11 publications · 1.1K citations

    10

    h-index

  2. CP
    Charalampos Papamanthou

    University of Maryland, College Park, United States

    9 publications · 527 citations

    9

    h-index

  3. AJ
    Andrew J. Blumberg

    The University of Texas at Austin, United States

    8 publications · 963 citations

    8

    h-index

  4. RC
    Ran Canetti

    IBM (United States), United States

    6 publications · 594 citations

    6

    h-index

  5. SS
    Srinath Setty

    The University of Texas at Austin, United States

    6 publications · 749 citations

    6

    h-index

1–5 of 1.2K

Venues

  1. arXiv (Cornell University)

    Repository · 17 publications · 678 citations

    13

    h-index

  2. IACR Cryptology ePrint Archive

    Repository · 10 publications · 302 citations

    10

    h-index

  3. IEEE Internet of Things Journal

    9 publications · 608 citations

    9

    h-index

  4. 8

    h-index

  5. Information Sciences

    7 publications · 351 citations

    7

    h-index

1–5