{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T23:02:49Z","timestamp":1765062169558,"version":"3.44.0"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032019004","type":"print"},{"value":"9783032019011","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-032-01901-1_18","type":"book-chapter","created":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T08:45:02Z","timestamp":1755333902000},"page":"569-597","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Fully-Adaptive Threshold Partially-Oblivious PRF"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-9310-8964","authenticated-orcid":false,"given":"Ruben","family":"Baecker","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0164-0187","authenticated-orcid":false,"given":"Paul","family":"Gerhart","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1901-3659","authenticated-orcid":false,"given":"Daniel","family":"Rausch","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6943-8914","authenticated-orcid":false,"given":"Dominique","family":"Schr\u00f6der","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,17]]},"reference":[{"key":"18_CR1","unstructured":"Barker, E.: NIST Special Publication 800-57 Part 1, Revision 5. https:\/\/nvlpubs.nist.gov\/nistpubs\/SpecialPublications\/NIST.SP.800- 57pt1r5.pdf. Accessed 21 Jan 2025"},{"key":"18_CR2","doi-asserted-by":"publisher","unstructured":"Baum, C., et al.: PESTO: proactively secure distributed single sign-on, or how to trust a hacked server. In: 2020 IEEE European Symposium on Security and Privacy (EuroS &P), pp. 587\u2013606. IEEE Computer Society, Los Alamitos (2020). https:\/\/doi.org\/10.1109\/EuroSP48549.2020.00044","DOI":"10.1109\/EuroSP48549.2020.00044"},{"key":"18_CR3","unstructured":"Bourdrez, D., et al.: The OPAQUE Augmented PAKE Protocol. https:\/\/datatracker.ietf.org\/doc\/draft-irtf-cfrg-opaque\/. Accessed 10 Feb 2024"},{"key":"18_CR4","doi-asserted-by":"publisher","unstructured":"Brost, J., et al.: Threshold password-hardened encryption services. In: Ligatti, J., et al. (eds.) ACM CCS 2020: 27th Conference on Computer and Communications Security, pp. 409\u2013424. ACM Press (2020). https:\/\/doi.org\/10.1145\/3372297.3417266","DOI":"10.1145\/3372297.3417266"},{"key":"18_CR5","doi-asserted-by":"publisher","unstructured":"Camenisch, J., Lehmann, A., Neven, G.: Optimal distributed password verification. In: Ray, I., Li, N., Kruegel, C. (eds.) ACM CCS 2015: 22nd Conference on Computer and Communications Security, pp. 182\u2013194. ACM Press (2015). https:\/\/doi.org\/10.1145\/2810103.2813722","DOI":"10.1145\/2810103.2813722"},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-030-34618-8_7","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"J Camenisch","year":"2019","unstructured":"Camenisch, J., Krenn, S., K\u00fcsters, R., Rausch, D.: iUC: flexible universal composability made simple. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019. LNCS, vol. 11923, pp. 191\u2013221. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34618-8_7"},{"key":"18_CR7","doi-asserted-by":"publisher","unstructured":"Canetti, R.: Universally composable security. J. ACM 67(5), 28:1\u201328:94 (2020). https:\/\/doi.org\/10.1145\/3402457","DOI":"10.1145\/3402457"},{"key":"18_CR8","doi-asserted-by":"publisher","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: 42nd Annual Symposium on Foundations of Computer Science, pp. 136\u2013145. IEEE Computer Society Press (2001). https:\/\/doi.org\/10.1109\/SFCS.2001.959888","DOI":"10.1109\/SFCS.2001.959888"},{"key":"18_CR9","doi-asserted-by":"publisher","unstructured":"Casacuberta, S., Hesse, J., Lehmann, A.: SoK: oblivious pseudorandom functions. In: 2022 IEEE 7th European Symposium on Security and Privacy (EuroS &P), pp. 625\u2013646. IEEE Computer Society, Los Alamitos (2022). https:\/\/doi.org\/10.1109\/EuroSP53844.2022.00045","DOI":"10.1109\/EuroSP53844.2022.00045"},{"key":"18_CR10","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: Proceedings of the 2022 ACM on Asia Conference on Computer and Communications Security, pp. 682\u2013696. Association for Computing Machinery, New York (2022). https:\/\/doi.org\/10.1145\/3488932.3517389","DOI":"10.1145\/3488932.3517389"},{"key":"18_CR11","doi-asserted-by":"publisher","unstructured":"Davidson, A., et al.: Privacy pass: bypassing internet challenges anonymously. Proc. Priv. Enhancing Technol. 2018(3), 164\u2013180 (2018). https:\/\/doi.org\/10.1515\/popets-2018-0026","DOI":"10.1515\/popets-2018-0026"},{"key":"18_CR12","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 2023, Part IV. 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":"18_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-642-40084-1_8","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"A Escala","year":"2013","unstructured":"Escala, A., Herold, G., Kiltz, E., R\u00e0fols, C., Villar, J.: An algebraic framework for Diffie-Hellman assumptions. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8043, pp. 129\u2013147. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40084-1_8"},{"key":"18_CR14","unstructured":"Everspaugh, A., et al.: The Pythia PRF service. In: Jung, J., Holz, T. (eds.) USENIX Security 2015: 24th USENIX Security Symposium, pp. 547\u2013562. USENIX Association (2015)"},{"key":"18_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-319-96881-0_2","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"G Fuchsbauer","year":"2018","unstructured":"Fuchsbauer, G., Kiltz, E., Loss, J.: The algebraic group model and its applications. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10992, pp. 33\u201362. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96881-0_2"},{"key":"18_CR16","unstructured":"Google. Google Cloud KMS Documentation: Key rotation. https:\/\/cloud.google.com\/kms\/docs\/key-rotation. Accessed 21 Jan 2025"},{"key":"18_CR17","doi-asserted-by":"publisher","unstructured":"Gu, Y., et al.: Threshold PAKE with security against compromise of all servers. In: Chung, K.-M., Sasaki, Y. (eds.) ASIACRYPT 2024, Part V. LNCS, vol. 15488, pp. 66\u2013100. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-981-96-0935-2_3","DOI":"10.1007\/978-981-96-0935-2_3"},{"issue":"3","key":"18_CR18","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s00145-013-9160-y","volume":"28","author":"D Hofheinz","year":"2013","unstructured":"Hofheinz, D., Shoup, V.: GNUC: a new universal composability framework. J. Cryptol. 28(3), 423\u2013508 (2013). https:\/\/doi.org\/10.1007\/s00145-013-9160-y","journal-title":"J. Cryptol."},{"key":"18_CR19","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":"18_CR20","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":"18_CR21","doi-asserted-by":"publisher","unstructured":"Jarecki, S., et al.: 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 (2016). https:\/\/doi.org\/10.1109\/EuroSP.2016.30.","DOI":"10.1109\/EuroSP.2016.30."},{"key":"18_CR22","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":"18_CR23","doi-asserted-by":"publisher","unstructured":"Katsumata, S., Reichle, M., Takemure, K.: Adaptively secure 5 round threshold signatures from MLWE\/MSIS and DL with rewinding. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024, Part VII. LNCS, vol. 14926, pp. 459\u2013491. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68394-7_15","DOI":"10.1007\/978-3-031-68394-7_15"},{"issue":"4","key":"18_CR24","doi-asserted-by":"publisher","first-page":"1461","DOI":"10.1007\/s00145-020-09352-1","volume":"33","author":"R K\u00fcsters","year":"2020","unstructured":"K\u00fcsters, R., Tuengerthal, M., Rausch, D.: The IITM model: a simple and expressive model for universal composability. J. Cryptol. 33(4), 1461\u20131584 (2020). https:\/\/doi.org\/10.1007\/s00145-020-09352-1","journal-title":"J. Cryptol."},{"key":"18_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-14577-3_1","volume-title":"Financial Cryptography and Data Security","author":"U Maurer","year":"2010","unstructured":"Maurer, U.: Constructive cryptography \u2013 a primer. In: Sion, R. (ed.) FC 2010. LNCS, vol. 6052, pp. 1\u20131. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14577-3_1"},{"key":"18_CR26","unstructured":"OWASP Cheat Sheets Series Team. Cryptographic Storage Cheat Sheet. https:\/\/cheatsheetseries.owasp.org\/cheatsheets\/Cryptographic_Storage_Cheat_Sheet.html. Accessed 12 Feb 2025"},{"key":"18_CR27","doi-asserted-by":"publisher","unstructured":"Del Pino, R., et al.: Threshold raccoon: practical threshold signatures from standard lattice assumptions. In: Joye, M., Leander, G. (eds.) EUROCRYPT 2024, Part II. LNCS, vol. 14652, pp. 219\u2013248. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58723-8_8","DOI":"10.1007\/978-3-031-58723-8_8"},{"key":"18_CR28","unstructured":"Security Standards Council. PCI DSS v4.0.1 (Section 15, 3.7.4 and 3.7.5). https:\/\/docs-prv.pcisecuritystandards.org\/PCI%20DSS\/Standard\/PCI-DSS-v4_0_1.pdf. Accessed 21 Jan 2025"},{"issue":"11","key":"18_CR29","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. Assoc. Comput. Mach. 22(11), 612\u2013613 (1979). https:\/\/doi.org\/10.1145\/359168.359176","journal-title":"Commun. Assoc. Comput. Mach."},{"key":"18_CR30","unstructured":"Stieglitz, J.: The curious case of faster AWS KMS symmetric key rotation. https:\/\/aws.amazon.com\/blogs\/security\/the-curiouscase-of-faster-aws-kms-symmetric-key-rotation\/. Accessed 12 Feb 2025"},{"key":"18_CR31","unstructured":"WhatsApp. Security of End-To-End Encrypted Backups (2021). www.whatsapp.com\/security\/WhatsApp_Security_Encrypted_Backups_Whitepaper.pdf. Accessed 10 Feb 2024"},{"key":"18_CR32","doi-asserted-by":"publisher","unstructured":"Zhang, C., Zhou, H.-S., Katz, J.: An analysis of the algebraic group model. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT 2022, Part IV. LNCS, vol. 13794, pp. 310\u2013322. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22972-5_11","DOI":"10.1007\/978-3-031-22972-5_11"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-01901-1_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T08:45:05Z","timestamp":1755333905000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01901-1_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783032019004","9783032019011"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01901-1_18","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":"17 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"17 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}