## CryptoDB

### Paper: Universal Composition with Joint State

Authors: Ran Canetti Tal Rabin URL: http://eprint.iacr.org/2002/047 Search ePrint Search Google Cryptographic systems often involve running multiple concurrent instances of some protocol, where the instances have some amount of joint state and randomness. (Examples include systems where multiple protocol instances use the same public-key infrastructure, or the same common reference string.) Rather than attempting to analyze the entire system as a single unit, we would like to be able to analyze each such protocol instance as stand-alone, and then use a general composition theorem to deduce the security of the entire system. However, no known composition theorem applies in this setting, since they all assume that the composed protocol instances have disjoint internal states, and that the internal random choices in the various instances are independent. We propose a new composition operation that can handle the case where different components have some amount of joint state and randomness, and demonstrate sufficient conditions for when the new operation preserves security. The new operation, which is called {\em universal composition with joint state} (and is based on the recently proposed universal composition operation), turns out to be very useful in a number of quite different scenarios such as those mentioned above.
##### BibTeX
@misc{eprint-2002-11571,
title={Universal Composition with Joint State},
booktitle={IACR Eprint archive},
keywords={foundations / Cryptographic protocols, protocol composition, security analysis},
url={http://eprint.iacr.org/2002/047},
note={Extended abstract of this work appears in proceedings of Crypto 2003. canetti@watson.ibm.com 12373 received 18 Apr 2002, last revised 17 Nov 2003},
author={Ran Canetti and Tal Rabin},
year=2002
}