{"title":"Verifiable Cloud-Assisted Multi-Party Private Set Intersection Cardinality","authors":"Gongli Li, Weichen Liu, Lu Li","doi":"10.1002/cpe.70126","DOIUrl":null,"url":null,"abstract":"<div>\n \n <p>Private Set Intersection Cardinality (PSI-CA) is a privacy-preserving method designed to compute the size of the intersection between two or more sets without revealing any additional information. In scenarios that require extensive computational resources, outsourcing tasks to cloud servers has emerged as a common solution. Nevertheless, the malicious behavior of cloud servers may lead to incorrect results and pose challenges for clients when verifying correctness. First, for clients with limited computational capabilities, a cloud-assisted multi-party PSI-CA (CMPSI-CA) is introduced, which stores the elements generated by the pseudorandom function generator in a Bloom filter and masks them using the Oblivious Distributed Key PRF (Odk-PRF). Furthermore, to protect against possible malicious behavior of cloud servers, the verifiable cloud-assisted multi-party PSI-CA (VCMPSI-CA) is proposed, leveraging the dual functions with the XOR homomorphic property. When the set size is <span></span><math>\n <semantics>\n <mrow>\n <msup>\n <mrow>\n <mn>2</mn>\n </mrow>\n <mrow>\n <mn>18</mn>\n </mrow>\n </msup>\n </mrow>\n <annotation>$$ {2}^{18} $$</annotation>\n </semantics></math> and there are 32 participants, both protocols can be completed in 23.99 and 58.62 s, respectively.</p>\n </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"37 12-14","pages":""},"PeriodicalIF":1.5000,"publicationDate":"2025-05-16","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.70126","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
Private Set Intersection Cardinality (PSI-CA) is a privacy-preserving method designed to compute the size of the intersection between two or more sets without revealing any additional information. In scenarios that require extensive computational resources, outsourcing tasks to cloud servers has emerged as a common solution. Nevertheless, the malicious behavior of cloud servers may lead to incorrect results and pose challenges for clients when verifying correctness. First, for clients with limited computational capabilities, a cloud-assisted multi-party PSI-CA (CMPSI-CA) is introduced, which stores the elements generated by the pseudorandom function generator in a Bloom filter and masks them using the Oblivious Distributed Key PRF (Odk-PRF). Furthermore, to protect against possible malicious behavior of cloud servers, the verifiable cloud-assisted multi-party PSI-CA (VCMPSI-CA) is proposed, leveraging the dual functions with the XOR homomorphic property. When the set size is and there are 32 participants, both protocols can be completed in 23.99 and 58.62 s, respectively.
期刊介绍:
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.