To refer to this page use:
|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 Braverman and Rao, STOC 2011). The problem was also studied over the adaptive channel, where the order in which the parties communicate may not be predetermined (Ghaffari, Haeupler, and Sudan, STOC 2014; Efremenko, Kol, and Saxena, 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.|
|Citation:||Efremenko, Klim, Gillat Kol, and Raghuvansh R. Saxena. "Optimal error resilience of adaptive message exchange." In Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (2021): pp. 1235-1247. doi:10.1145/3406325.3451077|
|Pages:||1235 - 1247|
|Type of Material:||Conference Article|
|Journal/Proceeding Title:||Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing|
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.