A STUDY ON SECURE PRIVATE SET UNION SCHEME IN IOT ENVIRONMENT
DOI:
https://doi.org/10.20319/stra.2025.5666Keywords:
Data Privacy, Third Party, Private Set Union, Random Oblivious Transfer, Multi-Key EncryptionAbstract
In the IOT environment, network edges have data, but a centralized server may need to obtain the union from edges for efficient data access. PSU is a cryptographic primitive that allows protocol parties to compute the union of their private datasets without revealing any extra information. Traditional PSU protocols presuppose that all parties must input their private datasets. This assumption doesn’t hold in some scenarios where an inputless Third party needs to get the union. For instance, a regulatory organization may need to get the union of patient data from hospitals for statistical analysis, without inputting any dataset. We propose a novel TP-PSU, specifically designed for a setting with three parties and an inputless Third party. Our protocol enables the Third party to compute the union, while preventing the leakage of any other extra information. This includes protecting the origin and duplication of each data item across edge nodes, thus maintaining privacy in the IoT environment.
References
Dong, M., Chen, Y., Zhang, C., & Bai, Y. (2024). Breaking free: Efficient multi-party private set union without non-collusion assumptions. arXiv preprint arXiv:2406.07011.
Gao, J., Nguyen, S., & Trieu, N. (2023). Toward A practical multi-party private set union. Cryptology ePrint Archive.
Jia, Y., Sun, S. F., Zhou, H. S., & Gu, D. (2024). Scalable private set union, with stronger security. In 33rd USENIX Security Symposium (USENIX Security 24) (pp. 6471-6488).
Jia, Y., Sun, S. F., Zhou, H. S., Du, J., & Gu, D. (2022). Shuffle-based private set union: Faster and more secure. In 31st USENIX Security Symposium (USENIX Security 22) (pp. 2947-2964).
Kolesnikov, V., Rosulek, M., Trieu, N., & Wang, X. (2019, November). Scalable private set union from symmetric-key techniques. In International conference on the theory and application of cryptology and information security (pp. 636-666). Cham: Springer International Publishing.
Liu, X., & Gao, Y. (2023, December). Scalable multi-party private set union from multi-query secret-shared private membership test. In International conference on the theory and application of cryptology and information security (pp. 237-271). Singapore: Springer Nature Singapore.
Nguyen, D. T., & Trieu, N. (2022). MPCCache: Privacy-preserving multi-party cooperative cache sharing at the edge. In International Conference on Financial Cryptography and Data Security (pp. 80–99). Cham: Springer International Publishing.
Pinkas, B., Schneider, T., Tkachenko, O., & Yanai, A. (2019). Efficient circuit-based PSI with linear communication. In Advances in Cryptology–EUROCRYPT 2019: 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Darmstadt, Germany, May 19–23, 2019, Proceedings, Part III 38 (pp. 122-153). Springer International Publishing.
Rabin, M. O. (2005). How to exchange secrets with oblivious transfer. Cryptology ePrint Archive.
Zhang, C., Chen, Y., Liu, W., Zhang, M., & Lin, D. (2022). Optimal Private Set Union from Multi-Query Reverse Private Membership Test. IACR Cryptol. ePrint Arch., 2022, 358.
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Copyright of Published Articles
Author(s) retain the article copyright and publishing rights without any restrictions.
All published work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
