Definition 2 for sequential rational proofs requires a relationship between the reward earned by the prover and the amount of “work” the prover invested to produce that result. The intuition is that to produce the correct result, the prover must run the computation and incur its full cost.
A rational proof (P, V ) for a function f is sequentially composable if for every prover ˜P, and every sequence of inputs x, x1,...,xk such that. C(x) ≥ P ... 1 We defined a notion of sequential composability for rational proofs, motivated by scenarios where many problems are outsourced by the. Verifier to the ...
Nov 12, 2015 · Definition 2 for sequential rational proofs requires a relationship between the reward earned by the prover and the amount of “work” the prover invested to produce that result. The intuition is that to produce the correct result, the prover must run the computation and incur its full cost.
Apr 26, 2017 · We show that Rational Proofs do not satisfy basic compositional properties in the case where a large number of “computation problems” are outsourced. We show that a “fast” incorrect answer is more remunerable for the prover, by allowing him to solve more problems and collect more rewards.
We show that Rational Proofs do not satisfy basic compositional properties in the case where a large number of “computation problems” are outsourced.
TL;DR: This work presents new protocols for the verification of space bounded polytime computations against a rational adversary, and presents protocols for ...
We also presented sequentially composable rational proofs, but only for some ad-hoc cases, and were not able to generalize them to well-defined complexity classes. 1.4 Our Contribution. This paper presents new protocols for the verification of space-bounded polytime computations against a rational adversary. More ...
We show that Rational Proofs do not satisfy basic compositional properties in the case where a large number of "computation problems" are outsourced. We show that a "fast" incorrect answer is more remunerable for the prover, by allowing him to solve more problems and collect more rewards.
Missing: Composable | Show results with:Composable
Mar 24, 2017 · Campanelli and Gennaro [4] studied the composability of rational proofs and presented a sequentially composable rational proof for arithmetic circuits. Chen, McCauley, and. Singh [5] studied rational proofs that allows multiple provers, and showed that multiple rational provers are strictly more ...
Abstract. We investigate proof systems where security holds against rational parties instead of malicious ones. Our starting point is the notion of rational arguments, a variant of rational proofs (Azar and Micali, STOC 2012) where security holds against rational adversaries that are also computationally bounded.