A Concrete Procedure of the $\Sigma$-protocol on Monotone Predicates

You are looking at a specific version 20180308:090839 of this paper. See the latest version.

Paper 2016/483

A Concrete Procedure of the $\Sigma$-protocol on Monotone Predicates

Hiroaki Anada and Seiko Arita and Kouichi Sakurai

Abstract

We propose a concrete procedure of the $\Sigma$-protocol introduced by Cramer, Damgård and Schoenmakers at CRYPTO '94, which is for proving knowledge that a set of witnesses satisfies a monotone predicate in witness-indistinguishable way. We provide the concrete procedure by extending the so-called OR-proof.

Note: Explanation on the witness indistinguishability was corrected.

Metadata

Available format(s): PDF
Publication info: Published elsewhere. Minor revision. Proceedings of the 2nd ACM ASIA Public-Key Cryptography Workshop - ASIAPKC 2014, pp. 49-58
DOI: DOI: 10.1145/2600694.2600696
Keywords: proof system sigma-protocol OR-proof witness indistinguishability
Contact author(s): anada @ sun ac jp
History: 2020-06-23: last of 17 revisions; 2016-05-20: received; See all versions
Short URL: https://ia.cr/2016/483
License: CC BY