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, Shuai Shang, Wenqi Zhang, Xiaofen Wang, Ke Huang, 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.
期刊介绍:
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.