Abstract

In fully-defective asynchronous networks all links are subject to an unlimited number of alteration errors, implying that all messages in the network may be completely corrupted. Despite the possible intuition that such a setting is too harsh for any reliable communication, we show how to simulate any algorithm for a noiseless setting over any fully-defective setting, given that the network is 2-edge connected. We further prove that if the network is not 2-edge connected, no non- trivial computation in the fully-defective setting is possible.Based on work with Keren Censor-Hillel, Shir Cohen, and Gal Sela.

About Ran Gelles

Dr. Ran Gelles received his B.Sc. (Summa Cum Laude) and M.Sc. from the Technion–Israel Institute of Technology, in 2003 and 2009, respectively. He received his PhD in 2014 from the University of California, Los Angeles (UCLA). Between 2014-2016 he served as a Postdoctoral Research Associate at Princeton University, New-Jersey. Starting 2016, Ran is with the Faculty of Engineering at Bar-Ilan University, Israel. His research interests include coding theory, distributed computing, fault-tolerance, and cryptography.

Curious about our other news? Subscribe to our news feed, calendar, or newsletter, or follow us on social media.