Secure Distributed Computing Made (Nearly) Optimal

DOI10.1145/3293611.3331620OpenAlexW2963051187WikidataQ130854719 ScholiaQ130854719MaRDI QIDQ5145188FDOQ5145188

M. Parter, Eylon Yogev

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.3331620

zbMATH Keywords

distributed algorithmssecure computationmulti-party computationprivate neighborhood trees

Mathematics Subject Classification ID

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

Cited In (2)

• Invited talk: Resilient distributed algorithms
• Distributed CONGEST Algorithms against Mobile Adversaries

This page was built for publication: Secure Distributed Computing Made (Nearly) Optimal

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