Information Theoretically Secure Multi Party Set Intersection Re-visited

  • Arpita Patra
  • Ashish Choudhary
  • C. Pandu Rangan
Conference paper

DOI: 10.1007/978-3-642-05445-7_5

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5867)
Cite this paper as:
Patra A., Choudhary A., Rangan C.P. (2009) Information Theoretically Secure Multi Party Set Intersection Re-visited. In: Jacobson M.J., Rijmen V., Safavi-Naini R. (eds) Selected Areas in Cryptography. SAC 2009. Lecture Notes in Computer Science, vol 5867. Springer, Berlin, Heidelberg

Abstract

We re-visit the problem of secure multiparty set intersection (MPSI) in information theoretic settings. In [15], Li et.al have proposed a protocol for MPSI with n = 3t + 1 parties, that provides information theoretic security, when t out of those n parties are corrupted by an active adversary having unbounded computing power. In [15], the authors have claimed that their protocol takes six rounds of communication and communicates \({\cal O}(n^4m^2)\) field elements, where each party has a set containing m field elements. However, we show that the round and communication complexity of the protocol in [15] is much more than what is claimed in [15]. We then propose a novel information theoretically secure protocol for MPSI with n ≥ 3t + 1, which significantly improves the ”actual” round and communication complexity of the protocol of [15]. Our protocols employ several tools which are of independent interest.

Keywords

Multiparty Computation Information Theoretic Security 
Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Arpita Patra
    • 1
  • Ashish Choudhary
    • 1
  • C. Pandu Rangan
    • 1
  1. 1.Dept of Computer Science and EngineeringIIT MadrasChennaiIndia

Personalised recommendations