Practical Private Set Operation via Secret Sharing for Lightweight Clients
IEEE Transactions on Information Forensics and Security · 2026 · 21 · 4090-4105
DOI: 10.1109/tifs.2026.3684841 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Transactions on Information Forensics and Security, 2026. Verfasst von Ziyu Niu und 5 weiteren Autor:innen. Die Arbeit nennt 66 Literaturangaben. Gefördert von: National Natural Science Foundation of China, Natural Science Foundation of Shandong Province, Australian Research Council Australian Laureate Fellowship.
Abstract (Originalsprache)
The rapid growth of sensitive cross-domain data, such as electronic health records and genomic sequences in healthcare, presents significant opportunities for large-scale, multi-institutional collaborative analysis. Meeting stringent privacy regulations while utilizing data has become a critical challenge. Private set operations (PSO) play a crucial role to address this challenge. PSO protocols enable privacy-preserving data alignment across parties (such as interinstitutional data matching based on private set intersection (PSI)) and secure data aggregation (such as federated data aggregation through private set union (PSU)), providing fundamental support for cross-domain data collaboration. This type of technology is not only applicable to multi-center medical research but also has broad value in other scenarios requiring confidential data sharing. However, existing delegated/outsourced PSO schemes face two key limitations: 1) high client-side preprocessing overhead, requiring clients to expensively mask private data before uploading; 2) performance and single-point dependency bottlenecks in client-assisted computation where one client must act as a computational leader. To address these issues, we propose a secret-shared PSO framework for lightweight clients. In our scheme, the clients can go offline while servers perform all computations, significantly reducing clients’ burden. Notably, our protocol can be extended to support multi-party settings, making it well-suited for collaborative research across multiple institutions. In addition, we prove the security of all constructions under the semi-honest model. Experiments show that when the set size $n \geq 2^{16}$ , our protocol has a significant advantage and is well-suited for lightweight client that holds a large set.
Förderung
- National Natural Science Foundation of China
- Natural Science Foundation of Shandong Province
- Australian Research Council Australian Laureate Fellowship
- China Scholarship Council
- Young Talent of Lifting Engineering for Science and Technology in Shandong, China
- Shandong Normal University (SDNU) Young Academic Elites Development Program
- Shandong Province Technology-Based Small and Medium-Sized Enterprises (SME) Innovation Capacity Improvement Project
- Australian Research Council (ARC) Laureate Fellowship
Zitieren
APA
Niu, Z., Zhang, Y., Li, Y., Susilo, W., Su, Y., & Wang, H. (2026). Practical Private Set Operation via Secret Sharing for Lightweight Clients. IEEE Transactions on Information Forensics and Security, 21, 4090-4105. https://doi.org/10.1109/tifs.2026.3684841
Vancouver
Niu Z, Zhang Y, Li Y, Susilo W, Su Y, Wang H. Practical Private Set Operation via Secret Sharing for Lightweight Clients. IEEE Transactions on Information Forensics and Security. 2026;21:4090-4105. doi:10.1109/tifs.2026.3684841
BibTeX
@article{Niu2026,
author = {Niu, Ziyu and Zhang, Yudi and Li, Yumei and Susilo, Willy and Su, Ye and Wang, Hao},
title = {Practical Private Set Operation via Secret Sharing for Lightweight Clients},
journal = {IEEE Transactions on Information Forensics and Security},
year = {2026},
volume = {21},
pages = {4090--4105},
doi = {10.1109/tifs.2026.3684841}
}
EUVIMED