Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/36016
Citations | ||
Scopus | Web of Science® | Altmetric |
---|---|---|
?
|
?
|
Type: | Conference paper |
Title: | Efficient protocols for privacy preserving matching against distributed datasets |
Author: | Sang, Y. Shen, H. Tan, Y. Xiong, N. |
Citation: | Information and communications security : 8th international conference, ICICS 2006 Raleigh, NC, USA, December 4-7 2006 : proceedings / Peng Ning, Sihan Qing, Ninghui Li (eds.), pp. 210-227 |
Publisher: | Springs |
Publisher Place: | Germany |
Issue Date: | 2006 |
Series/Report no.: | Lecture notes in computer science; 4307 |
ISBN: | 3540494960 9783540494966 |
ISSN: | 0302-9743 1611-3349 |
Conference Name: | International Conference on Information and Communications Security (8th : 2006 : Raleigh, N.C.) |
Editor: | Ning, P. Qing, S. Li, N. |
Statement of Responsibility: | Yingpeng Sang, Hong Shen, Yasuo Tan and Naixue Xiong |
Abstract: | When datasets are distributed on different sources, finding out matched data while preserving the privacy of the datasets is a widely required task. In this paper, we address two matching problems against the private datasets on N (N≥2) parties. The first one is the Privacy Preserving Set Intersection (PPSI) problem, in which each party wants to learn the intersection of the N private datasets. The second one is the Privacy Preserving Set Matching (PPSM) problem, in which each party wants to learn whether its elements can be matched in any private set of the other parties. For the two problems we propose efficient protocols based on a threshold cryptosystem which is additive homomorphic. In a comparison with the related work in [18], the computation and communication costs of our PPSI protocol decrease by 81% and 17% respectively, and the computation and communication costs of our PPSM protocol decrease by 80% and 50% respectively. In practical utilities both of our protocols save computation time and communication bandwidth. |
Keywords: | cryptographic protocol, privacy preservation, distributed database, set intersection, set matching. |
DOI: | 10.1007/11935308_15 |
Published version: | http://www.springerlink.com./content/r5310336465w81n5 |
Appears in Collections: | Aurora harvest Computer Science publications |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.