Distributed Algorithms Made Secure: A Graph Theoretic Approach

v1v2v3v4v5 (latest)

Distributed Algorithms Made Secure: A Graph Theoretic Approach

4 December 2017

ArXiv (abs)PDF HTML

Papers citing "Distributed Algorithms Made Secure: A Graph Theoretic Approach"

6 / 6 papers shown

Title
Federated k-Core Decomposition: A Secure Distributed Approach Bin Guo E. Sekerinski Lingyang Chu 144 1 0 03 Oct 2024
Fast Broadcast in Highly Connected Networks Shashwat Chandra Yi-Jun Chang Michal Dory Mohsen Ghaffari Dean Leitersdorf 134 1 0 19 Apr 2024
Distributed CONGEST Algorithms against Mobile AdversariesACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2023 Orr Fischer M. Parter FedML 110 6 0 23 May 2023
Secured Distributed Algorithms Without Hardness AssumptionsInternational Conference on Principles of Distributed Systems (OPODIS), 2020 Leonid Barenboim Harel Levin 126 0 0 16 Nov 2020
Broadcast CONGEST Algorithms against Adversarial EdgesInternational Symposium on Distributed Computing (DISC), 2020 Yael Hitron M. Parter 251 10 0 14 Apr 2020
The Local Information Cost of Distributed Graph Spanners Peter Robinson 167 0 0 22 Mar 2020