A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
Efficient Batch Verification for UP
2018
Computational Complexity Conference
Consider a setting in which a prover wants to convince a verifier of the correctness of k NP statements. For example, the prover wants to convince the verifier that k given integers N 1 , . . . , N k are all RSA moduli (i.e., products of equal length primes). Clearly this problem can be solved by simply having the prover send the k NP witnesses, but this involves a lot of communication. Can interaction help? In particular, is it possible to construct interactive proofs for this task whose
doi:10.4230/lipics.ccc.2018.22
dblp:conf/coco/ReingoldRR18
fatcat:vcay77j3vjapxcao6rrm5d2yva