{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T15:54:39Z","timestamp":1783007679625,"version":"3.54.5"},"publisher-location":"Cham","reference-count":55,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031911002","type":"print"},{"value":"9783031911019","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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-3-031-91101-9_12","type":"book-chapter","created":{"date-parts":[[2025,4,27]],"date-time":"2025-04-27T21:14:29Z","timestamp":1745788469000},"page":"332-362","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["The 2Hash OPRF Framework and\u00a0Efficient Post-quantum Instantiations"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0888-283X","authenticated-orcid":false,"given":"Ward","family":"Beullens","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lucas","family":"Dodgson","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-4126-3098","authenticated-orcid":false,"given":"Sebastian","family":"Faller","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2875-6198","authenticated-orcid":false,"given":"Julia","family":"Hesse","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,4,28]]},"reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/978-3-030-56784-2_10","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"M Abdalla","year":"2020","unstructured":"Abdalla, M., Barbosa, M., Bradley, T., Jarecki, S., Katz, J., Xu, J.: Universally composable relaxed password authenticated key exchange. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12170, pp. 278\u2013307. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56784-2_10"},{"key":"12_CR2","doi-asserted-by":"publisher","unstructured":"Albrecht, M.R., Davidson, A., Deo, A., Gardham, D.: Crypto dark matter on the torus - oblivious PRFs from shallow PRFs and TFHE. In: Joye, M., Leander, G. (eds.) EUROCRYPT\u00a02024, Part\u00a0VI. LNCS, vol. 14656, pp. 447\u2013476. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58751-1_16","DOI":"10.1007\/978-3-031-58751-1_16"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-030-75248-4_10","volume-title":"Public-Key Cryptography \u2013 PKC 2021","author":"MR Albrecht","year":"2021","unstructured":"Albrecht, M.R., Davidson, A., Deo, A., Smart, N.P.: Round-optimal verifiable oblivious pseudorandom functions from ideal lattices. In: Garay, J.A. (ed.) PKC 2021. LNCS, vol. 12711, pp. 261\u2013289. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75248-4_10"},{"key":"12_CR4","doi-asserted-by":"publisher","unstructured":"Albrecht, M.R., G\u00fcr, K.D.: Verifiable oblivious pseudorandom functions from lattices: practicalish and thresholdisable. In: Chung, K.M., Sasaki, Y. (eds.) ASIACRYPT\u00a02024, Part\u00a0IV. LNCS, vol. 15487, pp. 205\u2013237. Springer, Singapore (2024). https:\/\/doi.org\/10.1007\/978-981-96-0894-2_7","DOI":"10.1007\/978-981-96-0894-2_7"},{"key":"12_CR5","doi-asserted-by":"publisher","unstructured":"Bagherzandi, A., Jarecki, S., Saxena, N., Lu, Y.: Password-protected secret sharing. In: Chen, Y., Danezis, G., Shmatikov, V. (eds.) ACM CCS 2011. pp. 433\u2013444. ACM Press (2011). https:\/\/doi.org\/10.1145\/2046707.2046758","DOI":"10.1145\/2046707.2046758"},{"key":"12_CR6","unstructured":"Basso, A.: A post-quantum round-optimal oblivious PRF from isogenies. Cryptology ePrint Archive, Report 2023\/225 (2023), https:\/\/eprint.iacr.org\/2023\/225"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-030-92062-3_6","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2021","author":"A Basso","year":"2021","unstructured":"Basso, A., Kutas, P., Merz, S.-P., Petit, C., Sanso, A.: Cryptanalysis of an oblivious PRF from supersingular isogenies. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021. LNCS, vol. 13090, pp. 160\u2013184. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92062-3_6"},{"key":"12_CR8","doi-asserted-by":"publisher","unstructured":"Baum, C., et al.: Publicly verifiable zero-knowledge and post-quantum signatures from VOLE-in-the-head. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO\u00a02023, Part\u00a0V. LNCS, vol. 14085, pp. 581\u2013615. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38554-4_19","DOI":"10.1007\/978-3-031-38554-4_19"},{"key":"12_CR9","doi-asserted-by":"publisher","unstructured":"Baum, C., Frederiksen, T.K., Hesse, J., Lehmann, A., Yanai, A.: PESTO: proactively secure distributed single sign-on, or how to trust a hacked server. In: IEEE European Symposium on Security and Privacy, EuroS &P 2020, Genoa, Italy, 7\u201311 September 2020, pp. 587\u2013606. IEEE (2020). https:\/\/doi.org\/10.1109\/EUROSP48549.2020.00044,","DOI":"10.1109\/EUROSP48549.2020.00044"},{"key":"12_CR10","doi-asserted-by":"publisher","unstructured":"Beullens, W., Beyne, T., Udovenko, A., Vitto, G.: Cryptanalysis of the Legendre PRF and generalizations. IACR Trans. Symm. Cryptol. 2020(1), 313\u2013330 (2020). https:\/\/doi.org\/10.13154\/tosc.v2020.i1.313-330","DOI":"10.13154\/tosc.v2020.i1.313-330"},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-030-44223-1_8","volume-title":"Post-Quantum Cryptography","author":"W Beullens","year":"2020","unstructured":"Beullens, W., Delpech de Saint Guilhem, C.: LegRoast: efficient post-quantum signatures from the legendre PRF. In: Ding, J., Tillich, J.-P. (eds.) PQCrypto 2020. LNCS, vol. 12100, pp. 130\u2013150. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-44223-1_8"},{"key":"12_CR12","unstructured":"Beullens, W., Dodgson, L., Faller, S., Hesse, J.: The 2Hash OPRF framework and efficient post-quantum instantiations. Cryptology ePrint Archive, Report 2024\/450 (2024). https:\/\/eprint.iacr.org\/2024\/450"},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/978-3-030-34578-5_9","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"W Beullens","year":"2019","unstructured":"Beullens, W., Kleinjung, T., Vercauteren, F.: CSI-FiSh: efficient isogeny based signatures through class group computations. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019. LNCS, vol. 11921, pp. 227\u2013247. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34578-5_9"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1007\/978-3-030-03810-6_25","volume-title":"Theory of Cryptography","author":"D Boneh","year":"2018","unstructured":"Boneh, D., Ishai, Y., Passel\u00e8gue, A., Sahai, A., Wu, D.J.: Exploring crypto dark matter: In: Beimel, A., Dziembowski, S. (eds.) TCC 2018. LNCS, vol. 11240, pp. 699\u2013729. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03810-6_25"},{"key":"12_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1007\/978-3-030-64834-3_18","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"D Boneh","year":"2020","unstructured":"Boneh, D., Kogan, D., Woo, K.: Oblivious pseudorandom functions from isogenies. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12492, pp. 520\u2013550. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64834-3_18"},{"key":"12_CR16","doi-asserted-by":"publisher","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: 42nd FOCS, pp. 136\u2013145. IEEE Computer Society Press (2001). https:\/\/doi.org\/10.1109\/SFCS.2001.959888","DOI":"10.1109\/SFCS.2001.959888"},{"key":"12_CR17","doi-asserted-by":"publisher","unstructured":"Casacuberta, S., Hesse, J., Lehmann, A.: Sok: Oblivious pseudorandom functions. In: 7th IEEE European Symposium on Security and Privacy, EuroS &P 2022, Genoa, Italy, 6\u201310 June 2022, pp. 625\u2013646. IEEE (2022). https:\/\/doi.org\/10.1109\/EUROSP53844.2022.00045,","DOI":"10.1109\/EUROSP53844.2022.00045"},{"key":"12_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/978-3-030-03332-3_15","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"W Castryck","year":"2018","unstructured":"Castryck, W., Lange, T., Martindale, C., Panny, L., Renes, J.: CSIDH: an efficient post-quantum commutative group action. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11274, pp. 395\u2013427. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03332-3_15"},{"key":"12_CR19","doi-asserted-by":"publisher","unstructured":"Chen, M., Leroux, A., Panny, L.: SCALLOP-HD: group action from 2-dimensional isogenies. In: Tang, Q., Teague, V. (eds.) Public-Key Cryptography - PKC 2024 - 27th IACR International Conference on Practice and Theory of Public-Key Cryptography, Sydney, NSW, Australia, 15\u201317 April 2024, Proceedings, Part III. Lecture Notes in Computer Science, vol. 14603, pp. 190\u2013216. Springer, Heidelberg (2024). https:\/\/doi.org\/10.1007\/978-3-031-57725-3_7,","DOI":"10.1007\/978-3-031-57725-3_7"},{"key":"12_CR20","unstructured":"van Dam, W., Hallgren, S.: Efficient quantum algorithms for shifted quadratic character problems. arXiv preprint quant-ph\/0011067 (2000)"},{"key":"12_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/0-387-34799-2_13","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 88","author":"IB Damg\u00e5rd","year":"1990","unstructured":"Damg\u00e5rd, I.B.: On the randomness of legendre and jacobi sequences. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 163\u2013172. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34799-2_13"},{"key":"12_CR22","doi-asserted-by":"publisher","unstructured":"Das, P., Hesse, J., Lehmann, A.: DPaSE: distributed password-authenticated symmetric-key encryption, or how to get many keys from one password. In: Suga, Y., Sakurai, K., Ding, X., Sako, K. (eds.) ASIACCS 22, pp. 682\u2013696. ACM Press (2022). https:\/\/doi.org\/10.1145\/3488932.3517389","DOI":"10.1145\/3488932.3517389"},{"key":"12_CR23","doi-asserted-by":"publisher","unstructured":"Davies, G.T., et al.: Security analysis of the WhatsApp end-to-end encrypted backup protocol. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO\u00a02023, Part\u00a0IV. LNCS, vol. 14084, pp. 330\u2013361. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38551-3_11","DOI":"10.1007\/978-3-031-38551-3_11"},{"key":"12_CR24","doi-asserted-by":"publisher","unstructured":"De Feo, L., et al.: SCALLOP: scaling the CSI-FiSh. In: Boldyreva, A., Kolesnikov, V. (eds.) PKC\u00a02023, Part\u00a0I. LNCS, vol. 13940, pp. 345\u2013375. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-31368-4_13","DOI":"10.1007\/978-3-031-31368-4_13"},{"key":"12_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/978-3-030-84259-8_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"I Dinur","year":"2021","unstructured":"Dinur, I., et al.: MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12828, pp. 517\u2013547. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84259-8_18"},{"key":"12_CR26","unstructured":"Esgin, M.F., Steinfeld, R., Tairi, E., Xu, J.: LeOPaRd: towards practical post-quantum oblivious PRFs via interactive lattice problems. Cryptology ePrint Archive, Paper 2024\/1615 (2024). https:\/\/eprint.iacr.org\/2024\/1615"},{"key":"12_CR27","unstructured":"Everspaugh, A., Chatterjee, R., Scott, S., Juels, A., Ristenpart, T.: The pythia PRF service. In: Jung, J., Holz, T. (eds.) USENIX Security 2015, pp. 547\u2013562. USENIX Association (2015)"},{"key":"12_CR28","doi-asserted-by":"publisher","unstructured":"Faller, S., Ottenhues, A., Ottenhues, J.: Composable oblivious pseudo-random functions via garbled circuits. In: Aly, A., Tibouchi, M. (eds.) LATINCRYPT 2023, pp. 249\u2013270. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-44469-2_13","DOI":"10.1007\/978-3-031-44469-2_13"},{"issue":"2","key":"12_CR29","first-page":"52","volume":"1","author":"P Frixons","year":"2021","unstructured":"Frixons, P., Schrottenloher, A.: Quantum security of the legendre prf. Math. Cryptol. 1(2), 52\u201369 (2021)","journal-title":"Math. Cryptol."},{"key":"12_CR30","doi-asserted-by":"publisher","unstructured":"Grassi, L., Rechberger, C., Rotaru, D., Scholl, P., Smart, N.P.: MPC-friendly symmetric key primitives. In: Weippl, E.R., Katzenbeisser, S., Kruegel, C., Myers, A.C., Halevi, S. (eds.) ACM CCS 2016, pp. 430\u2013443. ACM Press (2016). https:\/\/doi.org\/10.1145\/2976749.2978332","DOI":"10.1145\/2976749.2978332"},{"key":"12_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-662-46497-7_4","volume-title":"Theory of Cryptography","author":"C Hazay","year":"2015","unstructured":"Hazay, C.: Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015. LNCS, vol. 9015, pp. 90\u2013120. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46497-7_4"},{"key":"12_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-540-78524-8_10","volume-title":"Theory of Cryptography","author":"C Hazay","year":"2008","unstructured":"Hazay, C., Lindell, Y.: Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 155\u2013175. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78524-8_10"},{"key":"12_CR33","unstructured":"Heimberger, L., Hennerbichler, T., Meisingseth, F., Ramacher, S., Rechberger, C.: OPRFs from isogenies: designs and analysis. Cryptology ePrint Archive, Report 2023\/639 (2023). https:\/\/eprint.iacr.org\/2023\/639"},{"key":"12_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-3-662-45608-8_13","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"S Jarecki","year":"2014","unstructured":"Jarecki, S., Kiayias, A., Krawczyk, H.: Round-optimal password-protected secret sharing and T-PAKE in the password-only model. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014. LNCS, vol. 8874, pp. 233\u2013253. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45608-8_13"},{"key":"12_CR35","doi-asserted-by":"publisher","unstructured":"Jarecki, S., Kiayias, A., Krawczyk, H., Xu, J.: Highly-efficient and composable password-protected secret sharing (or: How to protect your bitcoin wallet online). In: 2016 IEEE European Symposium on Security and Privacy (EuroS &P), pp. 276\u2013291. IEEE (2016). https:\/\/doi.org\/10.1109\/EuroSP.2016.30","DOI":"10.1109\/EuroSP.2016.30"},{"key":"12_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-319-61204-1_3","volume-title":"Applied Cryptography and Network Security","author":"S Jarecki","year":"2017","unstructured":"Jarecki, S., Kiayias, A., Krawczyk, H., Xu, J.: TOPPSS: cost-minimal password-protected secret sharing based on threshold OPRF. In: Gollmann, D., Miyaji, A., Kikuchi, H. (eds.) ACNS 2017. LNCS, vol. 10355, pp. 39\u201358. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-61204-1_3"},{"key":"12_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1007\/978-3-319-78372-7_15","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"S Jarecki","year":"2018","unstructured":"Jarecki, S., Krawczyk, H., Xu, J.: OPAQUE: an asymmetric PAKE protocol secure against pre-computation attacks. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10822, pp. 456\u2013486. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78372-7_15"},{"key":"12_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/978-3-030-75248-4_14","volume-title":"Public-Key Cryptography \u2013 PKC 2021","author":"S Jarecki","year":"2021","unstructured":"Jarecki, S., Krawczyk, H., Xu, J.: On the (in)security of the diffie-hellman oblivious PRF with multiplicative blinding. In: Garay, J.A. (ed.) PKC 2021. LNCS, vol. 12711, pp. 380\u2013409. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75248-4_14"},{"key":"12_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/978-3-642-00457-5_34","volume-title":"Theory of Cryptography","author":"S Jarecki","year":"2009","unstructured":"Jarecki, S., Liu, X.: Efficient oblivious pseudorandom function with applications to adaptive OT and secure computation of set intersection. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 577\u2013594. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00457-5_34"},{"key":"12_CR40","unstructured":"Kales, D., Rechberger, C., Schneider, T., Senker, M., Weinert, C.: Mobile private contact discovery at scale. In: Heninger, N., Traynor, P. (eds.) USENIX Security 2019, pp. 1447\u20131464. USENIX Association (2019)"},{"issue":"1","key":"12_CR41","doi-asserted-by":"publisher","first-page":"267","DOI":"10.2140\/obs.2020.4.267","volume":"4","author":"N Kalu\u0111erovi\u0107","year":"2020","unstructured":"Kalu\u0111erovi\u0107, N., Kleinjung, T., Kosti\u0107, D.: Cryptanalysis of the generalised legendre pseudorandom function. Open Book Series 4(1), 267\u2013282 (2020)","journal-title":"Open Book Series"},{"key":"12_CR42","unstructured":"Khovratovich, D.: Key recovery attacks on the Legendre PRFs within the birthday bound. Cryptology ePrint Archive, Report 2019\/862 (2019). https:\/\/eprint.iacr.org\/2019\/862"},{"key":"12_CR43","doi-asserted-by":"publisher","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.) ACM CCS 2016, pp. 818\u2013829. ACM Press (2016). https:\/\/doi.org\/10.1145\/2976749.2978381","DOI":"10.1145\/2976749.2978381"},{"key":"12_CR44","unstructured":"Maino, L., Martindale, C.: An attack on SIDH with arbitrary starting curve. Cryptology ePrint Archive, Report 2022\/1026 (2022). https:\/\/eprint.iacr.org\/2022\/1026"},{"key":"12_CR45","doi-asserted-by":"publisher","unstructured":"Masny, D., Rindal, P.: Endemic oblivious transfer. In: Cavallaro, L., Kinder, J., Wang, X., Katz, J. (eds.) ACM CCS 2019, pp. 309\u2013326. ACM Press (2019). https:\/\/doi.org\/10.1145\/3319535.3354210","DOI":"10.1145\/3319535.3354210"},{"key":"12_CR46","doi-asserted-by":"publisher","unstructured":"May, A., Zweydinger, F.: Legendre PRF (multiple) key attacks and the power of preprocessing. In: CSF 2022 Computer Security Foundations Symposium, pp. 428\u2013438. IEEE Computer Society Press (2022). https:\/\/doi.org\/10.1109\/CSF54842.2022.9919640","DOI":"10.1109\/CSF54842.2022.9919640"},{"key":"12_CR47","unstructured":"Mouris, D., Masny, D., Trieu, N., Sengupta, S., Buddhavarapu, P., Case, B.: Delegated private matching for compute. Cryptology ePrint Archive, Paper 2023\/012 (2023). https:\/\/eprint.iacr.org\/2023\/012"},{"key":"12_CR48","doi-asserted-by":"publisher","unstructured":"Naor, M., Reingold, O.: Number-theoretic constructions of efficient pseudo-random functions. In: 38th FOCS, pp. 458\u2013467. IEEE Computer Society Press (1997). https:\/\/doi.org\/10.1109\/SFCS.1997.646134","DOI":"10.1109\/SFCS.1997.646134"},{"key":"12_CR49","unstructured":"Peter\u00a0Rindal, L.R.: libOTe: an efficient, portable, and easy to use Oblivious Transfer Library. https:\/\/github.com\/osu-crypto\/libOTe"},{"key":"12_CR50","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.) CRYPTO\u00a02022, Part\u00a0I. LNCS, vol. 13507, pp. 657\u2013687. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_23","DOI":"10.1007\/978-3-031-15802-5_23"},{"key":"12_CR51","doi-asserted-by":"crossref","unstructured":"Seres, I.A., Horv\u00e1th, M., Burcsi, P.: The legendre pseudorandom function as a multivariate quadratic cryptosystem: security and applications. In: Applicable Algebra in Engineering, Communication and Computing, pp. 1\u201331 (2023)","DOI":"10.1007\/s00200-023-00599-2"},{"key":"12_CR52","unstructured":"Team, F.P.P.: Silk - Privacy Pass Client. Accessed 28 Jan 2024. https:\/\/addons.mozilla.org\/en-US\/firefox\/addon\/privacy-pass\/"},{"key":"12_CR53","doi-asserted-by":"publisher","unstructured":"Wang, X., Ranellucci, S., Katz, J.: Authenticated garbling and efficient maliciously secure two-party computation. In: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) ACM CCS 2017, pp. 21\u201337. ACM Press (2017). https:\/\/doi.org\/10.1145\/3133956.3134053","DOI":"10.1145\/3133956.3134053"},{"key":"12_CR54","unstructured":"WhatsApp: Security of End-To-End Encrypted Backups (2021). https:\/\/www.whatsapp.com\/security\/WhatsApp_Security_Encrypted_Backups_Whitepaper.pdf"},{"key":"12_CR55","doi-asserted-by":"publisher","unstructured":"Yang, K., Sarkar, P., Weng, C., Wang, X.: QuickSilver: efficient and affordable zero-knowledge proofs for circuits and polynomials over any field. In: Vigna, G., Shi, E. (eds.) ACM CCS 2021, pp. 2986\u20133001. ACM Press (2021). https:\/\/doi.org\/10.1145\/3460120.3484556","DOI":"10.1145\/3460120.3484556"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-91101-9_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,27]],"date-time":"2025-04-27T21:14:33Z","timestamp":1745788473000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-91101-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031911002","9783031911019"],"references-count":55,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-91101-9_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"28 April 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","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":"4 May 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 May 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}