{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:31:08Z","timestamp":1772119868097,"version":"3.50.1"},"reference-count":44,"publisher":"MDPI AG","issue":"6","license":[{"start":{"date-parts":[[2024,6,7]],"date-time":"2024-06-07T00:00:00Z","timestamp":1717718400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Guangdong Key Laboratory of Data Security and Privacy Preserving","award":["2023B1212060036"],"award-info":[{"award-number":["2023B1212060036"]}]},{"name":"Guangdong Key Laboratory of Data Security and Privacy Preserving","award":["62272199"],"award-info":[{"award-number":["62272199"]}]},{"name":"National Natural Science Foundation of China","award":["2023B1212060036"],"award-info":[{"award-number":["2023B1212060036"]}]},{"name":"National Natural Science Foundation of China","award":["62272199"],"award-info":[{"award-number":["62272199"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Future Internet"],"abstract":"<jats:p>Private Set Intersection Cardinality (PSI-CA) is a cryptographic method in secure multi-party computation that allows entities to identify the cardinality of the intersection without revealing their private data. Traditional approaches assume similar-sized datasets and equal computational power, overlooking practical imbalances. In real-world applications, dataset sizes and computational capacities often vary, particularly in Internet of Things and mobile scenarios where device limitations restrict computational types. Traditional PSI-CA protocols are inefficient here, as computational and communication complexities correlate with the size of larger datasets. Thus, adapting PSI-CA protocols to these imbalances is crucial. This paper explores unbalanced scenarios where one party (the receiver) has a relatively small dataset and limited computational power, while the other party (the sender) has a large amount of data and strong computational capabilities.This paper, based on the concept of commutative encryption, introduces Cuckoo filter, cloud computing technology, and homomorphic encryption, among other technologies, to construct three novel solutions for unbalanced Private Set Intersection Cardinality (PSI-CA): an unbalanced PSI-CA protocol based on Cuckoo filter, an unbalanced PSI-CA protocol based on single-cloud assistance, and an unbalanced PSI-CA protocol based on dual-cloud assistance. Depending on performance and security requirements, different protocols can be employed for various applications.<\/jats:p>","DOI":"10.3390\/fi16060205","type":"journal-article","created":{"date-parts":[[2024,6,7]],"date-time":"2024-06-07T10:43:42Z","timestamp":1717757022000},"page":"205","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["Enhancing Efficiency and Security in Unbalanced PSI-CA Protocols through Cloud Computing and Homomorphic Encryption in Mobile Networks"],"prefix":"10.3390","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0431-7414","authenticated-orcid":false,"given":"Wuzheng","family":"Tan","sequence":"first","affiliation":[{"name":"College of Cyber Security, Jinan University, Guangzhou 510632, China"},{"name":"Guangdong Key Laboratory of Data Security and Privacy Preserving, Guangzhou 510632, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0960-7477","authenticated-orcid":false,"given":"Shenglong","family":"Du","sequence":"additional","affiliation":[{"name":"College of Cyber Security, Jinan University, Guangzhou 510632, China"},{"name":"Guangdong Key Laboratory of Data Security and Privacy Preserving, Guangzhou 510632, China"}]},{"given":"Jian","family":"Weng","sequence":"additional","affiliation":[{"name":"College of Cyber Security, Jinan University, Guangzhou 510632, China"},{"name":"Guangdong Key Laboratory of Data Security and Privacy Preserving, Guangzhou 510632, China"}]}],"member":"1968","published-online":{"date-parts":[[2024,6,7]]},"reference":[{"key":"ref_1","first-page":"7","article-title":"Efficient and secure testing of fully-sequenced human genomes","volume":"470","author":"Bald","year":"2000","journal-title":"Biol. Sci. Initiat."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Chen, H., Laine, K., and Rindal, P. (November, January 30). Fast private set intersection from homomorphic encryption. Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, Dallas, TX, USA.","DOI":"10.1145\/3133956.3134061"},{"key":"ref_3","unstructured":"Nagaraja, S., Mittal, P., Hong, C.Y., Caesar, M., and Borisov, N. (2010, January 11\u201313). {BotGrep}: Finding {P2P} Bots with Structured Graph Analysis. Proceedings of the 19th USENIX Security Symposium (USENIX Security 10), Washington, DC, USA."},{"key":"ref_4","first-page":"1782","article-title":"A Survey on Set Intersection Computation for Privacy Protection","volume":"59","author":"Li","year":"2022","journal-title":"J. Comput. Res. Dev."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Meadows, C. (1986, January 7\u20139). A More Efficient Cryptographic Matchmaking Protocol for Use in the Absence of a Continuously Available Third Party. Proceedings of the 7th IEEE Symposium on Security and Privacy, Oakland, CA, USA.","DOI":"10.1109\/SP.1986.10022"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Huberman, B., Franklin, M., and Hogg, T. (1999, January 3\u20135). Enhancing Privacy and Trust in Electronic Communities. Proceedings of the 1st ACM Conference on Electronic Commerce, Denver, CO, USA.","DOI":"10.1145\/336992.337012"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"DeCristofaro, E., and Tsudik, G. (2012, January 13\u201315). Experimenting with Fast Private Set Intersection. Proceedings of the International Conference on Trust and Trustworthy Computing, Vienna, Austria.","DOI":"10.1007\/978-3-642-30921-2_4"},{"key":"ref_8","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, San Diego, CA, USA."},{"key":"ref_9","unstructured":"Freedman, M., Nissim, K., and Pinkas, B. (2004, January 2\u20136). Efficient Private Matching and Set Intersection. Proceedings of the 23rd International Conference on the Theory and Applications of Cryptographic Techniques, Interlaken, Switzerland."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s00145-014-9190-0","article-title":"Efficient Set Intersection with Simulation-Based Security","volume":"29","author":"Freedman","year":"2016","journal-title":"J. Cryptol."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Abadi, A., Terzis, S., and Dong, C. (2015, January 26\u201328). O-PSI: Delegated Private Set Intersection on Outsourced Datasets. Proceedings of the 27th IFIP International Information Security and Privacy Conference, Hamburg, Germany.","DOI":"10.1007\/978-3-319-18467-8_1"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Kissner, L., and Song, D. (2005, January 14\u201318). Privacy-Preserving Set Operations. Proceedings of the 25th Annual International Cryptology Conference, Santa Barbara, CA, USA.","DOI":"10.21236\/ADA457144"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Jarecki, S., and Liu, X. Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection. LNCS 5444, Proceedings of the 6th Theory of Cryptography Conference, Francisco, CA, USA, 15\u201317 March 2009, Springer.","DOI":"10.1007\/978-3-642-00457-5_34"},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Hazay, C., and Venkitasubramaniam, M. (2017, January 28\u201331). Scalable Multi-party Private Set-Intersection. Proceedings of the 20th IACR International Workshop on Public Key Cryptography, Amsterdam, The Netherlands.","DOI":"10.1007\/978-3-662-54365-8_8"},{"key":"ref_15","first-page":"1397","article-title":"Efficient and Secure Calculation of Two-Party Sets in the Field of Rational Numbers","volume":"43","author":"Dou","year":"2020","journal-title":"Chin. J. Comput."},{"key":"ref_16","unstructured":"Name, E. (2012, January 19\u201323). Multiparty Computation from Somewhat Homomorphic Encryption. Proceedings of the 32nd Annual Cryptology Conference, Santa Barbara, CA, USA. Lecture Notes in Computer Science."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Yao, A.C. (1982, January 3\u20135). 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_18","doi-asserted-by":"crossref","unstructured":"Micali, S., Goldreich, O., and Wigderson, A. (1987, January 1). How to Play Any Mental Game. Proceedings of the 19th ACM Symposium on Theory of Computing, New York, NY, USA.","DOI":"10.1145\/28395.28420"},{"key":"ref_19","unstructured":"Pinkas, B., Schneider, T., Segev, G., and Zohner, M. (2015, January 12\u201314). Phasing: Privateset intersectionusing permutation-basedhashing. Proceedings of the 24th USENIX Security Symposium, USENIX Association, Washington, DC, USA."},{"key":"ref_20","unstructured":"Pinkas, B., Schneider, T., Weinert, C., and Wieder, U. (2019, January 19\u201323). Efficient circuit-based PSI via Cuckoo hashing. Proceedings of the 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Darmstadt, Germany."},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Pinkas, B., Schneider, T., Tkachenko, O., and Yanai, A. (2019, January 10\u201314). Efficient circuit-based PSI with linear communication. Proceedings of the 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia.","DOI":"10.1007\/978-3-030-17659-4_5"},{"key":"ref_22","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, San Diego, CA, USA."},{"key":"ref_23","unstructured":"Naor, M., and Pinkas, B. (2001, January 7\u20139). Efficient oblivious transfer protocols. Proceedings of the SODA, Washington, DC, USA."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Dong, C., Chen, L., and Wen, Z. (2013, January 4\u20138). When private-set intersection meets big data: An efficient and scalable protocol. Proceedings of the 2013 ACM SIGSAC Conference on Computer & Communications Security, Berlin, Germany.","DOI":"10.1145\/2508859.2516701"},{"key":"ref_25","unstructured":"Rindal, P., and Rosulek, M. (May, January 30). Improved private set intersection against malicious adversaries. Proceedings of the Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France."},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Zhang, E., Liu, F.H., Lai, Q., Jin, G., and Li, Y. (2019, January 11). Efficient multi-party private set intersection against malicious adversaries. Proceedings of the 2019 ACM SIGSAC Conference on Cloud Computing Security Workshop, London, UK.","DOI":"10.1145\/3338466.3358927"},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Pinkas, B., Rosulek, M., Trieu, N., and Yanai, A. (2019, January 10\u201314). PSIfrom PaXoS: Fast, malicious private set intersection. Proceedings of the 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia.","DOI":"10.1007\/978-3-030-45724-2_25"},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Orr\u00f9, M., Orsini, E., and Scholl, P. (2017, January 14\u201317). Actively secure 1-out-of-n OT extension with application to private set intersection. Proceedings of the Cryptographers\u2019 Track at the RSA Conference, San Francisco, CA, USA.","DOI":"10.1007\/978-3-319-52153-4_22"},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Rindal, P., and Schoppmann, P. (2024, April 28). VOLE-PSI: Fast OPRF and Circuit-PSI from Vector-OLE. IACR Cryptology ePrint Archive. Available online: https:\/\/eprint.iacr.org\/2021\/266.","DOI":"10.1007\/978-3-030-77886-6_31"},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Schoppmann, P., Gasc\u00f3n, A., Reichert, L., and Raykova, M. (2019, January 11\u201315). Distributed vector-OLE: Improved constructions and implementation. Proceedings of the 26th ACM SIGSAC Conference on Computer and Communications Security, London, UK.","DOI":"10.1145\/3319535.3363228"},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Weng, C., Yang, K., Katz, J., and Wang, X. (2024, April 28). Wolverine: Fast, Scalable, and Communication-Efficient Zero-Knowledge Proofs for Boolean and Arithmetic Circuits. Cryptology ePrint Archive. Available online: https:\/\/eprint.iacr.org\/2020\/925.","DOI":"10.1109\/SP40001.2021.00056"},{"key":"ref_32","first-page":"371","article-title":"Privately Computing Set-Union and Set-Intersection Cardinality via Bloom Filters","volume":"139","author":"Egert","year":"2015","journal-title":"Eur. J. Oper. Res."},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Ashok, V., and Mukkamala, R. (2014, January 14\u201316). A Scalable and Efficient Privacy Preserving Global Itemset Support Approximation Using Bloom Filters. Proceedings of the IFIP Conference on Data and Applications Security and Privacy, Vienna, Austria.","DOI":"10.1007\/978-3-662-43936-4_26"},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Debnath, S., and Dutta, R. (2015, January 9\u201311). Secure and Efficient Private Set Intersection Cardinality Using Bloom Filter. Proceedings of the International Information Security Conference, Trondheim, Norway.","DOI":"10.1007\/978-3-319-23318-5_12"},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"De Cristofaro, E., Gasti, P., and Tsudik, G. (2012, January 12\u201314). Fast and Private Computation of Cardinality of Set Intersection and Union. Proceedings of the CANS 2012, Darmstadt, Germany.","DOI":"10.1007\/978-3-642-35404-5_17"},{"key":"ref_36","doi-asserted-by":"crossref","unstructured":"Jarecki, S., and Liu, X. (2010, January 13\u201315). Fast Secure Computation of Set Intersection. Proceedings of the SCN 2010, Amalfi, Italy. Lecture Notes in Computer Science.","DOI":"10.1007\/978-3-642-15317-4_26"},{"key":"ref_37","first-page":"19","article-title":"A Survey on Secure Multi-party Computation Technology and Applications","volume":"45","author":"Su","year":"2019","journal-title":"Inf. Commun. Technol. Policy"},{"key":"ref_38","unstructured":"Li, A. (2017). Research on Multi-Party Statistical Computations Based on Functional Encryption. [Ph.D. Thesis, Wuhan University of Technology]."},{"key":"ref_39","first-page":"35","article-title":"A Survey of Filter Data Structures","volume":"51","author":"Wang","year":"2024","journal-title":"Comput. Sci."},{"key":"ref_40","doi-asserted-by":"crossref","unstructured":"Yu, M., Fabrikant, A., and Rexford, J. (2009, January 1\u20134). BUFFALO: Bloom filter forwarding architecture for large organizations. Proceedings of the International Conference on Emerging Networking Experiments and Technologies, Rome, Italy.","DOI":"10.1145\/1658939.1658975"},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1080\/17445760.2019.1599889","article-title":"Cluster-based distributed dynamic Cuckoo filter system for Redis","volume":"35","author":"Li","year":"2020","journal-title":"Int. J. Parallel Emergent Distrib. Syst."},{"key":"ref_42","doi-asserted-by":"crossref","unstructured":"Wang, F., Chen, H., Liao, L., Zhang, F., and Jin, H. (2019, January 7\u201310). The power of better choice: Reducing relocations in Cuckoo filter. Proceedings of the International Conference on Distributed Computing Systems, Dallas, TX, USA.","DOI":"10.1109\/ICDCS.2019.00043"},{"key":"ref_43","unstructured":"Gur, L., Lis, D., Dai, H., Wang, H., Luo, Y., Fan, B., Basat, R.B., Wang, K., Song, Z., and Chen, S. (2023, January 10\u201312). Adaptive online cache capacity optimization via lightweight working set size estimation at scale. Proceedings of the USENIX Annual Technical Conference, Boston, MA, USA."},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"2690","DOI":"10.1109\/TNSM.2020.3024680","article-title":"Cuckoo Filters and Bloom Filters: Comparison and Application to Packet Classification","volume":"17","author":"Reviriego","year":"2020","journal-title":"IEEE Trans. Netw. Serv. Manag."}],"container-title":["Future Internet"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-5903\/16\/6\/205\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T14:55:26Z","timestamp":1760108126000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-5903\/16\/6\/205"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,7]]},"references-count":44,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2024,6]]}},"alternative-id":["fi16060205"],"URL":"https:\/\/doi.org\/10.3390\/fi16060205","relation":{},"ISSN":["1999-5903"],"issn-type":[{"value":"1999-5903","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,6,7]]}}}