Asynchronous Secure Multiparty Computation in Constant Time

DOI10.1007/978-3-662-49387-8_8zbMath1395.94275OpenAlexW2296436904MaRDI QIDQ2798798

Ran Cohen

Publication date: 13 April 2016

Published in: Public-Key Cryptography – PKC 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-49387-8_8

zbMATH Keywords

asynchronous communicationmultiparty computationByzantine agreement.constant-time protocolsthreshold FHE

Mathematics Subject Classification ID

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

Related Items (12)

Improving the efficiency of optimally-resilient statistically-secure asynchronous multi-party computation ⋮ High throughput secure MPC over small population in hybrid networks (extended abstract) ⋮ Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party ⋮ Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions ⋮ 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 ⋮ Network-agnostic security comes (almost) for free in DKG and MPC ⋮ MPC with synchronous security and asynchronous responsiveness ⋮ On the communication efficiency of statistically secure asynchronous MPC with optimal resilience ⋮ On communication-efficient asynchronous MPC with adaptive security ⋮ Adaptively secure MPC with sublinear communication complexity ⋮ Always have a backup plan: fully secure synchronous MPC with asynchronous fallback

This page was built for publication: Asynchronous Secure Multiparty Computation in Constant Time