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

DOI10.1007/B13246zbMath1041.68036OpenAlexW2495276536MaRDI 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 Agreementmulti-party protocolcomputation with abortpoint-to-point network

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Distributed systems (68M14) Network protocols (68M12)

Related Items (13)

Polynomial runtime and composability ⋮ Long-term security and universal composability ⋮ On Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption ⋮ Actively secure arithmetic computation and VOLE with constant computational overhead ⋮ Lower bounds and impossibility results for concurrent self composition ⋮ Impossibility results for universal composability in public-key models and with fixed inputs ⋮ Cryptography Using Captcha Puzzles ⋮ Secure Two-Party Computation of Squared Euclidean Distances in the Presence of Malicious Adversaries ⋮ A note on universal composable zero-knowledge in the common reference string model ⋮ On Adaptively Secure Multiparty Computation with a Short CRS ⋮ General composition and universal composability in secure multiparty computation ⋮ On black-box complexity of universally composable security in the CRS model ⋮ Conditional Reactive Simulatability

This page was built for publication: Composition of secure multi-party protocols. A comprehensive study.