Round-Efficient Black-Box Construction of Composable Multi-Party Computation

DOI10.1007/978-3-662-44381-1_20zbMath1335.94061OpenAlexW51340397MaRDI QIDQ2874546

Susumu Kiyoshima

Publication date: 7 August 2014

Published in: Advances in Cryptology – CRYPTO 2014 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-44381-1_20

Mathematics Subject Classification ID

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

Related Items

Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments ⋮ Towards a unified approach to black-box constructions of zero-knowledge proofs ⋮ Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions ⋮ Survey of information security ⋮ Unbounded ABE via bilinear entropy expansion, revisited ⋮ Improved, black-box, non-malleable encryption from semantic security ⋮ Statistical concurrent non-malleable zero-knowledge from one-way functions ⋮ Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round ⋮ Concurrently composable non-interactive secure computation ⋮ A new approach to efficient non-malleable zero-knowledge ⋮ Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles ⋮ Environmentally friendly composable multi-party computation in the plain model from standard (timed) assumptions ⋮ 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