Composition of secure multi-party protocols. A comprehensive study.
From MaRDI portal
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Data encryption (aspects in computer science) (68P25) Distributed systems (68M14) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Network protocols (68M12)
Recommendations
Cited in
(18)- On black-box complexity of universally composable security in the CRS model
- Secure multi-party computation without agreement
- Secure Protocols with Asymmetric Trust
- A note on universal composable zero-knowledge in the common reference string model
- Impossibility results for universal composability in public-key models and with fixed inputs
- Long-term security and universal composability
- Actively secure arithmetic computation and VOLE with constant computational overhead
- Cryptography using \texttt{CAPTCHA} puzzles
- Polynomial runtime and composability
- Lower bounds and impossibility results for concurrent self composition
- scientific article; zbMATH DE number 3856986 (Why is no real title available?)
- On Adaptively Secure Multiparty Computation with a Short CRS
- Mixed-technique multi-party computations composed of two-party computations
- On constant-round concurrent zero-knowledge from a knowledge assumption
- General composition and universal composability in secure multiparty computation
- Secure Two-Party Computation of Squared Euclidean Distances in the Presence of Malicious Adversaries
- Conditional reactive simulatability
- scientific article; zbMATH DE number 2013820 (Why is no real title available?)
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)
