Information theoretically secure multi party set intersection re-visited

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

Volumn 5867 LNCS, Issue , 2009, Pages 71-91

  Patra, Arpita ^a   Choudhary, Ashish ^a   Rangan, C Pandu ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY MADRAS   (India)

Author keywords

Information Theoretic Security; Multiparty Computation

Indexed keywords

ACTIVE ADVERSARY; COMMUNICATION COMPLEXITY; COMPUTING POWER; INFORMATION-THEORETIC SECURITY; MULTIPARTY COMPUTATION; NOVEL INFORMATION; SECURE PROTOCOLS; SET INTERSECTION;

CRYPTOGRAPHY; INFORMATION THEORY; NETWORK PROTOCOLS;

NETWORK SECURITY;

EID: 70549091142     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-05445-7_5     Document Type: Conference Paper

References (20)

1. Beerliová-Trubíniová, Z., Hirt, M.: Efficient Multi-party Computation with Dispute Control. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 305-328. Springer, Heidelberg (2006)
2. Beerliová-Trubíniová, Z., Hirt, M.: Perfectly-Secure MPC with Linear Communication Complexity. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 213-230. Springer, Heidelberg (2008)
3. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness Theorems for Non-Cryptographic Fault Tolerant Distributed Computation. In: 20th ACM Symposium on Theory of Computing, pp. 1-10. ACM Press, New York (1988)
4. Berman, P., Garay, J.A., Perry, K.J.: Bit Optimal Distributed Consensus. Comp. Sci. Research, 313-322 (1992)
5. Carter, L., Wegman, M.N.: Universal Classes of Hash Functions. J. of Comp. and Sys. Sci. 18(4), 143-154 (1979)
6. Cramer, R., Damgård, I.: Multiparty Computation: An Introduction: Contemporary Cryptography. Birkhäuser, Basel (2005)
7. Cramer, R., Damgård, I., Dziembowski, S., Hirt, M., Rabin, T.: Efficient Multiparty Computations Secure Against an Adaptive Adversary. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 311-326. Springer, Heidelberg (1999)
8. Damgård, I., Nielsen, J.B.: Scalable and Unconditionally Secure Multiparty Computation. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 572-590. Springer, Heidelberg (2007)
9. Fitzi, M., Garay, J., Gollakota, S., Pandu Rangan, C., Srinathan, K.: Round-Optimal and Efficient Verifiable Secret Sharing. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 329-342. Springer, Heidelberg (2006)
10. Freedman, M.J., Nissim, K., Pinkas, B.: Efficient Private Matching and Set Intersection. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 1-19. Springer, Heidelberg (2004)
11. Gennaro, R., Ishai, Y., Kushilevitz, E., Rabin, T.: The Round Complexity of Verifiable Secret Sharing and Secure Multicast. In: 33rd ACM Symposium on Theory of Computing, pp. 580-589. ACM Press, New York (2001)
12. Hirt, M., Maurer, U., Przydatek, B.: Efficient Secure Multi-party Computation. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 143-161. Springer, Heidelberg (2000)
13. Katz, J., Koo, C.Y., Kumaresan, R.: Improving the Round Complexity of VSS in Point-to-Point Networks. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol. 5126, pp. 499-510. Springer, Heidelberg (2008)
14. Kissner, L., Song, D.: Privacy-Preserving Set Operations. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 241-257. Springer, Heidelberg (2005)
15. Li, R., Wu, C.: An Unconditionally Secure Protocol for Multi-Party Set Intersection. In: Katz, J., Yung, M. (eds.) ACNS 2007. LNCS, vol. 4521, pp. 226-236. Springer, Heidelberg (2007)
16. Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann, San Francisco (1996)
17. MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error Correcting Codes. North-Holland Publishing Company, Amsterdam (1978)
18. Rabin, T., Ben-Or, M.: Verifiable Secret Sharing and Multiparty Protocols with Honest Majority. In: 21st ACM Symposium on Theory of Computing, pp. 73-85. ACM Press, New York (1989)
19. Srinathan, K., Narayanan, A., Pandu Rangan, C.: Optimal Perfectly Secure Message Transmission. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 545-561. Springer, Heidelberg (2004)
20. Yao, A.C.: Protocols for Secure Computations. In: 23rd IEEE Symposium on Foundations of Computer Science, pp. 160-164. IEEE Press, Los Alamitos (1982)