{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T18:22:09Z","timestamp":1757614929473,"version":"3.44.0"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,6,27]],"date-time":"2025-06-27T00:00:00Z","timestamp":1750982400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,6,27]],"date-time":"2025-06-27T00:00:00Z","timestamp":1750982400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100002241","name":"Japan Science and Technology Agency","doi-asserted-by":"publisher","award":["JPMJSP2018","JPMJCR2113"],"award-info":[{"award-number":["JPMJSP2018","JPMJCR2113"]}],"id":[{"id":"10.13039\/501100002241","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["JP23KJ0385","P21073"],"award-info":[{"award-number":["JP23KJ0385","P21073"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Inf. Secur."],"published-print":{"date-parts":[[2025,8]]},"DOI":"10.1007\/s10207-025-01088-y","type":"journal-article","created":{"date-parts":[[2025,6,27]],"date-time":"2025-06-27T09:14:07Z","timestamp":1751015647000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Revisiting Cuckoo Hash-based Unbalanced Private Set Union: Leakage Analysis and Better Construction"],"prefix":"10.1007","volume":"24","author":[{"given":"Keyang","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xingxin","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tsuyoshi","family":"Takagi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,6,27]]},"reference":[{"key":"1088_CR1","doi-asserted-by":"publisher","unstructured":"Bajard, J.C., Eynard, J., Hasan, M.A., Zucca, V.: A full rns variant of fv like somewhat homomorphic encryption schemes. In: International Conference on Selected Areas in Cryptography. Lecture Notes in Computer Science, vol. 10532, pp. 423\u2013442. Springer (2016). https:\/\/doi.org\/10.1007\/978-3-319-69453-5_23","DOI":"10.1007\/978-3-319-69453-5_23"},{"key":"1088_CR2","unstructured":"Benny, P., Thomas, S., Michael, Z.: Faster private set intersection based on ot extension. In: 23rd USENIX Security Symposium, USENIX Security 2014. pp. 797\u2013812. USENIX Association (2014)"},{"key":"1088_CR3","unstructured":"Burkhart, M., Strasser, M., Many, D., Dimitropoulos, X.: Sepia: Privacy-preserving aggregation of multi-domain network events and statistics. In: 19th USENIX Security Symposium, USENIX Security 2010. pp. 223\u2013240. USENIX Association (2010)"},{"key":"1088_CR4","doi-asserted-by":"crossref","unstructured":"Chandran, G.R., Schneider, T., Stillger, M., Weinert, C.: Concretely efficient private set union via circuit-based psi. In: Proceedings of the 2025 ACM Asia Conference on Computer and Communications Security (2025)","DOI":"10.1145\/3708821.3710839"},{"key":"1088_CR5","doi-asserted-by":"crossref","unstructured":"Chase, M., Ghosh, E., Poburinnaya, O.: Secret-shared shuffle. In: Advances in Cryptology \u2013 ASIACRYPT 2020. Lecture Notes in Computer Science, vol. 12493, pp. 342\u2013372. Springer (2020). URL: 978-3-030-64840-4_12","DOI":"10.1007\/978-3-030-64840-4_12"},{"key":"1088_CR6","doi-asserted-by":"publisher","unstructured":"Chen, H., Huang, Z., Laine, K., Rindal, P.: Labeled psi from fully homomorphic encryption with malicious security. In: 25th ACM Conference on Computer and Communications Security, ACM-CCS 2018. pp. 1223\u20131237. ACM (2018). https:\/\/doi.org\/10.1145\/3243734.3243836","DOI":"10.1145\/3243734.3243836"},{"key":"1088_CR7","doi-asserted-by":"publisher","unstructured":"Chen, H., Laine, K., Rindal, P.: Fast private set intersection from homomorphic encryption. In: 24th ACM Conference on Computer and Communications Security, ACM-CCS 2017. pp. 1243\u20131255. ACM (2017). https:\/\/doi.org\/10.1145\/3133956.3134061","DOI":"10.1145\/3133956.3134061"},{"key":"1088_CR8","doi-asserted-by":"publisher","unstructured":"Chen, Y., Zhang, M., Zhang, C., Dong, M., Liu, W.: Private set operations from multi-query reverse private membership test. In: Public-Key Cryptography \u2013 PKC 2024. Lecture Notes in Computer Science, vol. 14603, pp. 387\u2013416. Springer (2024). https:\/\/doi.org\/10.1007\/978-3-031-57725-3_13","DOI":"10.1007\/978-3-031-57725-3_13"},{"key":"1088_CR9","doi-asserted-by":"publisher","unstructured":"Cong, K., Moreno, R.C., da\u00a0Gama, M.B., Dai, W., Iliashenko, I., Laine, K., Rosenberg, M.: Labeled psi from homomorphic encryption with reduced computation and communication. In: 28th ACM Conference on Computer and Communications Security, ACM-CCS 2021. pp. 1135\u20131150. ACM (2021). https:\/\/doi.org\/10.1145\/3460120.3484760","DOI":"10.1145\/3460120.3484760"},{"key":"1088_CR10","doi-asserted-by":"publisher","unstructured":"Dumas, J.G., Galan, A., Grenet, B., Maignan, A., Roche, D.S.: Communication optimal unbalanced private set union. CoRR abs\/2402.16393 (2024). https:\/\/doi.org\/10.48550\/arXiv.2402.16393","DOI":"10.48550\/arXiv.2402.16393"},{"key":"1088_CR11","doi-asserted-by":"publisher","unstructured":"Freedman, M.J., Ishai, Y., Pinkas, B., Reingold, O.: Keyword search and oblivious pseudorandom functions. In: Theory of Cryptography \u2013 TCC 2005. Lecture Notes in Computer Science, vol.\u00a03378, pp. 303\u2013324. Springer (2005). https:\/\/doi.org\/10.1007\/978-3-540-30576-7_17","DOI":"10.1007\/978-3-540-30576-7_17"},{"key":"1088_CR12","doi-asserted-by":"publisher","unstructured":"Garimella, G., Mohassel, P., Rosulek, M., Sadeghian, S., Singh, J.: Private set operations from oblivious switching. In: Public-Key Cryptography \u2013 PKC 2021. Lecture Notes in Computer Science, vol. 12711, pp. 591\u2013617. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-75248-4_21","DOI":"10.1007\/978-3-030-75248-4_21"},{"key":"1088_CR13","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Kilian, J., Nissim, K., Petrank, E.: Extending oblivious transfers efficiently. In: Advances in Cryptology \u2013 CRYPTO 2003. Lecture Notes in Computer Science, vol.\u00a02729, pp. 145\u2013161. Springer (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_9","DOI":"10.1007\/978-3-540-45146-4_9"},{"key":"1088_CR14","doi-asserted-by":"publisher","unstructured":"Jarecki, S., Liu, X.: Fast secure computation of set intersection. In: 7th International Conference on Security and Cryptography for Networks, SCN 2010. Lecture Notes in Computer Science, vol.\u00a06280, pp. 418\u2013435. Springer (2010). https:\/\/doi.org\/10.1007\/978-3-642-15317-4_26","DOI":"10.1007\/978-3-642-15317-4_26"},{"key":"1088_CR15","unstructured":"Jia, Y., Sun, S.F., Zhou, H.S., Du, J., Gu, D.: Shuffle-based private set union: Faster and more secure. In: 31st USENIX Security Symposium, USENIX Security 2022. pp. 2947\u20132964. USENIX Association (2022)"},{"key":"1088_CR16","unstructured":"Jia, Y., Sun, S.F., Zhou, H.S., Gu, D.: Scalable private set union, with stronger security. In: 33rd USENIX Security Symposium (USENIX Security 24). pp. 6471\u20136488 (2024)"},{"issue":"4","key":"1088_CR17","doi-asserted-by":"publisher","first-page":"1543","DOI":"10.1137\/080728743","volume":"39","author":"A Kirsch","year":"2009","unstructured":"Kirsch, A., Mitzenmacher, M., Wieder, U.: More robust hashing: Cuckoo hashing with a stash. SIAM J. Comput. 39(4), 1543\u20131561 (2009). https:\/\/doi.org\/10.1137\/080728743","journal-title":"SIAM J. Comput."},{"key":"1088_CR18","doi-asserted-by":"publisher","unstructured":"Kolesnikov, V., Rosulek, M., Trieu, N., Wang, X.: Scalable private set union from symmetric-key techniques. In: Advances in Cryptology \u2013 ASIACRYPT 2019. Lecture Notes in Computer Science, vol. 11922, pp. 636\u2013666. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-34621-8_23","DOI":"10.1007\/978-3-030-34621-8_23"},{"key":"1088_CR19","doi-asserted-by":"publisher","unstructured":"Liu, K., Li, X., Takagi, T.: Review the cuckoo hash-based unbalanced private set union: Leakage, fix, and optimization. In: 29th European Symposium on Research in Computer Security, ESORICS 2024. Lecture Notes in Computer Science, vol. 14983, pp. 331\u2013352. Springer (2024). https:\/\/doi.org\/10.1007\/978-3-031-70890-9_17","DOI":"10.1007\/978-3-031-70890-9_17"},{"key":"1088_CR20","doi-asserted-by":"publisher","unstructured":"Mohassel, P., Sadeghian, S.: How to hide circuits in mpc an efficient framework for private function evaluation. In: Advances in Cryptology \u2013 EUROCRYPT 2013. Lecture Notes in Computer Science, vol.\u00a07881, pp. 557\u2013574. Springer (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_33","DOI":"10.1007\/978-3-642-38348-9_33"},{"issue":"2","key":"1088_CR21","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1006\/jcss.1998.1618","volume":"58","author":"M Naor","year":"1999","unstructured":"Naor, M., Reingold, O.: Synthesizers and their application to the parallel construction of pseudo-random functions. J. Comput. Syst. Sci. 58(2), 336\u2013375 (1999). https:\/\/doi.org\/10.1006\/jcss.1998.1618","journal-title":"J. Comput. Syst. Sci."},{"key":"1088_CR22","series-title":"Basic Applications","volume-title":"Foundations of Cryptography","author":"G Oded","year":"2009","unstructured":"Oded, G.: Foundations of Cryptography. Basic Applications, vol. 2. Cambridge University Press (2009)"},{"key":"1088_CR23","doi-asserted-by":"publisher","unstructured":"Pinkas, B., Rosulek, M., Trieu, N., Yanai, A.: Spot-light: Lightweight private set intersection from sparse ot extension. In: Advances in Cryptology \u2013 CRYPTO 2019. Lecture Notes in Computer Science, vol. 11694, pp. 401\u2013431. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_13","DOI":"10.1007\/978-3-030-26954-8_13"},{"key":"1088_CR24","unstructured":"Pinkas, B., Schneider, T., Segev, G., Zohner, M.: Phasing: Private set intersection using permutation-based hashing. In: 24th USENIX Security Symposium, USENIX Security 2015. pp. 515\u2013530. USENIX Association (2015)"},{"key":"1088_CR25","doi-asserted-by":"publisher","unstructured":"Pinkas, B., Schneider, T., Weinert, C., Wieder, U.: Efficient circuit-based psi via cuckoo hashing. In: Advances in Cryptology \u2013 EUROCRYPT 2018. Lecture Notes in Computer Science, vol. 10822, pp. 125\u2013157. Springer (2018). https:\/\/doi.org\/10.1007\/978-3-319-78372-7_5","DOI":"10.1007\/978-3-319-78372-7_5"},{"issue":"2","key":"1088_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/315479","volume":"21","author":"B Pinkas","year":"2018","unstructured":"Pinkas, B., Schneider, T., Zohner, M.: Scalable private set intersection based on ot extension. ACM Trans. Priv. Secur. 21(2), 1\u201335 (2018). https:\/\/doi.org\/10.1145\/315479","journal-title":"ACM Trans. Priv. Secur."},{"key":"1088_CR27","doi-asserted-by":"crossref","unstructured":"Raab, M., Steger, A.: \u201cballs into bins\"-a simple and tight analysis. In: 2nd International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 1998. Lecture Notes in Computer Science, vol.\u00a01518, pp. 159\u2013170. Springer (1998)","DOI":"10.1007\/3-540-49543-6_13"},{"key":"1088_CR28","doi-asserted-by":"crossref","unstructured":"Ramanathan, S., Mirkovic, J., Yu, M.: Blag: Improving the accuracy of blacklists. In: 27th Annual Network and Distributed System Security Symposium, NDSS 2020 (2020)","DOI":"10.14722\/ndss.2020.24232"},{"key":"1088_CR29","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s10623-012-9720-4","volume":"71","author":"NP Smart","year":"2014","unstructured":"Smart, N.P., Vercauteren, F.: Fully homomorphic simd operations. Des. Codes Crypt. 71, 57\u201381 (2014). https:\/\/doi.org\/10.1007\/s10623-012-9720-4","journal-title":"Des. Codes Crypt."},{"key":"1088_CR30","doi-asserted-by":"publisher","unstructured":"Son, Y., Jeong, J.: Psi with computation or circuit-psi for unbalanced sets from homomorphic encryption. In: 30th ACM Conference on Computer and Communications Security, ACM-CCS 2023. pp. 342\u2013356. ACM (2023). https:\/\/doi.org\/10.1145\/3579856.3582817","DOI":"10.1145\/3579856.3582817"},{"key":"1088_CR31","doi-asserted-by":"publisher","unstructured":"Tu, B., Chen, Y., Liu, Q., Zhang, C.: Fast unbalanced private set union from fully homomorphic encryption. In: 30th ACM Conference on Computer and Communications Security, ACM-CCS 2023. pp. 2959\u20132973. ACM (2023). https:\/\/doi.org\/10.1145\/3576915.3623064","DOI":"10.1145\/3576915.3623064"},{"key":"1088_CR32","unstructured":"Wu, M., Yuen, T.H.: Efficient unbalanced private set intersection cardinality and user-friendly privacy-preserving contact tracing. In: 32nd USENIX Security Symposium, USENIX Security 2023. pp. 283\u2013300. USENIX Association (2023)"},{"key":"1088_CR33","doi-asserted-by":"publisher","unstructured":"Zhang, C., Chen, Y., Liu, W., Peng, L., Hao, M., Wang, A., Wang, X.: Unbalanced private set union with reduced computation and communication. In: Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security. pp. 1434\u20131447 (2024). https:\/\/doi.org\/10.1145\/3658644.3690308","DOI":"10.1145\/3658644.3690308"},{"key":"1088_CR34","unstructured":"Zhang, C., Chen, Y., Liu, W., Zhang, M., Lin, D.: Linear private set union from multi-query reverse private membership test. In: 32nd USENIX Security Symposium, USENIX Security 2023. pp. 337\u2013354. USENIX Association (2023)"}],"container-title":["International Journal of Information Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-025-01088-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10207-025-01088-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-025-01088-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T11:33:42Z","timestamp":1757072022000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10207-025-01088-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,27]]},"references-count":34,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,8]]}},"alternative-id":["1088"],"URL":"https:\/\/doi.org\/10.1007\/s10207-025-01088-y","relation":{},"ISSN":["1615-5262","1615-5270"],"issn-type":[{"type":"print","value":"1615-5262"},{"type":"electronic","value":"1615-5270"}],"subject":[],"published":{"date-parts":[[2025,6,27]]},"assertion":[{"value":"27 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Authors are required to disclose financial or non-financial interests that are directly or indirectly related to the work submitted for publication. Please refer to \u201cCompeting Interests and Funding\u201d below for more information on how to complete this section. The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"164"}}