On the hardness of information-theoretic multiparty computation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3027, Issue , 2004, Pages 439-455

  Ishai, Yuval ^a   Kushilevitz, Eyal ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; DECODING; INFORMATION RETRIEVAL;

COMMUNICATION COMPLEXITY; ERROR CORRECTING CODE; INFORMATION-THEORETIC CRYPTOGRAPHY; LOCALLY-DECODABLE CODES; MULTIPARTY COMPUTATION; PRIVATE INFORMATION RETRIEVAL; SECURE MULTI-PARTY COMPUTATION; UNCONDITIONALLY SECURE;

INFORMATION THEORY;

EID: 33748114725     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24676-3_26     Document Type: Article

References (29)

1. A. Ambainis. Upper bound on the communication complexity of private information retrieval. In Proc. of 24th ICALP, pages 401-407, 1997.
2. J. Bar-Ilan and D. Beaver. Non-cryptographic fault-tolerant computing in a constant number of rounds. In Proc. of 8th PODC, pages 201-209, 1989.
3. D. Beaver and J. Feigenbaum. Hiding instances in multioracle queries. In Proc. of 6th STACS, pages 37-48, 1990.
4. D. Beaver, J. Feigenbaum, J. Kilian, and P. Rogaway. Security with low communication overhead. In Proc. of CRYPTO '90, pages 62-76, 1990.
5. D. Beaver, S. Micali, and P. Rogaway. The round complexity of secure protocols (extended abstract). In Proc. of 22nd STOC, pages 503-513, 1990.
6. 1/(2k-1) Barrier for Information-Theoretic Private Information Retrieval. In Proc. of 43rd FOCS, pages 261-270, 2002.
7. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for noncryptographic fault-tolerant distributed computation. In Proc. of 20th STOC, pages 1-10, 1988.
8. B. Chor and N. Gilboa. Computationally private information retrieval. In Proc. of the 29th STOC, pages 304-313, 1997.
9. C. Cachin, S. Micali, and M. Stadier. Computationally private information retrieval with polylogarithmic communication. In Proc. of EUROCRYPT '99, pages 402-414, 1999.
10. D. Chaum, C. Crépeau, and I. Damgard. Multiparty unconditionally secure protocols (extended abstract). In Proc. of 20th STOC, pages 11-19, 1988.
11. B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan. Private information retrieval. In Proc. of the 36th FOCS, pages 41-51, 1995.
12. Journal version: J. of the ACM, 45, pages 965-981, 1998.
13. R. Cramer, I. Damgard, and U. Maurer. General secure multi-party computation from any linear secret-sharing scheme. In Proc. of EUROCRYPT 2000, pages 316-334, 2000.
14. A. Deshpande, R. Jain, T Kavita, V. Lokam, and J. Radhakrishnan. Better lower bounds for locally decodable codes. In Proc. of 16th CCC, pages 184-193, 2002.
15. G. Di-Crescenzo, T. Malkin, and R. Ostrovsky. Single-database private information retrieval implies oblivious transfer. In Proc. of EUROCRYPT 2000, pages 122-138, 2000.
16. Y. Gertner, Y. Ishai, E. Kushilevitz, and T. Malkin. Protecting data privacy in private information retrieval schemes. In Proc. of 30th STOC, pages 151-160, 1998.
17. Journal version: J. of Computer and System Sciences, 60(3), pages 592-629, 2000.
18. O. Goldreich. Personal communication, 2000 (cited in [6]).
19. O. Goldreich, H. Karloff, L. Schulman, and L. Trevisan. Lower bounds for linear locally decodable codes and PIR. In Proc. of 16th CCC, pp. 175 - 183, 2002.
20. M. Hirt and U. Maurer. Player Simulation and General Adversary Structures in Perfect Multiparty Computation. In Journal of cryptology, 13(1), pages 31-60, 2000.
21. Y. Ishai and E. Kushilevitz. Randomizing Polynomials: A New Representation with Applications to Round-Efficient Secure Computation. In Proc. of 41st FOCS, pages 294-304, 2000.
22. J. Katz and L. Trevisan. On the efficiency of local decoding procedures for errorcorrecting codes. In Proc. of 32nd STOC, pages 80-86, 2000.
23. I. Kerenidis and R. de Wolf. Exponential lower bound for 2-query locally decodable codes via a quantum argument. In Proc. of 35th STOC, pages 106-115, 2003.
24. E. Kushilevitz and R. Ostrovsky. Replication is not needed: Single database, computationally-private information retrieval. In Proc. of 38th FOCS, pages 364373, 1997.
25. E. Mann. Private access to distributed information. Master's thesis, Technion Israel Institute of Technology, Haifa, 1998.
26. M. Naor and K. Nissim. Communication Preserving Protocols for Secure Function Evaluation. In Proc. of 33rd STOC, pages 590-599, 2001.
27. M. Naor and B. Pinkas. Oblivious transfer and polynomial evaluation. Proc. 31st STOC, pages 245-254, 1999.
28. N. Nisan and A. Wigderson. Hardness vs Randomness. J. Comput. Syst. Sci. 49(2), pages 149-167, 1994.
29. K. Obata. Optimal Lower Bounds for 2-Query Locally Decodable Linear Codes. In Proc. of 6th RANDOM, pages 39-50, 2002.