Allison Lewko

Interactive coding for multiparty protocols


We will discuss upper and lower bounds for the communication
complexity and error resilience properties that are achievable for
interactive multiparty protocols executed across adversarial channels.
For the case of two parties, this has been studied under the name
"interactive coding," an area pioneered by Schulman. We focus on how
the achievable error rates and communication overhead are affected by
having n parties for n larger than 2. This is joint work with Abhishek
Jain and Yael Kalai.