Sublinear Zero-Knowledge Arguments for RAM Programs
ADVANCES IN CRYPTOLOGY - EUROCRYPT 2017, PT I, pp. 501-531, 2017.
We describe a new succinct zero-knowledge argument protocol with the following properties. The prover commits to a large data-set M, and can thereafter prove many statements of the form there exists w : R-i(M, w) = 1, where R-i is a public function. The protocol is succinct in the sense that the cost for the verifier (in computation & com...More
PPT (Upload PPT)