On the theoretical gap between synchronous and asynchronous MPC protocols

DOI10.1145/1835698.1835746zbMath1315.68011OpenAlexW2129497273MaRDI QIDQ5176200

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

cryptographyMPCasynchronous networkmulti-party computation

Mathematics Subject Classification ID

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

Related Items (3)

High throughput secure MPC over small population in hybrid networks (extended abstract) ⋮ Synchronous consensus with optimal asynchronous fallback guarantees ⋮ \textsc{Tardigrade}: an atomic broadcast protocol for arbitrary network conditions

Uses Software

• CCSTM

Cites Work

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

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