General composition and universal composability in secure multiparty computation
From MaRDI portal
Publication:1027983
DOI10.1007/s00145-008-9021-2zbMath1184.94243OpenAlexW2157779300MaRDI QIDQ1027983
Publication date: 30 June 2009
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-008-9021-2
Related Items (5)
A Simpler Variant of Universally Composable Security for Standard Multiparty Computation ⋮ (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens ⋮ Resource fairness and composability of cryptographic protocols ⋮ On expected probabilistic polynomial-time adversaries: a suggestion for restricted definitions and their benefits ⋮ Overcoming impossibility results in composable security using interval-wise guarantees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Composition of secure multi-party protocols. A comprehensive study.
- Security and composition of multiparty cryptographic protocols
- Concurrent composition of secure protocols in the timing model
- On the limitations of universally composable two-party computation without set-up assumptions
- Secure multi-party computation without agreement
- Magic Functions
- Universally composable two-party and multi-party secure computation
- Bounded-concurrent secure multi-party computation with a dishonest majority
- New notions of security
- Bounded-concurrent secure two-party computation without setup assumptions
- Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds
- Foundations of Cryptography
- Cryptography and cryptographic protocols
- Concurrent zero-knowledge
- Theory of Cryptography
- Theory of Cryptography
This page was built for publication: General composition and universal composability in secure multiparty computation
