P²FRPSI: Privacy-preserving feature retrieved private set intersection

Private Set Intersection (PSI) protocols can securely compute the intersection of the private sets on the server and the client without revealing additional data. This work introduces the concept of Privacy-Preserving Feature Retrieved Private Set Intersection ( $\mathsf {P^{2}FRPSI}$ ). In $\maths...

Full description

Saved in:
Bibliographic Details
Main Authors: LING, Guowei, TANG, Fei, CAI, Chaochao, SHAN, Jinyong, XUE, Haiyang, LI, Wulu, TANG, Peng, HUANG, Xinyi, QIU, Weidong
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2023
Subjects:
Online Access:https://ink.library.smu.edu.sg/sis_research/9210
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
id sg-smu-ink.sis_research-10215
record_format dspace
spelling sg-smu-ink.sis_research-102152024-08-13T01:24:03Z P²FRPSI: Privacy-preserving feature retrieved private set intersection LING, Guowei TANG, Fei CAI, Chaochao SHAN, Jinyong XUE, Haiyang LI, Wulu TANG, Peng HUANG, Xinyi QIU, Weidong Private Set Intersection (PSI) protocols can securely compute the intersection of the private sets on the server and the client without revealing additional data. This work introduces the concept of Privacy-Preserving Feature Retrieved Private Set Intersection ( $\mathsf {P^{2}FRPSI}$ ). In $\mathsf {P^{2}FRPSI}$ protocols, the client can obtain the intersection that satisfies a given predicate without revealing the predicate and additional data. We formally define the $\mathsf {P^{2}FRPSI}$ protocol, including its inputs, outputs, functionality, and security. To achieve the privacy guarantee in $\mathsf {P^{2}FRPSI}$ protocols, a new two-party protocol is designed, namely Secure Secret Shared Retrieval ( $\mathsf {S^{3}R}$ ), which can be used to securely determine whether each item on the server satisfies the predicate. We construct an $\mathsf {S^{3}R}$ protocol and prove its security in the semi-honest model. On the basis of this, we design an efficient OT-based $\mathsf {P^{2}FRPSI}$ protocol and an easy-to-implement DH-based $\mathsf {P^{2}FRPSI}$ protocol and prove that they are secure in the semi-honest model. Our implementation shows that the OT-based $\mathsf {P^{2}FRPSI}$ protocol can perform the matching for about 1000K items in 3.8 seconds with a single thread. Moreover, the DH-based $\mathsf {P^{2}FRPSI}$ can perform the matching for about 7000K items in one hour with four threads, with communication totaling 1456 MB, while the OT-based $\mathsf {P^{2}FRPSI}$ protocol requires 1673 MB. 2023-12-18T08:00:00Z text https://ink.library.smu.edu.sg/sis_research/9210 info:doi/10.1109/tifs.2023.3343973 Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Protocols Companies Servers Remuneration Finance Training Data models Information Security
institution Singapore Management University
building SMU Libraries
continent Asia
country Singapore
Singapore
content_provider SMU Libraries
collection InK@SMU
language English
topic Protocols
Companies
Servers
Remuneration
Finance
Training
Data models
Information Security
spellingShingle Protocols
Companies
Servers
Remuneration
Finance
Training
Data models
Information Security
LING, Guowei
TANG, Fei
CAI, Chaochao
SHAN, Jinyong
XUE, Haiyang
LI, Wulu
TANG, Peng
HUANG, Xinyi
QIU, Weidong
P²FRPSI: Privacy-preserving feature retrieved private set intersection
description Private Set Intersection (PSI) protocols can securely compute the intersection of the private sets on the server and the client without revealing additional data. This work introduces the concept of Privacy-Preserving Feature Retrieved Private Set Intersection ( $\mathsf {P^{2}FRPSI}$ ). In $\mathsf {P^{2}FRPSI}$ protocols, the client can obtain the intersection that satisfies a given predicate without revealing the predicate and additional data. We formally define the $\mathsf {P^{2}FRPSI}$ protocol, including its inputs, outputs, functionality, and security. To achieve the privacy guarantee in $\mathsf {P^{2}FRPSI}$ protocols, a new two-party protocol is designed, namely Secure Secret Shared Retrieval ( $\mathsf {S^{3}R}$ ), which can be used to securely determine whether each item on the server satisfies the predicate. We construct an $\mathsf {S^{3}R}$ protocol and prove its security in the semi-honest model. On the basis of this, we design an efficient OT-based $\mathsf {P^{2}FRPSI}$ protocol and an easy-to-implement DH-based $\mathsf {P^{2}FRPSI}$ protocol and prove that they are secure in the semi-honest model. Our implementation shows that the OT-based $\mathsf {P^{2}FRPSI}$ protocol can perform the matching for about 1000K items in 3.8 seconds with a single thread. Moreover, the DH-based $\mathsf {P^{2}FRPSI}$ can perform the matching for about 7000K items in one hour with four threads, with communication totaling 1456 MB, while the OT-based $\mathsf {P^{2}FRPSI}$ protocol requires 1673 MB.
format text
author LING, Guowei
TANG, Fei
CAI, Chaochao
SHAN, Jinyong
XUE, Haiyang
LI, Wulu
TANG, Peng
HUANG, Xinyi
QIU, Weidong
author_facet LING, Guowei
TANG, Fei
CAI, Chaochao
SHAN, Jinyong
XUE, Haiyang
LI, Wulu
TANG, Peng
HUANG, Xinyi
QIU, Weidong
author_sort LING, Guowei
title P²FRPSI: Privacy-preserving feature retrieved private set intersection
title_short P²FRPSI: Privacy-preserving feature retrieved private set intersection
title_full P²FRPSI: Privacy-preserving feature retrieved private set intersection
title_fullStr P²FRPSI: Privacy-preserving feature retrieved private set intersection
title_full_unstemmed P²FRPSI: Privacy-preserving feature retrieved private set intersection
title_sort p²frpsi: privacy-preserving feature retrieved private set intersection
publisher Institutional Knowledge at Singapore Management University
publishDate 2023
url https://ink.library.smu.edu.sg/sis_research/9210
_version_ 1814047792132259840