{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T00:16:34Z","timestamp":1760660194504,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032078902","type":"print"},{"value":"9783032078919","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T00:00:00Z","timestamp":1760659200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T00:00:00Z","timestamp":1760659200000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-07891-9_3","type":"book-chapter","created":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T10:23:52Z","timestamp":1760610232000},"page":"42-62","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient One-Pass Private Set Intersection from\u00a0Pairings with\u00a0Offline Preprocessing"],"prefix":"10.1007","author":[{"given":"Joonsang","family":"Baek","sequence":"first","affiliation":[]},{"given":"Seongbong","family":"Choi","sequence":"additional","affiliation":[]},{"given":"Willy","family":"Susilo","sequence":"additional","affiliation":[]},{"given":"Partha Sarathi","family":"Roy","sequence":"additional","affiliation":[]},{"given":"Hyung Tae","family":"Lee","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,17]]},"reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-030-90456-2_4","volume-title":"Theory of Cryptography","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.) TCC 2021. LNCS, vol. 13044, pp. 94\u2013125. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90456-2_4"},{"key":"3_CR2","first-page":"111","volume":"2022","author":"DF Aranha","year":"2022","unstructured":"Aranha, D.F., Lin, C., Orlandi, C., Simkin, M.: Laconic private set-intersection from pairings. In ACM CCS 2022, 111\u2013124 (2022)","journal-title":"In ACM CCS"},{"key":"3_CR3","unstructured":"Bienstock, A., Patel, S., Seo, J.Y., Yeo, K.: Near-optimal oblivious key-value stores for efficient psi, PSU and volume-hiding multi-maps. In: USENIX Security 2023, pp. 301\u2013318. USENIX Association (2023)"},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"1311","DOI":"10.1016\/j.dam.2011.04.021","volume":"159","author":"S Chatterjee","year":"2011","unstructured":"Chatterjee, S., Menezes, A.: On cryptographic protocols employing asymmetric pairings - the role of $$\\psi $$ revisited. Discret. Appl. Math. 159, 1311\u20131322 (2011)","journal-title":"Discret. Appl. Math."},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-642-17373-8_13","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"E Cristofaro","year":"2010","unstructured":"Cristofaro, E., Kim, J., Tsudik, G.: Linear-complexity private set intersection protocols secure in malicious model. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 213\u2013231. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17373-8_13"},{"key":"3_CR6","doi-asserted-by":"publisher","unstructured":"D\u00f6ttling, N., Kolonelos, D., Lai, R.W.F., Lin, C., Malavolta, G., Rahimi, A.: Efficient Laconic Cryptography from Learning with Errors. In: Hazay, C., Stam, M. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2023. LNCS, vol. 14006. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30620-4_14","DOI":"10.1007\/978-3-031-30620-4_14"},{"key":"3_CR7","unstructured":"Aranha, D.F., et\u00a0al.: relic\u2013toolkit, Version 0.6.0 (2020). https:\/\/github.com\/relic-toolkit Accessed 1 Apr 2024"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Foundations of Cryptography: Volume II Basic Applications. Cambridge University Press (2004)","DOI":"10.1017\/CBO9780511721656"},{"key":"3_CR9","unstructured":"T.R. Group. Ristretto (2024). https:\/\/ristretto.group\/ristretto.html Accessed 1 Sep 2024"},{"key":"3_CR10","unstructured":"Heinrich, A., Matthias Hollick, T.S., Stute, M., Weinert, C.: Privatedrop: practical privacy-preserving authentication for apple airdrop. In: USENIX Security 2021, pp. 3577\u20133594. USENIX Association (2021)"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Huberman, B.A., Franklin, M., Hogg, T.: Enhancing privacy and trust in electronic communities. In: ACM EC 1999, pp. 78\u201386. ACM (1999)","DOI":"10.1145\/336992.337012"},{"key":"3_CR12","unstructured":"Ion, M., et al.: On deploying secure computing: Private intersection-sum-with-cardinality. Cryptology ePrint Archive, Paper 2019\/723 (2019). https:\/\/eprint.iacr.org\/2019\/723"},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/978-3-642-15317-4_26","volume-title":"Security and Cryptography for Networks","author":"S Jarecki","year":"2010","unstructured":"Jarecki, S., Liu, X.: Fast secure computation of set intersection. In: Garay, J.A., De Prisco, R. (eds.) SCN 2010. LNCS, vol. 6280, pp. 418\u2013435. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15317-4_26"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Meadows, C.: A more efficient cryptographic matchmaking protocol for use in the absence of available third party. In: IEEE SP 1986, pp. 134\u2013187. IEEE (1985)","DOI":"10.1109\/SP.1986.10022"},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"10567","DOI":"10.1016\/j.cosrev.2023.100567","volume":"49","author":"D Morales","year":"2023","unstructured":"Morales, D., Agudo, I., Lopez, J.: Private set intersection: a systematic literature review. Comput. Sci. Rev. 49, 10567 (2023)","journal-title":"Comput. Sci. Rev."},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-540-30574-3_19","volume-title":"Topics in Cryptology \u2013 CT-RSA 2005","author":"L Nguyen","year":"2005","unstructured":"Nguyen, L.: Accumulators from bilinear pairings and applications. In: Menezes, A. (ed.) CT-RSA 2005. LNCS, vol. 3376, pp. 275\u2013292. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30574-3_19"},{"key":"3_CR17","unstructured":"Rosulek, M.: A brief overview of private set intersection. Special Topics on Privacy and Public Auditability (STPPA) series, National Institute of Standards and Technology (2021)"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Rosulek, M., Trieu, N.: Compact and malicious private set intersection for small sets. In: ACM CCS 2021, pp. 1166\u20131181 (2021)","DOI":"10.1145\/3460120.3484778"},{"key":"3_CR19","unstructured":"O. Team. OpenSSL\u2013Cryptography and SSL\/TLS Toolkit, Version 1.1.1w (2023). https:\/\/www.openssl.org Accessed 7 Mar 2024"},{"issue":"1","key":"3_CR20","first-page":"295","volume":"12","author":"A Wu","year":"2024","unstructured":"Wu, A., Xin, X., Zhu, J., Liu, W., Song, C., Li, G.: Cloud-assisted laconic private set intersection cardinality. IEEE TCC 12(1), 295\u2013305 (2024)","journal-title":"IEEE TCC"}],"container-title":["Lecture Notes in Computer Science","Computer Security \u2013 ESORICS 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-07891-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T10:23:56Z","timestamp":1760610236000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-07891-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,17]]},"ISBN":["9783032078902","9783032078919"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-07891-9_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,17]]},"assertion":[{"value":"17 October 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ESORICS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Symposium on Research in Computer Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Toulouse","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"esorics2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.esorics2025.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}