Title :
A Study of the Private Set Intersection Protocol Based on Negative Databases
Author :
Dongdong Zhao ; Wenjian Luo
Author_Institution :
Sch. of Comput. Sci. & Technol., Univ. of Sci. & Technol. of China, Hefei, China
Abstract :
Nowadays, data privacy has been widely concerned. The private set intersection means that several parties calculate the intersection of their private sets while without revealing extra information about their private data. The negative database (NDB) is a new technique for preserving privacy, and it stores information in the complementary set of a traditional database (DB). Reversing the NDB to recover the corresponding DB is an NP-hard problem, and this property is the security foundation of the NDB. Moreover, the NDB can directly support some database operations such as intersection, union, select and Cartesian product. However, so far, there is no research work about the secure multi-party computation based on NDBs. In this paper, firstly, a two-party private set intersection protocol based on NDBs is proposed, and its security and efficiency are analyzed. Then, the multi-party private set intersection protocol based on NDBs is given.
Keywords :
computational complexity; data privacy; database management systems; protocols; security of data; Cartesian product; NDB reversal; NP-hard problem; data privacy; database operations; information storage; multiparty private set intersection protocol; negative databases; privacy preservation; private data; secure multiparty computation; security; traditional database; two-party private set intersection protocol; Algorithm design and analysis; Complexity theory; Databases; Educational institutions; Protocols; Security; Servers; negative database; privacy preserving; private set intersection; secure multi-party computation;
Conference_Titel :
Dependable, Autonomic and Secure Computing (DASC), 2013 IEEE 11th International Conference on
Conference_Location :
Chengdu
Print_ISBN :
978-1-4799-3380-8
DOI :
10.1109/DASC.2013.38
