Rational Proofs against Rational Verifiers

Keita INASAWA  Kenji YASUNAGA  

Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E100-A   No.11   pp.2392-2397
Publication Date: 2017/11/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.E100.A.2392
Type of Manuscript: PAPER
Category: Cryptography and Information Security
Keyword: 
rational proof,  delegation of computation,  game theory,  random oracle model,  

Full Text: PDF(690.9KB)>>
Buy this Article



Summary: 
Rational proofs, introduced by Azar and Micali (STOC 2012), are a variant of interactive proofs in which the prover is rational, and may deviate from the protocol for increasing his reward. Guo et al. (ITCS 2014) demonstrated that rational proofs are relevant to delegation of computation. By restricting the prover to be computationally bounded, they presented a one-round delegation scheme with sublinear verification for functions computable by log-space uniform circuits with logarithmic depth. In this work, we study rational proofs in which the verifier is also rational, and may deviate from the protocol for decreasing the prover's reward. We construct a three-message delegation scheme with sublinear verification for functions computable by log-space uniform circuits with polylogarithmic depth in the random oracle model.