Composition of secure multi-party protocols. A comprehensive study.
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Network protocols (68M12) Distributed systems (68M14) Data encryption (aspects in computer science) (68P25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Multi-party protocols consider the scenario where several parties wish to jointly compute some function. Such a protocol is secure if it does not reveal anything beyond what is necessary (privacy) and each party receive its correct output (correctness). The book studies security of multi-party protocols under composition, i.e. when more protocols run in succession or simultaneously. The initial chapter introduces the problem of multi-party protocols and security properties; describes possible adversarial models and types of protocol compositions; and summarizes new results presented in the book. Three technical chapters follow. The first one deals with the composition of authentication Byzantine agreement. The protocol securely simulates a broadcast channel within a point-to-point network, and is the key tool in the design of secure protocols for multi-party computation. The author shows that the problem of achieving secure broadcast is strictly harder when composition is allowed. Using unique identifiers to solve the problem is discussed. Lower bounds for the composition of deterministic protocols are presented as well. In Chapter 3 it is shown that if the definition of secure computation is slightly relaxed (``computation with abort), one can construct secure protocols without using Byzantine Agreement, and, as a result, multi-party protocols in a point-to-point network that remain secure under self composition can be achieved for any number of corrupted parties and without a broadcast channel. The last chapter deals with the problem whether the secure multi-party computation remaining secure under general composition can be achieved for any number of corrupted parties, considering an asynchronous multi-party network and an adversary that can adaptively corrupt as many parties as it wishes. Several secure multi-party protocols are presented.
- A note on universal composable zero-knowledge in the common reference string model
- General composition and universal composability in secure multiparty computation
- Security and composition of multiparty cryptographic protocols
- On black-box complexity of universally composable security in the CRS model
- Polynomial runtime and composability
- Lower bounds and impossibility results for concurrent self composition
- Secure multi-party computation without agreement
- On Adaptively Secure Multiparty Computation with a Short CRS
- On constant-round concurrent zero-knowledge from a knowledge assumption
- scientific article; zbMATH DE number 3856986 (Why is no real title available?)
- Secure Protocols with Asymmetric Trust
- Secure Two-Party Computation of Squared Euclidean Distances in the Presence of Malicious Adversaries
- scientific article; zbMATH DE number 2013820 (Why is no real title available?)
- Impossibility results for universal composability in public-key models and with fixed inputs
- Cryptography using \texttt{CAPTCHA} puzzles
- Conditional reactive simulatability
- Long-term security and universal composability
- Actively secure arithmetic computation and VOLE with constant computational overhead
- Mixed-technique multi-party computations composed of two-party computations
- Threshold Niederreiter: chosen-ciphertext security and improved distributed decoding
This page was built for publication: Composition of secure multi-party protocols. A comprehensive study.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1407493)
