Rational arguments: single round delegation with sublinear verification

@inproceedings{Guo2014RationalAS,
  title={Rational arguments: single round delegation with sublinear verification},
  author={Siyao Guo and Pavel Hub{\'a}cek and Alon Rosen and Margarita Vald},
  booktitle={ITCS},
  year={2014}
}
Rational proofs, recently introduced by Azar and Micali (STOC 2012), are a variant of interactive proofs in which the prover is neither honest nor malicious, but rather rational. The advantage of rational proofs over their classical counterparts is that they allow for extremely low communication and verification time. Azar and Micali demonstrated their potential by giving a one message rational proof for #SAT, in which the verifier runs in time O(n), where $n$ denotes the instance size. In a… CONTINUE READING

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…