General composition and universal composability in secure multiparty computation
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.
- Universally composable two-party and multi-party secure computation
- Universally Composable Multiparty Computation with Partially Isolated Parties
- A simpler variant of universally composable security for standard multiparty computation
- Adaptively secure, universally composable, multiparty computation in constant rounds
- Secure multiparty computation with general interaction patterns
- Topics in Cryptology – CT-RSA 2006
- Advances in Cryptology - CRYPTO 2003
- Generalizing efficient multiparty computation
- Distributing the setup in universally composable multi-party computation
- Universally Composable Multi-party Computation Using Tamper-Proof Hardware
- Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds
- Bounded-concurrent secure multi-party computation with a dishonest majority
- Bounded-concurrent secure two-party computation without setup assumptions
- Composition of secure multi-party protocols. A comprehensive study.
- Concurrent composition of secure protocols in the timing model
- Concurrent zero-knowledge
- Cryptography and cryptographic protocols
- Foundations of Cryptography
- scientific article; zbMATH DE number 176562 (Why is no real title available?)
- scientific article; zbMATH DE number 1304087 (Why is no real title available?)
- scientific article; zbMATH DE number 503243 (Why is no real title available?)
- scientific article; zbMATH DE number 2009954 (Why is no real title available?)
- scientific article; zbMATH DE number 1842484 (Why is no real title available?)
- Magic functions
- New notions of security: achieving universal composability without trusted setup
- On the limitations of universally composable two-party computation without set-up assumptions
- Secure multi-party computation without agreement
- Security and composition of multiparty cryptographic protocols
- Theory of Cryptography
- Theory of Cryptography
- Universally composable two-party and multi-party secure computation
- How to simulate it in Isabelle: towards formal proof for secure multi-party computation
- Security and composition of multiparty cryptographic protocols
- Overcoming impossibility results in composable security using interval-wise guarantees
- Synchronous constructive cryptography
- Universally composable subversion-resilient cryptography
- On expected probabilistic polynomial-time adversaries: a suggestion for restricted definitions and their benefits
- On black-box complexity of universally composable security in the CRS model
- Polynomial runtime and composability
- (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens
- Lower bounds and impossibility results for concurrent self composition
- Concurrent composition of secure protocols in the timing model
- On the limitations of universally composable two-party computation without set-up assumptions
- On Black-Box Complexity of Universally Composable Security in the CRS Model
- Synchronous universally composable computer networks
- Universally composable security with local adversaries
- New impossibility results for concurrent composition and a non-interactive completeness theorem for secure computation
- Information-theoretically secure protocols and security under composition
- Universal composition with responsive environments
- Information-theoretically secure protocols and security under composition
- Secure composition of cryptographic protocols. (Abstract)
- A second note on the feasibility of generalized universal composability
- A simpler variant of universally composable security for standard multiparty computation
- A Compiler of Two-Party Protocols for Composable and Game-Theoretic Security, and Its Application to Oblivious Transfer
- Universally Composable Simultaneous Broadcast
- Universally composable two-party and multi-party secure computation
- Concurrent general composition of secure protocols in the timing model
- On the Necessity of Rewinding in Secure Multiparty Computation
- Local Sequentiality Does Not Help for Concurrent Composition
- Impossibility results for universal composability in public-key models and with fixed inputs
- scientific article; zbMATH DE number 1842484 (Why is no real title available?)
- Universally composable synchronous computation
- Universally composable security
- A Note on the Feasibility of Generalized Universal Composability
- Advances in Cryptology - CRYPTO 2003
- Information Security
- Information Security
- Theory of Cryptography
- Progress in Cryptology - INDOCRYPT 2004
- Theory of Cryptography
- Resource fairness and composability of cryptographic protocols
This page was built for publication: General composition and universal composability in secure multiparty computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1027983)
