On Interactive Coding Schemes with Adaptive Termination
Meghal Gupta, Rachel Yun Zhang

TL;DR
This paper investigates how adaptive termination in interactive coding schemes can improve error resilience, allowing parties to end protocols early and potentially enhance robustness against adversarial errors.
Contribution
It introduces the concept of adaptive termination in interactive coding and analyzes its impact on error resilience in message exchange protocols.
Findings
Adaptive termination can increase error resilience in interactive coding.
Partially adaptive schemes outperform non-adaptive ones under certain conditions.
Early termination strategies improve robustness against adversarial errors.
Abstract
In interactive coding, Alice and Bob wish to compute some function of their individual private inputs and . They do this by engaging in an interactive protocol to jointly compute . The goal is to do this in an error-resilient way, such that even given some fraction of adversarial corruptions to the protocol, both parties still learn . Typically, the error resilient protocols constructed by interactive coding schemes are \emph{non-adaptive}, that is, the length of the protocol as well as the speaker in each round is fixed beforehand. The maximal error resilience obtainable by non-adaptive schemes is now well understood. In order to circumvent known barriers and achieve higher error resilience, the work of Agrawal, Gelles, and Sahai (ISIT 2016) introduced to interactive coding the notion of \emph{adaptive} schemes, where the length of the protocol or the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptography and Data Security · Computability, Logic, AI Algorithms · semigroups and automata theory
