TY - GEN
T1 - Outsourced Private Set Intersection Cardinality with Fully Homomorphic Encryption
AU - Tajima, Arisa
AU - Sato, Hiroki
AU - Yamana, Hayato
N1 - Funding Information:
ACKNOWLEDGMENT This work was supported by JST CREST Grant Number JPMJCR1503, Japan.
Publisher Copyright:
© 2018 IEEE.
PY - 2018/11/6
Y1 - 2018/11/6
N2 - Cloud database services have attracted considerable interest with the increase in the amount of data to be analyzed. Delegating data management to cloud services, however, causes security and privacy issues because cloud services are not always trustable. In this study, we address the problem of answering join queries across outsourced private datasets while maintaining data confidentiality. We particularly consider a scenario in which two data owners each own a set of elements and a querier asks the cloud to perform join operations to obtain the size of the common elements in the two datasets. To process the join operations without revealing the contents of data to the cloud, we propose two protocols, a basic protocol and a querier-friendly protocol, which adopt a functionality of outsourced private set intersection cardinality (OPSI-CA) with fully homomorphic encryption (FHE) and bloom filters. The querier-friendly protocol achieves a reduction in communication and computation costs for the querier. Our experimental results show that it takes 436 s for the basic protocol and 298 s for the querier-friendly protocol to execute the join query on the two datasets with 100 elements each. The novelty of this study is that our protocols are the first approaches for outsourced join operations adopting FHE.
AB - Cloud database services have attracted considerable interest with the increase in the amount of data to be analyzed. Delegating data management to cloud services, however, causes security and privacy issues because cloud services are not always trustable. In this study, we address the problem of answering join queries across outsourced private datasets while maintaining data confidentiality. We particularly consider a scenario in which two data owners each own a set of elements and a querier asks the cloud to perform join operations to obtain the size of the common elements in the two datasets. To process the join operations without revealing the contents of data to the cloud, we propose two protocols, a basic protocol and a querier-friendly protocol, which adopt a functionality of outsourced private set intersection cardinality (OPSI-CA) with fully homomorphic encryption (FHE) and bloom filters. The querier-friendly protocol achieves a reduction in communication and computation costs for the querier. Our experimental results show that it takes 436 s for the basic protocol and 298 s for the querier-friendly protocol to execute the join query on the two datasets with 100 elements each. The novelty of this study is that our protocols are the first approaches for outsourced join operations adopting FHE.
KW - FHE
KW - bloom filter
KW - cloud computing
KW - component
KW - outsourced join queries
KW - private set intersection
UR - http://www.scopus.com/inward/record.url?scp=85063232008&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85063232008&partnerID=8YFLogxK
U2 - 10.1109/ICMCS.2018.8525881
DO - 10.1109/ICMCS.2018.8525881
M3 - Conference contribution
AN - SCOPUS:85063232008
T3 - International Conference on Multimedia Computing and Systems -Proceedings
BT - Proceedings of 2018 6th International Conference on Multimedia Computing and Systems, ICMCS 2018
A2 - El Hibaoui, Abdelaaziz
A2 - Essaaidi, Mohamed
A2 - Zaz, Youssef
PB - IEEE Computer Society
T2 - 6th International Conference on Multimedia Computing and Systems, ICMCS 2018
Y2 - 10 May 2018 through 12 May 2018
ER -