Secure Distributed Computing Made (Nearly) Optimal
Merav Parter, Eylon Yogev · 2019
In this paper, we study secure distributed algorithms that are nearly optimal, with respect to running time, for the given input graph G. Roughly speaking, an algorithm is secure if the nodes learn only their final output while gaining no information on the input (or output) of other nodes.