On Simulation-Sound Trapdoor Commitments [chapter]

Philip MacKenzie, Ke Yang
2004 Lecture Notes in Computer Science  
We study the recently introduced notion of a simulation-sound trapdoor commitment (SSTC) scheme. In this paper, we present a new, simpler de nition for an SSTC scheme that admits more e cient constructions and can be used in a larger set of applications. Speci cally, we show how to construct SSTC schemes from any one-way functions, and how to construct very e cient SSTC schemes based on speci c number-theoretic assumptions. We also show how to construct simulation-sound, non-malleable, and
more » ... rsally-composable zero-knowledge protocols using SSTC schemes, yielding, for instance, the most e cient 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.
doi:10.1007/978-3-540-24676-3_23 fatcat:eqn424j2brhsfg7lgyakqtl6mi