{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T20:35:39Z","timestamp":1773693339189,"version":"3.50.1"},"publisher-location":"Cham","reference-count":37,"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_11","type":"book-chapter","created":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T10:23:55Z","timestamp":1760610235000},"page":"205-225","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Post-quantum Distributed OPRF from\u00a0the\u00a0Legendre PRF"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4309-5412","authenticated-orcid":false,"given":"Novak","family":"Kalu\u0111erovi\u0107","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2438-4080","authenticated-orcid":false,"given":"Nan","family":"Cheng","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7073-0258","authenticated-orcid":false,"given":"Aikaterini","family":"Mitrokotsa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,17]]},"reference":[{"key":"11_CR1","unstructured":"Secret sharing schemes realizing general access structures. In: Proceedings of the IEEE Global Telecommunication Conf., Globecom 87, LNCS (1987)"},{"key":"11_CR2","unstructured":"Unapproved IEEE draft standard for specifications for password based public key cryptographic techniques. In: IEEE Unapproved Std P1363.2 \/D27 (2007)"},{"key":"11_CR3","unstructured":"ISO: Information technology \u2014 security techniques \u2014 key management \u2014 part 4: mechanisms based on weak secrets. ISO\/IEC, International organization for standardization (2017). https:\/\/www.iso.org\/standard\/67933.html16"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Miao, P., Mohassel, P., Mukherjee, P.: Pasta: password-based threshold authentication. Cryptology ePrint Archive, Paper 2018\/885 (2018)","DOI":"10.1145\/3243734.3243839"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Albrecht, M.R., Davidson, A., Deo, A., Gardham, D.: Crypto dark matter on the torus: oblivious prfs from shallow prfs and fhe. Cryptology ePrint Archive, Paper 2023\/232 (2023)","DOI":"10.1007\/978-3-031-58751-1_16"},{"key":"11_CR6","unstructured":"Albrecht, M.R., Davidson, A., Deo, A., Smart, N.P.: Round-optimal verifiable oblivious pseudorandom functions from ideal lattices. Cryptology ePrint Archive, Paper 2019\/1271 (2019)"},{"key":"11_CR7","unstructured":"Baccarini, A., Blanton, M., Yuan, C.: Multi-party replicated secret sharing over a ring with applications to privacy-preserving machine learning. Cryptology ePrint Archive, Paper 2020\/1577 (2020)"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Basso, A.: A post-quantum round-optimal oblivious prf from isogenies. Cryptology ePrint Archive, Paper 2023\/225 (2023)","DOI":"10.1007\/978-3-031-53368-6_8"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Basso, A., Kutas, P., Merz, S.P., Petit, C., Sanso, A.: Cryptanalysis of an oblivious prf from supersingular isogenies. In: Advances in Cryptology \u2013 ASIACRYPT (2021)","DOI":"10.1007\/978-3-030-92062-3_6"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Baum, C., Frederiksen, T., Hesse, J., Lehmann, A., Yanai, A.: Pesto: proactively secure distributed single sign-on, or how to trust a hacked server. Cryptology ePrint Archive, Paper 2019\/1470 (2019)","DOI":"10.1109\/EuroSP48549.2020.00044"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Beullens, W., Dodgson, L., Faller, S., Hesse, J.: The 2hash oprf framework and efficient post-quantum instantiations. Cryptology ePrint Archive, Paper 2024\/450 (2024)","DOI":"10.1007\/978-3-031-91101-9_12"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Boneh, D., Kogan, D., Woo, K.: Oblivious pseudorandom functions from isogenies. Cryptology ePrint Archive, Paper 2020\/1532 (2020)","DOI":"10.1007\/978-3-030-64834-3_18"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Casacuberta, S., Hesse, J., Lehmann, A.: Sok: oblivious pseudorandom functions. Cryptology ePrint Archive, Paper 2022\/302 (2022)","DOI":"10.1109\/EuroSP53844.2022.00045"},{"issue":"3","key":"11_CR14","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s00145-023-09453-7","volume":"36","author":"K Chida","year":"2023","unstructured":"Chida, K., et al.: Fast large-scale honest-majority mpc for malicious adversaries. J. Cryptol. 36(3), 15 (2023)","journal-title":"J. Cryptol."},{"key":"11_CR15","unstructured":"Dalskov, A., Escudero, D., Keller, M.: Fantastic four:$$\\{$$Honest-Majority$$\\}\\{$$Four-Party$$\\}$$ secure computation with malicious security. In: 30th USENIX Security Symposium (USENIX Security 21), pp. 2183\u20132200 (2021)"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I.: On the randomness of Legendre and Jacobi sequences. In: Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology, CRYPTO 88, pp. 163\u2013172, London, UK, UK, Springer-Verlag (1990)","DOI":"10.1007\/0-387-34799-2_13"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Nielsen, J.B.: Scalable and unconditionally secure multiparty computation. In: Annual International Cryptology Conference, pp. 572\u2013590. Springer (2007)","DOI":"10.1007\/978-3-540-74143-5_32"},{"key":"11_CR18","unstructured":"Das, P., Hesse, J., Lehmann, A.: Dpase: distributed password-authenticated symmetric encryption. Cryptology ePrint Archive, Paper 2020\/1443 (2020)"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Dinur, I., et al.: Mpc-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications. In: Malkin, T., Peikert, C. (eds.) Advances in Cryptology \u2013 CRYPTO 2021 (2021)","DOI":"10.1007\/978-3-030-84259-8_18"},{"key":"11_CR20","unstructured":"Dodgson, L.: https:\/\/ethz.ch\/content\/dam\/ethz\/special-interest\/infk\/inst-infsec\/appliedcrypto\/education\/theses\/Master_Thesis_Post_Quantum_Building_blocks_for_secure_computation.pdf (2023)"},{"key":"11_CR21","doi-asserted-by":"crossref","unstructured":"Faller, S., Ottenhues, A., Ottenhues, J.: Composable oblivious pseudo-random functions via garbled circuits. Cryptology ePrint Archive, Paper 2023\/1176 (2023)","DOI":"10.1007\/978-3-031-44469-2_13"},{"key":"11_CR22","unstructured":"Feist, D.: Legendre pseudo-random function (2019). https:\/\/legendreprf.org\/bounties"},{"key":"11_CR23","doi-asserted-by":"crossref","unstructured":"Freedman, M.J., Ishai, Y., Pinkas, B., Reingold, O.: Keyword search and oblivious pseudorandom functions. In: Kilian, J. (ed.) Theory of Cryptography, pp. 303\u2013324, Springer, Berlin, Heidelberg (2005)","DOI":"10.1007\/978-3-540-30576-7_17"},{"key":"11_CR24","unstructured":"Frixons, P., Schrottenloher, A.: Quantum security of the legendre prf. Cryptology ePrint Archive, Paper 2021\/149 (2021)"},{"key":"11_CR25","doi-asserted-by":"crossref","unstructured":"Grassi, L., Rechberger, C., Rotaru, D., Scholl, P., Smart, N.P.: MPC-friendly symmetric key primitives. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, CCS 2016, pp. 430\u2013443, New York, NY, USA, ACM (2016)","DOI":"10.1145\/2976749.2978332"},{"key":"11_CR26","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search (1996)","DOI":"10.1145\/237814.237866"},{"key":"11_CR27","unstructured":"Hazay, C., Lindell, Y.: Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries. Cryptology ePrint Archive, Paper 2009\/045 (2009)"},{"key":"11_CR28","unstructured":"Bagherzandi, A., Jarecki, S., Saxena, N., Lu, Y.: Password-protected secret sharing. Cryptology ePrint Archive, Paper 2010\/561 (2010)"},{"key":"11_CR29","doi-asserted-by":"crossref","unstructured":"Jarecki, S., Kiayias, A., Krawczyk, H.: Round-optimal password-protected secret sharing and t-pake in the password-only model. Cryptology ePrint Archive, Paper 2014\/650 (2014)","DOI":"10.1007\/978-3-662-45608-8_13"},{"key":"11_CR30","doi-asserted-by":"crossref","unstructured":"Jarecki, S., Kiayias, A., Krawczyk, H., Xu, J.: Toppss: cost-minimal password-protected secret sharing based on threshold oprf. Cryptology ePrint Archive, Paper 2017\/363 (2017)","DOI":"10.1007\/978-3-319-61204-1_3"},{"key":"11_CR31","doi-asserted-by":"crossref","unstructured":"Jarecki, S., Liu, X.: Efficient oblivious pseudorandom function with applications to adaptive ot and secure computation of set intersection (2009)","DOI":"10.1007\/978-3-642-00457-5_34"},{"key":"11_CR32","doi-asserted-by":"crossref","unstructured":"Jarecki, S., Liu, X.: Fast secure computation of set intersection (2010)","DOI":"10.1007\/978-3-642-15317-4_26"},{"key":"11_CR33","unstructured":"Kaluderovic, N., Cheng, N., Mitrokotsa, K.: A post-quantum distributed oprf from the legendre prf. Cryptology ePrint Archive (2024)"},{"key":"11_CR34","doi-asserted-by":"crossref","unstructured":"Kalu\u0111erovi\u0107, N., Kleinjung, T., Kosti\u0107, D.: Cryptanalysis of the generalised Legendre pseudorandom function. 4, 267\u2013282 (2020)","DOI":"10.2140\/obs.2020.4.267"},{"key":"11_CR35","unstructured":"Kalu\u0111erovi\u0107, N., Kleinjung, T., Kostic, D.: Improved key recovery on the legendre prf. Cryptology ePrint Archive, Paper 2020\/098 (2020)"},{"key":"11_CR36","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1016\/j.dam.2005.03.020","volume":"154","author":"U Maurer","year":"2006","unstructured":"Maurer, U.: Secure multi-party computation made simple. Discret. Appl. Math. 154, 370\u2013381 (2006)","journal-title":"Discret. Appl. Math."},{"key":"11_CR37","unstructured":"O\u2019Connor, J., Aumasson, J.-P., Neves, S., Zooko, W.-O.: Blake3, one function fast everywhere (2020)"}],"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_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T10:24:02Z","timestamp":1760610242000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-07891-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,17]]},"ISBN":["9783032078902","9783032078919"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-07891-9_11","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"}}]}}