General composition and universal composability in secure multi-party computation

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

27 Scopus citations

Abstract

Concurrent general composition relates to a setting where a secure protocol is run in a network concurrently with other, arbitrary protocols. Clearly, security in such a setting is what is desired, or even needed, in modern computer networks where many different protocols are executed concurrently. Our main result is a proof that security under concurrent general composition is equivalent to a relaxed variant of universal composability (where the only difference relates to the order of quantifiers in the definition). An important corollary of this theorem is that existing impossibility results for universal composability (or actually its relaxed variant) are inherent in any definition achieving security under concurrent general composition. We stress that the impossibility results obtained are not "black-box", and apply even to non-black-box simulation. Our main result also demonstrates that the definition of universal composability is somewhat "minimal", in that the composition guarantee provided by universal composability (almost) implies the definition itself. This indicates that the security definition of universal composability is not overly restrictive.

Original languageEnglish
Title of host publicationProceedings - 44th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2003
PublisherIEEE Computer Society
Pages394-403
Number of pages10
ISBN (Electronic)0769520405
DOIs
StatePublished - 2003
Externally publishedYes
Event44th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2003 - Cambridge, United States
Duration: 11 Oct 200314 Oct 2003

Publication series

NameProceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
Volume2003-January
ISSN (Print)0272-5428

Conference

Conference44th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2003
Country/TerritoryUnited States
CityCambridge
Period11/10/0314/10/03

Bibliographical note

Publisher Copyright:
© 2003 IEEE.

Keywords

  • Computer networks
  • Computer security
  • Concurrent computing
  • Cryptography
  • Intelligent networks
  • Polynomials
  • Privacy
  • Protocols
  • Random variables
  • Stress

Fingerprint

Dive into the research topics of 'General composition and universal composability in secure multi-party computation'. Together they form a unique fingerprint.

Cite this