TY  - INPR
A1  - Canetti, Ran
A1  - Fischlin, Marc
T1  - Universally composable commitments
N2  - We propose a new security measure for commitment protocols, called Universally Composable (UC) Commitment. The measure guarantees that commitment protocols behave like an \ideal commitment service," even when concurrently composed with an arbitrary set of protocols. This is a strong guarantee: it implies that security is maintained even when an unbounded number of copies of the scheme are running concurrently, it implies non-malleability (not only with respect to other copies of the same protocol but even with respect to other protocols), it provides resilience to selective decommitment, and more. Unfortunately two-party uc commitment protocols do not exist in the plain model. However, we construct two-party uc commitment protocols, based on general complexity assumptions, in the common reference string model where all parties have access to a common string taken from a predetermined distribution. The protocols are non-interactive, in the sense that both the commitment and the opening phases consist of a single message from the committer to the receiver.
KW  - Commitment schemes
KW  - concurrent composition
KW  - non-malleability
KW  - security analysis of protocols
Y1  - 2005
UR  - http://publikationen.ub.uni-frankfurt.de/frontdoor/index/index/docId/4230
UR  - https://nbn-resolving.org/urn:nbn:de:hebis:30-12599
UR  - http://www.mi.informatik.uni-frankfurt.de/research/papers/fischlin.composable.2001.pdf
N1  - Preprint, später in: Advances in Cryptology - Crypto 2001 , Lecture Notes in Computer Science, Vol. 2139, pp. 19-40, Springer-Verlag, 2001
ER  -