Paper 2004/006

Protocol Initialization for the Framework of Universal Composability

Boaz Barak, Yehuda Lindell, and Tal Rabin


Universally composable protocols (Canetti, FOCS 2000) are cryptographic protocols that remain secure even when run concurrently with arbitrary other protocols. Thus, universally composable protocols can be run in modern networks, like the Internet, and their security is guaranteed. However, the definition of universal composition actually assumes that each execution of the protocol is assigned a unique session identifier, and furthermore, that this identifier is known to all the participating parties. In addition, all universally composable protocols assume that the set of participating parties and the specification of the protocol to be run are a-priori agreed upon and known to all parties. In a decentralized network like the Internet, this setup information must be securely generated by the parties themselves. In this note we formalize the setup problem and show how to securely realize it with a simple and highly efficient protocol.

Available format(s)
Cryptographic protocols
Publication info
Published elsewhere. Unknown where it was published
Universal compositionsecure multiparty computation
Contact author(s)
talr @ watson ibm com
2004-01-09: received
Short URL
Creative Commons Attribution


      author = {Boaz Barak and Yehuda Lindell and Tal Rabin},
      title = {Protocol Initialization for the Framework of Universal Composability},
      howpublished = {Cryptology ePrint Archive, Paper 2004/006},
      year = {2004},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.