{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:54:01Z","timestamp":1743076441002,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031180668"},{"type":"electronic","value":"9783031180675"}],"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.springer.com\/tdm"},{"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.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-18067-5_9","type":"book-chapter","created":{"date-parts":[[2022,9,28]],"date-time":"2022-09-28T07:07:51Z","timestamp":1664348871000},"page":"118-132","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficient and\u00a0Collusion Resistant Multi-party Private Set Intersection Protocols for\u00a0Large Participants and\u00a0Small Sets Setting"],"prefix":"10.1007","author":[{"given":"Lifei","family":"Wei","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jihai","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wuji","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,29]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Baldi, P., Baronio, R., De Cristofaro, 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 (ACM CCS 2011), pp. 691\u2013702. ACM (2011)","DOI":"10.1145\/2046707.2046785"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-56877-1_1","volume-title":"Advances in Cryptology \u2013 CRYPTO 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.) CRYPTO 2020. LNCS, vol. 12172, pp. 3\u201333. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_1"},{"key":"9_CR3","unstructured":"Heinrich, A., Hollick, M., Schneider, T., Stute, M., Weinert, C.: PrivateDrop: practical privacy-preserving authentication for apple airdrop. In: 30th USENIX Security Symposium (USENIX Security 2021), pp. 3577\u20133594. USENIX Association (2021)"},{"key":"9_CR4","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., Alishahi, M., 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":"9_CR5","doi-asserted-by":"crossref","unstructured":"Bay, A., Erkin, Z., Alishahi, M., Vos, J.: Multi-party private set intersection protocols for practical applications. IEEE Trans. Inf. Forensics Secur. (2021). (SECRYPT 2021), pp. 515\u2013522. SciTePress","DOI":"10.5220\/0010547600002998"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-540-45146-4_9","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"Y Ishai","year":"2003","unstructured":"Ishai, Y., Kilian, J., Nissim, K., Petrank, E.: Extending oblivious transfers efficiently. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 145\u2013161. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_9"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-642-40084-1_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"V Kolesnikov","year":"2013","unstructured":"Kolesnikov, V., Kumaresan, R.: Improved OT extension for transferring short secrets. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8043, pp. 54\u201370. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40084-1_4"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Schoppmann, P., Gasc\u00f3n, A., Reichert, L., Raykova, M.: Distributed vector-OLE: improved constructions and implementation. In: 26th ACM Conference on Computer and Communications Security (ACM CCS 2019), pp. 1055\u20131072. ACM (2019)","DOI":"10.1145\/3319535.3363228"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Kolesnikov, V., Kumaresan, R., Rosulek, M., Trieu, N.: Efficient batched oblivious PRF with applications to private set intersection. In: 23rd ACM Conference on Computer and Communications Security (ACM CCS 2016), pp. 818\u2013829. ACM (2016)","DOI":"10.1145\/2976749.2978381"},{"key":"9_CR10","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. LNCS, vol. 11694, pp. 401\u2013431. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_13"},{"key":"9_CR11","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. LNCS, vol. 12106, pp. 739\u2013767. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_25"},{"key":"9_CR12","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. LNCS, vol. 12172, pp. 34\u201363. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_2"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Rindal, P., Schoppmann, P.: VOLE-PSI: fast OPRF and circuit-psi from vector-OLE. IACR Cryptology ePrint Archive 2021\/266 (2021)","DOI":"10.1007\/978-3-030-77886-6_31"},{"key":"9_CR14","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: 24th ACM Conference on Computer and Communications Security (ACM CCS 2017), pp. 1257\u20131272. ACM (2017)","DOI":"10.1145\/3133956.3134065"},{"key":"9_CR15","doi-asserted-by":"crossref","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)","DOI":"10.1145\/3133956.3134061"},{"issue":"1","key":"9_CR16","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s13389-020-00242-7","volume":"11","author":"AC Davi Resende","year":"2020","unstructured":"Davi Resende, A.C., de Freitas Aranha, D.: Faster unbalanced Private Set Intersection in the semi-honest setting. J. Cryptogr. Eng. 11(1), 21\u201338 (2020). https:\/\/doi.org\/10.1007\/s13389-020-00242-7","journal-title":"J. Cryptogr. Eng."},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Rosulek, M., Trieu, N.: Compact and malicious private set intersection for small sets. In: 28th ACM Conference on Computer and Communications Security (ACM CCS 2021), pp. 1166\u20131181. ACM (2021)","DOI":"10.1145\/3460120.3484778"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Meadows, C.A.: A more efficient cryptographic matchmaking protocol for use in the absence of a continuously available third party. In: IEEE Symposium on Security and Privacy (IEEE S &P 1986), pp. 134\u2013137. IEEE (1986)","DOI":"10.1109\/SP.1986.10022"},{"key":"9_CR19","unstructured":"Huberman, B.A., Franklin, M., Hogg, T.: Proceedings of the 1st ACM Conference on Electronic Commerce, pp. 78\u201386 (1999)"},{"key":"9_CR20","unstructured":"Pinkas, B., Schneider, T., Zohner, M.: Faster private set intersection based on OT extension. In: 23rd USENIX Security Symposium (USENIX Security 2014), pp. 797\u2013812. USENIX Association (2014)"},{"key":"9_CR21","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: 28th ACM Conference on Computer and Communications Security (ACM CCS 2021), pp. 1182\u20131204. ACM (2021)","DOI":"10.1145\/3460120.3484591"},{"key":"9_CR22","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. LNCS, vol. 10174, pp. 175\u2013203. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54365-8_8"},{"key":"9_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-642-04904-0_28","volume-title":"Security Protocols","author":"F Hao","year":"2009","unstructured":"Hao, F., Zieli\u0144ski, P.: A 2-round anonymous veto protocol. In: Christianson, B., Crispo, B., Malcolm, J.A., Roe, M. (eds.) Security Protocols 2006. LNCS, vol. 5087, pp. 202\u2013211. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04904-0_28"},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., Hamburg, M., Krasnova, A., Lange, T.: Elligator: elliptic-curve points indistinguishable from uniform random strings. In: 20th ACM Conference on Computer and Communications Security (ACM CCS 2013), pp. 967\u2013980. ACM (2013)","DOI":"10.1145\/2508859.2516734"},{"key":"9_CR25","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":"9_CR26","doi-asserted-by":"crossref","unstructured":"Nevo, O., Trieu, N., Yanai, A.: Simple, fast malicious multiparty private set intersection. In: 28th ACM Conference on Computer and Communications Security (ACM CCS 2021), pp. 1151\u20131165. ACM (2021)","DOI":"10.1145\/3460120.3484772"}],"container-title":["Lecture Notes in Computer Science","Cyberspace Safety and Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-18067-5_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,29]],"date-time":"2022-09-29T23:11:14Z","timestamp":1664493074000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-18067-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031180668","9783031180675"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-18067-5_9","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":"29 September 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Cyberspace Safety and Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"css2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/css2021.compute.dtu.dk\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}