Paper Info
Title
An Integer Commitment Scheme based on Groups with Hidden Order.
Abstract
Abstract. We present a commitment,scheme allowing commitment,to arbitrary size integers, based on any Abelian group with certain properties, most importantly that it is hard for the committer to compute its order. Potential examples include RSA and class groups. We also give efficient zero-knowledge protocols for proving knowledge ofthe contents of a commitment,and for verifying multiplicative relations over the integers on committed values. This means that our scheme can support, for instance, the efficent interval proofs of Boudot[1]. The scheme can be seen as a modification and a generalization of an earlier scheme,of Fujisaki and Okamoto [5], and in particular our results show that we can use a much,larger class of RSA moduli than the safe prime products proposed in [5]. Also, we correct some mistakes in the proofs of [5] and give what appears to be the first multiplication protocol for a Fujisaki/Okamoto-like scheme with a complete proof of soundness.
Year
Venue
Keywords
2001
IACR Cryptology ePrint Archive
abelian group,zero knowledge,commitment scheme
DocType
Volume
Citations 
Journal
2001
47
PageRank 
References 
Authors
3.79
0
2
Name
Order
Citations
PageRank
Ivan B. Damgård123019.97
Eiichiro Fujisaki21526114.30