Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/44928
Citations | ||
Scopus | Web of Science® | Altmetric |
---|---|---|
?
|
?
|
Type: | Conference paper |
Title: | Privacy preserving set intersection protocol secure against malicious behaviors |
Author: | Sang, Y. Shen, H. |
Citation: | Proceedings of Eighth International Conference Parallel and Distributed Computing, Applications and Technologies, 2007 / pp.461-468 |
Publisher: | IEEE |
Publisher Place: | USA |
Issue Date: | 2007 |
ISBN: | 0769530494 9780769530499 |
Conference Name: | International Conference on Parallel and Distributed Computing, Applications and Technologies (8th : 2007 : Adelaide, South Australia) |
Editor: | Munro, D. |
Statement of Responsibility: | Yingpeng Sang and Hong Shen |
Abstract: | When datasets are distributed on different sources, finding out their intersection while preserving the privacy of the datasets is a widely required task. In this paper, we address the privacy preserving set intersection (PPSI) problem, in which each of the N parties learns no elements other than the intersection of their N private datasets. We propose an efficient protocol in the malicious model, where the adversary may control arbitrary number of parties and execute the protocol for its own benefit. A related work in [12] has a correctness probability of ( v;1)ldquo (f is the size of the encryption scheme's plaintext space), a computation complexity of' 0(N2 S2lgf) (S is the size of each party's data set). Our PPSI protocol in the malicious model has a correctness probability iquest/C a-/1)JV~1 plusmnmiddotd achieves a computation cost of 0{c2S2lgM) (c is the number of malicious parties and c < N eurordquo I). |
Rights: | © 2007 IEEE |
DOI: | 10.1109/PDCAT.2007.59 |
Appears in Collections: | Aurora harvest 6 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.