General composition and universal composability in secure multiparty computation
type: Item
instance of: scholarly article
title: General composition and universal composability in secure multiparty computation
zbMATH Open document ID: 1184.94243
author: Yehuda Lindell
published in: Journal of Cryptology
publication date: 2009-06-30T00:00:00Z
review text: An important part of theoretical cryptography deals with definitions and models of security. One difficulty in this area is that there is no unique natural model for each purpose, and various models have to be studied and compared. The paper deals mainly with two such models, or definitions, of security, related to secure protocols running concurrently with other protocols: \textit{universal composability} and \textit{concurrent general composition}. Canetti has shown that security under universal composability implies concurrent general composition. While the converse implication remains open, the author proves that natural variants of universal composability and concurrent general composition are equivalent. The ramifications of this technical result are significant. Specifically, it is known that it is impossible to achieve universal composability in the plain model; thus in order to achieve this level of security a trusted setup phase is used. Concurrent general composition models the weakest natural way of defining security when protocols run concurrently with other protocols. The fact that this notion implies a variant of universal composability for which all the impossibility results hold, means that the impossibility results all carry over to the definition of concurrent general composition.
reviewed by: Boaz Tsaban
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 94A62
zbMATH DE Number: 5571753
zbMATH Keywords: secure computation
zbMATH Keywords: concurrent general composition
zbMATH Keywords: universal composability
MaRDI profile type: Publication
full work available at URL: s00145-008-9021-2
OpenAlex ID: W2157779300
cites work: Q4035733
cites work: Security and composition of multiparty cryptographic protocols
cites work: Q4783717
cites work: Universally composable two-party and multi-party secure computation
cites work: Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds
cites work: On the limitations of universally composable two-party computation without set-up assumptions
cites work: Magic Functions
cites work: Concurrent zero-knowledge
cites work: Cryptography and cryptographic protocols
cites work: Foundations of Cryptography
cites work: Q4279565
cites work: Secure multi-party computation without agreement
cites work: Concurrent composition of secure protocols in the timing model
cites work: Bounded-concurrent secure two-party computation without setup assumptions
cites work: Composition of secure multi-party protocols. A comprehensive study.
cites work: Theory of Cryptography
cites work: Q4434874
cites work: Bounded-concurrent secure multi-party computation with a dishonest majority
cites work: New notions of security
cites work: Q4250778
DOI: 10.1007/S00145-008-9021-2
Recommended article: Universally composable two-party and multi-party secure computation
Recommended article: Universally Composable Multiparty Computation with Partially Isolated Parties
Recommended article: A Simpler Variant of Universally Composable Security for Standard Multiparty Computation
Recommended article: Adaptively Secure, Universally Composable, Multiparty Computation in Constant Rounds
Recommended article: Secure multiparty computation with general interaction patterns
Recommended article: Topics in Cryptology – CT-RSA 2006
Recommended article: Advances in Cryptology - CRYPTO 2003
Recommended article: Generalizing Efficient Multiparty Computation
Recommended article: Distributing the setup in universally composable multi-party computation
Recommended article: Universally Composable Multi-party Computation Using Tamper-Proof Hardware
description: scientific article; zbMATH DE number 5571753