CryptoDB
On Simulation-Sound Trapdoor Commitments
Authors: | |
---|---|
Download: | |
Abstract: | We study the recently introduced notion of a simulation-sound trapdoor commitment (SSTC) scheme. In this paper, we present a new, simpler definition for an SSTC scheme that admits more efficient constructions and can be used in a larger set of applications. Specifically, we show how to construct SSTC schemes from any one-way functions, and how to construct very efficient SSTC schemes based on specific number-theoretic assumptions. We also show how to construct simulation-sound, non-malleable, and universally-composable zero-knowledge protocols using SSTC schemes, yielding, for instance, the most efficient universally-composable zero-knowledge protocols known. Finally, we explore the relation between SSTC schemes and non-malleable commitment schemes by presenting a sequence of implication and separation results, which in particular imply that SSTC schemes are non-malleable. |
BibTeX
@misc{eprint-2003-11965, title={On Simulation-Sound Trapdoor Commitments}, booktitle={IACR Eprint archive}, keywords={cryptographic protocols / trapdoor commitments, non-malleability}, url={http://eprint.iacr.org/2003/252}, note={ philmac@lucent.com 12388 received 2 Dec 2003}, author={Philip MacKenzie and Ke Yang}, year=2003 }