collaborators

1 paper

cs.CC2025

Efficiently Batching Unambiguous Interactive Proofs

Bonnie Berger, Rohan Goyal, Matthew M. Hong +1

We show that if a language admits a public-coin unambiguous interactive proof (UIP) with round complexity , where bits are communicated per round, then the batch lang…