z-logo
open-access-imgOpen Access
SE-PSI: Fog/Cloud server-aided enhanced secure and effective private set intersection on scalable datasets with Bloom Filter
Author(s) -
Shuo Qiu,
AUTHOR_ID,
Zheng Zhang,
Yanan Liu,
Hao Yan,
Yuan Cheng
Publication year - 2021
Publication title -
mathematical biosciences and engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.451
H-Index - 45
eISSN - 1551-0018
pISSN - 1547-1063
DOI - 10.3934/mbe.2022087
Subject(s) - bloom filter , scalability , computer science , cloud computing , intersection (aeronautics) , protocol (science) , encryption , set (abstract data type) , computer network , filter (signal processing) , novelty , distributed computing , operating system , medicine , philosophy , alternative medicine , theology , pathology , engineering , computer vision , programming language , aerospace engineering
Private Set Intersection (PSI), which is a hot topic in recent years, has been extensively utilized in credit evaluation, medical system and so on. However, with the development of big data era, the existing traditional PSI cannot meet the application requirements in terms of performance and scalability. In this work, we proposed two secure and effective PSI (SE-PSI) protocols on scalable datasets by leveraging deterministic encryption and Bloom Filter. Specially, our first protocol focuses on high efficiency and is secure under a semi-honest server, while the second protocol achieves security on an economic-driven malicious server and hides the set/intersection size to the server. With experimental evaluation, our two protocols need only around 15 and 24 seconds respectively over one million-element datasets. Moreover, as a novelty, a multi-round mechanism is proposed for the two protocols to improve the efficiency. The implementation demonstrates that our two-round mechanism can enhance efficiency by almost twice than two basic protocols.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here