Composition of secure multi-party protocols. A comprehensive study.

DOI10.1007/b13246zbMath1041.68036MaRDI QIDQ1407493

Yehuda Lindell

Publication date: 16 September 2003

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b13246

zbMATH Keywords

Byzantine Agreement; multi-party protocol; computation with abort; point-to-point network

Mathematics Subject Classification ID

68P25: Data encryption (aspects in computer science)

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

68-02: Research exposition (monographs, survey articles) pertaining to computer science

68M14: Distributed systems

68M12: Network protocols

Related Items

Cryptography Using Captcha Puzzles, Conditional Reactive Simulatability, Actively secure arithmetic computation and VOLE with constant computational overhead, Impossibility results for universal composability in public-key models and with fixed inputs, Long-term security and universal composability, A note on universal composable zero-knowledge in the common reference string model, General composition and universal composability in secure multiparty computation, 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, On Adaptively Secure Multiparty Computation with a Short CRS, On Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption, Secure Two-Party Computation of Squared Euclidean Distances in the Presence of Malicious Adversaries