TY - CHAP
T1 - On the hardness of information-theoretic multiparty computation
AU - Ishai, Yuval
AU - Kushilevitz, Eyal
PY - 2004
Y1 - 2004
N2 - We revisit the following open problem in information-theoretic cryptography: Does the communication complexity of unconditionally secure computation depend on the computational complexity of the function being computed? For instance, can computationally unbounded players compute an arbitrary function of their inputs with polynomial communication complexity and a linear threshold of unconditional privacy? Can this be done using a constant number of communication rounds? We provide an explanation for the difficulty of resolving these questions by showing that they are closely related to the problem of obtaining efficient protocols for (information-theoretic) private information retrieval and hence also to the problem of constructing short locally-decodable error-correcting codes. The latter is currently considered to be among the most intriguing open problems in complexity theory. Information-theoretic cryptography, secure multiparty computation, private information retrieval, locally decodable codes.
AB - We revisit the following open problem in information-theoretic cryptography: Does the communication complexity of unconditionally secure computation depend on the computational complexity of the function being computed? For instance, can computationally unbounded players compute an arbitrary function of their inputs with polynomial communication complexity and a linear threshold of unconditional privacy? Can this be done using a constant number of communication rounds? We provide an explanation for the difficulty of resolving these questions by showing that they are closely related to the problem of obtaining efficient protocols for (information-theoretic) private information retrieval and hence also to the problem of constructing short locally-decodable error-correcting codes. The latter is currently considered to be among the most intriguing open problems in complexity theory. Information-theoretic cryptography, secure multiparty computation, private information retrieval, locally decodable codes.
UR - http://www.scopus.com/inward/record.url?scp=33748114725&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-24676-3_26
DO - 10.1007/978-3-540-24676-3_26
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.chapter???
AN - SCOPUS:33748114725
SN - 3540219358
SN - 9783540219354
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 439
EP - 455
BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
A2 - Cachin, Christian
A2 - Camenisch, Jan
ER -