Sending a Message with Unknown Noise

Aggarwal, Abhinav; Dani, Varsha; Hayes, Thomas P.; Saia, Jared

doi:10.1145/3154273.3154318

Cited by 5 publications

(4 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We review some related work in these areas, but we stress that neither approach can be used in fully-defective networks: Interactive coding must assume some bound on the errors, either per channel or globally, while solutions for networks with Byzantine edges must assume a bound on the number of noisy channels. ADHS18,GI20] for the two-party case and in [ADHS20] for the multiparty case. In a work by Efrmenko, Haramaty, and Kalai [EHK20], the noise model is similar to the one we consider here in the sense that it can corrupt the content of messages but not their existence.…”

Section: Related Workmentioning

confidence: 99%

Distributed Computations in Fully-Defective Networks

Censor-Hillel¹,

Cohen²,

Gelles³

et al. 2022

Preprint

View full text Add to dashboard Cite

We address fully-defective asynchronous networks, in which 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 prove that if the network is not 2-edge connected, no non-trivial computation in the fully-defective setting is possible.The key structural property of 2-edge-connected graphs that we leverage is the existence of an oriented (non-simple) cycle that goes through all nodes [Robbins, 1939]. The core of our technical contribution is presenting a construction of such a Robbins cycle in fully-defective networks, and showing how to communicate over it despite total message corruption. These are obtained in a content-oblivious manner, since nodes must ignore the content of received messages.

show abstract

Section: Related Workmentioning

confidence: 99%

Distributed Computations in Fully-Defective Networks

Censor-Hillel¹,

Cohen²,

Gelles³

et al. 2022

Preprint

View full text Add to dashboard Cite

show abstract

“…Resource competitive analysis has been applied to designing algorithms for: jamming-resistant wireless communication [27,29,36]; attack-resistance on multiple access channels [8], tolerating adversarial channel noise [3,19,20], and efficiently distributing bridges for anonymity networks such as TOR [60]. See [9,28] for detailed surveys.…”

Section: Related Workmentioning

confidence: 99%

“…Such as the public key for a digital signature 3. Just the identities of the neighbors, not any other information such as the internal states of the neighbors is assumed.…”

mentioning

confidence: 99%

Scalable and Secure Computation Among Strangers: Resource-Competitive Byzantine Protocols

Augustine,

King,

Molla

et al. 2019

Preprint

Self Cite

View full text Add to dashboard Cite

The last decade has seen substantial progress on designing Byzantine agreement algorithms which are scalable in that they do not require all-to-all communication among nodes. These protocols require each node to play a particular role determined by its ID, and to send to specific neighbors. Motivated, in part, by the rise of permissionless systems such as Bitcoin where arbitrary nodes (whose identities are not known apriori) can join and leave at will, we extend this research to a more practical model where each node (initially) does not know the identity of its neighbors. In particular, a node can send to new destinations only by sending to random (or arbitrary) nodes, or responding (if it chooses) to messages received from those destinations. We assume a synchronous and fully-connected network, with a fullinformation, but static Byzantine adversary. A general drawback of existing Byzantine protocols is that the communication cost incurred by the honest nodes may not be proportional to those incurred by the Byzantine nodes; in fact, they can be significantly higher. Our goal is to design Byzantine protocols for fundamental problems which are resource competitive, i.e., the total number of bits sent by all the honest nodes is not significantly more than those sent by the Byzantine nodes.We describe a randomized scalable algorithm to solve Byzantine agreement, leader election, and committee election in this model. Our algorithm sends an expected O((T + n) log n) bits and has latency O(polylog(n)), where n is the number of nodes, and T is the minimum of n 2 and the number of bits sent by adversarially controlled nodes. The algorithm is resilient to (1/4 − )n Byzantine nodes for any fixed > 0, and succeeds with high probability 1 . Our work can be considered as a first application of resource-competitive analysis to fundamental Byzantine problems.To complement our algorithm we also show lower bounds for resource-competitive Byzantine agreement. We prove that, in general, one cannot hope to design Byzantine protocols that have communication cost that is significantly smaller than the cost of the Byzantine adversary.

show abstract

“…An AMD code [CDF + 08] is used to fingerprint each transmitted message, allowing the other side to detect corruptions with high probability. Aggrawal et al [ADHS18] use similar techniques to develop a robust protocol for message transfer, assuming bi-directional channel that suffers from an arbitrary (yet finite) and unknown amount of bit flips. Aggarwal et al [ADHS17] extended this setting to the multiparty case, where n parties, rather than two, perform a computation over a noisy network with an arbitrary and unknown amount of noise.…”

Section: Related Workmentioning

confidence: 99%

Interactive coding resilient to an unknown number of erasures

Gelles¹,

Iyer²

2018

Preprint

View full text Add to dashboard Cite

We consider distributed computations between two parties carried out over a noisy channel that may erase messages. Following a noise model proposed by , the noise level observed by the parties during the computation in our setting is arbitrary and a priori unknown to the parties.We develop interactive coding schemes that adapt to the actual level of noise and correctly execute any two-party computation. Namely, in case the channel erases T transmissions, the coding scheme will take N + 2T transmissions using an alphabet of size 4 (alternatively, using 2N + 4T transmissions over a binary channel) to correctly simulate any binary protocol that takes N transmissions assuming a noiseless channel. We can further reduce the communication to N + T by relaxing the communication model and allowing parties to remain silent rather than forcing them to communicate in every round of the coding scheme.Our coding schemes are efficient, deterministic, have linear overhead both in their communication and round complexity, and succeed (with probability 1) regardless of the number of erasures T .

show abstract

Sending a Message with Unknown Noise

Cited by 5 publications

References 34 publications

Distributed Computations in Fully-Defective Networks

Distributed Computations in Fully-Defective Networks

Scalable and Secure Computation Among Strangers: Resource-Competitive Byzantine Protocols

Interactive coding resilient to an unknown number of erasures

Contact Info

Product

Resources

About