Vupsi: Verifiable Unbalanced Private Set Intersection Based on Homomorphic Encryption

IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING
Ruirui Gao, Shuai Shang, Wenqi Zhang, Xiaofen Wang, Ke Huang, Xiong Li
{"title":"Vupsi: Verifiable Unbalanced Private Set Intersection Based on Homomorphic Encryption","authors":"Ruirui Gao,&nbsp;Shuai Shang,&nbsp;Wenqi Zhang,&nbsp;Xiaofen Wang,&nbsp;Ke Huang,&nbsp;Xiong Li","doi":"10.1002/cpe.70122","DOIUrl":null,"url":null,"abstract":"<div>\n \n <p>Unbalanced private set intersection (UPSI), a cryptographic technique for securely computing set intersections in asymmetrical setups while preserving privacy, has been extensively studied. However, existing protocols often require clients with small sets to participate in computations, are highly interactive, and lack result verifiability. In this paper, we propose VuPSI, a verifiable unbalanced PSI scheme designed to overcome the limitations of existing protocols. VuPSI offloads the computational burden to the server, reducing client-side processing and simplifying the overall workflow. In addition, VuPSI incorporates an efficient zero-knowledge verification mechanism that allows clients to efficiently verify the correctness of intersection results with minimal computational overhead. This approach significantly improves the reliability of PSI outcomes. Our design implements a low-interaction protocol that ensures scalability and efficiency, especially for large-scale dynamic datasets. Experimental evaluations show that VuPSI is both efficient and practical. Specifically, VuPSI can process 1,024 client-side items and 1,000,000 server-side items within seconds using 32 threads, achieving 40×  the communication efficiency of comparable protocols such as DiPSI. Its lower computational overhead and faster data preprocessing make it well-suited for real-time, dynamic server environments.</p>\n </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"37 12-14","pages":""},"PeriodicalIF":1.5000,"publicationDate":"2025-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Concurrency and Computation-Practice & Experience","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/cpe.70122","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

Abstract

Unbalanced private set intersection (UPSI), a cryptographic technique for securely computing set intersections in asymmetrical setups while preserving privacy, has been extensively studied. However, existing protocols often require clients with small sets to participate in computations, are highly interactive, and lack result verifiability. In this paper, we propose VuPSI, a verifiable unbalanced PSI scheme designed to overcome the limitations of existing protocols. VuPSI offloads the computational burden to the server, reducing client-side processing and simplifying the overall workflow. In addition, VuPSI incorporates an efficient zero-knowledge verification mechanism that allows clients to efficiently verify the correctness of intersection results with minimal computational overhead. This approach significantly improves the reliability of PSI outcomes. Our design implements a low-interaction protocol that ensures scalability and efficiency, especially for large-scale dynamic datasets. Experimental evaluations show that VuPSI is both efficient and practical. Specifically, VuPSI can process 1,024 client-side items and 1,000,000 server-side items within seconds using 32 threads, achieving 40×  the communication efficiency of comparable protocols such as DiPSI. Its lower computational overhead and faster data preprocessing make it well-suited for real-time, dynamic server environments.

Vupsi:基于同态加密的可验证不平衡私有集交集
不平衡私有集交集(UPSI)是一种在不对称设置下安全计算集交集的加密技术,目前已得到广泛的研究。然而,现有的协议通常需要具有小集的客户端参与计算,具有高度的交互性,并且缺乏结果的可验证性。在本文中,我们提出了VuPSI,一种可验证的非平衡PSI方案,旨在克服现有协议的局限性。VuPSI将计算负担转移到服务器,减少了客户端处理并简化了整个工作流程。此外,VuPSI集成了一个高效的零知识验证机制,允许客户端以最小的计算开销有效地验证交叉结果的正确性。这种方法显著提高了PSI结果的可靠性。我们的设计实现了一个低交互协议,确保了可扩展性和效率,特别是对于大规模动态数据集。实验结果表明,VuPSI是一种高效实用的方法。具体来说,VuPSI可以使用32个线程在几秒钟内处理1,024个客户端项目和1,000,000个服务器端项目,实现了DiPSI等可比协议的40倍通信效率。其较低的计算开销和更快的数据预处理使其非常适合实时、动态的服务器环境。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Concurrency and Computation-Practice & Experience
Concurrency and Computation-Practice & Experience 工程技术-计算机:理论方法
CiteScore
5.00
自引率
10.00%
发文量
664
审稿时长
9.6 months
期刊介绍: Concurrency and Computation: Practice and Experience (CCPE) publishes high-quality, original research papers, and authoritative research review papers, in the overlapping fields of: Parallel and distributed computing; High-performance computing; Computational and data science; Artificial intelligence and machine learning; Big data applications, algorithms, and systems; Network science; Ontologies and semantics; Security and privacy; Cloud/edge/fog computing; Green computing; and Quantum computing.
×
引用
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学术官方微信