{'fraction_non_alphanumeric': 0.027210884353741496, 'fraction_numerical': 0.0, 'mean_word_length': 5.094674556213017, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A Study of the Private Set Intersection Protocol Based on Negative Databases

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.