{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T00:24:57Z","timestamp":1771460697028,"version":"3.50.1"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2023,5,24]],"date-time":"2023-05-24T00:00:00Z","timestamp":1684886400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,5,24]],"date-time":"2023-05-24T00:00:00Z","timestamp":1684886400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U19B2021, 61972457,62202363"],"award-info":[{"award-number":["U19B2021, 61972457,62202363"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100015401","name":"Key Research and Development Program of Shaanxi","doi-asserted-by":"crossref","award":["2020ZDLGY08-04"],"award-info":[{"award-number":["2020ZDLGY08-04"]}],"id":[{"id":"10.13039\/501100015401","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100013057","name":"Innovation Scientists and Technicians Troop Construction Projects of Henan Province","doi-asserted-by":"publisher","award":["U19B2021, 61972457,62202363"],"award-info":[{"award-number":["U19B2021, 61972457,62202363"]}],"id":[{"id":"10.13039\/501100013057","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2023,9]]},"DOI":"10.1007\/s10623-023-01238-0","type":"journal-article","created":{"date-parts":[[2023,5,24]],"date-time":"2023-05-24T12:02:18Z","timestamp":1684929738000},"page":"2893-2915","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Hiding the input-size in multi-party private set intersection"],"prefix":"10.1007","volume":"91","author":[{"given":"Yu","family":"Zhan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ziqian","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qian","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2554-4464","authenticated-orcid":false,"given":"Baocang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,5,24]]},"reference":[{"issue":"4","key":"1238_CR1","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1109\/TDSC.2017.2708710","volume":"16","author":"A Abadi","year":"2019","unstructured":"Abadi A., Terzis S., Metere R., Dong C.: Efficient delegated private set intersection on outsourced private datasets. IEEE Trans. Depend. Secure Comput. 16(4), 608\u2013624 (2019). https:\/\/doi.org\/10.1109\/TDSC.2017.2708710.","journal-title":"IEEE Trans. Depend. Secure Comput."},{"key":"1238_CR2","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1007\/978-3-030-88428-4_35","volume-title":"Computer Security\u2013ESORICS 2021","author":"A Abadi","year":"2021","unstructured":"Abadi A., Murdoch S.J., Zacharias T.: Polynomial representation is tricky: maliciously secure private set intersection revisited. In: Bertino E., Shulman H., Waidner M. (eds.) Computer Security\u2013ESORICS 2021, vol. 12973, pp. 721\u2013742. Springer, Darmstadt (2021)."},{"key":"1238_CR3","first-page":"100","volume-title":"Financial Cryptography and Data Security\u2014FC 2022, Grenada","author":"A Abadi","year":"2022","unstructured":"Abadi A., Dong C., Murdoch S.J., Terzis S.: Multi-party updatable delegated private set intersection. In: Eyal I., Garay J.A. (eds.) Financial Cryptography and Data Security\u2014FC 2022, Grenada, vol. 13411, pp. 100\u2013119. Springer, Grenada (2022)."},{"key":"1238_CR4","first-page":"94","volume-title":"Theory of Cryptography, TCC 2021","author":"N Alamati","year":"2021","unstructured":"Alamati N., Branco P., D\u00f6ttling N., Garg S., Hajiabadi M., Pu S.: Laconic private set intersection and applications. In: Nissim K., Waters B. (eds.) Theory of Cryptography, TCC 2021, vol. 13044, pp. 94\u2013125. Springer, Raleigh (2021)."},{"key":"1238_CR5","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-642-19379-8_10","volume-title":"Public Key Cryptography\u2014PKC 2011","author":"G Ateniese","year":"2011","unstructured":"Ateniese G., De Cristofaro E., Tsudik G.: (if) size matters: Size-hiding private set intersection. In: Catalano D., Fazio N., Gennaro R., Nicolosi A. (eds.) Public Key Cryptography\u2014PKC 2011, pp. 156\u2013173. Springer, Berlin (2011)."},{"issue":"4","key":"1238_CR6","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1109\/TDSC.2017.2708710","volume":"16","author":"TS Aydin","year":"2019","unstructured":"Aydin T.S., Metere R., Dong C.: Efficient delegated private set intersection on outsourced private datasets. IEEE Trans. Depend. Secure Comput. 16(4), 608\u2013624 (2019). https:\/\/doi.org\/10.1109\/TDSC.2017.2708710.","journal-title":"IEEE Trans. Depend. Secure Comput."},{"key":"1238_CR7","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/978-3-030-75248-4_13","volume-title":"Public-Key Cryptography\u2014PKC 2021","author":"S Badrinarayanan","year":"2021","unstructured":"Badrinarayanan S., Miao P., Raghuraman S., Rindal P.: Multi-party threshold private set intersection with sublinear communication. In: Garay J.A. (ed.) Public-Key Cryptography\u2014PKC 2021, pp. 349\u2013379. Springer, Cham (2021)."},{"issue":"2","key":"1238_CR8","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 Enhanc. Technol. 2022(2), 378\u2013406 (2022). https:\/\/doi.org\/10.2478\/popets-2022-0051.","journal-title":"Proc. Privacy Enhanc. Technol."},{"key":"1238_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TIFS.2021.3118879","volume":"17","author":"A Bay","year":"2022","unstructured":"Bay A., Erkin Z., Hoepman J.-H., Samardjiska S., Vos J.: Practical multi-party private set intersection protocols. IEEE Trans. Inf. Forensics Secur. 17, 1\u201315 (2022). https:\/\/doi.org\/10.1109\/TIFS.2021.3118879.","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"1238_CR10","unstructured":"Bhowmick A., Boneh D., Myers S., Talwar K., Tarbe K.: The Apple PSI system (2021). https:\/\/www.apple.com\/child-safety\/pdf\/Apple_PSI_System_Security_Protocol_and_Analysis.pdf."},{"issue":"7","key":"1238_CR11","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"BH Bloom","year":"1970","unstructured":"Bloom B.H.: Space\/time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422\u2013426 (1970). https:\/\/doi.org\/10.1145\/362686.362692.","journal-title":"Commun. ACM"},{"issue":"4","key":"1238_CR12","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1016\/j.ipl.2008.05.018","volume":"108","author":"P Bose","year":"2008","unstructured":"Bose P., Guo H., Kranakis E., Maheshwari A., Morin P., Morrison J., Smid M., Tang Y.: On the false-positive rate of bloom filters. Inf. Process. Lett. 108(4), 210\u2013213 (2008). https:\/\/doi.org\/10.1016\/j.ipl.2008.05.018.","journal-title":"Inf. Process. Lett."},{"key":"1238_CR13","first-page":"449","volume-title":"Security and Cryptography for Networks","author":"T Bradley","year":"2016","unstructured":"Bradley T., Faber S., Tsudik G.: Bounded size-hiding private set intersection. In: Zikas V., De Prisco R. (eds.) Security and Cryptography for Networks, pp. 449\u2013467. Springer, Cham (2016)."},{"key":"1238_CR14","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-030-75248-4_2","volume-title":"Public-Key Cryptography\u2014PKC 2021","author":"P Branco","year":"2021","unstructured":"Branco P., D\u00f6ttling N., Pu S.: Multiparty cardinality testing for threshold private intersection. In: Garay J.A. (ed.) Public-Key Cryptography\u2014PKC 2021, vol. 12711, pp. 32\u201360. Springer, New York (2021)."},{"key":"1238_CR15","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-319-93387-0_15","volume-title":"Applied Cryptography and Network Security","author":"A Cerulli","year":"2018","unstructured":"Cerulli A., De Cristofaro E., Soriente C.: Nothing refreshes like a RePSI: reactive private set intersection. In: Preneel B., Vercauteren F. (eds.) Applied Cryptography and Network Security, pp. 280\u2013300. Springer, Cham (2018)."},{"key":"1238_CR16","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-030-56877-1_2","volume-title":"Advances in Cryptology\u2014CRYPTO 2020","author":"M Chase","year":"2020","unstructured":"Chase M., Miao P.: Private set intersection in the internet setting from lightweight oblivious PRF. In: Micciancio D., Ristenpart T. (eds.) Advances in Cryptology\u2014CRYPTO 2020, pp. 34\u201363. Springer, Cham (2020)."},{"key":"1238_CR17","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1007\/978-3-662-46803-6_18","volume-title":"Advances in Cryptology\u2014EUROCRYPT 2015","author":"M Chase","year":"2015","unstructured":"Chase M., Ostrovsky R., Visconti I.: Executable proofs, input-size hiding secure computation and a new ideal world. In: Oswald E., Fischlin M. (eds.) Advances in Cryptology\u2014EUROCRYPT 2015, pp. 532\u2013560. Springer, Berlin (2015)."},{"key":"1238_CR18","doi-asserted-by":"crossref","unstructured":"Chen H., Laine K., Rindal P.: Fast private set intersection from homomorphic encryption. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security (CCS \u201917), pp. 1243\u20131255. Association for Computing Machinery, New York (2017).","DOI":"10.1145\/3133956.3134061"},{"key":"1238_CR19","doi-asserted-by":"crossref","unstructured":"Chen H., Huang Z., Laine K., Rindal P.: Labeled psi from fully homomorphic encryption with malicious security. In: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security (CCS \u201918), pp. 1223\u20131237. Association for Computing Machinery, New York (2018).","DOI":"10.1145\/3243734.3243836"},{"key":"1238_CR20","doi-asserted-by":"crossref","unstructured":"D\u2019Arco P., Gonz\u00e1lez\u00a0Vasco M.I., P\u00e9rez\u00a0del Pozo A.L., Soriente C.: Size-hiding in private set intersection: existential results and constructions. In: Mitrokotsa, A., Vaudenay, S. (eds.) Progress in Cryptology\u2014AFRICACRYPT 2012, pp. 378\u2013394. Springer, Berlin (2012)","DOI":"10.1007\/978-3-642-31410-0_23"},{"key":"1238_CR21","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-319-59870-3_15","volume-title":"Information Security and Privacy","author":"A Davidson","year":"2017","unstructured":"Davidson A., Cid C.: An efficient toolkit for computing private set operations. In: Pieprzyk J., Suriadi S. (eds.) Information Security and Privacy, pp. 261\u2013278. Springer, Cham (2017)."},{"issue":"2","key":"1238_CR22","doi-asserted-by":"publisher","first-page":"365","DOI":"10.3934\/amc.2020071","volume":"15","author":"SK Debnath","year":"2021","unstructured":"Debnath S.K., St\u01cenic\u01ce P., Kundu N., Choudhury T.: Secure and efficient multiparty private set intersection cardinality. Adv. Math. Commun. 15(2), 365\u2013386 (2021).","journal-title":"Adv. Math. Commun."},{"key":"1238_CR23","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 the 2013 ACM SIGSAC Conference on Computer and Communications Security (CCS \u201913), pp. 789\u2013800. Association for Computing Machinery, New York, NY, USA (2013).","DOI":"10.1145\/2508859.2516701"},{"key":"1238_CR24","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/3-540-45472-1_7","volume-title":"Financial Cryptography","author":"P-A Fouque","year":"2001","unstructured":"Fouque P.-A., Poupard G., Stern J.: Sharing decryption in the context of voting or lotteries. In: Frankel Y. (ed.) Financial Cryptography, pp. 90\u2013104. Springer, Berlin (2001)."},{"key":"1238_CR25","first-page":"1","volume-title":"Advances in Cryptology\u2014EUROCRYPT 2004","author":"MJ Freedman","year":"2004","unstructured":"Freedman M.J., Nissim K., Pinkas B.: Efficient private matching and set intersection. In: Cachin C., Camenisch J.L. (eds.) Advances in Cryptology\u2014EUROCRYPT 2004, pp. 1\u201319. Springer, Berlin (2004)."},{"key":"1238_CR26","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/978-3-030-84245-1_14","volume-title":"Advances in Cryptology\u2014CRYPTO 2021","author":"G Garimella","year":"2021","unstructured":"Garimella G., Pinkas B., Rosulek M., Trieu N., Yanai A.: Oblivious key-value stores and amplification for private set intersection. In: Malkin T., Peikert C. (eds.) Advances in Cryptology\u2014CRYPTO 2021, pp. 395\u2013425. Springer, Cham (2021)."},{"key":"1238_CR27","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-030-17659-4_6","volume-title":"Advances in Cryptology\u2014EUROCRYPT 2019","author":"S Ghosh","year":"2019","unstructured":"Ghosh S., Nilges T.: An algebraic approach to maliciously secure private set intersection. In: Ishai Y., Rijmen V. (eds.) Advances in Cryptology\u2014EUROCRYPT 2019, pp. 154\u2013185. Springer, Cham (2019)."},{"key":"1238_CR28","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-26951-7_1","volume-title":"Advances in Cryptology\u2014CRYPTO 2019","author":"S Ghosh","year":"2019","unstructured":"Ghosh S., Simkin M.: The communication complexity of threshold private set intersection. In: Boldyreva A., Micciancio D. (eds.) Advances in Cryptology\u2014CRYPTO 2019, pp. 3\u201329. Springer, Cham (2019)."},{"key":"1238_CR29","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography","author":"O Goldreich","year":"2004","unstructured":"Goldreich O.: Foundations of Cryptography, vol. 2. Cambridge University Press, Cambridge (2004) https:\/\/doi.org\/10.1017\/CBO9780511721656."},{"key":"1238_CR30","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-662-54365-8_8","volume-title":"Public-Key Cryptography\u2014PKC 2017","author":"C Hazay","year":"2017","unstructured":"Hazay C., Venkitasubramaniam M.: Scalable multi-party private set-intersection. In: Fehr S. (ed.) Public-Key Cryptography\u2014PKC 2017, pp. 175\u2013203. Springer, Berlin (2017)."},{"key":"1238_CR31","doi-asserted-by":"crossref","unstructured":"Ion M., Kreuter B., Nergiz A.E., Patel S., Saxena S., Seth K., Raykova M., Shanahan D., Yung M.: On deploying secure computing: private intersection-sum-with-cardinality. In: 2020 IEEE European Symposium on Security and Privacy (EuroS P), pp. 370\u2013389 (2020)","DOI":"10.1109\/EuroSP48549.2020.00031"},{"issue":"4","key":"1238_CR32","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1515\/popets-2017-0044","volume":"2017","author":"\u00c1 Kiss","year":"2017","unstructured":"Kiss \u00c1., Liu J., Schneider T., Asokan N., Pinkas B.: Private set intersection for unequal set sizes with mobile applications. Proceedings on Privacy Enhancing Technologies 2017(4), 177\u2013197 (2017). https:\/\/doi.org\/10.1515\/popets-2017-0044.","journal-title":"Proceedings on Privacy Enhancing Technologies"},{"key":"1238_CR33","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/11535218_15","volume-title":"Advances in Cryptology\u2014CRYPTO 2005","author":"L Kissner","year":"2005","unstructured":"Kissner L., Song D.: Privacy-preserving set operations. In: Shoup V. (ed.) Advances in Cryptology\u2014CRYPTO 2005, pp. 241\u2013257. Springer, Berlin (2005)."},{"key":"1238_CR34","doi-asserted-by":"crossref","unstructured":"Kolesnikov V., Kumaresan R., Rosulek M., Trieu N.: Efficient batched oblivious PRF with applications to private set intersection. In: Weippl E.R., Katzenbeisser S., Kruegel C., Myers A.C., Halevi S. (eds.) Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, Vienna, Austria, October 24\u201328, 2016, pp. 818\u2013829. ACM, New York (2016).","DOI":"10.1145\/2976749.2978381"},{"key":"1238_CR35","doi-asserted-by":"crossref","unstructured":"Le P.H., Ranellucci S., Gordon S.D.: Two-party private set intersection with an untrusted third party. In: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security (CCS \u201919), pp. 2403\u20132420. Association for Computing Machinery, New York (2019).","DOI":"10.1145\/3319535.3345661"},{"key":"1238_CR36","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/978-3-642-42045-0_22","volume-title":"Advances in Cryptology\u2014ASIACRYPT 2013","author":"Y Lindell","year":"2013","unstructured":"Lindell Y., Nissim K., Orlandi C.: Hiding the input-size in secure two-party computation. In: Sako K., Sarkar P. (eds.) Advances in Cryptology\u2014ASIACRYPT 2013, pp. 421\u2013440. Springer, Berlin (2013)."},{"key":"1238_CR37","doi-asserted-by":"crossref","unstructured":"Meadows C.: A more efficient cryptographic matchmaking protocol for use in the absence of a continuously available third party. In: 1986 IEEE Symposium on Security and Privacy, pp. 134\u2013134 (1986).","DOI":"10.1109\/SP.1986.10022"},{"key":"1238_CR38","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-56877-1_1","volume-title":"Advances in Cryptology\u2014CRYPTO 2020","author":"P Miao","year":"2020","unstructured":"Miao P., Patel S., Raykova M., Seth K., Yung M.: Two-sided malicious security for private intersection-sum with cardinality. In: Micciancio D., Ristenpart T. (eds.) Advances in Cryptology\u2014CRYPTO 2020, pp. 3\u201333. Springer, Cham (2020)."},{"key":"1238_CR39","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-48910-X_16","volume-title":"Advances in Cryptology\u2014EUROCRYPT \u201999","author":"P Paillier","year":"1999","unstructured":"Paillier P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern J. (ed.) Advances in Cryptology\u2014EUROCRYPT \u201999, pp. 223\u2013238. Springer, Berlin, Heidelberg (1999)."},{"key":"1238_CR40","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-030-17659-4_5","volume-title":"Advances in Cryptology\u2014EUROCRYPT 2019","author":"B Pinkas","year":"2019","unstructured":"Pinkas B., Schneider T., Tkachenko O., Yanai A.: Efficient circuit-based psi with linear communication. In: Ishai Y., Rijmen V. (eds.) Advances in Cryptology\u2014EUROCRYPT 2019, pp. 122\u2013153. Springer, Cham (2019)."},{"key":"1238_CR41","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/978-3-030-26954-8_13","volume-title":"Advances in Cryptology\u2014CRYPTO 2019","author":"B Pinkas","year":"2019","unstructured":"Pinkas B., Rosulek M., Trieu N., Yanai A.: Spot-light: lightweight private set intersection from sparse OT extension. In: Boldyreva A., Micciancio D. (eds.) Advances in Cryptology\u2014CRYPTO 2019, pp. 401\u2013431. Springer, Cham (2019)."},{"key":"1238_CR42","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1007\/978-3-030-45724-2_25","volume-title":"Advances in Cryptology\u2014EUROCRYPT 2020","author":"B Pinkas","year":"2020","unstructured":"Pinkas B., Rosulek M., Trieu N., Yanai A.: Psi from Paxos: fast, malicious private set intersection. In: Canteaut A., Ishai Y. (eds.) Advances in Cryptology\u2014EUROCRYPT 2020, pp. 739\u2013767. Springer, Cham (2020)."},{"key":"1238_CR43","doi-asserted-by":"crossref","unstructured":"Quach W., Wee H., Wichs D.: Laconic function evaluation and applications. In: Thorup M. (ed.) 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, pp. 859\u2013870. IEEE Computer Society, Paris, France (2018).","DOI":"10.1109\/FOCS.2018.00086"},{"key":"1238_CR44","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-319-56620-7_9","volume-title":"Advances in Cryptology\u2014EUROCRYPT 2017","author":"P Rindal","year":"2017","unstructured":"Rindal P., Rosulek M.: Improved private set intersection against malicious adversaries. In: Coron J.-S., Nielsen J.B. (eds.) Advances in Cryptology\u2014EUROCRYPT 2017, pp. 235\u2013259. Springer, Cham (2017)."},{"key":"1238_CR45","doi-asserted-by":"publisher","first-page":"901","DOI":"10.1007\/978-3-030-77886-6_31","volume-title":"Advances in Cryptology\u2014EUROCRYPT 2021","author":"P Rindal","year":"2021","unstructured":"Rindal P., Schoppmann P.: Vole-psi: fast OPRF and circuit-psi from vector-ole. In: Canteaut A., Standaert F.-X. (eds.) Advances in Cryptology\u2014EUROCRYPT 2021, pp. 901\u2013930. Springer, Cham (2021)."},{"key":"1238_CR46","doi-asserted-by":"publisher","first-page":"64897","DOI":"10.1109\/ACCESS.2019.2917057","volume":"7","author":"O Ruan","year":"2019","unstructured":"Ruan O., Wang Z., Mi J., Zhang M.: New approach to set representation and practical private set-intersection protocols. IEEE Access 7, 64897\u201364906 (2019). https:\/\/doi.org\/10.1109\/ACCESS.2019.2917057.","journal-title":"IEEE Access"},{"key":"1238_CR47","doi-asserted-by":"crossref","unstructured":"Ruan O., Huang X., Mao H.: An efficient private set intersection protocol for the cloud computing environments. In: 2020 IEEE 6th International Conference on Big Data Security on Cloud (BigDataSecurity), IEEE International Conference on High Performance and Smart Computing, (HPSC) and IEEE International Conference on Intelligent Data and Security (IDS), pp. 254\u2013259 (2020).","DOI":"10.1109\/BigDataSecurity-HPSC-IDS49724.2020.00053"},{"key":"1238_CR48","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1007\/978-3-662-53890-6_31","volume-title":"Advances in Cryptology\u2014ASIACRYPT 2016","author":"K Shinagawa","year":"2016","unstructured":"Shinagawa K., Nuida K., Nishide T., Hanaoka G., Okamoto E.: Size-hiding computation for multiple parties. In: Cheon J.H., Takagi T. (eds.) Advances in Cryptology\u2014ASIACRYPT 2016, pp. 937\u2013966. Springer, Berlin, Heidelberg (2016)."},{"key":"1238_CR49","unstructured":"Shoup V., et al.: NTL: a library for doing number theory (2001). https:\/\/www.shoup.net\/ntl\/."},{"key":"1238_CR50","doi-asserted-by":"publisher","first-page":"4050","DOI":"10.1109\/TIFS.2021.3101059","volume":"16","author":"Y Wang","year":"2021","unstructured":"Wang Y., Huang Q., Li H., Xiao M., Ma S., Susilo W.: Private set intersection with authorization over outsourced encrypted datasets. IEEE Trans. Inf. Forensics Secur. 16, 4050\u20134062 (2021). https:\/\/doi.org\/10.1109\/TIFS.2021.3101059.","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"1238_CR51","doi-asserted-by":"crossref","unstructured":"Zhang E., Liu F.-H., Lai Q., Jin G., Li Y.: Efficient multi-party private set intersection against malicious adversaries. In: Proceedings of the 2019 ACM SIGSAC Conference on Cloud Computing Security Workshop, pp. 93\u2013104. Association for Computing Machinery, New York (2019).","DOI":"10.1145\/3338466.3358927"},{"key":"1238_CR52","doi-asserted-by":"publisher","first-page":"6560","DOI":"10.1109\/ACCESS.2020.3048743","volume":"9","author":"E Zhang","year":"2021","unstructured":"Zhang E., Chang J., Li Y.: Efficient threshold private set intersection. IEEE Access 9, 6560\u20136570 (2021). https:\/\/doi.org\/10.1109\/ACCESS.2020.3048743.","journal-title":"IEEE Access"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01238-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-023-01238-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01238-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,28]],"date-time":"2023-08-28T12:09:14Z","timestamp":1693224554000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-023-01238-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,24]]},"references-count":52,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["1238"],"URL":"https:\/\/doi.org\/10.1007\/s10623-023-01238-0","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,24]]},"assertion":[{"value":"11 April 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 December 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 April 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 May 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}