mPSI: Many-to-one Private Set Intersection

Keji Hu, Wensheng Zhang
{"title":"mPSI: Many-to-one Private Set Intersection","authors":"Keji Hu, Wensheng Zhang","doi":"10.1109/CSCloud.2017.35","DOIUrl":null,"url":null,"abstract":"In this paper, we first define a new security problem, named mPSI (many-to-one private set interaction), which can find applications in many scenarios where the host of a big database may be queried by a large number of clients who have small-size queries and want to prevent both the intentions and results of their queries from being exposed to others. We also propose a new scheme to solve the mPSI problem. The scheme extends the state-of-the-art oblivious transfer-based one-to-one PSI schemes, but also embeds the innovative ideas of (1) leveraging the collaborations between clients to achieve high computational and communication efficiency, and (2) relying on server-aided secret encryption to hide each client's private information from being exposed to either the server or any other client. Extensive theoretical analysis and experiments have been conducted to evaluate the proposed scheme and compare the scheme with the state of the art, and the results verify the security and efficiency of our proposed scheme.","PeriodicalId":436299,"journal":{"name":"2017 IEEE 4th International Conference on Cyber Security and Cloud Computing (CSCloud)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE 4th International Conference on Cyber Security and Cloud Computing (CSCloud)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSCloud.2017.35","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, we first define a new security problem, named mPSI (many-to-one private set interaction), which can find applications in many scenarios where the host of a big database may be queried by a large number of clients who have small-size queries and want to prevent both the intentions and results of their queries from being exposed to others. We also propose a new scheme to solve the mPSI problem. The scheme extends the state-of-the-art oblivious transfer-based one-to-one PSI schemes, but also embeds the innovative ideas of (1) leveraging the collaborations between clients to achieve high computational and communication efficiency, and (2) relying on server-aided secret encryption to hide each client's private information from being exposed to either the server or any other client. Extensive theoretical analysis and experiments have been conducted to evaluate the proposed scheme and compare the scheme with the state of the art, and the results verify the security and efficiency of our proposed scheme.
mPSI:多对一私有集合交集
在本文中,我们首先定义了一个新的安全问题,称为mPSI(多对一私有集交互),它可以在许多场景中找到应用程序,在这些场景中,大型数据库的主机可能被大量具有小型查询的客户端查询,并且希望防止其查询的意图和结果被暴露给其他人。我们还提出了一种解决mPSI问题的新方案。该方案扩展了最先进的基于不经意传输的一对一PSI方案,但也嵌入了以下创新思想:(1)利用客户端之间的协作来实现高计算和通信效率;(2)依靠服务器辅助的秘密加密来隐藏每个客户端的私有信息,使其不会暴露给服务器或任何其他客户端。进行了大量的理论分析和实验,对所提出的方案进行了评价,并与目前的方案进行了比较,结果验证了所提出方案的安全性和有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信