CryptoDB
An Integer Commitment Scheme based on Groups with Hidden Order
| Authors: | |
|---|---|
| Download: | |
| 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 of the 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. The scheme can be seen as a modification and a generalization of an earlier scheme of Fujisaki and Okamoto(FO), and in particular our results show that we can use a much larger class of RSA moduli than the safe prime products proposed by FO. Also, we correct some mistakes in the proofs of FO and give what appears to be the first multiplication protocol for a Fujisaki/Okamoto-like scheme with a complete proof of soundness. |
BibTeX
@misc{eprint-2001-11476,
title={An Integer Commitment Scheme based on Groups with Hidden Order},
booktitle={IACR Eprint archive},
keywords={cryptographic protocols / Commitment schemes, protocols},
url={http://eprint.iacr.org/2001/064},
note={ ivan@daimi.au.dk 11550 received 16 Aug 2001},
author={Ivan Damgård and Eiichiro Fujisaki},
year=2001
}