Efficient multiparty interactive coding for insertions, deletions, and substitutions
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019•dl.acm.org
In the field of interactive coding, two or more parties wish to carry out a distributed
computation over a communication network that may be noisy. The ultimate goal is to
develop efficient coding schemes that can tolerate a high level of noise while increasing the
communication by only a constant factor (ie, constant rate). In this work we consider
synchronous communication networks over an arbitrary topology, in the powerful adversarial
insertion-deletion noise model. Namely, the noisy channel may adversarially alter the …
computation over a communication network that may be noisy. The ultimate goal is to
develop efficient coding schemes that can tolerate a high level of noise while increasing the
communication by only a constant factor (ie, constant rate). In this work we consider
synchronous communication networks over an arbitrary topology, in the powerful adversarial
insertion-deletion noise model. Namely, the noisy channel may adversarially alter the …
In the field of interactive coding, two or more parties wish to carry out a distributed computation over a communication network that may be noisy. The ultimate goal is to develop efficient coding schemes that can tolerate a high level of noise while increasing the communication by only a constant factor (i.e., constant rate).
In this work we consider synchronous communication networks over an arbitrary topology, in the powerful adversarial insertion-deletion noise model. Namely, the noisy channel may adversarially alter the content of any transmitted symbol, as well as completely remove a transmitted symbol or inject a new symbol into the channel.
We provide efficient, constant rate schemes that successfully conduct any computation with high probability as long as the adversary corrupts at most ε over m fraction of the total communication, where m is the number of links in the network and ε is a small constant. This scheme assumes an oblivious adversary which is independent of the parties' inputs and randomness. We can remove this assumption and resist a worst-case adversary at the price of being resilient to ε over m log m errors.
While previous work considered the insertion-deletion noise model in the two-party setting, to the best of our knowledge, our scheme is the first multiparty scheme that is resilient to insertions and deletions. Furthermore, our scheme is the first computationally efficient scheme in the multiparty setting that is resilient to adversarial noise.
ACM Digital Library以上显示的是最相近的搜索结果。 查看全部搜索结果