You are looking at a specific version 20180111:030240 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 proposed 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: The title was changed to indicate the previous work proposed by Cramer, Damgård and Schoenmakers at CRYPTO '94. The content and the contribution was focused into our procedure of the sigma protocol. It was mentioned that the claim (which was stated in the related paper in the proceedings of ASIAPKC 2014) that we had constructed a pairing-free ABID scheme possessing attribute privacy and a pairing-free ABS scheme possessing attribute privacy was retracted.

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
10.1145/2600694.2600696
Keywords
proof systemsigma-protocolOR-proof
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
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.