TY - GEN
T1 - Outsourced private set union on multi- A ttribute datasets for search protocol using fully homomorphic encryption
AU - Shakya, Rumi
AU - Yasumura, Yoshiko
AU - Takuya, Suzuki
AU - Ishimaki, Yu
AU - Yamana, Hayato
N1 - Funding Information:
Acknowledgment This work was partly supported by JSPS KAKENHI Grant Number 26420268.
Publisher Copyright:
© 2019 Association for Computing Machinery.
PY - 2019/12/2
Y1 - 2019/12/2
N2 - In the era of big data and cloud computing, outsourcing data storage to the cloud poses the risk of its abuse or leakage. Thus, we address the problem of delegating computation on outsourced private datasets while maintaining privacy. In this study, we consider a scenario involving two data owners outsourcing their datasets to a cloud service. The cloud performs a set union computation, after which the querier sends a query to obtain information from both datasets. We propose a protocol that uses fully homomorphic encryption (FHE) and Cartesian-join of Bloom filters (CBF) as proposed by Wang et al. The protocol obtains information on the existence of a particular set of elements without learning about the residing source. To the best of our knowledge, our protocol, by using the FHE and CBF matrix, is a novel approach to ensuring the security of outsourced set union operations.
AB - In the era of big data and cloud computing, outsourcing data storage to the cloud poses the risk of its abuse or leakage. Thus, we address the problem of delegating computation on outsourced private datasets while maintaining privacy. In this study, we consider a scenario involving two data owners outsourcing their datasets to a cloud service. The cloud performs a set union computation, after which the querier sends a query to obtain information from both datasets. We propose a protocol that uses fully homomorphic encryption (FHE) and Cartesian-join of Bloom filters (CBF) as proposed by Wang et al. The protocol obtains information on the existence of a particular set of elements without learning about the residing source. To the best of our knowledge, our protocol, by using the FHE and CBF matrix, is a novel approach to ensuring the security of outsourced set union operations.
KW - Bloom filter
KW - Cartesian-join of Bloom filter matrix
KW - Outsourced private set union
KW - Query processing
UR - http://www.scopus.com/inward/record.url?scp=85123040170&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85123040170&partnerID=8YFLogxK
U2 - 10.1145/3366030.3366059
DO - 10.1145/3366030.3366059
M3 - Conference contribution
AN - SCOPUS:85123040170
T3 - ACM International Conference Proceeding Series
BT - 21st International Conference on Information Integration and Web-Based Applications and Services, iiWAS 2019 - Proceedings
A2 - Indrawan-Santiago, Maria
A2 - Pardede, Eric
A2 - Salvadori, Ivan Luiz
A2 - Steinbauer, Matthias
A2 - Khalil, Ismail
A2 - Anderst-Kotsis, Gabriele
PB - Association for Computing Machinery
T2 - 21st International Conference on Information Integration and Web-Based Applications and Services, iiWAS 2019
Y2 - 2 December 2019 through 4 December 2019
ER -