TY - GEN

T1 - Communication in the presence of replication

AU - Barkol, Omer

AU - Ishai, Yuval

AU - Weinreb, Enav

PY - 2008/1/1

Y1 - 2008/1/1

N2 - We consider the following problem. Suppose that a big amount of data is distributed among several parties, so that each party misses only few pieces of data. The parties wish to perform some global computation on the data while minimizing the communication between them. This situation is common in many real-life scenarios. A naive solution to this problem is to first perform a synchronization step, letting one party learn all pieces of data, and then let this party perform the required computation locally. We study the question of obtaining better solutions to the problem, focusing mainly on the case of computing low-degree polynomials via non-interactive protocols. We present interesting connections between this problem and the well studied cryptographic problem of secret sharing. We use this connection to obtain nontrivial upper bounds and lower bounds using results and techniques from the domain of secret sharing. The relation with open problems from the area of secret sharing also provides evidence for the difficulty of resolving some of the questions we leave open.

AB - We consider the following problem. Suppose that a big amount of data is distributed among several parties, so that each party misses only few pieces of data. The parties wish to perform some global computation on the data while minimizing the communication between them. This situation is common in many real-life scenarios. A naive solution to this problem is to first perform a synchronization step, letting one party learn all pieces of data, and then let this party perform the required computation locally. We study the question of obtaining better solutions to the problem, focusing mainly on the case of computing low-degree polynomials via non-interactive protocols. We present interesting connections between this problem and the well studied cryptographic problem of secret sharing. We use this connection to obtain nontrivial upper bounds and lower bounds using results and techniques from the domain of secret sharing. The relation with open problems from the area of secret sharing also provides evidence for the difficulty of resolving some of the questions we leave open.

KW - Communication complexity

KW - Secret sharing

KW - Simultaneous messages

UR - http://www.scopus.com/inward/record.url?scp=57049139457&partnerID=8YFLogxK

U2 - 10.1145/1374376.1374472

DO - 10.1145/1374376.1374472

M3 - Conference contribution

AN - SCOPUS:57049139457

SN - 9781605580470

T3 - Proceedings of the Annual ACM Symposium on Theory of Computing

SP - 661

EP - 669

BT - STOC'08

PB - Association for Computing Machinery (ACM)

T2 - 40th Annual ACM Symposium on Theory of Computing, STOC 2008

Y2 - 17 May 2008 through 20 May 2008

ER -