Paper Info
Title
Efficient protocols for privacy preserving matching against distributed datasets
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.
Year
DOI
Venue
2006
10.1007/11935308_15
ICICS
Keywords
Field
DocType
ppsi protocol decrease,communication cost,privacy preserving set intersection,computation time,ppsm protocol decrease,private set,communication bandwidth,private datasets,n private datasets,efficient protocol,privacy preserving set matching,cryptographic protocol,distributed database
Intersection (set theory),Data mining,Homomorphic encryption,Cryptographic protocol,Cryptography,Computer science,Computer network,Theoretical computer science,Bandwidth (signal processing),Distributed database,Information privacy,Threshold cryptosystem
Conference
Volume
ISSN
ISBN
4307
0302-9743
3-540-49496-0
Citations 
PageRank 
References 
14
0.76
17
Authors
4
Name
Order
Citations
PageRank
Yingpeng Sang116211.98
Hong Shen2342.90
Yasuo Tan315125.41
Naixue Xiong42413194.61