{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T17:13:09Z","timestamp":1778087589315,"version":"3.51.4"},"publisher-location":"Cham","reference-count":64,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032253163","type":"print"},{"value":"9783032253170","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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-25317-0_10","type":"book-chapter","created":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T16:35:45Z","timestamp":1778085345000},"page":"284-313","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["OneTwoPAKE: Two-Round Strong Asymmetric PAKE with Ideal Security"],"prefix":"10.1007","author":[{"given":"Yashvanth","family":"Kondi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ian","family":"McQuoid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kelsey","family":"Melissaris","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claudio","family":"Orlandi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lawrence","family":"Roy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"LaKyah","family":"Tyner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,7]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","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.) Advances in Cryptology \u2013 CRYPTO\u00a02020, Part\u00a0I. Lecture Notes in Computer Science, vol. 12170, pp. 278\u2013307. Springer, Heidelberg (Aug 2020).","DOI":"10.1007\/978-3-030-56784-2_10"},{"key":"10_CR2","unstructured":"Ahrens, K., Zumbr\u00e4gel, J.: Defend: towards verifiable delay functions from endomorphism rings. Cryptology ePrint Archive (2023)"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Albrecht, M.R., Davidson, A., Deo, A., Smart, N.P.: Round-optimal verifiable oblivious pseudorandom functions from ideal lattices. In: Garay, J. (ed.) PKC\u00a02021: 24th International Conference on Theory and Practice of Public Key Cryptography, Part\u00a0II. Lecture Notes in Computer Science, vol. 12711, pp. 261\u2013289. Springer, Heidelberg (May 2021).","DOI":"10.1007\/978-3-030-75248-4_10"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Barreto, P.S.L.M., Lynn, B., Scott, M.: Constructing elliptic curves with prescribed embedding degrees. In: Cimato, S., Galdi, C., Persiano, G. (eds.) SCN 02: 3rd International Conference on Security in Communication Networks. Lecture Notes in Computer Science, vol.\u00a02576, pp. 257\u2013267. Springer, Heidelberg (Sep 2003).","DOI":"10.1007\/3-540-36413-7_19"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Barreto, P.S.L.M., Naehrig, M.: Pairing-friendly elliptic curves of prime order. In: Preneel, B., Tavares, S. (eds.) SAC 2005: 12th Annual International Workshop on Selected Areas in Cryptography. Lecture Notes in Computer Science, vol.\u00a03897, pp. 319\u2013331. Springer, Heidelberg (Aug 2006).","DOI":"10.1007\/11693383_22"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Barthe, G., Fagerholm, E., Fiore, D., Mitchell, J.C., Scedrov, A., Schmidt, B.: Automated analysis of cryptographic assumptions in generic group models. In: Garay, J.A., Gennaro, R. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02014, Part\u00a0I. Lecture Notes in Computer Science, vol.\u00a08616, pp. 95\u2013112. Springer, Heidelberg (Aug 2014).","DOI":"10.1007\/978-3-662-44371-2_6"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Bellovin, S.M., Merritt, M.: Augmented encrypted key exchange: A password-based protocol secure against dictionary attacks and password file compromise. In: Denning, D.E., Pyle, R., Ganesan, R., Sandhu, R.S., Ashby, V. (eds.) ACM CCS 93: 1st Conference on Computer and Communications Security. pp. 244\u2013250. ACM Press (Nov 1993).","DOI":"10.1145\/168588.168618"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Benhamouda, F., Couteau, G., Pointcheval, D., Wee, H.: Implicit zero-knowledge arguments and applications to the malicious setting. In: Gennaro, R., Robshaw, M.J.B. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02015, Part\u00a0II. Lecture Notes in Computer Science, vol.\u00a09216, pp. 107\u2013129. Springer, Heidelberg (Aug 2015).","DOI":"10.1007\/978-3-662-48000-7_6"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Biryukov, A., Dinu, D., Khovratovich, D.: Argon2: New generation of memory-hard functions for password hashing and other applications. In: 2016 IEEE European Symposium on Security and Privacy (EuroS&P). pp. 292\u2013302 (2016).","DOI":"10.1109\/EuroSP.2016.31"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Boneh, D., Boyen, X.: Secure identity based encryption without random oracles. In: Franklin, M. (ed.) Advances in Cryptology \u2013 CRYPTO\u00a02004. Lecture Notes in Computer Science, vol.\u00a03152, pp. 443\u2013459. Springer, Heidelberg (Aug 2004).","DOI":"10.1007\/978-3-540-28628-8_27"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Boneh, D., Boyen, X.: Short signatures without random oracles. In: Cachin, C., Camenisch, J. (eds.) Advances in Cryptology \u2013 EUROCRYPT\u00a02004. Lecture Notes in Computer Science, vol.\u00a03027, pp. 56\u201373. Springer, Heidelberg (May 2004).","DOI":"10.1007\/978-3-540-24676-3_4"},{"key":"10_CR12","unstructured":"Bourdrez, D., Krawczyk, H., Lewi, K., Wood, C.: The opaque asymmetric pake protocol (2023), https:\/\/cfrg.github.io\/draft-irtf-cfrg-opaque\/draft-irtf-cfrg-opaque.html, https:\/\/cfrg.github.io\/draft-irtf-cfrg-opaque\/draft-irtf-cfrg-opaque.html"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Bradley, T., Jarecki, S., Xu, J.: Strong asymmetric PAKE based on trapdoor CKEM. In: Boldyreva, A., Micciancio, D. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02019, Part\u00a0III. Lecture Notes in Computer Science, vol. 11694, pp. 798\u2013825. Springer, Heidelberg (Aug 2019).","DOI":"10.1007\/978-3-030-26954-8_26"},{"key":"10_CR14","doi-asserted-by":"publisher","unstructured":"Camenisch, J., Lehmann, A.: Privacy-preserving user-auditable pseudonym systems. In: 2017 IEEE European Symposium on Security and Privacy, EuroS&P 2017, Paris, France, April 26-28, 2017. pp. 269\u2013284. IEEE (2017). , https:\/\/doi.org\/10.1109\/EuroSP.2017.36","DOI":"10.1109\/EuroSP.2017.36"},{"key":"10_CR15","doi-asserted-by":"crossref","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 (Oct 2001).","DOI":"10.1109\/SFCS.2001.959888"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Canetti, R., Gennaro, R., Goldfeder, S., Makriyannis, N., Peled, U.: UC non-interactive, proactive, threshold ECDSA with identifiable aborts. In: Ligatti, J., Ou, X., Katz, J., Vigna, G. (eds.) ACM CCS 2020: 27th Conference on Computer and Communications Security. pp. 1769\u20131787. ACM Press (Nov 2020).","DOI":"10.1145\/3372297.3423367"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Canetti, R., Halevi, S., Katz, J., Lindell, Y., MacKenzie, P.D.: Universally composable password-based key exchange. In: Cramer, R. (ed.) Advances in Cryptology \u2013 EUROCRYPT\u00a02005. Lecture Notes in Computer Science, vol.\u00a03494, pp. 404\u2013421. Springer, Heidelberg (May 2005).","DOI":"10.1007\/11426639_24"},{"key":"10_CR18","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, June 6-10, 2022. pp. 625\u2013646. IEEE (2022). , https:\/\/doi.org\/10.1109\/EuroSP53844.2022.00045","DOI":"10.1109\/EuroSP53844.2022.00045"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Castagnos, G., Catalano, D., Laguillaumie, F., Savasta, F., Tucker, I.: Two-party ECDSA from hash proof systems and efficient instantiations. In: Boldyreva, A., Micciancio, D. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02019, Part\u00a0III. Lecture Notes in Computer Science, vol. 11694, pp. 191\u2013221. Springer, Heidelberg (Aug 2019).","DOI":"10.1007\/978-3-030-26954-8_7"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Castagnos, G., Laguillaumie, F.: Linearly homomorphic encryption from DDH. In: Nyberg, K. (ed.) Topics in Cryptology \u2013 CT-RSA\u00a02015. Lecture Notes in Computer Science, vol.\u00a09048, pp. 487\u2013505. Springer, Heidelberg (Apr 2015)","DOI":"10.1007\/978-3-319-16715-2_26"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Chase, M., Meiklejohn, S.: D\u00e9j\u00e0 Q: Using dual systems to revisit q-type assumptions. In: Nguyen, P.Q., Oswald, E. (eds.) Advances in Cryptology \u2013 EUROCRYPT\u00a02014. Lecture Notes in Computer Science, vol.\u00a08441, pp. 622\u2013639. Springer, Heidelberg (May 2014).","DOI":"10.1007\/978-3-642-55220-5_34"},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"Cheon, J.H.: Security analysis of the strong Diffie-Hellman problem. In: Vaudenay, S. (ed.) Advances in Cryptology \u2013 EUROCRYPT\u00a02006. Lecture Notes in Computer Science, vol.\u00a04004, pp. 1\u201311. Springer, Heidelberg (May\u00a0\/\u00a0Jun 2006).","DOI":"10.1007\/11761679_1"},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"Cremers, C., Naor, M., Paz, S., Ronen, E.: CHIP and CRISP: Protecting all parties against compromise through identity-binding PAKEs. In: Dodis, Y., Shrimpton, T. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02022, Part\u00a0II. Lecture Notes in Computer Science, vol. 13508, pp. 668\u2013698. Springer, Heidelberg (Aug 2022).","DOI":"10.1007\/978-3-031-15979-4_23"},{"key":"10_CR24","doi-asserted-by":"crossref","unstructured":"Dayanikli, D., Lehmann, A.: (strong) apake revisited: Capturing multi-user security and salting. Cryptology ePrint Archive (2024)","DOI":"10.1109\/EuroSP60621.2024.00030"},{"key":"10_CR25","doi-asserted-by":"crossref","unstructured":"De Feo, L., Masson, S., Petit, C., Sanso, A.: Verifiable delay functions from supersingular isogenies and pairings. In: Galbraith, S.D., Moriai, S. (eds.) Advances in Cryptology \u2013 ASIACRYPT\u00a02019, Part\u00a0I. Lecture Notes in Computer Science, vol. 11921, pp. 248\u2013277. Springer, Heidelberg (Dec 2019).","DOI":"10.1007\/978-3-030-34578-5_10"},{"key":"10_CR26","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Yampolskiy, A.: A verifiable random function with short proofs and keys. In: Vaudenay, S. (ed.) PKC\u00a02005: 8th International Workshop on Theory and Practice in Public Key Cryptography. Lecture Notes in Computer Science, vol.\u00a03386, pp. 416\u2013431. Springer, Heidelberg (Jan 2005).","DOI":"10.1007\/978-3-540-30580-4_28"},{"key":"10_CR27","doi-asserted-by":"crossref","unstructured":"Doerner, J., Kondi, Y., Lee, E., shelat, a.: Secure two-party threshold ECDSA from ECDSA assumptions. In: 2018 IEEE Symposium on Security and Privacy. pp. 980\u2013997. IEEE Computer Society Press (May 2018).","DOI":"10.1109\/SP.2018.00036"},{"key":"10_CR28","doi-asserted-by":"publisher","unstructured":"Doerner, J., Kondi, Y., Lee, E., shelat, a.: Threshold ECDSA in three rounds. In: IEEE Symposium on Security and Privacy, SP 2024, San Francisco, CA, USA, May 19-23, 2024. pp. 3053\u20133071. IEEE (2024). , https:\/\/doi.org\/10.1109\/SP54263.2024.00178","DOI":"10.1109\/SP54263.2024.00178"},{"key":"10_CR29","doi-asserted-by":"crossref","unstructured":"Doerner, J., Kondi, Y., Lee, E., shelat, a., Tyner, L.: Threshold BBS+ signatures for distributed anonymous credential issuance. In: 2023 IEEE Symposium on Security and Privacy. pp. 773\u2013789. IEEE Computer Society Press (May 2023).","DOI":"10.1109\/SP46215.2023.10179470"},{"key":"10_CR30","doi-asserted-by":"crossref","unstructured":"Duman, J., Hartmann, D., Kiltz, E., Kunzweiler, S., Lehmann, J., Riepel, D.: Generic models for group actions. In: Boldyreva, A., Kolesnikov, V. (eds.) PKC\u00a02023: 26th International Conference on Theory and Practice of Public Key Cryptography, Part\u00a0I. Lecture Notes in Computer Science, vol. 13940, pp. 406\u2013435. Springer, Heidelberg (May 2023).","DOI":"10.1007\/978-3-031-31368-4_15"},{"key":"10_CR31","doi-asserted-by":"publisher","unstructured":"Faust, S., Hazay, C., Kretzler, D., Rometsch, L., Schlosser, B.: Non-interactive threshold BBS+ from pseudorandom correlations. In: Patra, A. (ed.) Topics in Cryptology - CT-RSA 2025 - Cryptographers\u2019 Track at the RSA Conference 2025, San Francisco, CA, USA, April 28-May 1, 2025, Proceedings. Lecture Notes in Computer Science, vol. 15598, pp. 198\u2013222. Springer (2025). , https:\/\/doi.org\/10.1007\/978-3-031-88661-4_9","DOI":"10.1007\/978-3-031-88661-4_9"},{"key":"10_CR32","doi-asserted-by":"crossref","unstructured":"Fischlin, M.: Communication-efficient non-interactive proofs of knowledge with online extractors. In: Advances in Cryptology - CRYPTO 2005: 25th Annual International Cryptology Conference, Santa Barbara, California, USA, August 14-18, 2005, Proceedings. Lecture Notes in Computer Science, vol.\u00a03621, pp. 152\u2013168. Springer (2005). , https:\/\/iacr.org\/archive\/crypto2005\/36210148\/36210148.pdf","DOI":"10.1007\/11535218_10"},{"key":"10_CR33","doi-asserted-by":"crossref","unstructured":"Freedman, M.J., Ishai, Y., Pinkas, B., Reingold, O.: Keyword search and oblivious pseudorandom functions. In: Kilian, J. (ed.) TCC\u00a02005: 2nd Theory of Cryptography Conference. Lecture Notes in Computer Science, vol.\u00a03378, pp. 303\u2013324. Springer, Heidelberg (Feb 2005).","DOI":"10.1007\/978-3-540-30576-7_17"},{"key":"10_CR34","doi-asserted-by":"crossref","unstructured":"Fuchsbauer, G., Kiltz, E., Loss, J.: The algebraic group model and its applications. In: Shacham, H., Boldyreva, A. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02018, Part\u00a0II. Lecture Notes in Computer Science, vol. 10992, pp. 33\u201362. Springer, Heidelberg (Aug 2018).","DOI":"10.1007\/978-3-319-96881-0_2"},{"key":"10_CR35","doi-asserted-by":"crossref","unstructured":"Fujisaki, E., Okamoto, T.: Secure integration of asymmetric and symmetric encryption schemes. In: Wiener, M.J. (ed.) Advances in Cryptology \u2013 CRYPTO\u201999. Lecture Notes in Computer Science, vol.\u00a01666, pp. 537\u2013554. Springer, Heidelberg (Aug 1999).","DOI":"10.1007\/3-540-48405-1_34"},{"key":"10_CR36","doi-asserted-by":"crossref","unstructured":"Gentry, C., MacKenzie, P., Ramzan, Z.: A method for making password-based key exchange resilient to server compromise. In: Dwork, C. (ed.) Advances in Cryptology \u2013 CRYPTO\u00a02006. Lecture Notes in Computer Science, vol.\u00a04117, pp. 142\u2013159. Springer, Heidelberg (Aug 2006).","DOI":"10.1007\/11818175_9"},{"key":"10_CR37","doi-asserted-by":"crossref","unstructured":"Gilboa, N.: Two party RSA key generation. In: Wiener, M.J. (ed.) Advances in Cryptology \u2013 CRYPTO\u201999. Lecture Notes in Computer Science, vol.\u00a01666, pp. 116\u2013129. Springer, Heidelberg (Aug 1999).","DOI":"10.1007\/3-540-48405-1_8"},{"key":"10_CR38","doi-asserted-by":"publisher","unstructured":"Gu, Y., Jarecki, S., Kedzior, P., Nazarian, P., Xu, J.: Threshold PAKE with security against compromise of all servers. In: Chung, K., Sasaki, Y. (eds.) Advances in Cryptology - ASIACRYPT 2024 - 30th International Conference on the Theory and Application of Cryptology and Information Security, Kolkata, India, December 9-13, 2024, Proceedings, Part V. Lecture Notes in Computer Science, vol. 15488, pp. 66\u2013100. Springer (2024). , https:\/\/doi.org\/10.1007\/978-981-96-0935-2_3","DOI":"10.1007\/978-981-96-0935-2_3"},{"key":"10_CR39","doi-asserted-by":"crossref","unstructured":"Haase, B., Labrique, B.: AuCPace: Efficient verifier-based PAKE protocol tailored for the IIoT. IACR Transactions on Cryptographic Hardware and Embedded Systems 2019(2), 1\u201348 (2019). , https:\/\/tches.iacr.org\/index.php\/TCHES\/article\/view\/7384","DOI":"10.46586\/tches.v2019.i2.1-48"},{"key":"10_CR40","doi-asserted-by":"crossref","unstructured":"Haitner, I., Makriyannis, N., Ranellucci, S., Tsfadia, E.: Highly efficient OT-based multiplication protocols. In: Dunkelman, O., Dziembowski, S. (eds.) Advances in Cryptology \u2013 EUROCRYPT\u00a02022, Part\u00a0I. Lecture Notes in Computer Science, vol. 13275, pp. 180\u2013209. Springer, Heidelberg (May\u00a0\/\u00a0Jun 2022).","DOI":"10.1007\/978-3-031-06944-4_7"},{"key":"10_CR41","doi-asserted-by":"crossref","unstructured":"Hesse, J.: Separating symmetric and asymmetric password-authenticated key exchange. In: Galdi, C., Kolesnikov, V. (eds.) SCN 20: 12th International Conference on Security in Communication Networks. Lecture Notes in Computer Science, vol. 12238, pp. 579\u2013599. Springer, Heidelberg (Sep 2020).","DOI":"10.1007\/978-3-030-57990-6_29"},{"key":"10_CR42","doi-asserted-by":"crossref","unstructured":"Jao, D., Yoshida, K.: Boneh-Boyen signatures and the strong Diffie-Hellman problem. In: Shacham, H., Waters, B. (eds.) PAIRING 2009: 3rd International Conference on Pairing-based Cryptography. Lecture Notes in Computer Science, vol.\u00a05671, pp. 1\u201316. Springer, Heidelberg (Aug 2009).","DOI":"10.1007\/978-3-642-03298-1_1"},{"key":"10_CR43","doi-asserted-by":"crossref","unstructured":"Jarecki, S.: Practical covert authentication. In: Krawczyk, H. (ed.) PKC\u00a02014: 17th International Conference on Theory and Practice of Public Key Cryptography. Lecture Notes in Computer Science, vol.\u00a08383, pp. 611\u2013629. Springer, Heidelberg (Mar 2014).","DOI":"10.1007\/978-3-642-54631-0_35"},{"key":"10_CR44","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. In: Sarkar, P., Iwata, T. (eds.) Advances in Cryptology \u2013 ASIACRYPT\u00a02014, Part\u00a0II. Lecture Notes in Computer Science, vol.\u00a08874, pp. 233\u2013253. Springer, Heidelberg (Dec 2014).","DOI":"10.1007\/978-3-662-45608-8_13"},{"key":"10_CR45","doi-asserted-by":"crossref","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)","DOI":"10.1109\/EuroSP.2016.30"},{"key":"10_CR46","doi-asserted-by":"crossref","unstructured":"Jarecki, S., Krawczyk, H., Xu, J.: OPAQUE: An asymmetric PAKE protocol secure against pre-computation attacks. In: Nielsen, J.B., Rijmen, V. (eds.) Advances in Cryptology \u2013 EUROCRYPT\u00a02018, Part\u00a0III. Lecture Notes in Computer Science, vol. 10822, pp. 456\u2013486. Springer, Heidelberg (Apr\u00a0\/\u00a0May 2018).","DOI":"10.1007\/978-3-319-78372-7_15"},{"key":"10_CR47","doi-asserted-by":"crossref","unstructured":"Jarecki, S., Krawczyk, H., Xu, J.: OPAQUE: An asymmetric PAKE protocol secure against pre-computation attacks. Cryptology ePrint Archive, Report 2018\/163 (2018), https:\/\/eprint.iacr.org\/2018\/163","DOI":"10.1007\/978-3-319-78372-7_15"},{"key":"10_CR48","doi-asserted-by":"crossref","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\u00a02009: 6th Theory of Cryptography Conference. Lecture Notes in Computer Science, vol.\u00a05444, pp. 577\u2013594. Springer, Heidelberg (Mar 2009).","DOI":"10.1007\/978-3-642-00457-5_34"},{"key":"10_CR49","doi-asserted-by":"crossref","unstructured":"Jutla, C.S., Roy, A.: Smooth NIZK arguments. In: Beimel, A., Dziembowski, S. (eds.) TCC\u00a02018: 16th Theory of Cryptography Conference, Part\u00a0I. Lecture Notes in Computer Science, vol. 11239, pp. 235\u2013262. Springer, Heidelberg (Nov 2018).","DOI":"10.1007\/978-3-030-03807-6_9"},{"key":"10_CR50","doi-asserted-by":"crossref","unstructured":"Katz, J., Ostrovsky, R., Yung, M.: Efficient password-authenticated key exchange using human-memorable passwords. In: Pfitzmann, B. (ed.) Advances in Cryptology \u2013 EUROCRYPT\u00a02001. Lecture Notes in Computer Science, vol.\u00a02045, pp. 475\u2013494. Springer, Heidelberg (May 2001).","DOI":"10.1007\/3-540-44987-6_29"},{"key":"10_CR51","unstructured":"Kondi, Y., McQuoid, I., Melissaris, K., Orlandi, C., Roy, L., Tyner, L.: OneTwoPAKE: Two-round strong asymmetric PAKE with ideal security. Cryptology ePrint Archive, Paper 2025\/1573 (2025), https:\/\/eprint.iacr.org\/2025\/1573"},{"key":"10_CR52","unstructured":"Kondi, Y., abhi shelat: Improved straight-line extraction in the random oracle model with applications to signature aggregation. Cryptology ePrint Archive, Paper 2022\/393 (2022), https:\/\/eprint.iacr.org\/2022\/393"},{"key":"10_CR53","doi-asserted-by":"crossref","unstructured":"Lindell, Y., Nof, A.: Fast secure multiparty ECDSA with practical distributed key generation and applications to cryptocurrency custody. In: Lie, D., Mannan, M., Backes, M., Wang, X. (eds.) ACM CCS 2018: 25th Conference on Computer and Communications Security. pp. 1837\u20131854. ACM Press (Oct 2018).","DOI":"10.1145\/3243734.3243788"},{"key":"10_CR54","unstructured":"McQuoid, I.: Characterizing Server Compromise: Resilience Models, Instantiations, and Impossibilities. Phd thesis, Oregon State University, Corvallis, OR, USA (2023)"},{"key":"10_CR55","doi-asserted-by":"crossref","unstructured":"McQuoid, I., Rosulek, M., Xu, J.: How to obfuscate MPC inputs. In: Kiltz, E., Vaikuntanathan, V. (eds.) TCC\u00a02022: 20th Theory of Cryptography Conference, Part\u00a0II. Lecture Notes in Computer Science, vol. 13748, pp. 151\u2013180. Springer, Heidelberg (Nov 2022).","DOI":"10.1007\/978-3-031-22365-5_6"},{"key":"10_CR56","doi-asserted-by":"crossref","unstructured":"McQuoid, I., Rosulek, M., Xu, J.: How to tolerate typos in strong asymmetric pake. In: Tauman\u00a0Kalai, Y., Kamara, S.F. (eds.) Advances in Cryptology \u2013 CRYPTO 2025. pp. 610\u2013641. Springer Nature Switzerland (2025)","DOI":"10.1007\/978-3-032-01881-6_19"},{"key":"10_CR57","doi-asserted-by":"crossref","unstructured":"McQuoid, I., Xu, J.: An efficient strong asymmetric PAKE compiler instantiable from group actions. In: Guo, J., Steinfeld, R. (eds.) Advances in Cryptology \u2013 ASIACRYPT\u00a02023, Part\u00a0VIII. Lecture Notes in Computer Science, vol. 14445, pp. 176\u2013207. Springer, Heidelberg (Dec 2023).","DOI":"10.1007\/978-981-99-8742-9_6"},{"key":"10_CR58","doi-asserted-by":"crossref","unstructured":"Miao, P., Patel, S., Raykova, M., Seth, K., Yung, M.: Two-sided malicious security for private intersection-sum with cardinality. In: Micciancio, D., Ristenpart, T. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02020, Part\u00a0III. Lecture Notes in Computer Science, vol. 12172, pp. 3\u201333. Springer, Heidelberg (Aug 2020).","DOI":"10.1007\/978-3-030-56877-1_1"},{"key":"10_CR59","doi-asserted-by":"publisher","unstructured":"Naor, M., Pinkas, B., Reingold, O.: Distributed pseudo-random functions and kdcs. In: Stern, J. (ed.) Advances in Cryptology - EUROCRYPT \u201999, International Conference on the Theory and Application of Cryptographic Techniques, Prague, Czech Republic, May 2-6, 1999, Proceeding. Lecture Notes in Computer Science, vol.\u00a01592, pp. 327\u2013346. Springer (1999). , https:\/\/doi.org\/10.1007\/3-540-48910-X_23","DOI":"10.1007\/3-540-48910-X_23"},{"key":"10_CR60","doi-asserted-by":"crossref","unstructured":"Naor, M., Reingold, O.: Number-theoretic constructions of efficient pseudo-random functions. Journal of the ACM 51(2), 231\u2013262 (Mar 2004).","DOI":"10.1145\/972639.972643"},{"key":"10_CR61","doi-asserted-by":"crossref","unstructured":"Roy, L., Xu, J.: A universally composable PAKE with zero communication cost - (and why it shouldn\u2019t be considered UC-secure). In: Boldyreva, A., Kolesnikov, V. (eds.) PKC\u00a02023: 26th International Conference on Theory and Practice of Public Key Cryptography, Part\u00a0I. Lecture Notes in Computer Science, vol. 13940, pp. 714\u2013743. Springer, Heidelberg (May 2023).","DOI":"10.1007\/978-3-031-31368-4_25"},{"key":"10_CR62","doi-asserted-by":"crossref","unstructured":"Santos, B.F.D., Gu, Y., Jarecki, S., Krawczyk, H.: Asymmetric PAKE with low computation and communication. In: Dunkelman, O., Dziembowski, S. (eds.) Advances in Cryptology \u2013 EUROCRYPT\u00a02022, Part\u00a0II. Lecture Notes in Computer Science, vol. 13276, pp. 127\u2013156. Springer, Heidelberg (May\u00a0\/\u00a0Jun 2022).","DOI":"10.1007\/978-3-031-07085-3_5"},{"key":"10_CR63","doi-asserted-by":"crossref","unstructured":"Shoup, V.: Security analysis of itSPAKE2+. In: Pass, R., Pietrzak, K. (eds.) TCC\u00a02020: 18th Theory of Cryptography Conference, Part\u00a0III. Lecture Notes in Computer Science, vol. 12552, pp. 31\u201360. Springer, Heidelberg (Nov 2020).","DOI":"10.1007\/978-3-030-64381-2_2"},{"key":"10_CR64","doi-asserted-by":"crossref","unstructured":"Wesolowski, B.: Efficient verifiable delay functions. In: Ishai, Y., Rijmen, V. (eds.) Advances in Cryptology \u2013 EUROCRYPT\u00a02019, Part\u00a0III. Lecture Notes in Computer Science, vol. 11478, pp. 379\u2013407. Springer, Heidelberg (May 2019).","DOI":"10.1007\/978-3-030-17659-4_13"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2026"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-25317-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T16:36:12Z","timestamp":1778085372000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-25317-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032253163","9783032253170"],"references-count":64,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-25317-0_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"7 May 2026","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":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 May 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 May 2026","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":"eurocrypt2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}