Issue No. 05 - Sept.-Oct. (2016 vol. 13)
Bharath K. Samanthula , Department of Computer Science, Purdue University, 305 N. University Street, West Lafayette, IN
Wei Jiang , Department of Computer Science, Missouri University of Science and Technology, 310 CS Building, 500 West 15th St., Rolla, MO
The Jaccard Coefficient, as an information similarity measure, has wide variety of applications, such as cluster analysis and image segmentation. Due to the concerns of personal privacy, the Jaccard Coefficient cannot be computed directly between two independently owned datasets. The problem, secure computation of the Jaccard Coefficient for multisets (SJCM), considers the situation where two parties want to securely compute the random shares of the Jaccard Coefficient between their multisets. During the process, the content of each party's multiset is not disclosed to the other party and also the value of Jaccard Coefficient should be hidden from both parties. Secure computation of multiset intersection cardinality is an important sub-problem of SJCM. Existing methods when applied to solve such a problem can lead to either insecure or inefficient solutions. Our work addresses this gap. We first present a basic SJCM protocol constructed using the existing secure dot product method as a sub-routine. Then, as a major contribution, we propose an approximated version of our basic protocol to improve efficiency without compromising accuracy much. We provide various experimental results to show that the proposed protocols are significantly more efficient than the existing techniques when the domain size is small using both simulated and real datasets.
Protocols, Silicon carbide, Encryption, Privacy, Polynomials, Approximation methods
B. K. Samanthula and W. Jiang, "Secure Multiset Intersection Cardinality and its Application to Jaccard Coefficient," in IEEE Transactions on Dependable and Secure Computing, vol. 13, no. 5, pp. 591-604, 2016.