Secured distributed algorithms without hardness assumptions

DOI10.4230/LIPICS.OPODIS.2020.32MaRDI QIDQ6834013zbMATH OpenFDO

Authors Leonid Barenboim, Harel Levin

Publication date 31 March 2026

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://doi.org/10.4230/LIPICS.OPODIS.2020.32

zbMATH Keywords

distributed algorithmsgraph coloringprivacy preservationmulti-party computationgeneric algorithms

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15) Privacy of data (68P27)

Cites work

• Almost-Everywhere Secure Computation
• Communication Locality in Secure Multi-party Computation
• Distributed Graph Coloring: Fundamentals and Recent Developments
• Distributed \((\Delta+1)\)-coloring in linear (in \(\Delta\)) time
• Families of finite sets in which no set is covered by the union of \(r\) others
• Improved fault tolerance and secure computation on sparse networks
• Low diameter graph decompositions
• Non-interactive multiparty computation without correlated randomness
• Polylogarithmic-time deterministic network decomposition and distributed derandomization
• Removing randomness in parallel computation without a processor penalty
• Secure Distributed Computing Made (Nearly) Optimal
• Secure multiparty computation with general interaction patterns
• Simple distributed +1-coloring of graphs
• Some simple distributed algorithms for sparse networks
• Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition

This page was built for publication: Secured distributed algorithms without hardness assumptions

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