Paper 2003/252

On Simulation-Sound Trapdoor Commitments

Philip MacKenzie and Ke Yang

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.

Metadata
Available format(s)
PDF PS
Category
Cryptographic protocols
Publication info
Published elsewhere. Unknown where it was published
Keywords
trapdoor commitmentsnon-malleability
Contact author(s)
philmac @ lucent com
History
2003-12-04: received
Short URL
https://ia.cr/2003/252
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2003/252,
      author = {Philip MacKenzie and Ke Yang},
      title = {On Simulation-Sound Trapdoor Commitments},
      howpublished = {Cryptology ePrint Archive, Paper 2003/252},
      year = {2003},
      note = {\url{https://eprint.iacr.org/2003/252}},
      url = {https://eprint.iacr.org/2003/252}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.