{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T19:35:36Z","timestamp":1772307336868,"version":"3.50.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,9,6]],"date-time":"2023-09-06T00:00:00Z","timestamp":1693958400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,9,6]],"date-time":"2023-09-06T00:00:00Z","timestamp":1693958400000},"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":["Front. Comput. Sci."],"published-print":{"date-parts":[[2024,2]]},"DOI":"10.1007\/s11704-022-2269-0","type":"journal-article","created":{"date-parts":[[2023,9,6]],"date-time":"2023-09-06T07:02:26Z","timestamp":1693983746000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["EMPSI: Efficient multiparty private set intersection (with cardinality)"],"prefix":"10.1007","volume":"18","author":[{"given":"Yunbo","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaolei","family":"Dong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhenfu","family":"Cao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiachen","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruofan","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yihao","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shangmin","family":"Dou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,6]]},"reference":[{"key":"2269_CR1","unstructured":"Castelluccia C, Bielova N, Boutet A, Cunche M, Lauradoux C, Le M\u00e9tayer D, Roca V. DESIRE: a third way for a European exposure notification system leveraging the best of centralized and decentralized systems. 2020, arXiv preprint arXiv: 2008.01621"},{"key":"2269_CR2","unstructured":"Madhusudan P, Ren L, Venkatakrishnan V N. ConTraIL: privacy-preserving secure contact tracing. 2020"},{"key":"2269_CR3","unstructured":"Chan J, Foster D, Gollakota S, Horvitz E, Jaeger J, Kakade S, Kohno T, Langford J, Larson J, Sharma P, Singanamalla S, Sunshine J, Tessaro S. PACT: privacy sensitive protocols and mechanisms for mobile contact tracing. 2020, arXiv preprint arXiv: 2004.03544"},{"key":"2269_CR4","unstructured":"Canetti R, Kalai Y T, Lysyanskaya A, Rivest R L, Shamir A, Shen E, Trachtenberg A, Varia M, Weitzner D J. Privacy-preserving automated exposure notification. Cryptology ePrint Archive, 2020"},{"issue":"2","key":"2269_CR5","doi-asserted-by":"crossref","first-page":"7","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 Transactions on Privacy and Security, 2018, 21(2): 7","journal-title":"ACM Transactions on Privacy and Security"},{"key":"2269_CR6","doi-asserted-by":"crossref","unstructured":"Pinkas B, Rosulek M, Trieu V, Yanai A. SpOT-light: lightweight private set intersection from sparse OT extension. In: Proceedings of the 39th Annual International Cryptology Conference. 2019, 401\u2013431","DOI":"10.1007\/978-3-030-26954-8_13"},{"key":"2269_CR7","doi-asserted-by":"crossref","unstructured":"Chase M, Miao P. Private set intersection in the internet setting from lightweight oblivious PRF. In: Proceedings of the 40th Annual International Cryptology Conference. 2020, 34\u201363","DOI":"10.1007\/978-3-030-56877-1_2"},{"key":"2269_CR8","doi-asserted-by":"crossref","unstructured":"Rindal P, Rosulek M. Malicious-secure private set intersection via dual execution. In: Proceedings of 2017 ACM SIGSAC Conference on Computer and Communications Security. 2017, 1229\u20131242","DOI":"10.1145\/3133956.3134044"},{"key":"2269_CR9","doi-asserted-by":"crossref","unstructured":"Kolesnikov V, Matania N, Pinkas B, Rosulek M, Trieu N. Practical multi-party private set intersection from symmetric-key techniques. In: Proceedings of 2017 ACM SIGSAC Conference on Computer and Communications Security. 2017, 1257\u20131272","DOI":"10.1145\/3133956.3134065"},{"key":"2269_CR10","doi-asserted-by":"crossref","unstructured":"Inbar R, Omri E, Pinkas B. Efficient scalable multiparty private set-intersection via garbled bloom filters. In: Proceedings of the 11th International Conference on Security and Cryptography for Networks. 2018, 235\u2013252","DOI":"10.1007\/978-3-319-98113-0_13"},{"key":"2269_CR11","doi-asserted-by":"crossref","unstructured":"Dong C, Chen L, Wen Z. When private set intersection meets big data: an efficient and scalable protocol. In: Proceedings of 2013 ACM SIGSAC Conference on Computer & Communications Security. 2013, 789\u2013800","DOI":"10.1145\/2508859.2516701"},{"key":"2269_CR12","unstructured":"Abadi A, Terzis S, Dong C. Feather: lightweight multi-party updatable delegated private set intersection. Cryptology ePrint Archive, 2020"},{"key":"2269_CR13","doi-asserted-by":"crossref","unstructured":"Abadi A, Terzis S, Dong C. O-PSI: delegated private set intersection on outsourced datasets. In: Proceedings of the 30th IFIP International Information Security and Privacy Conference. 2015, 3\u201317","DOI":"10.1007\/978-3-319-18467-8_1"},{"key":"2269_CR14","doi-asserted-by":"crossref","unstructured":"Abadi A, Terzis S, Dong C. VD-PSI: verifiable delegated private set intersection on outsourced private datasets. In: Proceedings of the 20th International Conference on Financial Cryptography and Data Security. 2016, 149\u2013168","DOI":"10.1007\/978-3-662-54970-4_9"},{"key":"2269_CR15","doi-asserted-by":"crossref","unstructured":"Branco P, D\u00f6ttling N, Pu S. Multiparty cardinality testing for threshold private intersection. In: Proceedings of the 24th IACR International Conference on Public-Key Cryptography. 2021, 32\u201360","DOI":"10.1007\/978-3-030-75248-4_2"},{"issue":"1","key":"2269_CR16","doi-asserted-by":"crossref","first-page":"e4329","DOI":"10.1002\/cpe.4329","volume":"30","author":"X Yang","year":"2018","unstructured":"Yang X, Luo X, Wang X A, Zhang S. Improved outsourced private set intersection protocol based on polynomial interpolation. Concurrency and Computation: Practice and Experience, 2018, 30(1): e4329","journal-title":"Concurrency and Computation: Practice and Experience"},{"key":"2269_CR17","doi-asserted-by":"crossref","unstructured":"Zhao Y, Chow S S M. Can you find the one for me?. In: Proceedings of 2018 Workshop on Privacy in the Electronic Society. 2018, 54\u201365","DOI":"10.1145\/3267323.3268965"},{"key":"2269_CR18","doi-asserted-by":"crossref","unstructured":"Kissner L, Song D. Privacy-preserving set operations. In: Proceedings of the 25th Annual International Cryptology Conference. 2005, 241\u2013257","DOI":"10.1007\/11535218_15"},{"key":"2269_CR19","doi-asserted-by":"crossref","unstructured":"Duong T, Phan D H, Trieu N. Catalic: delegated psi cardinality with applications to contact tracing. In: Proceedings of the 26th International Conference on the Theory and Application of Cryptology and Information Security. 2020, 870\u2013899","DOI":"10.1007\/978-3-030-64840-4_29"},{"key":"2269_CR20","first-page":"2100411","volume":"2","author":"R H Shi","year":"2021","unstructured":"Shi R H. Quantum bloom filter and its applications. IEEE Transactions on Quantum Engineering, 2021, 2: 2100411","journal-title":"IEEE Transactions on Quantum Engineering"},{"issue":"4","key":"2269_CR21","first-page":"1203","volume":"68","author":"R H Shi","year":"2021","unstructured":"Shi R H. Quantum multiparty privacy set intersection cardinality. IEEE Transactions on Circuits and Systems II: Express Briefs, 2021, 68(4): 1203\u20131207","journal-title":"IEEE Transactions on Circuits and Systems II: Express Briefs"},{"issue":"6","key":"2269_CR22","first-page":"2399","volume":"69","author":"R H Shi","year":"2022","unstructured":"Shi R H, Li Y F. Quantum private set intersection cardinality protocol with application to privacy-preserving condition query. IEEE Transactions on Circuits and Systems I: Regular Papers, 2022, 69(6): 2399\u20132411","journal-title":"IEEE Transactions on Circuits and Systems I: Regular Papers"},{"key":"2269_CR23","doi-asserted-by":"crossref","unstructured":"Hazay C, Venkitasubramaniam M. Scalable multi-party private set-intersection. In: Proceedings of the 20th IACR International Workshop on Public Key Cryptography. 2017, 175\u2013203","DOI":"10.1007\/978-3-662-54365-8_8"},{"issue":"2","key":"2269_CR24","doi-asserted-by":"crossref","first-page":"365","DOI":"10.3934\/amc.2020071","volume":"15","author":"S K Debnath","year":"2021","unstructured":"Debnath S K, St\u00e4nic\u00e4 P, Kundu N, Choudhury T. Secure and efficient multiparty private set intersection cardinality. Advances in Mathematics of Communications, 2021, 15(2): 365\u2013386","journal-title":"Advances in Mathematics of Communications"},{"issue":"11","key":"2269_CR25","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir A. How to share a secret. Communications of the ACM, 1979, 22(11): 612\u2013613","journal-title":"Communications of the ACM"},{"key":"2269_CR26","volume-title":"Applied Cryptography: Protocols, Algorithms, and Source Code in C","author":"B Schneier","year":"2007","unstructured":"Schneier B. Applied Cryptography: Protocols, Algorithms, and Source Code in C. New York: John Wiley & Sons, 2007"},{"key":"2269_CR27","unstructured":"Rabin M O. How to exchange secrets with oblivious transfer. Cryptology ePrint Archive, 2005"},{"key":"2269_CR28","doi-asserted-by":"crossref","unstructured":"Kolesnikov V, Kumaresan R. Improved OT extension for transferring short secrets. In: Proceedings of the 33rd Annual Cryptology Conference. 2013, 54\u201370","DOI":"10.1007\/978-3-642-40084-1_4"},{"key":"2269_CR29","doi-asserted-by":"crossref","unstructured":"Freedman M J, Ishai Y, Pinkas B, Reingold O. Keyword search and oblivious pseudorandom functions. In: Proceedings of the 2nd Theory of Cryptography Conference. 2005, 303\u2013324","DOI":"10.1007\/978-3-540-30576-7_17"},{"key":"2269_CR30","doi-asserted-by":"crossref","unstructured":"Kolesnikov V, Kumaresan R, Rosulek M, Trieu N. Efficient batched oblivious PRF with applications to private set intersection. In: Proceedings of 2016 ACM SIGSAC Conference on Computer and Communications Security. 2016, 818\u2013829","DOI":"10.1145\/2976749.2978381"},{"key":"2269_CR31","doi-asserted-by":"crossref","unstructured":"Jarecki S, Liu X. Fast secure computation of set intersection. In: Proceedings of the 7th International Conference on Security and Cryptography for Networks. 2010, 418\u2013435","DOI":"10.1007\/978-3-642-15317-4_26"},{"key":"2269_CR32","doi-asserted-by":"crossref","unstructured":"Chandran N, Dasgupta N, Gupta D, Obbattu S L B, Sekar S, Shah A. Efficient linear multiparty PSI and extensions to circuit\/quorum PSI. In: Proceedings of 2021 ACM SIGSAC Conference on Computer and Communications Security. 2021, 1182\u20131204","DOI":"10.1145\/3460120.3484591"},{"issue":"1","key":"2269_CR33","doi-asserted-by":"crossref","first-page":"768","DOI":"10.56553\/popets-2022-0132","volume":"2022","author":"A Bampoulidis","year":"2022","unstructured":"Bampoulidis A, Bruni A, Helminger L, Kales D, Rechberger C, Walch R. Privately connecting mobility to infectious diseases via applied cryptography. Proceedings on Privacy Enhancing Technologies, 2022, 2022(1): 768\u2013788","journal-title":"Proceedings on Privacy Enhancing Technologies"}],"container-title":["Frontiers of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-022-2269-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11704-022-2269-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-022-2269-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,23]],"date-time":"2025-03-23T02:26:40Z","timestamp":1742696800000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11704-022-2269-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,6]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,2]]}},"alternative-id":["2269"],"URL":"https:\/\/doi.org\/10.1007\/s11704-022-2269-0","relation":{},"ISSN":["2095-2228","2095-2236"],"issn-type":[{"value":"2095-2228","type":"print"},{"value":"2095-2236","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,9,6]]},"assertion":[{"value":"9 May 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 November 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 September 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"181804"}}