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
مستوى الصوت171
المعرِّفات الرقمية للأشياء
حالة النشرنُشِر - يناير 2023

ملاحظة ببليوغرافية

Publisher Copyright:
© 2022 Elsevier Inc.


أدرس بدقة موضوعات البحث “Secured distributed algorithms without hardness assumptions'. فهما يشكلان معًا بصمة فريدة.

قم بذكر هذا