Constant-Round Black-Box Construction of Composable Multi-Party Computation Protocol

DOI10.1007/978-3-642-54242-8_15zbMath1327.68097OpenAlexW173892823MaRDI QIDQ5746344

Susumu Kiyoshima, Tatsuaki Okamoto, Yoshifumi Manabe

Publication date: 18 February 2014

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-54242-8_15

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Network protocols (68M12)

Related Items (15)

Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions ⋮ Statistical Concurrent Non-malleable Zero-Knowledge from One-Way Functions ⋮ Round-Optimal Black-Box Two-Party Computation ⋮ Unbounded ABE via bilinear entropy expansion, revisited ⋮ Improved, black-box, non-malleable encryption from semantic security ⋮ Maliciously-secure MrNISC in the plain model ⋮ Statistical concurrent non-malleable zero-knowledge from one-way functions ⋮ Round-optimal black-box secure computation from two-round malicious OT ⋮ Concurrently composable non-interactive secure computation ⋮ Round-efficient black-box construction of composable multi-party computation ⋮ A black-box construction of non-malleable encryption from semantically secure encryption ⋮ Computing boundary cycle of a pseudo-triangle polygon from its visibility graph ⋮ Concurrently Composable Security with Shielded Super-Polynomial Simulators ⋮ On the Exact Round Complexity of Self-composable Two-Party Computation ⋮ Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions

This page was built for publication: Constant-Round Black-Box Construction of Composable Multi-Party Computation Protocol