Outsourced Private Set Intersection Cardinality with Fully Homomorphic Encryption

A. Tajima, Hiroki Sato, H. Yamana
{"title":"Outsourced Private Set Intersection Cardinality with Fully Homomorphic Encryption","authors":"A. Tajima, Hiroki Sato, H. Yamana","doi":"10.1109/ICMCS.2018.8525881","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":272255,"journal":{"name":"2018 6th International Conference on Multimedia Computing and Systems (ICMCS)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 6th International Conference on Multimedia Computing and Systems (ICMCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICMCS.2018.8525881","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

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.
具有完全同态加密的外包私有集交集基数
随着要分析的数据量的增加,云数据库服务已经引起了相当大的兴趣。然而,将数据管理委托给云服务会导致安全和隐私问题,因为云服务并不总是可信的。在本研究中,我们解决了在保持数据机密性的同时回答跨外包私有数据集的连接查询的问题。我们特别考虑这样一个场景:两个数据所有者各自拥有一组元素,查询程序要求云执行连接操作以获取两个数据集中公共元素的大小。为了在不向云泄露数据内容的情况下处理连接操作,我们提出了两个协议,一个是基本协议,一个是查询友好协议,这两个协议采用了外包私有集交集基数(OPSI-CA)的功能,具有完全同态加密(FHE)和bloom过滤器。对查询程序友好的协议减少了查询程序的通信和计算成本。我们的实验结果表明,在两个各有100个元素的数据集上执行连接查询,基本协议需要436秒,查询友好协议需要298秒。本研究的新颖之处在于,我们的协议是采用FHE的外包连接操作的第一种方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信