Invited Talk: Resilient Distributed Algorithms

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Following the immense recent advances in distributed networks, the explosive growth of the Internet, and our increased dependence on these infrastructures, guaranteeing the uninterrupted operation of communication networks has become a major objective in network algorithms. The modern instantiations of distributed networks, such as, the Bitcoin network and cloud computing, introduce in addition, new security challenges that deserve urgent attention in both theory and practice. This extended abstract describes our initial steps towards developing a unified framework for obtaining fast, resilient and secure distributed algorithms for fundamental graph problems. We will be focusing on two main objectives: Initiating and establishing the theoretical exploration of security in distributed graph algorithms. Such a notion has been addressed before mainly in the context of secure multi-party computation (MPC). The heart of our approach is to develop new graph theoretical infrastructures to provide graphical secure channels between nodes in a communication network of an arbitrary topology.Developing efficient distributed algorithms against various adversarial settings, such as, node crashes and Byzantine attacks. The main novelty in addressing these objectives is in our approach, which is based on taking a graph theoretic perspective where common notions of resilience requirements will be translated into suitably tailored combinatorial graph structures. We believe that the proposed perspective will deepen the theoretical foundations for resilient distributed computation, strengthen the connections with the areas of fault tolerant network design and information theoretic security, and provide a refreshing perspective on extensively-studied graph theoretical concepts.

Original languageEnglish
Title of host publicationSOFSEM 2021
Subtitle of host publicationTheory and Practice of Computer Science - 47th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2021, Proceedings
EditorsTomáš Bureš, Riccardo Dondi, Johann Gamper, Giovanna Guerrini, Tomasz Jurdzinski, Claus Pahl, Florian Sikora, Prudence W. Wong
PublisherSpringer Science and Business Media B.V.
Pages28-42
Number of pages15
ISBN (Print)9783030677305
DOIs
StatePublished - 11 Jan 2021
Event47th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2021 - Bolzano-Bozen, Italy
Duration: 25 Jan 202129 Jan 2021

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume12607 LNCS
ISSN (Print)0302-9743

Conference

Conference47th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2021
Country/TerritoryItaly
CityBolzano-Bozen
Period25/01/2129/01/21

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Invited Talk: Resilient Distributed Algorithms'. Together they form a unique fingerprint.

Cite this