General composition and universal composability in secure multiparty computation
From MaRDI portal
Publication:1027983
Recommendations
- 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
Cites work
- 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?)
- 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
- 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
Cited in
(39)- Theory of Cryptography
- scientific article; zbMATH DE number 1842484 (Why is no real title available?)
- Overcoming impossibility results in composable security using interval-wise guarantees
- Universally Composable Simultaneous Broadcast
- A Note on the Feasibility of Generalized Universal Composability
- Information-theoretically secure protocols and security under composition
- Synchronous constructive cryptography
- Secure composition of cryptographic protocols. (Abstract)
- Universal composition with responsive environments
- A Compiler of Two-Party Protocols for Composable and Game-Theoretic Security, and Its Application to Oblivious Transfer
- How to simulate it in Isabelle: towards formal proof for secure multi-party computation
- On black-box complexity of universally composable security in the CRS model
- Universally composable subversion-resilient cryptography
- Polynomial runtime and composability
- Advances in Cryptology - CRYPTO 2003
- (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens
- On the limitations of universally composable two-party computation without set-up assumptions
- Concurrent general composition of secure protocols in the timing model
- Universally composable two-party and multi-party secure computation
- Information-theoretically secure protocols and security under composition
- Universally composable security
- Lower bounds and impossibility results for concurrent self composition
- A simpler variant of universally composable security for standard multiparty computation
- On Black-Box Complexity of Universally Composable Security in the CRS Model
- Information Security
- Universally composable security with local adversaries
- Concurrent composition of secure protocols in the timing model
- On expected probabilistic polynomial-time adversaries: a suggestion for restricted definitions and their benefits
- Universally composable synchronous computation
- Synchronous universally composable computer networks
- A second note on the feasibility of generalized universal composability
- On the Necessity of Rewinding in Secure Multiparty Computation
- New impossibility results for concurrent composition and a non-interactive completeness theorem for secure computation
- Theory of Cryptography
- Impossibility results for universal composability in public-key models and with fixed inputs
- Resource fairness and composability of cryptographic protocols
- Local Sequentiality Does Not Help for Concurrent Composition
- Information Security
- Progress in Cryptology - INDOCRYPT 2004
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)
