{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T21:10:31Z","timestamp":1758057031583,"version":"3.44.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2025,8,19]],"date-time":"2025-08-19T00:00:00Z","timestamp":1755561600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,19]],"date-time":"2025-08-19T00:00:00Z","timestamp":1755561600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cluster Comput"],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1007\/s10586-025-05176-5","type":"journal-article","created":{"date-parts":[[2025,8,19]],"date-time":"2025-08-19T11:54:27Z","timestamp":1755604467000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Cloud-assisted updatable private set intersection cardinality"],"prefix":"10.1007","volume":"28","author":[{"given":"Yue","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiayi","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ke","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qian","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,8,19]]},"reference":[{"key":"5176_CR1","doi-asserted-by":"crossref","unstructured":"Aranha, D.F., Lin, C., Orlandi, C., Simkin, M.: Laconic private set-intersection from pairings. In: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, pp. 111\u2013124 (2022)","DOI":"10.1145\/3548606.3560642"},{"key":"5176_CR2","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-031-33491-7_6","volume-title":"International Conference on Applied Cryptography and Network Security","author":"Y Yang","year":"2023","unstructured":"Yang, Y., Weng, J., Yi, Y., Dong, C., Zhang, L.Y., Zhou, J.: Predicate private set intersection with linear complexity. In: International Conference on Applied Cryptography and Network Security, pp. 143\u2013166. Springer (2023)"},{"key":"5176_CR3","doi-asserted-by":"crossref","unstructured":"Zhan, Y., Zhang, Z., Liu, Q., Wang, B.: Hiding the input-size in multi-party private set intersection. Designs Codes Cryptogr., 1\u201323 (2023)","DOI":"10.1007\/s10623-023-01238-0"},{"issue":"5","key":"5176_CR4","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1049\/ise2.12070","volume":"16","author":"J Gao","year":"2022","unstructured":"Gao, J., Surana, C., Trieu, N.: Secure contact tracing platform from simplest private set intersection cardinality. IET Inf. Secur. 16(5), 346\u2013361 (2022)","journal-title":"IET Inf. Secur."},{"key":"5176_CR5","unstructured":"Pinkas, B., Schneider, T., Segev, G., Zohner, M.: Phasing: private set intersection using permutation-based hashing. In: 24th USENIX Security Symposium, pp. 515\u2013530 (2015)"},{"key":"5176_CR6","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s13389-020-00242-7","volume":"11","author":"AC Davi Resende","year":"2021","unstructured":"Davi Resende, A.C., de Freitas Aranha, D.: Faster unbalanced private set intersection in the semi-honest setting. J. Cryptogr. Eng. 11, 21\u201338 (2021)","journal-title":"J. Cryptogr. Eng."},{"issue":"2","key":"5176_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3154794","volume":"21","author":"B Pinkas","year":"2018","unstructured":"Pinkas, B., Schneider, T., Zohner, M.: Scalable private set intersection based on OT extension. ACM Trans. Privacy Secur. 21(2), 1\u201335 (2018)","journal-title":"ACM Trans. Privacy Secur."},{"key":"5176_CR8","doi-asserted-by":"crossref","unstructured":"Pinkas, B., Rosulek, M., Trieu, N., Yanai, A.: PSI from PaXoS: fast, malicious private set intersection. In: 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 739\u2013767 (2020). Springer","DOI":"10.1007\/978-3-030-45724-2_25"},{"key":"5176_CR9","doi-asserted-by":"crossref","unstructured":"Rindal, P., Rosulek, M.: Malicious-secure private set intersection via dual execution. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, pp. 1229\u20131242 (2017)","DOI":"10.1145\/3133956.3134044"},{"issue":"2","key":"5176_CR10","doi-asserted-by":"publisher","first-page":"378","DOI":"10.2478\/popets-2022-0051","volume":"2022","author":"S Badrinarayanan","year":"2022","unstructured":"Badrinarayanan, S., Miao, P., Xie, T.: Updatable private set intersection. Proc. Privacy Enhancing Technol. 2022(2), 378\u2013406 (2022)","journal-title":"Proc. Privacy Enhancing Technol."},{"key":"5176_CR11","first-page":"100","volume-title":"Financial Cryptography and Data Security","author":"A Abadi","year":"2012","unstructured":"Abadi, A., Dong, C., Murdoch, S.J., Terzis, S.: Multi-party updatable delegated private set intersection. In: Financial Cryptography and Data Security, pp. 100\u2013119. Springer (2012)"},{"key":"5176_CR12","first-page":"200","volume-title":"International Conference on the Theory and Application of Cryptology and Information Security","author":"S Badrinarayanan","year":"2025","unstructured":"Badrinarayanan, S., Miao, P., Shi, X., Tromanhauser, M., Zeng, R.: Updatable private set intersection revisited: extended functionalities, deletion, and worst-case complexity. In: International Conference on the Theory and Application of Cryptology and Information Security, pp. 200\u2013233. Springer (2025)"},{"key":"5176_CR13","unstructured":"Agarwal, A., Cash, D., George, M., Kamara, S., Moataz, T., Singh, J.: Updatable private set intersection from structured encryption. Cryptology ePrint Archive (2024)"},{"key":"5176_CR14","unstructured":"Ling, G., Tang, P., Qiu, W.: Low-communication updatable psi from asymmetric PSI and PSU. Cryptology ePrint Archive (2024)"},{"key":"5176_CR15","first-page":"870","volume-title":"26th International Conference on the Theory and Application of Cryptology and Information Security","author":"T Duong","year":"2020","unstructured":"Duong, T., Phan, D.H., Trieu, N.: Catalic: delegated psi cardinality with applications to contact tracing. In: 26th International Conference on the Theory and Application of Cryptology and Information Security, pp. 870\u2013899. Springer (2020)"},{"key":"5176_CR16","first-page":"169","volume-title":"International Conference on Information Security and Cryptology","author":"Y Chen","year":"2023","unstructured":"Chen, Y., Ding, N., Gu, D., Bian, Y.: Practical multi-party private set intersection cardinality and intersection-sum under arbitrary collusion. In: International Conference on Information Security and Cryptology, pp. 169\u2013191. Springer (2023)"},{"key":"5176_CR17","unstructured":"Trieu, N., Shehata, K., Saxena, P., Shokri, R., Song, D.: Epione: Lightweight contact tracing with strong privacy. arXiv preprint arXiv:2004.13293 (2020)"},{"key":"5176_CR18","first-page":"1","volume-title":"International Conference on the Theory and Applications of Cryptographic Techniques","author":"MJ Freedman","year":"2004","unstructured":"Freedman, M.J., Nissim, K., Pinkas, B.: Efficient private matching and set intersection. In: International Conference on the Theory and Applications of Cryptographic Techniques, pp. 1\u201319. Springer (2004)"},{"issue":"1","key":"5176_CR19","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s00145-014-9190-0","volume":"29","author":"MJ Freedman","year":"2016","unstructured":"Freedman, M.J., Hazay, C., Nissim, K., Pinkas, B.: Efficient set intersection with simulation-based security. J. Cryptol. 29(1), 115\u2013155 (2016)","journal-title":"J. Cryptol."},{"key":"5176_CR20","first-page":"312","volume-title":"13th International Conference on Practice and Theory in Public Key Cryptography","author":"C Hazay","year":"2010","unstructured":"Hazay, C., Nissim, K.: Efficient set operations in the presence of malicious adversaries. In: 13th International Conference on Practice and Theory in Public Key Cryptography, pp. 312\u2013331. Springer (2010)"},{"key":"5176_CR21","doi-asserted-by":"crossref","unstructured":"Kerschbaum, F.: Collusion-resistant outsourcing of private set intersection. In: Proceedings of the 27th Annual ACM Symposium on Applied Computing, pp. 1451\u20131456 (2012)","DOI":"10.1145\/2245276.2232008"},{"key":"5176_CR22","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-662-45472-5_13","volume-title":"Financial Cryptography and Data Security: 18th International Conference","author":"S Kamara","year":"2014","unstructured":"Kamara, S., Mohassel, P., Raykova, M., Sadeghian, S.: Scaling private set intersection to billion-element sets. In: Financial Cryptography and Data Security: 18th International Conference, pp. 195\u2013215. Springer (2014)"},{"key":"5176_CR23","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-18467-8_1","volume-title":"ICT Systems Security and Privacy Protection: 30th IFIP TC 11 International Conference","author":"A Abadi","year":"2015","unstructured":"Abadi, A., Terzis, S., Dong, C.: O-PSI: delegated private set intersection on outsourced datasets. In: ICT Systems Security and Privacy Protection: 30th IFIP TC 11 International Conference, pp. 3\u201317. Springer (2015)"},{"key":"5176_CR24","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-662-54970-4_9","volume-title":"Financial Cryptography and Data Security: 20th International Conference","author":"A Abadi","year":"2017","unstructured":"Abadi, A., Terzis, S., Dong, C.: VD-PSI: verifiable delegated private set intersection on outsourced private datasets. In: Financial Cryptography and Data Security: 20th International Conference, pp. 149\u2013168. Springer (2017)"},{"key":"5176_CR25","doi-asserted-by":"publisher","DOI":"10.1016\/j.csi.2023.103760","volume":"87","author":"X Yang","year":"2024","unstructured":"Yang, X., Zhao, Y., Zhou, S., Wang, L.: A lightweight delegated private set intersection cardinality protocol. Comput. Standards Interfaces 87, 103760 (2024)","journal-title":"Comput. Standards Interfaces"},{"key":"5176_CR26","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-642-35404-5_17","volume-title":"International Conference on Cryptology and Network Security","author":"E De Cristofaro","year":"2012","unstructured":"De Cristofaro, E., Gasti, P., Tsudik, G.: Fast and private computation of cardinality of set intersection and union. In: International Conference on Cryptology and Network Security, pp. 218\u2013231. Springer (2012)"},{"key":"5176_CR27","first-page":"1","volume-title":"2018 6th International Conference on Multimedia Computing and Systems","author":"A Tajima","year":"2018","unstructured":"Tajima, A., Sato, H., Yamana, H.: Outsourced private set intersection cardinality with fully homomorphic encryption. In: 2018 6th International Conference on Multimedia Computing and Systems, pp. 1\u20138. IEEE (2018)"},{"issue":"01","key":"5176_CR28","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1109\/TCC.2024.3360098","volume":"12","author":"Y Chen","year":"2024","unstructured":"Chen, Y., Wu, A., Yang, Y., Xin, X., Song, C.: Efficient verifiable cloud-assisted psi cardinality for privacy-preserving contact tracing. IEEE Trans. Cloud Comput. 12(01), 251\u2013263 (2024)","journal-title":"IEEE Trans. Cloud Comput."},{"issue":"01","key":"5176_CR29","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1109\/TCC.2024.3361882","volume":"12","author":"A Wu","year":"2024","unstructured":"Wu, A., Xin, X., Jianhao, Z., Wei, L., Song, C., Li, G.: Cloud-assisted laconic private set intersection cardinality. IEEE Trans. Cloud Comput. 12(01), 295\u2013305 (2024)","journal-title":"IEEE Trans. Cloud Comput."},{"key":"5176_CR30","doi-asserted-by":"crossref","unstructured":"Baldi, P., Baronio, R., De\u00a0Cristofaro, E., Gasti, P., Tsudik, G.: Countering gattaca: efficient and secure testing of fully-sequenced human genomes. In: Proceedings of the 18th ACM Conference on Computer and Communications Security, pp. 691\u2013702 (2011)","DOI":"10.1145\/2046707.2046785"},{"key":"5176_CR31","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-030-89432-0_20","volume-title":"Information Security Applications: 22nd International Conference","author":"J Wen","year":"2021","unstructured":"Wen, J., Liu, J.-N., Wu, A., Weng, J.: A general framework for matching pattern hiding in deep packet inspection. In: Information Security Applications: 22nd International Conference, pp. 243\u2013254. Springer (2021)"},{"key":"5176_CR32","first-page":"1","volume-title":"2021 IEEE 34th Computer Security Foundations Symposium","author":"I Karantaidou","year":"2021","unstructured":"Karantaidou, I., Baldimtsi, F.: Efficient constructions of pairing based accumulators. In: 2021 IEEE 34th Computer Security Foundations Symposium, pp. 1\u201316. IEEE (2021)"},{"key":"5176_CR33","first-page":"395","volume-title":"Cryptographers\u2019 Track at the RSA Conference","author":"G Vitto","year":"2022","unstructured":"Vitto, G., Biryukov, A.: Dynamic universal accumulator with batch update over bilinear groups. In: Cryptographers\u2019 Track at the RSA Conference, pp. 395\u2013426. Springer (2022)"}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-025-05176-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10586-025-05176-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-025-05176-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,15]],"date-time":"2025-09-15T19:07:37Z","timestamp":1757963257000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10586-025-05176-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,19]]},"references-count":33,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["5176"],"URL":"https:\/\/doi.org\/10.1007\/s10586-025-05176-5","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"type":"print","value":"1386-7857"},{"type":"electronic","value":"1573-7543"}],"subject":[],"published":{"date-parts":[[2025,8,19]]},"assertion":[{"value":"5 June 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 January 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 February 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 August 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"538"}}