Constant-round interactive proofs for delegating computation
STOC(2021)
摘要
The celebrated IP - PSPACE theorem [Lund, Fortnow, Karloff, and Nisan, J. ACM, 39 (1992), pp. 859-868; Shamir, J. ACM, 39 (1992), pp. 869-877] allows an all-powerful but untrusted prover to convince a polynomial-time verifier of the validity of extremely complicated statements (as long as they can be evaluated using polynomial space). The interactive proof system designed for this purpose requires a polynomial number of communication rounds and an exponential-time (polynomial-space complete) prover. In this paper, we study the power of more efficient interactive proof systems. Our main result is that for every statement that can be evaluated in polynomial time and bounded-polynomial space there exists an interactive proof that satisfies the following strict efficiency requirements: (1) the honest prover runs in polynomial time, (2) the verifier is almost linear time (and under some conditions even sublinear), and (3) the interaction consists of only a constant number of communication rounds. Prior to this work, very little was known about the power of efficient, constant-round interactive proofs (rather than arguments). This result represents significant progress on the round complexity of interactive proofs (even if we ignore the running time of the honest prover) and on the expressive power of interactive proofs with polynomial-time honest prover (even if we ignore the round complexity). This result has several applications, and in particular it can be used for verifiable delegation of computation. Our construction leverages several new notions of interactive proofs, which may be of independent interest. One of these notions is that of unambiguous interactive proofs where the prover has a unique successful strategy. Another notion is that of probabilistically checkable interactive proofs (PCIPS), where the verifier only reads a few bits of the transcript in checking the proof (this could be viewed as an interactive extension of PCIPS). An equivalent notion to PCIPS, called interactive oracle proofs, was recently introduced in an independent work of Ben-Sasson, Chiesa, and Sponcer [Proceedings of TCC, 2016, pp. 31-60].
更多查看译文
关键词
interactive proofs,delegation,probabilistic proof sytems
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络