Secured distributed algorithms without hardness assumptions

Leonid Barenboim

doi:10.1016/j.jpdc.2022.09.012

Return

Secured distributed algorithms without hardness assumptions

2023-01-01

Leonid Barenboim *

Harel Levin

DOI：10.1016/j.jpdc.2022.09.012

Original

Save

View PDF

Abstract

En 中文

We study algorithms in the LOCAL model that produce secured output. Specifically, each vertex computes its part in the output, the entire output is correct, but each vertex cannot discover the output of other vertices, with a certain probability. As the extensive research in the distributed algorithms field yielded efficient decentralized algorithms, the discussion about the security of distributed algorithms was somewhat neglected. Nevertheless, many protocols and algorithms were devised in the research area of secure multi-party computation problem. However, the focus in those protocols was to work for every function f at the expense of increasing the round complexity, or the necessity of several computational assumptions. We present a novel approach, which identifies and develops those algorithms that are inherently secure (which means they do not require any further constructions). This approach yields efficient secure algorithms for various labeling and decomposition problems without requiring any hardness assumption, but only a private randomness generator in each vertex.(c) 2022 Elsevier Inc. All rights reserved.

Keywords:

Distributed algorithms

Privacy preserving

Graph coloring

Generic algorithms

Multi-party computation

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.