Efficient General-Adversary Multi-Party Computation

DOI10.1007/978-3-642-42045-0_10zbMath1314.94073OpenAlexW111864789MaRDI QIDQ2867152

Daniel Tschudi, Martin Hirt

Publication date: 10 December 2013

Published in: Advances in Cryptology - ASIACRYPT 2013 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-42045-0_10

zbMATH Keywords

efficiencysecure multiparty computationgeneral adversaries

Mathematics Subject Classification ID

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

Related Items (7)

Broadcast from Minicast Secure Against General Adversaries ⋮ Perfectly-secure asynchronous MPC for general adversaries (extended abstract) ⋮ On the (in)efficiency of non-interactive secure multiparty computation ⋮ Revisiting the efficiency of asynchronous MPC with optimal resilience against general adversaries ⋮ Revisiting the efficiency of perfectly secure asynchronous multi-party computation against general adversaries ⋮ Multiplicative and verifiably multiplicative secret sharing for multipartite adversary structures ⋮ Strong Separations Between Broadcast and Authenticated Channels

This page was built for publication: Efficient General-Adversary Multi-Party Computation