Secured distributed algorithms without hardness assumptions

Leonid Barenboim, Harel Levin

פרסום מחקרי: פרסום בכתב עתמאמרביקורת עמיתים


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.

שפה מקוריתאנגלית
עמודים (מ-עד)130-140
מספר עמודים11
כתב עתJournal of Parallel and Distributed Computing
מזהי עצם דיגיטלי (DOIs)
סטטוס פרסוםפורסם - ינו׳ 2023

הערה ביבליוגרפית

Publisher Copyright:
© 2022 Elsevier Inc.

טביעת אצבע

להלן מוצגים תחומי המחקר של הפרסום 'Secured distributed algorithms without hardness assumptions'. יחד הם יוצרים טביעת אצבע ייחודית.

פורמט ציטוט ביבליוגרפי