{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T21:22:30Z","timestamp":1768512150796,"version":"3.49.0"},"reference-count":34,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T00:00:00Z","timestamp":1768003200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers"],"abstract":"<jats:p>Private Set Intersection (PSI) is a fundamental cryptographic primitive in privacy-preserving computation and has been widely applied in federated learning, secure data sharing, and privacy-aware data analytics. However, most existing PSI protocols rely on RSA or standard elliptic curve cryptography, which limits their applicability in scenarios requiring domestic cryptographic standards and often leads to high computational and communication overhead when processing large-scale datasets. In this paper, we propose a novel PSI protocol based on the Chinese commercial cryptographic standard SM2, referred to as SM2-OT-PSI. The proposed scheme constructs an oblivious transfer-based Oblivious Pseudorandom Function (OPRF) using SM2 public-key cryptography and the SM3 hash function, enabling efficient multi-point OPRF evaluation under the semi-honest adversary model. A formal security analysis demonstrates that the protocol satisfies privacy and correctness guarantees assuming the hardness of the Elliptic Curve Discrete Logarithm Problem. To further improve practical performance, we design a software\u2013hardware co-design architecture that offloads SM2 scalar multiplication and SM3 hashing operations to a domestic reconfigurable cryptographic accelerator (RSP S20G). Experimental results show that, for datasets with up to millions of elements, the presented protocol significantly outperforms several representative PSI schemes in terms of execution time and communication efficiency, especially in medium and high-bandwidth network environments. The proposed SM2-OT-PSI protocol provides a practical and efficient solution for large-scale privacy-preserving set intersection under national cryptographic standards, making it suitable for deployment in real-world secure computing systems.<\/jats:p>","DOI":"10.3390\/computers15010044","type":"journal-article","created":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T08:20:37Z","timestamp":1768206037000},"page":"44","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Privacy-Preserving Set Intersection Protocol Based on SM2 Oblivious Transfer"],"prefix":"10.3390","volume":"15","author":[{"given":"Zhibo","family":"Guan","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, Harbin University of Science and Technology, Harbin 150080, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2416-630X","authenticated-orcid":false,"given":"Hai","family":"Huang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Harbin University of Science and Technology, Harbin 150080, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haibo","family":"Yao","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Harbin University of Science and Technology, Harbin 150080, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiong","family":"Jia","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Harbin University of Science and Technology, Harbin 150080, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kai","family":"Cheng","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Harbin University of Science and Technology, Harbin 150080, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mengmeng","family":"Ge","sequence":"additional","affiliation":[{"name":"College of Computing and Data Science, Nanyang Technological University, 50 Nanyang Avenue, Singapore 639798, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2920-7868","authenticated-orcid":false,"given":"Bin","family":"Yu","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Harbin University of Science and Technology, Harbin 150080, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chao","family":"Ma","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Harbin University of Science and Technology, Harbin 150080, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2026,1,10]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1016\/j.ins.2018.10.024","article-title":"Secure multi-party computation: Theory, practice and applications","volume":"476","author":"Zhao","year":"2019","journal-title":"Inf. Sci."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"3479","DOI":"10.1109\/TIFS.2022.3207911","article-title":"Differentially private set intersection for asymmetrical id alignment","volume":"17","author":"He","year":"2022","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"ref_3","first-page":"3419","article-title":"A Privacy-preserving Data Alignment Framework for Vertical Federated Learning","volume":"46","author":"Gao","year":"2024","journal-title":"J. Electron. Inf. Technol."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Brickell, J., Porter, D.E., Shmatikov, V., and Witchel, E. (2007, January 29\u201331). Privacy-preserving remote diagnostics. Proceedings of the 14th ACM Conference on Computer and Communications Security, Alexandria, VA, USA.","DOI":"10.1145\/1315245.1315307"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"He, X., Machanavajjhala, A., Flynn, C., and Srivastava, D. (November, January 30). Composing differential privacy and secure computation: A case study on scaling private record linkage. Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, Dallas, TX, USA.","DOI":"10.1145\/3133956.3134030"},{"key":"ref_6","unstructured":"Ion, M., Kreuter, B., Nergiz, E., Patel, S., Saxena, S., Seth, K., Shanahan, D., and Yung, M. (2025, December 17). Private Intersection-Sum Protocol with Applications to Attributing Aggregate ad Conversions. Cryptology ePrint Archive, Paper 2017\/738. Available online: https:\/\/eprint.iacr.org\/2017\/738."},{"key":"ref_7","unstructured":"(2016). Information Security Technology\u2014Public Key Cryptographic Algorithm SM2 Based on Elliptic Curves\u2014Part 4: Public Key Encryption Algorithm (Standard No. GB\/T 32918.4-2016)."},{"key":"ref_8","unstructured":"(2016). Information Security Techniques\u2014SM3 Cryptographic Hash Algorithm (Standard No. GB\/T 32905-2016)."},{"key":"ref_9","unstructured":"Kales, D., Rechberger, C., Schneider, T., Senker, M., and Weinert, C. (2019, January 14\u201316). Mobile private contact discovery at scale. Proceedings of the 28th USENIX Security Symposium (USENIX Security 19), Santa Clara, CA, USA. Available online: https:\/\/www.usenix.org\/conference\/usenixsecurity19\/presentation\/kales."},{"key":"ref_10","unstructured":"Huang, Y., Evans, D., and Katz, J. (2012, January 5\u20138). Private set intersection: Are garbled circuits better than custom protocols?. Proceedings of the 19th Network and Distributed System Security Symposium (NDSS 2012), San Diego, CA, USA."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Kiss, \u00c1., Liu, J., Schneider, T., Asokan, N., and Pinkas, B. (2017, January 19\u201321). Private set intersection for unequal set sizes with mobile applications. Proceedings of the Privacy Enhancing Technologies Symposium (PoPETS 2017), Munich, Germany.","DOI":"10.1515\/popets-2017-0044"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Pinkas, B., Schneider, T., Tkachenko, O., and Yanai, A. (2019, January 19\u201323). Efficient circuit-based PSI with linear communication. Proceedings of the Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT 2019), Darmstadt, Germany.","DOI":"10.1007\/978-3-030-17659-4_5"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Meadows, C. (1986, January 27\u201329). A more efficient cryptographic matchmaking protocol for use in the absence of a continuously available third party. Proceedings of the 1986 IEEE Symposium on Security and Privacy (S & P 1986), Toronto, ON, Canada.","DOI":"10.1109\/SP.1986.10022"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3603114","article-title":"Topgun: An ECC accelerator for private set intersection","volume":"16","author":"Wu","year":"2023","journal-title":"ACM Trans. Reconfigurable Technol. Syst."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Hazay, C., and Nissim, K. (2010, January 28\u201330). Efficient set operations in the presence of malicious adversaries. Proceedings of the International Workshop on Public Key Cryptography (PKC 2010), Paris, France.","DOI":"10.1007\/978-3-642-13013-7_19"},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"De Cristofaro, E., and Tsudik, G. (2010, January 22\u201326). Practical private set intersection protocols with linear complexity. Proceedings of the International Conference on Financial Cryptography and Data Security (FC 2010), Bridgetown, Barbados.","DOI":"10.1007\/978-3-642-14577-3_13"},{"key":"ref_17","unstructured":"Zhang, J.X., Cheng, X.D., Wang, W., Yang, L., Hu, J.B., and Chen, K. (2023, January 25\u201328). {FLASH}: Towards a high-performance hardware acceleration architecture for cross-silo federated learning. Proceedings of the 20th USENIX Symposium on Networked Systems Design and Implementation (NSDI 23), Boston, MA, USA. Available online: https:\/\/www.usenix.org\/conference\/nsdi23\/presentation\/zhang-junxue."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/0022-0000(83)90042-9","article-title":"Transaction protection by beacons","volume":"27","author":"Rabin","year":"1983","journal-title":"J. Comput. Syst. Sci."},{"key":"ref_19","unstructured":"Pinkas, B., Schneider, T., and Zohner, M. (2014, January 20\u201322). Faster private set intersection based on OT extension. Proceedings of the 23rd USENIX Security Symposium (USENIX Security 14), San Diego, CA, USA. Available online: https:\/\/www.usenix.org\/conference\/usenixsecurity14\/technical-sessions\/presentation\/pinkas."},{"key":"ref_20","unstructured":"Pinkas, B., Schneider, T., Segev, G., and Zohner, M. (2015, January 12\u201314). Phasing: Private set intersection using permutation-based hashing. Proceedings of the 24th USENIX Security Symposium (USENIX Security 15), Washington, DC, USA. Available online: https:\/\/www.usenix.org\/conference\/usenixsecurity15\/technical-sessions\/presentation\/pinkas."},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Garimella, G., Mohassel, P., Rosulek, M., Sadeghian, S., and Singh, J. (2021, January 17\u201320). Private set operations from oblivious switching. Proceedings of the IACR International Conference on Public Key Cryptography (PKC 2021), Virtual Event.","DOI":"10.1007\/978-3-030-75248-4_21"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Kolesnikov, V., Kumaresan, R., Rosulek, M., and Trieu, N. (2016, January 24\u201328). Efficient batched oblivious PRF with applications to private set intersection. Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security (CCS 2016), Vienna, Austria.","DOI":"10.1145\/2976749.2978381"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Pinkas, B., Rosulek, M., Trieu, N., and Yanai, A. (2019, January 18\u201322). SpOT-light: Lightweight private set intersection from sparse OT extension. Proceedings of the Annual International Cryptology Conference (CRYPTO 2019), Santa Barbara, CA, USA. Available online: https:\/\/link.springer.com\/chapter\/10.1007\/978-3-030-26954-8_13.","DOI":"10.1007\/978-3-030-26954-8_13"},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Pinkas, B., Rosulek, M., Trieu, N., and Yanai, A. (2020, January 10\u201314). PSI from PaXoS: Fast, malicious private set intersection. Proceedings of the Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT 2020), Zagreb, Croatia. Available online: https:\/\/link.springer.com\/chapter\/10.1007\/978-3-030-45724-2_25.","DOI":"10.1007\/978-3-030-45724-2_25"},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Chase, M., and Miao, P. (2020, January 17\u201321). Private set intersection in the internet setting from lightweight oblivious PRF. Proceedings of the Annual International Cryptology Conference (CRYPTO 2020), Santa Barbara, CA, USA. Available online: https:\/\/link.springer.com\/chapter\/10.1007\/978-3-030-56877-1_2.","DOI":"10.1007\/978-3-030-56877-1_2"},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Resende, A.C.D., and Aranha, D.F. (2018, January 19\u201323). Faster unbalanced private set intersection. Proceedings of the International Conference on Financial Cryptography and Data Security (FC 2018), Bridgetown, Barbados. Available online: https:\/\/link.springer.com\/chapter\/10.1007\/978-3-662-58387-6_11.","DOI":"10.1007\/978-3-662-58387-6_11"},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Yao, A.C. (1982, January 25\u201327). Protocols for secure computations. Proceedings of the 23rd Annual Symposium on Foundations of Computer Science (SFCS 1982), Chicago, IL, USA.","DOI":"10.1109\/SFCS.1982.38"},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., and Wigderson, A. (2019). How to play any mental game, or a completeness theorem for protocols with honest majority. Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali, ACM.","DOI":"10.1145\/3335741.3335759"},{"key":"ref_29","first-page":"1821","article-title":"High-performance hardware architecture design and implementation of Ed25519 algorithm","volume":"43","author":"Yu","year":"2021","journal-title":"J. Electron. Inf. Technol."},{"key":"ref_30","first-page":"344","article-title":"Design of high area efficiency elliptic curve scalar multiplier based on fast modulo reduction of bit reorganization","volume":"46","author":"Liu","year":"2024","journal-title":"J. Electron. Inf. Technol."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TIFS.2021.3118879","article-title":"Practical multi-party private set intersection protocols","volume":"17","author":"Bay","year":"2021","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"53881","DOI":"10.1109\/ACCESS.2024.3388992","article-title":"Secure multi-party computation for machine learning: A survey","volume":"12","author":"Zhou","year":"2024","journal-title":"IEEE Access"},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Gao, Y., Luo, Y., Wang, L., Liu, X., Qi, L., Wang, W., and Zhou, M. (2024, January 14\u201318). Efficient scalable multi-party private set intersection (-Variants) from bicentric zero-sharing. Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, Salt Lake City, UT, USA.","DOI":"10.1145\/3658644.3690245"},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kilian, J., Nissim, K., and Petrank, E. (2003, January 17\u201321). Extending oblivious transfers efficiently. Proceedings of the Annual International Cryptology Conference (CRYPTO 2003), Santa Barbara, CA, USA.","DOI":"10.1007\/978-3-540-45146-4_9"}],"container-title":["Computers"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-431X\/15\/1\/44\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T06:40:33Z","timestamp":1768459233000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-431X\/15\/1\/44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,10]]},"references-count":34,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,1]]}},"alternative-id":["computers15010044"],"URL":"https:\/\/doi.org\/10.3390\/computers15010044","relation":{},"ISSN":["2073-431X"],"issn-type":[{"value":"2073-431X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,10]]}}}