Multiparty Interactive Communication with Private Channels

DOI10.1145/3293611.3331571MaRDI QIDQ5145192zbMATH OpenOpenAlexFDO

Authors Abhinav Aggarwal, Varsha Dani, Thomas P. Hayes, Jared Saia

Publication date 20 January 2021

Published in Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

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

zbMATH Keywords

resource competitive analysisinteractive communicationprivate channels

Mathematics Subject Classification ID

Distributed algorithms (68W15) Distributed systems (68M14)

Recommendations

• Brief announcement: Optimally-resilient unconditionally-secure asynchronous multi-party computation revisited
• scientific article; zbMATH DE number 1583939
• Robust Multiparty Computation with Linear Communication Complexity
• scientific article; zbMATH DE number 1955785

Cited in

(3)

• Algorithms and Data Structures
• Noisy beeping networks
• Open Multiparty Interaction

This page was built for publication: Multiparty Interactive Communication with Private Channels

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