{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T15:29:52Z","timestamp":1777390192434,"version":"3.51.4"},"publisher-location":"Singapore","reference-count":17,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819609437","type":"print"},{"value":"9789819609444","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T00:00:00Z","timestamp":1733961600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T00:00:00Z","timestamp":1733961600000},"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":[[2025]]},"DOI":"10.1007\/978-981-96-0944-4_9","type":"book-chapter","created":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T05:54:54Z","timestamp":1733896494000},"page":"266-296","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Revisiting OKVS-Based OPRF and\u00a0PSI: Cryptanalysis and\u00a0Better Construction"],"prefix":"10.1007","author":[{"given":"Kyoohyung","family":"Han","sequence":"first","affiliation":[]},{"given":"Seongkwang","family":"Kim","sequence":"additional","affiliation":[]},{"given":"Byeonghak","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Yongha","family":"Son","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,12]]},"reference":[{"key":"9_CR1","unstructured":"Code Tables: Bounds on the parameters of various types of codes (2022), http:\/\/codetables.de\/"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Baum, C., Braun, L., de\u00a0Saint\u00a0Guilhem, C.D., Kloo\u00df, M., Orsini, E., Roy, L., Scholl, P.: Publicly Verifiable Zero-Knowledge and Post-Quantum Signatures from VOLE-in-the-Head. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology \u2013 CRYPTO 2023. pp. 581\u2013615. Springer Nature Switzerland, Cham (2023)","DOI":"10.1007\/978-3-031-38554-4_19"},{"key":"9_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: 32nd USENIX Security Symposium (USENIX Security 23). pp. 301\u2013318. USENIX Association, Anaheim, CA (Aug 2023), https:\/\/www.usenix.org\/conference\/usenixsecurity23\/presentation\/bienstock"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Resch, N., Scholl, P.: Correlated Pseudorandomness from Expand-Accumulate Codes. In: Dodis, Y., Shrimpton, T. (eds.) Advances in Cryptology \u2013 CRYPTO 2022. Springer Nature Switzerland, Cham (2022)","DOI":"10.1007\/978-3-031-15979-4_21"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Rindal, P., Scholl, P.: Efficient Two-Round OT Extension and Silent Non-Interactive Secure Computation. In: CCS 2019. pp. 291\u2013308 (2019)","DOI":"10.1145\/3319535.3354255"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Couteau, G., Rindal, P., Raghuraman, S.: Silver: Silent VOLE and Oblivious Transfer from Hardness of Decoding Structured LDPC Codes. In: CRYPTO 2021. pp. 502\u2013534. Springer, Cham (2021)","DOI":"10.1007\/978-3-030-84252-9_17"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Garimella, G., Pinkas, B., Rosulek, M., Trieu, N., Yanai, A.: Oblivious key-value stores and amplification for private set intersection. In: CRYPTO 2021. pp. 395\u2013425. Springer (2021)","DOI":"10.1007\/978-3-030-84245-1_14"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Orr\u00f9, M., Orsini, E., Scholl, P.: Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection. In: Handschuh, H. (ed.) Topics in Cryptology \u2013 CT-RSA 2017. pp. 381\u2013396. Springer International Publishing, Cham (2017)","DOI":"10.1007\/978-3-319-52153-4_22"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Pinkas, B., Rosulek, M., Trieu, N., Yanai, A.: PSI from PaXoS: fast, malicious Private Set Intersection. In: EUROCRYPT 2020. pp. 739\u2013767. Springer (2020)","DOI":"10.1007\/978-3-030-45724-2_25"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Raghuraman, S., Rindal, P.: Blazing Fast PSI from Improved OKVS and Subfield VOLE. In: CCS 2022. pp. 2505\u20132517. ACM, New York, NY, USA (2022)","DOI":"10.1145\/3548606.3560658"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Raghuraman, S., Rindal, P., Tanguy, T.: Expand-Convolute Codes for Pseudorandom Correlation Generators from LPN. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology \u2013 CRYPTO 2023. Springer Nature Switzerland, Cham (2023)","DOI":"10.1007\/978-3-031-38551-3_19"},{"key":"9_CR12","unstructured":"Rindal, P.: libOTe: an efficient, portable, and easy to use Oblivious Transfer Library (2022), https:\/\/github.com\/osu-crypto\/libOTe"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Rindal, P., Schoppmann, P.: VOLE-PSI: Fast OPRF and Circuit-PSI from Vector-OLE. In: EUROCRYPT 2021. pp. 901\u2013930. Springer, Cham (2021)","DOI":"10.1007\/978-3-030-77886-6_31"},{"key":"9_CR14","doi-asserted-by":"publisher","unstructured":"Roy, L.: SoftSpokenOT: Quieter OT Extension from Small-Field Silent VOLE in the Minicrypt Model. In: Dodis, Y., Shrimpton, T. (eds.) Advances in Cryptology - CRYPTO 2022 - 42nd Annual International Cryptology Conference, CRYPTO 2022, Santa Barbara, CA, USA, August 15-18, 2022, Proceedings, Part I. Lecture Notes in Computer Science, vol. 13507, pp. 657\u2013687. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_23, https:\/\/doi.org\/10.1007\/978-3-031-15802-5_23","DOI":"10.1007\/978-3-031-15802-5_23"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Suzuki, K., Tonien, D., Kurosawa, K., Toyota, K.: Birthday Paradox for Multi-collisions. In: Rhee, M.S., Lee, B. (eds.) Information Security and Cryptology \u2013 ICISC 2006. pp. 29\u201340. Springer Berlin Heidelberg, Berlin, Heidelberg (2006)","DOI":"10.1007\/11927587_5"},{"key":"9_CR16","unstructured":"Visa-Research: volepsi: Efficient private set intersection base on vole (2022), https:\/\/github.com\/Visa-Research\/volepsi"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Wagner, D.: A Generalized Birthday Problem. In: Yung, M. (ed.) Advances in Cryptology \u2014 CRYPTO 2002. pp. 288\u2013304. Springer Berlin Heidelberg, Berlin, Heidelberg (2002)","DOI":"10.1007\/3-540-45708-9_19"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-0944-4_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T06:12:02Z","timestamp":1733897522000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-0944-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,12]]},"ISBN":["9789819609437","9789819609444"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-0944-4_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,12]]},"assertion":[{"value":"12 December 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kolkata","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2024","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":"asiacrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}