On the theoretical gap between synchronous and asynchronous MPC protocols

DOI10.1145/1835698.1835746MaRDI QIDQ5176200zbMATH OpenOpenAlexFDO

Authors Zuzana Beerliová-Trubíniová, Martin Hirt, Jesper Buus Nielsen

Publication date 2 March 2015

Published in Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1835698.1835746

zbMATH Keywords

asynchronous networkcryptographyMPCmulti-party computation

Mathematics Subject Classification ID

Network protocols (68M12) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed algorithms (68W15) Cryptography (94A60)

Recommendations

• Simple and Efficient Perfectly-Secure Asynchronous MPC
• Constant-round asynchronous multi-party computation based on one-way functions
• Always have a backup plan: fully secure synchronous MPC with asynchronous fallback
• MPC with synchronous security and asynchronous responsiveness
• Perfectly-secure asynchronous MPC for general adversaries (extended abstract)

Cites work

• Elastic Transactions
• Software transactional memory
• Toward a theory of transactional contention managers

Cited in

(5)

• High throughput secure MPC over small population in hybrid networks (extended abstract)
• Synchronous consensus with optimal asynchronous fallback guarantees
• MPC with synchronous security and asynchronous responsiveness
• \textsc{Tardigrade}: an atomic broadcast protocol for arbitrary network conditions
• Peeking into the future: MPC resilient to super-rushing adversaries

Describes a project that uses

Uses Software

• CCSTM

This page was built for publication: On the theoretical gap between synchronous and asynchronous MPC protocols

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5176200)