{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T05:45:54Z","timestamp":1748583954495,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031157769"},{"type":"electronic","value":"9783031157776"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-15777-6_5","type":"book-chapter","created":{"date-parts":[[2022,8,23]],"date-time":"2022-08-23T15:24:33Z","timestamp":1661268273000},"page":"69-88","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Maliciously Secure Multi-party PSI with\u00a0Lower Bandwidth and\u00a0Faster Computation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7588-091X","authenticated-orcid":false,"given":"Zhi","family":"Qiu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7453-4043","authenticated-orcid":false,"given":"Kang","family":"Yang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9278-4521","authenticated-orcid":false,"given":"Yu","family":"Yu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7792-2669","authenticated-orcid":false,"given":"Lijing","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,24]]},"reference":[{"doi-asserted-by":"publisher","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y.: Compressing vector OLE. In: ACM Conference on Computer and Communications Security (CCS) 2018, pp. 896\u2013912. ACM Press (2018). https:\/\/doi.org\/10.1145\/3243734.3243868","key":"5_CR1","DOI":"10.1145\/3243734.3243868"},{"doi-asserted-by":"publisher","unstructured":"Boyle, E., et al.: Efficient two-round OT extension and silent non-interactive secure computation. In: ACM Conference on Computer and Communications Security (CCS) 2019, pp. 291\u2013308. ACM Press (2019). https:\/\/doi.org\/10.1145\/3319535.3354255","key":"5_CR2","DOI":"10.1145\/3319535.3354255"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/978-3-030-26954-8_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"E Boyle","year":"2019","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Scholl, P.: Efficient pseudorandom correlation generators: silent OT extension and more. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019, Part III. LNCS, vol. 11694, pp. 489\u2013518. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_16"},{"doi-asserted-by":"publisher","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Scholl, P.: Correlated pseudorandom functions from variable-density LPN, pp. 1069\u20131080. IEEE (2020). https:\/\/doi.org\/10.1109\/FOCS46700.2020.00103","key":"5_CR4","DOI":"10.1109\/FOCS46700.2020.00103"},{"doi-asserted-by":"publisher","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: 42nd Annual Symposium on Foundations of Computer Science (FOCS), pp. 136\u2013145. IEEE (2001). https:\/\/doi.org\/10.1109\/SFCS.2001.959888","key":"5_CR5","DOI":"10.1109\/SFCS.2001.959888"},{"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 the 2021 ACM SIGSAC Conference on Computer and Communications Security, CCS 2021, pp. 1182\u20131204. Association for Computing Machinery (2021)","key":"5_CR6","DOI":"10.1145\/3460120.3484591"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-030-56877-1_2","volume-title":"Advances in Cryptology \u2013 CRYPTO 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.) CRYPTO 2020, Part III. LNCS, vol. 12172, pp. 34\u201363. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_2"},{"unstructured":"Cheon, J.H., Jarecki, S., Seo, J.H.: Multi-party privacy-preserving set intersection with quasi-linear complexity. Cryptology ePrint Archive, Report 2010\/512 (2010). https:\/\/eprint.iacr.org\/2010\/512","key":"5_CR8"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-030-84252-9_17","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"G Couteau","year":"2021","unstructured":"Couteau, G., Rindal, P., Raghuraman, S.: Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12827, pp. 502\u2013534. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84252-9_17"},{"issue":"4","key":"5_CR10","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1515\/popets-2018-0037","volume":"2018","author":"D Demmler","year":"2018","unstructured":"Demmler, D., Rindal, P., Rosulek, M., Trieu, N.: PIR-PSI: scaling private contact discovery. Proc. Priv. Enhancing Technol. 2018(4), 159\u2013178 (2018)","journal-title":"Proc. Priv. Enhancing Technol."},{"doi-asserted-by":"publisher","unstructured":"Dong, C., Chen, L., Wen, Z.: When private set intersection meets big data: an efficient and scalable protocol. In: ACM Conference on Computer and Communications Security (CCS) 2013, pp. 789\u2013800. ACM Press (2013). https:\/\/doi.org\/10.1145\/2508859.2516701","key":"5_CR11","DOI":"10.1145\/2508859.2516701"},{"unstructured":"Efraim, A.B., Nissenbaum, O., Omri, E., Paskin-Cherniavsky, A.: PSimple: practical multiparty maliciously-secure private set intersection. Cryptology ePrint Archive, Report 2021\/122 (2021). https:\/\/ia.cr\/2021\/122","key":"5_CR12"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24676-3_1","volume-title":"Advances in Cryptology - EUROCRYPT 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.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 1\u201319. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24676-3_1"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/978-3-030-84245-1_14","volume-title":"Advances in Cryptology \u2013 CRYPTO 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.) CRYPTO 2021. LNCS, vol. 12826, pp. 395\u2013425. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_14"},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-030-17659-4_6","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 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.) EUROCRYPT 2019, Part III. LNCS, vol. 11478, pp. 154\u2013185. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_6"},{"key":"5_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-662-54365-8_8","volume-title":"Public-Key Cryptography \u2013 PKC 2017","author":"C Hazay","year":"2017","unstructured":"Hazay, C., Venkitasubramaniam, M.: Scalable multi-party private set-intersection. In: Fehr, S. (ed.) PKC 2017, Part I. LNCS, vol. 10174, pp. 175\u2013203. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54365-8_8"},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-319-98113-0_13","volume-title":"Security and Cryptography for Networks","author":"R Inbar","year":"2018","unstructured":"Inbar, R., Omri, E., Pinkas, B.: Efficient scalable multiparty private set-intersection via garbled bloom filters. In: Catalano, D., De Prisco, R. (eds.) SCN 2018. LNCS, vol. 11035, pp. 235\u2013252. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98113-0_13"},{"doi-asserted-by":"crossref","unstructured":"Ion, M., et al.: On deploying secure computing: private intersection-sum-with-cardinality. In: 2020 IEEE European Symposium on Security and Privacy (EuroS &P), pp. 370\u2013389 (2020)","key":"5_CR18","DOI":"10.1109\/EuroSP48549.2020.00031"},{"unstructured":"Ion, M., et al.: Private intersection-sum protocol with applications to attributing aggregate ad conversions. Cryptology ePrint Archive, Report 2017\/738 (2017). https:\/\/eprint.iacr.org\/2017\/738","key":"5_CR19"},{"unstructured":"Kales, D., Rechberger, C., Schneider, T., Senker, M., Weinert, C.: Mobile private contact discovery at scale. In: 28th USENIX Security Symposium (USENIX Security 2019), pp. 1447\u20131464 (2019)","key":"5_CR20"},{"doi-asserted-by":"crossref","unstructured":"Kavousi, A., Mohajeri, J., Salmasizadeh, M.: Efficient scalable multi-party private set intersection using oblivious PRF. Cryptology ePrint Archive, Report 2021\/484 (2021). https:\/\/ia.cr\/2021\/484","key":"5_CR21","DOI":"10.1007\/978-3-030-91859-0_5"},{"key":"5_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/11535218_15","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"L Kissner","year":"2005","unstructured":"Kissner, L., Song, D.: Privacy-preserving set operations. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 241\u2013257. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11535218_15"},{"doi-asserted-by":"publisher","unstructured":"Kolesnikov, V., Matania, N., Pinkas, B., Rosulek, M., Trieu, N.: Practical multi-party private set intersection from symmetric-key techniques. In: ACM Conference on Computer and Communications Security (CCS) 2017, pp. 1257\u20131272. ACM Press (2017). https:\/\/doi.org\/10.1145\/3133956.3134065","key":"5_CR23","DOI":"10.1145\/3133956.3134065"},{"doi-asserted-by":"crossref","unstructured":"Nevo, O., Trieu, N., Yanai, A.: Simple, fast malicious multiparty private set intersection. In: Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security, CCS 2021, pp. 1151\u20131165. Association for Computing Machinery (2021)","key":"5_CR24","DOI":"10.1145\/3460120.3484772"},{"unstructured":"Nguyen, D.T., Trieu, N.: MPCCache: privacy-preserving multi-party cooperative cache sharing at the edge. Cryptology ePrint Archive, Report 2021\/317 (2021). https:\/\/ia.cr\/2021\/317","key":"5_CR25"},{"key":"5_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/978-3-030-26954-8_13","volume-title":"Advances in Cryptology \u2013 CRYPTO 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.) CRYPTO 2019, Part III. LNCS, vol. 11694, pp. 401\u2013431. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_13"},{"key":"5_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1007\/978-3-030-45724-2_25","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 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.) EUROCRYPT 2020, Part II. LNCS, vol. 12106, pp. 739\u2013767. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_25"},{"unstructured":"Qiu, Z., Yang, K., Yu, Y., Zhou, L.: Maliciously secure multi-party PSI with lower bandwidth and faster computation. Cryptology ePrint Archive, Paper 2022\/772 (2022). https:\/\/eprint.iacr.org\/2022\/772","key":"5_CR28"},{"doi-asserted-by":"crossref","unstructured":"Rindal, P., Raghuraman, S.: Blazing fast PSI from improved OKVS and subfield vole. Cryptology ePrint Archive, Report 2022\/320 (2022). https:\/\/ia.cr\/2022\/320","key":"5_CR29","DOI":"10.1145\/3548606.3560658"},{"key":"5_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-319-56620-7_9","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 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.) EUROCRYPT 2017, Part I. LNCS, vol. 10210, pp. 235\u2013259. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56620-7_9"},{"key":"5_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"901","DOI":"10.1007\/978-3-030-77886-6_31","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 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.) EUROCRYPT 2021. LNCS, vol. 12697, pp. 901\u2013930. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77886-6_31"},{"doi-asserted-by":"crossref","unstructured":"Sang, Y., Shen, H.: Privacy preserving set intersection protocol secure against malicious behaviors. In: Proceedings of the Eighth International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2007, pp. 461\u2013468. IEEE Computer Society (2007)","key":"5_CR32","DOI":"10.1109\/PDCAT.2007.4420204"},{"unstructured":"Sang, Y., Shen, H.: Privacy preserving set intersection based on bilinear groups. In: The 31th Australasian Computer Science Conference, ACSC 2008, vol. 74, pp. 47\u201354. Australian Computer Society (2008)","key":"5_CR33"},{"doi-asserted-by":"publisher","unstructured":"Schoppmann, P., Gasc\u00f3n, A., Reichert, L., Raykova, M.: Distributed vector-OLE: improved constructions and implementation. In: ACM Conference on Computer and Communications Security (CCS) 2019, pp. 1055\u20131072. ACM Press (2019). https:\/\/doi.org\/10.1145\/3319535.3363228","key":"5_CR34","DOI":"10.1145\/3319535.3363228"},{"doi-asserted-by":"crossref","unstructured":"Weng, C., Yang, K., Katz, J., Wang, X.: Wolverine: fast, scalable, and communication-efficient zero-knowledge proofs for Boolean and arithmetic circuits. In: 2021 IEEE Symposium on Security and Privacy (SP), pp. 1074\u20131091 (2021)","key":"5_CR35","DOI":"10.1109\/SP40001.2021.00056"},{"doi-asserted-by":"publisher","unstructured":"Yang, K., Weng, C., Lan, X., Zhang, J., Wang, X.: Ferret: fast extension for correlated OT with small communication. In: ACM Conference on Computer and Communications Security (CCS) 2020, pp. 1607\u20131626. ACM Press (2020). https:\/\/doi.org\/10.1145\/3372297.3417276","key":"5_CR36","DOI":"10.1145\/3372297.3417276"},{"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, CCSW 2019, pp. 93\u2013104. Association for Computing Machinery (2019)","key":"5_CR37","DOI":"10.1145\/3338466.3358927"}],"container-title":["Lecture Notes in Computer Science","Information and Communications Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-15777-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T17:06:21Z","timestamp":1709831181000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15777-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031157769","9783031157776"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15777-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"24 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}