{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:20:36Z","timestamp":1757618436377,"version":"3.44.0"},"publisher-location":"Cham","reference-count":59,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031957604"},{"type":"electronic","value":"9783031957611"}],"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:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"vor","delay-in-days":172,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"abstract":"Abstract<\/jats:title>\n Authenticated Key Exchange (\n \n $${\\textsf {AKE}}$$<\/jats:tex-math>\n \n AKE<\/mml:mi>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>) can be used in client-server applications for mutual authentication and key establishment. In scenarios where client authentication is neither feasible nor desirable, One-Sided AKE (\n \n $${\\textsf {OS-AKE}}$$<\/jats:tex-math>\n \n \n OS<\/mml:mi>\n -<\/mml:mo>\n AKE<\/mml:mi>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>) allows both parties to establish a key while only the server authenticates to the client. Thus, \n \n $${\\textsf {OS-AKE}}$$<\/jats:tex-math>\n \n \n OS<\/mml:mi>\n -<\/mml:mo>\n AKE<\/mml:mi>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula> provides client anonymity with respect to the server, but does not allow the server to enforce any form of access control\u2014that is, the server simply establishes a key with any<\/jats:italic> client.<\/jats:p>\n In this paper, we introduce Anonymous<\/jats:italic> AKE (\n \n $${\\textsf {A-AKE}}$$<\/jats:tex-math>\n \n \n A<\/mml:mi>\n -<\/mml:mo>\n AKE<\/mml:mi>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>) to strike a balance between classical client authentication of \n \n $${\\textsf {AKE}}$$<\/jats:tex-math>\n \n AKE<\/mml:mi>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula> and client anonymity of \n \n $${\\textsf {OS-AKE}}$$<\/jats:tex-math>\n \n \n OS<\/mml:mi>\n -<\/mml:mo>\n AKE<\/mml:mi>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>. In a nutshell \n \n $${\\textsf {A-AKE}}$$<\/jats:tex-math>\n \n \n A<\/mml:mi>\n -<\/mml:mo>\n AKE<\/mml:mi>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula> is an \n \n $${\\textsf {AKE}}$$<\/jats:tex-math>\n \n AKE<\/mml:mi>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula> protocol where (i) the server authenticates to the client, (ii) the server can enforce access control by deciding which clients are authorized to run the key-establishment protocol, (iii) a key is established between the server and the client only if the latter is one of the authorized clients as defined by the server, and (iv) the authorized client remains anonymous (within the set of all authorized clients) with respect to the server. We introduce a security model for \n \n $${\\textsf {A-AKE}}$$<\/jats:tex-math>\n \n \n A<\/mml:mi>\n -<\/mml:mo>\n AKE<\/mml:mi>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula> that extends popular \n \n $${\\textsf {AKE}}$$<\/jats:tex-math>\n \n AKE<\/mml:mi>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula> models and design a general framework for instantiating \n \n $${\\textsf {A-AKE}}$$<\/jats:tex-math>\n \n \n A<\/mml:mi>\n -<\/mml:mo>\n AKE<\/mml:mi>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula> protocols based on well-established cryptographic primitives. Finally, we instantiate several \n \n $${\\textsf {AKE}}$$<\/jats:tex-math>\n \n AKE<\/mml:mi>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula> protocols aiming at strong security guarantees in the classical and post-quantum settings. We implement a prototype of each instantiation and provide an experimental comparison of their performance.<\/jats:p>","DOI":"10.1007\/978-3-031-95761-1_18","type":"book-chapter","created":{"date-parts":[[2025,6,21]],"date-time":"2025-06-21T09:30:28Z","timestamp":1750498228000},"page":"516-546","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Anonymous Authenticated Key Exchange"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0079-642X","authenticated-orcid":false,"given":"Jos\u00e9 Ignacio Escribano","family":"Pablos","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7452-9121","authenticated-orcid":false,"given":"Mar\u00eda Isabel Gonz\u00e1lez","family":"Vasco","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8135-9642","authenticated-orcid":false,"given":"\u00c1ngel P\u00e9rez del","family":"Pozo","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8215-5457","authenticated-orcid":false,"given":"Claudio","family":"Soriente","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,6,22]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Abdalla, M., Bohli, J., Vasco, M.I.G., Steinwandt, R.: (password) authenticated key establishment: From 2-party to group. In: Theory of Cryptography Conference (TCC), pp. 499\u2013514 (2007)","DOI":"10.1007\/978-3-540-70936-7_27"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Abdalla, M., Fouque, P., Pointcheval, D.: Password-based authenticated key exchange in the three-party setting. In: Vaudenay, S. (ed.) Public Key Cryptography (PKC), pp. 65\u201384 (2005)","DOI":"10.1007\/978-3-540-30580-4_6"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Backes, M., Kate, A., Mohammadi, E.: ACE: an efficient key-exchange protocol for onion routing. In: ACM Workshop on Privacy in the Electronic Society (WPES), pp. 55\u201364 (2012)","DOI":"10.1145\/2381966.2381974"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Bellare, M., Canetti, R., Krawczyk, H.: A modular approach to the design and analysis of authentication and key exchange protocols (extended abstract). In: ACM Symposium on the Theory of Computing, pp. 419\u2013428 (1998)","DOI":"10.1145\/276698.276854"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Bellare, M., Micciancio, D., Warinschi, B.: Foundations of group signatures: formal definitions, simplified requirements, and a construction based on general assumptions. In: International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT), pp. 614\u2013629 (2003)","DOI":"10.1007\/3-540-39200-9_38"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Bellare, M., Shi, H., Zhang, C.: Foundations of group signatures: the case of dynamic groups. In: The Cryptographers\u2019 Track at the RSA Conference (CT-RSA), pp. 136\u2013153 (2005)","DOI":"10.1007\/978-3-540-30574-3_11"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Bender, A., Katz, J., Morselli, R.: Ring signatures: stronger definitions, and constructions without random oracles. In: Theory of Cryptography Conference (TCC), pp. 60\u201379 (2006)","DOI":"10.1007\/11681878_4"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Boneh, D., Eskandarian, S., Fisch, B.: Post-quantum EPID signatures from symmetric primitives. In: The Cryptographers\u2019 Track at the RSA Conference (CT-RSA), pp. 251\u2013271 (2019)","DOI":"10.1007\/978-3-030-12612-4_13"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Boneh, D., Gentry, C., Waters, B.: Collusion resistant broadcast encryption with short ciphertexts and private keys. In: International Cryptology Conference (CRYPTO), pp. 258\u2013275 (2005)","DOI":"10.1007\/11535218_16"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Bootle, J., Cerulli, A., Chaidos, P., Ghadafi, E., Groth, J.: Foundations of fully dynamic group signatures. In: International Conference on Applied Cryptography and Network Security (ACNS), pp. 117\u2013136 (2016)","DOI":"10.1007\/978-3-319-39555-5_7"},{"issue":"4","key":"18_CR11","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1093\/comjnl\/bxaa104","volume":"64","author":"C Boyd","year":"2021","unstructured":"Boyd, C., Gellert, K.: A modern view on forward security. Comput. J. 64(4), 639\u2013652 (2021)","journal-title":"Comput. J."},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Bradley, T., Jarecki, S., Xu, J.: Strong asymmetric PAKE based on trapdoor CKEM. In: International Cryptology Conference (CRYPTO), pp. 798\u2013825 (2019)","DOI":"10.1007\/978-3-030-26954-8_26"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Brickell, E.F., Camenisch, J., Chen, L.: Direct anonymous attestation. In: ACM Conference on Computer and Communications Security (CCS), pp. 132\u2013145 (2004)","DOI":"10.1145\/1030083.1030103"},{"issue":"3","key":"18_CR14","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1109\/TDSC.2011.63","volume":"9","author":"E Brickell","year":"2012","unstructured":"Brickell, E., Li, J.: Enhanced privacy ID: a direct anonymous attestation scheme with enhanced revocation capabilities. IEEE Trans. Dependable Secur. Comput. 9(3), 345\u2013360 (2012)","journal-title":"IEEE Trans. Dependable Secur. Comput."},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Brock, D., Ballweg, R., Wick, K., Byorth, K.: Online collaborative exercises: the implications of anonymous participation. J. Phys. Assist. Educ. 16, 13\u201317 (2005)","DOI":"10.1097\/01367895-200516010-00004"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Canard, S., Fuchsbauer, G., Gouget, A., Laguillaumie, F.: Plaintext-checkable encryption. In: The Cryptographers\u2019 Track at the RSA Conference (CT-RSA), pp. 332\u2013348 (2012)","DOI":"10.1007\/978-3-642-27954-6_21"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"Canetti, R., Krawczyk, H.: Analysis of key-exchange protocols and their use for building secure channels. In: International Conference on the Theory and Application of Cryptographic Techniques (EUROCRYPT), pp. 453\u2013474 (2001)","DOI":"10.1007\/3-540-44987-6_28"},{"key":"18_CR18","unstructured":"Certicom Research: Standards for efficient cryptography 2 (sec 2) (2010). https:\/\/www.secg.org\/sec2-v2.pdf"},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"Chow, S.S.M., Choo, K.R.: Strongly-secure identity-based key agreement and anonymous extension. In: Information Security Conference (ISC), pp. 203\u2013220 (2007)","DOI":"10.1007\/978-3-540-75496-1_14"},{"issue":"1","key":"18_CR20","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S0097539702403773","volume":"33","author":"R Cramer","year":"2003","unstructured":"Cramer, R., Shoup, V.: Design and analysis of practical public-key encryption schemes secure against adaptive chosen ciphertext attack. SIAM J. Comput. 33(1), 167\u2013226 (2003)","journal-title":"SIAM J. Comput."},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"Derler, D., Ramacher, S., Slamanig, D.: Post-quantum zero-knowledge proofs for accumulators with applications to ring signatures from symmetric-key primitives. In: International Conference on Post-Quantum Cryptography (PQCrypto), pp. 419\u2013440 (2018)","DOI":"10.1007\/978-3-319-79063-3_20"},{"key":"18_CR22","doi-asserted-by":"crossref","unstructured":"Dowsley, R., Hanaoka, G., Imai, H., Nascimento, A.C.A.: Round-optimal deniable ring authentication in the presence of big brother. In: International Workshop on Information Security Applications (WISA), pp. 307\u2013321 (2010)","DOI":"10.1007\/978-3-642-17955-6_23"},{"key":"18_CR23","unstructured":"ECIES Team: Elliptic curve integrated encryption scheme for secp256k1 in rust. https:\/\/github.com\/ecies\/rs"},{"key":"18_CR24","doi-asserted-by":"crossref","unstructured":"Ferreira, L.: Privacy-preserving authenticated key exchange for constrained devices. In: Applied Cryptography and Network Security (ACNS), vol. 13269, pp. 293\u2013312 (2022)","DOI":"10.1007\/978-3-031-09234-3_15"},{"key":"18_CR25","doi-asserted-by":"crossref","unstructured":"Ghosh, S., Kate, A.: Post-quantum forward-secure onion routing - (future anonymity in today\u2019s budget). In: Applied Cryptography and Network Security (ACNS), pp. 263\u2013286 (2015)","DOI":"10.1007\/978-3-319-28166-7_13"},{"issue":"2","key":"18_CR26","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s10623-011-9604-z","volume":"67","author":"I Goldberg","year":"2013","unstructured":"Goldberg, I., Stebila, D., Ustaoglu, B.: Anonymity and one-way authentication in key exchange protocols. Des. Codes Cryptogr. 67(2), 245\u2013269 (2013)","journal-title":"Des. Codes Cryptogr."},{"key":"18_CR27","doi-asserted-by":"crossref","unstructured":"Hanaoka, G., Kurosawa, K.: Efficient chosen ciphertext secure public key encryption under the computational Diffie-Hellman assumption. In: International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT), pp. 308\u2013325 (2008)","DOI":"10.1007\/978-3-540-89255-7_19"},{"issue":"3","key":"18_CR28","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s00145-022-09427-1","volume":"35","author":"K Hashimoto","year":"2022","unstructured":"Hashimoto, K., Katsumata, S., Kwiatkowski, K., Prest, T.: An efficient and generic construction for signal\u2019s handshake (X3DH): post-quantum, state leakage secure, and deniable. J. Cryptol. 35(3), 17 (2022)","journal-title":"J. Cryptol."},{"key":"18_CR29","doi-asserted-by":"crossref","unstructured":"Ishibashi, R., Yoneyama, K.: Post-quantum anonymous one-sided authenticated key exchange without random oracles. In: Public-Key Cryptography (PKC), pp. 35\u201365 (2022)","DOI":"10.1007\/978-3-030-97131-1_2"},{"key":"18_CR30","doi-asserted-by":"crossref","unstructured":"Jarecki, S., Krawczyk, H., Xu, J.: OPAQUE: an asymmetric PAKE protocol secure against pre-computation attacks. In: International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT), pp. 456\u2013486 (2018)","DOI":"10.1007\/978-3-319-78372-7_15"},{"key":"18_CR31","unstructured":"Kassem, N.E., Chen, L., Bansarkhani, R.E., El Kaafarani, A., Camenisch, J., Hough, P.: L-DAA: lattice-based direct anonymous attestation. Cryptology ePrint Archive, Paper 2018\/401 (2018)"},{"key":"18_CR32","doi-asserted-by":"crossref","unstructured":"Katz, J., Kolesnikov, V., Wang, X.: Improved non-interactive zero knowledge with applications to post-quantum signatures. In: ACM Conference on Computer and Communications Security (CCS), pp. 525\u2013537 (2018)","DOI":"10.1145\/3243734.3243805"},{"key":"18_CR33","doi-asserted-by":"crossref","unstructured":"Kaufman, C., Hoffman, P., Nir, Y., Eronen, P., Kivinen, T.: Internet Key Exchange Protocol Version 2 (IKEv2) (2014). https:\/\/www.rfc-editor.org\/rfc\/rfc7296","DOI":"10.17487\/rfc7296"},{"key":"18_CR34","doi-asserted-by":"crossref","unstructured":"LaMacchia, B.A., Lauter, K.E., Mityagin, A.: Stronger security of authenticated key exchange. In: Provable Security (ProvSec), pp. 1\u201316 (2007)","DOI":"10.1007\/978-3-540-75670-5_1"},{"key":"18_CR35","doi-asserted-by":"crossref","unstructured":"Li, H., D\u00e1n, G., Nahrstedt, K.: Lynx: Authenticated anonymous real-time reporting of electric vehicle information. In: 2015 IEEE International Conference on Smart Grid Communications (SmartGridComm), pp. 599\u2013604 (2015)","DOI":"10.1109\/SmartGridComm.2015.7436366"},{"key":"18_CR36","doi-asserted-by":"crossref","unstructured":"Libert, B., Nguyen, K., Peters, T., Yung, M.: One-shot fiat-shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model. In: International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT), pp. 488\u2013519 (2022)","DOI":"10.1007\/978-3-031-07085-3_17"},{"key":"18_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1007\/BFb0054150","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u201998","author":"M Luby","year":"1998","unstructured":"Luby, M., Staddon, J.: Combinatorial bounds for broadcast encryption. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 512\u2013526. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054150"},{"key":"18_CR38","doi-asserted-by":"crossref","unstructured":"Naor, D., Naor, M., Lotspiech, J.: Revocation and tracing schemes for stateless receivers. In: International Cryptology Conference (CRYPTO), pp. 41\u201362 (2001)","DOI":"10.1007\/3-540-44647-8_3"},{"key":"18_CR39","doi-asserted-by":"crossref","unstructured":"Naor, M., Pinkas, B.: Efficient trace and revoke schemes. In: Financial Cryptography (FC), pp. 1\u201320 (2000)","DOI":"10.1007\/3-540-45472-1_1"},{"key":"18_CR40","unstructured":"National Institute of Standards and Technology: Post-quantum cryptography PQC - security (evaluation criteria). https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/post-quantum-cryptography-standardization\/evaluation-criteria\/security-(evaluation-criteria)"},{"key":"18_CR41","unstructured":"NIST: Post-Quantum Cryptography Standardization (2023). https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/post-quantum-cryptography-standardization"},{"key":"18_CR42","unstructured":"Open Quantum Safe: Algorithms in liboqs. https:\/\/openquantumsafe.org\/liboqs"},{"key":"18_CR43","doi-asserted-by":"crossref","unstructured":"Peng, C., Chen, R., Wang, Y., He, D., Huang, X.: Parameter-hiding order-revealing encryption without pairings. In: Tang, Q., Teague, V. (eds.) Public-Key Cryptography (PKC), pp. 227\u2013256 (2024)","DOI":"10.1007\/978-3-031-57728-4_8"},{"key":"18_CR44","doi-asserted-by":"crossref","unstructured":"Pointcheval, D.: Provable Security for Public Key Schemes, pp. 133\u2013190. Birkh\u00e4user Basel, Basel (2005)","DOI":"10.1007\/3-7643-7394-6_4"},{"issue":"3","key":"18_CR45","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s001450010003","volume":"13","author":"D Pointcheval","year":"2000","unstructured":"Pointcheval, D., Stern, J.: Security arguments for digital signatures and blind signatures. J. Cryptol. 13(3), 361\u2013396 (2000)","journal-title":"J. Cryptol."},{"key":"18_CR46","doi-asserted-by":"crossref","unstructured":"Ramacher, S., Slamanig, D., Weninger, A.: Privacy-preserving authenticated key exchange: stronger privacy and generic constructions. In: European Symposium on Research in Computer Security (ESORICS), pp. 676\u2013696 (2021)","DOI":"10.1007\/978-3-030-88428-4_33"},{"key":"18_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1007\/3-540-45682-1_32","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2001","author":"RL Rivest","year":"2001","unstructured":"Rivest, R.L., Shamir, A., Tauman, Y.: How to leak a secret. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 552\u2013565. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45682-1_32"},{"key":"18_CR48","doi-asserted-by":"crossref","unstructured":"Roberts, L., Rajah-Kanagasabai, C.: \u201ci\u2019d be so much more comfortable posting anonymously\u201d: identified versus anonymous participation in student discussion boards. Aust. J. Educ. Technol. 29, 612\u2013625 (2013)","DOI":"10.14742\/ajet.452"},{"key":"18_CR49","unstructured":"Rust Crypto: Pure rust implementation of the aes-gcm authenticated encryption with associated data (aead) cipher. https:\/\/docs.rs\/aes-gcm"},{"key":"18_CR50","unstructured":"Rust Crypto: Secp256k1 (a.k.a. k-256) elliptic curve library written in pure rust with support for ecdsa. https:\/\/docs.rs\/k256\/latest\/k256\/"},{"key":"18_CR51","doi-asserted-by":"publisher","first-page":"4767","DOI":"10.1109\/ACCESS.2017.2788464","volume":"6","author":"J Sanchez","year":"2018","unstructured":"Sanchez, J., Bernab\u00e9, J.B., Skarmeta, A.F.: Integration of anonymous credential systems in IoT constrained environments. IEEE Access 6, 4767\u20134778 (2018)","journal-title":"IEEE Access"},{"key":"18_CR52","doi-asserted-by":"crossref","unstructured":"Sch\u00e4ge, S., Schwenk, J., Lauer, S.: Privacy-preserving authenticated key exchange and the case of ikev2. In: Public-Key Cryptography (PKC), pp. 567\u2013596 (2020)","DOI":"10.1007\/978-3-030-45388-6_20"},{"key":"18_CR53","doi-asserted-by":"crossref","unstructured":"Smart, N.P.: Cryptography Made Simple. Information Security and Cryptography. Springer, Cham (2016)","DOI":"10.1007\/978-3-319-21936-3"},{"key":"18_CR54","doi-asserted-by":"crossref","unstructured":"Walker, J., Li, J.: Key exchange with anonymous authentication using DAA-SIGMA protocol. In: International Conference on Trusted Systems (INTRUST), pp. 108\u2013127 (2010)","DOI":"10.1007\/978-3-642-25283-9_8"},{"key":"18_CR55","doi-asserted-by":"crossref","unstructured":"Yang, G., Tan, C.H., Huang, Q., Wong, D.S.: Probabilistic public key encryption with equality test. In: The Cryptographers\u2019 Track at the RSA Conference (CT-RSA), pp. 119\u2013131 (2010)","DOI":"10.1007\/978-3-642-11925-5_9"},{"issue":"3","key":"18_CR56","doi-asserted-by":"publisher","first-page":"1119","DOI":"10.1108\/ITP-03-2019-0138","volume":"34","author":"J Young","year":"2021","unstructured":"Young, J., Courtney, J., Bennett, R., Ellis, T.S., Posey, C.: The impact of anonymous, two-way, computer-mediated communication on perceived whistleblower credibility. Inf. Technol. People 34(3), 1119\u20131151 (2021)","journal-title":"Inf. Technol. People"},{"key":"18_CR57","unstructured":"Young, J., Farshadkhah, S.: Improving anonymous whistleblower credibility with self-sovereign identity. In: IFIP Dewald Roode Information Security Research Workshop, vol. 8, no. 11.13, pp. 1\u201325 (2021)"},{"key":"18_CR58","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1109\/TIFS.2022.3218432","volume":"18","author":"Q Zhang","year":"2023","unstructured":"Zhang, Q., Wu, J., Zhong, H., He, D., Cui, J.: Efficient anonymous authentication based on physically unclonable function in industrial internet of things. IEEE Trans. Inf. Forensics Secur. 18, 233\u2013247 (2023)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"18_CR59","doi-asserted-by":"crossref","unstructured":"Zhao, Y.: Identity-concealed authenticated encryption and key exchange. In: ACM Conference on Computer and Communications Security (CCS), pp. 1464\u20131479 (2016)","DOI":"10.1145\/2976749.2978350"}],"container-title":["Lecture Notes in Computer Science","Applied Cryptography and Network Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-95761-1_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T21:27:44Z","timestamp":1757194064000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-95761-1_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031957604","9783031957611"],"references-count":59,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-95761-1_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"22 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACNS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Applied Cryptography and Network Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Munich","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","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":"23 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"acns2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/acns2025.fordaysec.de\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}