Paper 1998/018
Security and Composition of Multi-party Cryptographic Protocols
Ran Canetti
Abstract
We present general definitions of security for multiparty cryptographic protocols and show that, using these definitions, security is preserved under a natural composition method. The definitions follow the general paradigm of known definitions; yet some substantial modifications and simplifications are introduced. In particular, `black-box simulation' is no longer required. The composition method is essentially the natural `subroutine substitution' method suggested by Micali and Rogaway. We first present the general definitional approach. Next we consider several settings for multiparty protocols. These include the cases of non-adaptive and adaptive adversaries, as well as the information-theoretic and the computational models.
Metadata
- Available format(s)
- PS
- Publication info
- Published elsewhere. Appeared in the THEORY OF CRYPTOGRAPHY LIBRARY and has been included in the ePrint Archive.
- Keywords
- Multiparty cryptographic protocolssecurity of protocolssecure composition of protocols.
- Contact author(s)
- canetti @ watson ibm com
- History
- 1999-08-01: last of 3 revisions
- 1998-06-04: received
- Short URL
- https://ia.cr/1998/018
- License
-
CC BY
BibTeX
@misc{cryptoeprint:1998/018,
author = {Ran Canetti},
title = {Security and Composition of Multi-party Cryptographic Protocols},
howpublished = {Cryptology ePrint Archive, Paper 1998/018},
year = {1998},
note = {\url{https://eprint.iacr.org/1998/018}},
url = {https://eprint.iacr.org/1998/018}
}
