Paper 2009/630

Information-Theoretically Secure Protocols and Security Under Composition

Eyal Kushilevitz, Yehuda Lindell, and Tal Rabin


We investigate the question of whether security of protocols in the information-theoretic setting (where the adversary is computationally unbounded) implies the security of these protocols under concurrent composition. This question is motivated by the folklore that all known protocols that are secure in the information-theoretic setting are indeed secure under concurrent composition. We provide answers to this question for a number of different settings (i.e., considering perfect versus statistical security, and concurrent composition with adaptive versus fixed inputs). Our results enhance the understanding of what is necessary for obtaining security under composition, as well as providing tools (i.e., composition theorems) that can be used for proving the security of protocols under composition while considering only the standard stand-alone definitions of security.

Available format(s)
Cryptographic protocols
Publication info
Published elsewhere. An extended abstract of this paper appeared in STOC 2006. This is the full version.
secure multiparty computationinformation-theoretic securitysecurity under composition
Contact author(s)
lindell @ cs biu ac il
2009-12-26: received
Short URL
Creative Commons Attribution


      author = {Eyal Kushilevitz and Yehuda Lindell and Tal Rabin},
      title = {Information-Theoretically Secure Protocols and Security Under Composition},
      howpublished = {Cryptology ePrint Archive, Paper 2009/630},
      year = {2009},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.