Abstract
We study the error resilience of the message exchange task: Two parties, each
holding a private input, want to exchange their inputs. However, the channel
connecting them is governed by an adversary that may corrupt a constant fraction of the transmissions. What is the maximum fraction of corruptions that still allows the parties to exchange their inputs? For the non-adaptive channel, where the parties must agree in advance on the order in which they communicate, the maximum error resilience was shown to be 1/4 (see [BR11], STOC 2011). The problem was also studied over the adaptive channel, where
the order in which the parties communicate may not be predetermined ([GHS14], STOC 2014; [EKS20], STOC 2020). These works show that the adaptive channel admits much richer set of protocols but leave open the question of finding its maximum error resilience. In this work, we show that the maximum error resilience of a protocol for message exchange over the adaptive channel is 5/16 , thereby settling the above question. Our result requires improving both the known upper bounds and the known lower bounds for the problem.
holding a private input, want to exchange their inputs. However, the channel
connecting them is governed by an adversary that may corrupt a constant fraction of the transmissions. What is the maximum fraction of corruptions that still allows the parties to exchange their inputs? For the non-adaptive channel, where the parties must agree in advance on the order in which they communicate, the maximum error resilience was shown to be 1/4 (see [BR11], STOC 2011). The problem was also studied over the adaptive channel, where
the order in which the parties communicate may not be predetermined ([GHS14], STOC 2014; [EKS20], STOC 2020). These works show that the adaptive channel admits much richer set of protocols but leave open the question of finding its maximum error resilience. In this work, we show that the maximum error resilience of a protocol for message exchange over the adaptive channel is 5/16 , thereby settling the above question. Our result requires improving both the known upper bounds and the known lower bounds for the problem.
| Original language | English GB |
|---|---|
| Number of pages | 45 |
| Journal | Electronic Colloquium on Computational Complexity |
| Volume | 60 |
| State | Published - 8 Apr 2021 |