Advancements in Private Set Union: Protocols, Security Frameworks, and Applications

Authors

  • Zihan Lin
  • Jingyan Wang
  • Shuaiqi Xu

DOI:

https://doi.org/10.54097/bg91vt52

Keywords:

Private Set Union, Data Privacy, Computational Diffie-Hellman, Security Models

Abstract

Private Set Union (PSU), a subset of Private Set Intersection (PSI) methodologies, is swiftly marking its importance in an era that progressively values computational integrity without infringing data privacy. This necessity sprouted from the intricate balance between ensuring rigorous privacy protection and fostering beneficial data sharing. PSU enables multiple entities to establish a union of their individual datasets without revealing their private information to each other. The foundational security models that drive PSU are both intricate and robust, with roots tracing back to the Computational Diffie-Hellman problems. These problems address the challenges of ensuring secure computations in multi-party scenarios. Attack strategies targeting PSU have evolved over time, leading to an enhancement in the defense mechanisms. Techniques utilizing encryption, randomization, and other cryptographic methods have seen consistent improvement, making privacy-preserved inter-party data analytics both feasible and efficient. Recent breakthroughs in PSU protocols have seen rigorous evaluations based on efficiency, security, and performance metrics. These evaluations aim to determine how these protocols fare under real-world conditions and what challenges they might encounter. Additionally, PSU’s adaptability and relevance have been showcased across various industries. Whether it's digital libraries collaborating for enriched content while preserving copyright restrictions, financial institutions aiming to analyze transaction patterns without compromising individual account details, risk assessment firms sharing data to provide better evaluations without revealing sensitive details, joint graph computations ensuring optimal routing without exposing network infrastructures, or the ever-growing Internet of Things (IoT) ecosystem maintaining device interoperability while upholding user privacy; PSU’s prominence is undeniable.

Downloads

Download data is not yet available.

References

Vladimir Kolesnikov, Mike Rosulek, Ni Trieu, and Xiaorui Sun. Scalable private set union from symmetric-key techniques. In International Conference on the Theory and Application of Cryptology and Information Security, pages 636–666, Cham, 2019. Springer International Publishing.

Gayathri Garimella, Payman Mohassel, Mike Rosulek, Saeed Sadeghian, and Jaspal Singh. Private set operations from oblivious switching. In IACR International Conference on Public-Key Cryptography, pages 591–617. Springer, 2021.

Yanxue Jia, Shufang Sun, Hui Shen Zhou, , et al. Shuffle-based private set union: Faster and more secure. In 31st USENIX Security Symposium (USENIX Security 22), pages 2947–2964, 2022.

Binbin Tu, Yanhong Chen, Qingju Liu, et al. Fast unbalanced private set union from fully homomorphic encryption. Cryptology ePrint Archive, 2022.

Cong Zhang, Yu Chen, Weiran Liu, Min Zhang, and Dongdai Lin. Linear private set union from multi-query reverse private membership test. Cryptology ePrint Archive, 2022.

Hui Pan. (2011). Research on user privacy of digital library and its implications for cloud computing services. Information Theory and Practice, 34(4), 4.

Dan Yanghe. (2015). Research on privacy issues based on similarity matching in mobile social networks. (Doctoral dissertation, Shanghai Jiao Tong University).

Wang Guosai, Li Yi, Chen Kun, Shi Shi, Yang Zuyan. (2022). Financial application of privacy computing technology. Financial Development Research (8), 31-37.

Chen JW. (2021). Private Computing Empowers Supply chain Finance. China Finance (24), 3.

Hogan, K., Luther, N., Schear, N., Shen, E., Stott, D., Yakoubov, S., & Yerukhimovich, A. (2016, November). Secure multiparty computation for cooperative cyber risk assessment. In 2016 IEEE Cybersecurity Development (SecDev) (pp. 75-76). IEEE.

Ramanathan, S., Mirkovic, J., & Yu, M. (2020, January). Blag: Improving the accuracy of blacklists. In NDSS.

Brickell, J., & Shmatikov, V. (2005). Privacy-preserving graph algorithms in the semi-honest model. In Advances in Cryptology-ASIACRYPT 2005: 11th International Conference on the Theory and Application of Cryptology and Information Security, Chennai, India, December 4-8, 2005. Proceedings 11 (pp. 236-252). Springer Berlin Heidelberg.

Zhou, Q., Zeng, Z., Wang, K., & Chen, M. (2022). Privacy Protection Scheme for the Internet of Vehicles Based on Private Set Intersection. Cryptography, 6(4), 64.

Zhang, L., Gao, W., Chen, S., Ren, W., Choo, K. K. R., & Xiong, N. N. (2021). A Privacy-Preserving Proximity Testing Using Private Set Intersection for Vehicular Ad-Hoc Networks. IEEE Transactions on Industrial Informatics, 18(10), 7373-7383.

Downloads

Published

13-03-2024

How to Cite

Lin, Z., Wang, J., & Xu, S. (2024). Advancements in Private Set Union: Protocols, Security Frameworks, and Applications. Highlights in Science, Engineering and Technology, 85, 191-195. https://doi.org/10.54097/bg91vt52