{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T16:47:44Z","timestamp":1755794864523,"version":"3.44.0"},"publisher-location":"Cham","reference-count":72,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032019127","type":"print"},{"value":"9783032019134","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-01913-4_1","type":"book-chapter","created":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T08:22:51Z","timestamp":1755332571000},"page":"3-38","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Deniable Authentication Against Malicious Verifiers"],"prefix":"10.1007","author":[{"given":"Rune","family":"Fiedler","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4083-8073","authenticated-orcid":false,"given":"Roman","family":"Langrehr","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,17]]},"reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-030-77870-5_4","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"J Alwen","year":"2021","unstructured":"Alwen, J., Blanchet, B., Hauck, E., Kiltz, E., Lipp, B., Riepel, D.: Analysing the HPKE standard. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021, Part I. LNCS, vol. 12696, pp. 87\u2013116. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_4"},{"key":"1_CR2","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/978-3-031-22969-5_17","volume-title":"ASIACRYPT 2022, Part III","author":"A Arun","year":"2022","unstructured":"Arun, A., Bonneau, J., Clark, J.: Short-lived zero-knowledge proofs and signatures. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT 2022, Part III. LNCS, vol. 13793, pp. 487\u2013516. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22969-5_17"},{"key":"1_CR3","unstructured":"Asaar, M.R., Salmasizadeh, M., Aref, M.R.: Code-based strong designated verifier signatures: Security analysis and a new construction. Cryptology ePrint Archive, Report 2016\/779 (2016). https:\/\/eprint.iacr.org\/2016\/779"},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-030-41702-4_6","volume-title":"Information Security Theory and Practice","author":"H Assidi","year":"2020","unstructured":"Assidi, H., Souidi, E.M.: Strong designated verifier signature based on the rank metric. In: Laurent, M., Giannetsos, T. (eds.) WISTP 2019. LNCS, vol. 12024, pp. 85\u2013102. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-41702-4_6"},{"key":"1_CR5","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/978-3-031-62746-0_13","volume-title":"PQCrypto 2024, Part II","author":"T Aulbach","year":"2024","unstructured":"Aulbach, T., D\u00fczl\u00fc, S., Meyer, M., Struck, P., Weish\u00e4upl, M.: Hash your keys before signing - BUFF security of the additional NIST PQC signatures. In: Saarinen, M.-J., Smith-Tone, D. (eds.) PQCrypto 2024, Part II. LNCS, vol. 14772, pp. 301\u2013335. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-62746-0_13"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44647-8_1","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"B Barak","year":"2001","unstructured":"Barak, B., et al.: On the (im)possibility of obfuscating programs. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 1\u201318. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_1"},{"key":"1_CR7","doi-asserted-by":"publisher","unstructured":"Beck, G., Choudhuri, A.R., Green, M., Jain, A., Tiwari, P.R.: Time-deniable signatures. In: PoPETs 2023.3, pp. 79\u2013102 (2023). https:\/\/doi.org\/10.56553\/popets-2023-0071","DOI":"10.56553\/popets-2023-0071"},{"key":"1_CR8","doi-asserted-by":"publisher","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: Denning, D.E., Pyle, R., Ganesan, R., Sandhu, R.S., Ashby, V. (eds.) ACM CCS 1993, pp. 62\u201373. ACM Press (1993). https:\/\/doi.org\/10.1145\/168588.168596","DOI":"10.1145\/168588.168596"},{"key":"1_CR9","doi-asserted-by":"publisher","unstructured":"Bitansky, N., Canetti, R., Paneth, O., Rosen, A.: On the existence of extractable one-way functions. In: Shmoys, D.B. (ed.) 46th ACM STOC, pp. 505\u2013514. ACM Press (2014). https:\/\/doi.org\/10.1145\/2591796.2591859","DOI":"10.1145\/2591796.2591859"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-642-19571-6_16","volume-title":"Theory of Cryptography","author":"D Boneh","year":"2011","unstructured":"Boneh, D., Sahai, A., Waters, B.: Functional encryption: definitions and challenges. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol. 6597, pp. 253\u2013273. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19571-6_16"},{"key":"1_CR11","doi-asserted-by":"publisher","unstructured":"Borisov, N., Goldberg, I., Brewer, E.A.: Off-the-record communication, or, why not to use PGP. In: Atluri, V., Syverson, P.F., De\u00a0Capitani di\u00a0Vimercati, S. (eds.) Proceedings of the 2004 ACM Workshop on Privacy in the Electronic Society, WPES 2004, Washington, DC, USA, 28 October 2004, pp. 77\u201384. ACM (2004). https:\/\/doi.org\/10.1145\/1029179.1029200","DOI":"10.1145\/1029179.1029200"},{"key":"1_CR12","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-031-22365-5_2","volume-title":"TCC 2022, Part II","author":"P Branco","year":"2022","unstructured":"Branco, P., D\u00f6ttling, N., Dujmovic, J.: Rate-1 incompressible encryption from standard assumptions. In: Kiltz, E., Vaikuntanathan, V. (eds.) TCC 2022, Part II. LNCS, vol. 13748, pp. 33\u201369. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22365-5_2"},{"key":"1_CR13","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-97131-1_1","volume-title":"PKC 2022, Part II","author":"J Brendel","year":"2022","unstructured":"Brendel, J., Fiedler, R., G\u00fcnther, F., Janson, C., Stebila, D.: Post-quantum asynchronous deniable key exchange and the Signal handshake. In: Hanaoka, G., Shikata, J., Watanabe, Y. (eds.) PKC 2022, Part II. LNCS, vol. 13178, pp. 3\u201334. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-97131-1_1"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/978-3-030-81652-0_16","volume-title":"Selected Areas in Cryptography","author":"J Brendel","year":"2021","unstructured":"Brendel, J., Fischlin, M., G\u00fcnther, F., Janson, C., Stebila, D.: Towards post-quantum security for signal\u2019s X3DH handshake. In: Dunkelman, O., Jacobson, Jr., M.J., O\u2019Flynn, C. (eds.) SAC 2020. LNCS, vol. 12804, pp. 404\u2013430. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81652-0_16"},{"key":"1_CR15","doi-asserted-by":"publisher","unstructured":"Cai, J., et al.: ID-based strong designated verifier signature over $$\\cal{R}$$-SIS assumption. In: Security and Communication Networks 2019, pp. 9678095:1\u20139678095:8 (2019). https:\/\/doi.org\/10.1155\/2019\/9678095","DOI":"10.1155\/2019\/9678095"},{"key":"1_CR16","doi-asserted-by":"publisher","unstructured":"Canetti, R., Goldreich, O., Halevi, S.: The random oracle methodology, revisited (preliminary version). In: 30th ACM STOC, pp. 209\u2013218. ACM Press (1998). https:\/\/doi.org\/10.1145\/276698.276741","DOI":"10.1145\/276698.276741"},{"key":"1_CR17","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-031-30620-4_3","volume-title":"EUROCRYPT 2023, Part III","author":"S Chakraborty","year":"2023","unstructured":"Chakraborty, S., Hofheinz, D., Maurer, U., Rito, G.: Deniable authentication when signing keys leak. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023, Part III. LNCS, vol. 14006, pp. 69\u2013100. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30620-4_3"},{"key":"1_CR18","unstructured":"Collins, D., Huguenin-Dumittan, L., Nguyen, N.K., Rolin, N., Vaudenay, S.: K-waay: fast and deniable post-quantum X3DH without ring signatures. In: Balzarotti, D., Xu, W. (eds.) USENIX Security 2024. USENIX Association (2024). https:\/\/www.usenix.org\/conference\/usenixsecurity24\/presentation\/collins"},{"key":"1_CR19","doi-asserted-by":"publisher","unstructured":"Cremers, C., Dax, A., Medinger, N.: Keeping up with the KEMs: stronger security notions for KEMs and automated analysis of KEM-based protocols. In: Luo, B., Liao, X., Xu, J., Kirda, E., Lie, D., (eds.) ACM CCS 2024, pp. 1046\u20131060. ACM Press (2024). https:\/\/doi.org\/10.1145\/3658644.3670283","DOI":"10.1145\/3658644.3670283"},{"key":"1_CR20","doi-asserted-by":"publisher","unstructured":"Cremers, C., D\u00fczl\u00fc, S., Fiedler, R., Fischlin, M., Janson, C.: BUFFing signature schemes beyond unforgeability and the case of post-quantum signatures. In: 2021 IEEE Symposium on Security and Privacy, pp. 1696\u20131714. IEEE Computer Society Press (2021). https:\/\/doi.org\/10.1109\/SP40001.2021.00093","DOI":"10.1109\/SP40001.2021.00093"},{"key":"1_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/3-540-46766-1_36","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201991","author":"I Damg\u00e5rd","year":"1992","unstructured":"Damg\u00e5rd, I.: Towards practical public key systems secure against chosen ciphertext attacks. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 445\u2013456. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_36"},{"key":"1_CR22","doi-asserted-by":"publisher","unstructured":"Di Raimondo, M., Gennaro, R.: New approaches for deniable authentication. In: Atluri, V., Meadows, C., Juels, A. (eds.) ACM CCS 2005, pp. 112\u2013121. ACM Press (2005). https:\/\/doi.org\/10.1145\/1102120.1102137","DOI":"10.1145\/1102120.1102137"},{"key":"1_CR23","doi-asserted-by":"publisher","unstructured":"Di Raimondo, M., Gennaro, R., Krawczyk, H.: Deniable authentication and key exchange. In: Juels, A., Wright, R.N., De Capitani di Vimercati, S. (eds.) ACM CCS 2006, pp. 400\u2013409. ACM Press (2006). https:\/\/doi.org\/10.1145\/1180405.1180454","DOI":"10.1145\/1180405.1180454"},{"key":"1_CR24","doi-asserted-by":"publisher","unstructured":"Dobson, S., Galbraith, S.D.: Post-quantum Signal key agreement from SIDH. In: Cheon, J.H., Johansson, T. (eds.) Post-Quantum Cryptography - 13th International Workshop, PQCrypto 2022, pp. 422\u2013450. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-17234-2_20","DOI":"10.1007\/978-3-031-17234-2_20"},{"key":"1_CR25","doi-asserted-by":"publisher","unstructured":"Dolev, D., Dwork, C., Naor, M.: Non-malleable cryptography (extended abstract). In: 23rd ACM STOC, pp. 542\u2013552. ACM Press (1991). https:\/\/doi.org\/10.1145\/103418.103474","DOI":"10.1145\/103418.103474"},{"key":"1_CR26","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/978-3-031-78020-2_12","volume-title":"TCC 2024, Part III","author":"J Don","year":"2024","unstructured":"Don, J., Fehr, S., Huang, Y.-H., Liao, J.-J., Struck, P.: Hide-and-seek and the non-resignability of the BUFF transform. In: Boyle, E., Mahmoody, M. (eds.) TCC 2024, Part III. LNCS, vol. 15366, pp. 347\u2013370. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-78020-2_12"},{"key":"1_CR27","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-031-68376-3_8","volume-title":"CRYPTO 2024, Part I","author":"J Don","year":"2024","unstructured":"Don, J., Fehr, S., Huang, Y.-H., Struck, P.: On the (in)security of the BUFF transform. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024, Part I. LNCS, vol. 14920, pp. 246\u2013275. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68376-3_8"},{"key":"1_CR28","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-3-031-82852-2_6","volume-title":"SAC 2024, Part I","author":"S D\u00fczl\u00fc","year":"2024","unstructured":"D\u00fczl\u00fc, S., Fiedler, R., Fischlin, M.: BUFFing FALCON without increasing the signature size. In: Eichlseder, M., Gambs, S. (eds.) SAC 2024, Part I. LNCS, vol. 15516, pp. 131\u2013150. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-82852-2_6"},{"key":"1_CR29","doi-asserted-by":"publisher","unstructured":"Dwork, C., Naor, M., Sahai, A.: Concurrent zero-knowledge. In: 30th ACM STOC, pp. 409\u2013418. ACM Press (1998). https:\/\/doi.org\/10.1145\/276698.276853","DOI":"10.1145\/276698.276853"},{"key":"1_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1007\/0-387-34805-0_46","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 89 Proceedings","author":"U Feige","year":"1990","unstructured":"Feige, U., Shamir, A.: Zero knowledge proofs of knowledge in two rounds. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 526\u2013544. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_46"},{"key":"1_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-47721-7_12","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 86","author":"A Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186\u2013194. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_12"},{"key":"1_CR32","doi-asserted-by":"publisher","unstructured":"Fiedler, R., Janson, C.: A deniability analysis of Signal\u2019s initial handshake PQXDH. In: PoPETs 2024.4, pp. 907\u2013928 (2024). https:\/\/doi.org\/10.56553\/popets-2024-0148","DOI":"10.56553\/popets-2024-0148"},{"key":"1_CR33","doi-asserted-by":"publisher","unstructured":"Goldwasser, S., Kalai, Y.T.: On the (in)security of the Fiat-Shamir paradigm. In: 44th FOCS, pp. 102\u2013115. IEEE Computer Society Press (2003). https:\/\/doi.org\/10.1109\/SFCS.2003.1238185","DOI":"10.1109\/SFCS.2003.1238185"},{"key":"1_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/978-3-030-75248-4_15","volume-title":"Public-Key Cryptography \u2013 PKC 2021","author":"K Hashimoto","year":"2021","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. In: Garay, J.A. (ed.) PKC 2021, Part II. LNCS, vol. 12711, pp. 410\u2013440. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75248-4_15"},{"key":"1_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1007\/978-3-662-53890-6_24","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"D Hofheinz","year":"2016","unstructured":"Hofheinz, D., Jager, T., Khurana, D., Sahai, A., Waters, B., Zhandry, M.: How to generate and use universal samplers. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016, Part II. LNCS, vol. 10032, pp. 715\u2013744. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53890-6_24"},{"key":"1_CR36","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1007\/978-3-031-38545-2_24","volume-title":"CRYPTO 2023, Part II","author":"D Hofheinz","year":"2023","unstructured":"Hofheinz, D., Kastner, J., Klein, K.: The power of undirected rewindings for adaptive security. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023, Part II. LNCS, vol. 14082, pp. 725\u2013758. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38545-2_24"},{"key":"1_CR37","unstructured":"Huang, Q., Yang, G., Wong, D.S., Susilo, W.: Efficient strong designated verifier signature schemes without random oracles or delegatability. Cryptology ePrint Archive, Report 2009\/518 (2009). https:\/\/eprint.iacr.org\/2009\/518"},{"key":"1_CR38","doi-asserted-by":"publisher","unstructured":"H\u00fclsing, A., Weber, F.J.: Epochal signatures for deniable group chats. In: 2021 IEEE Symposium on Security and Privacy, pp. 1677\u20131695. IEEE Computer Society Press (2021). https:\/\/doi.org\/10.1109\/SP40001.2021.00058","DOI":"10.1109\/SP40001.2021.00058"},{"key":"1_CR39","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"670","DOI":"10.1007\/978-3-031-06944-4_23","volume-title":"EUROCRYPT 2022, Part I","author":"A Jain","year":"2022","unstructured":"Jain, A., Lin, H., Sahai, A.: Indistinguishability obfuscation from LPN over $$\\mathbb{F} _{p}$$, DLIN, and PRGs in $${NC}^0$$. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022, Part I. LNCS, vol. 13275, pp. 670\u2013699. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-06944-4_23"},{"key":"1_CR40","doi-asserted-by":"publisher","unstructured":"Jain, A., Lin, H., Sahai, A.: Indistinguishability obfuscation from well-founded assumptions. In: Khuller, S., Williams, V.V. (eds.) 53rd ACM STOC, pp. 60\u201373. ACM Press (2021). https:\/\/doi.org\/10.1145\/3406325.3451093","DOI":"10.1145\/3406325.3451093"},{"key":"1_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/3-540-68339-9_13","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201996","author":"M Jakobsson","year":"1996","unstructured":"Jakobsson, M., Sako, K., Impagliazzo, R.: Designated verifier proofs and their applications. In: Maurer, U. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 143\u2013154. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68339-9_13"},{"key":"1_CR42","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-031-22972-5_10","volume-title":"ASIACRYPT 2022, Part IV","author":"J Kastner","year":"2022","unstructured":"Kastner, J., Loss, J., Jiayu, X.: The Abe-Okamoto partially blind signature scheme revisited. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT 2022, Part IV. LNCS, vol. 13794, pp. 279\u2013309. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22972-5_10"},{"key":"1_CR43","unstructured":"Khovratovich, D., Rothblum, R.D., Soukhanov, L.: How to prove false statements: practical attacks on Fiat-Shamir. In: Tauman Kalai, Y., Kamara, S.F.: (eds.) CRYPTO 2025, LNCS 16005, pp. 3\u201326 (2025)"},{"key":"1_CR44","unstructured":"Kret, E., Schmidt, R.: The PQXDH key agreement protocol (2023). https:\/\/signal.org\/docs\/specifications\/pqxdh\/"},{"key":"1_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/11586821_10","volume-title":"Cryptography and Coding","author":"C Kudla","year":"2005","unstructured":"Kudla, C., Paterson, K.G.: Non-interactive designated verifier proofs and undeniable signatures. In: Smart, N.P. (ed.) Cryptography and Coding 2005. LNCS, vol. 3796, pp. 136\u2013154. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11586821_10"},{"key":"1_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-540-30598-9_8","volume-title":"Security in Communication Networks","author":"F Laguillaumie","year":"2005","unstructured":"Laguillaumie, F., Vergnaud, D.: Designated verifier signatures: anonymity and efficient construction from any bilinear map. In: Blundo, C., Cimato, S. (eds.) SCN 2004. LNCS, vol. 3352, pp. 105\u2013119. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30598-9_8"},{"key":"1_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/11602897_6","volume-title":"Information and Communications Security","author":"Y Li","year":"2005","unstructured":"Li, Y., Lipmaa, H., Pei, D.: On delegatability of four designated verifier signatures. In: Qing, S., Mao, W., L\u00f3pez, J., Wang, G. (eds.) ICICS 2005. LNCS, vol. 3783, pp. 61\u201371. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11602897_6"},{"key":"1_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1191","DOI":"10.1007\/978-3-540-73549-6_116","volume-title":"Ubiquitous Intelligence and Computing","author":"Y Li","year":"2007","unstructured":"Li, Y., Susilo, W., Mu, Y., Pei, D.: Designated verifier signature: definition, framework and new constructions. In: Indulska, J., Ma, J., Yang, L.T., Ungerer, T., Cao, J. (eds.) UIC 2007. LNCS, vol. 4611, pp. 1191\u20131200. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73549-6_116"},{"key":"1_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/11523468_38","volume-title":"Automata, Languages and Programming","author":"H Lipmaa","year":"2005","unstructured":"Lipmaa, H., Wang, G., Bao, F.: Designated verifier signature schemes: attacks, new security notions and a new construction. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 459\u2013471. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11523468_38"},{"key":"1_CR50","unstructured":"Marlinspike, M., Perrin, T.: The X3DH key agreement protocol (2016). https:\/\/signal.org\/docs\/specifications\/x3dh\/"},{"key":"1_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/3-540-45708-9_8","volume-title":"Advances in Cryptology \u2014 CRYPTO 2002","author":"JB Nielsen","year":"2002","unstructured":"Nielsen, J.B.: Separating random oracle proofs from complexity theoretic proofs: the non-committing encryption case. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 111\u2013126. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45708-9_8"},{"issue":"18","key":"1_CR52","doi-asserted-by":"publisher","first-page":"6202","DOI":"10.1002\/SEC.1766","volume":"9","author":"G Noh","year":"2016","unstructured":"Noh, G., Jeong, I.R.: Strong designated verifier signature scheme from lattices in the standard model. Secur. Commun. Networks 9(18), 6202\u20136214 (2016). https:\/\/doi.org\/10.1002\/SEC.1766","journal-title":"Secur. Commun. Networks"},{"key":"1_CR53","unstructured":"O\u2019Neill, A.: Definitional issues in functional encryption. Cryptology ePrint Archive, Report 2010\/556 (2010). https:\/\/eprint.iacr.org\/2010\/556"},{"key":"1_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/978-3-540-45146-4_19","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"R Pass","year":"2003","unstructured":"Pass, R.: On deniability in the common reference string and random oracle model. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 316\u2013337. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_19"},{"key":"1_CR55","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-031-78023-3_1","volume-title":"TCC 2024, Part IV","author":"S Ragavan","year":"2024","unstructured":"Ragavan, S., Vafa, N., Vaikuntanathan, V.: Indistinguishability obfuscation from bilinear maps and LPN variants. In: Boyle, E., Mahmoody, M. (eds.) TCC 2024, Part IV. LNCS, vol. 15367, pp. 3\u201336. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-78023-3_1"},{"key":"1_CR56","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":"1_CR57","unstructured":"Rja\u0161ko, M., Stanek, M.: On designated verifier signature schemes. Cryptology ePrint Archive, Report 2010\/191 (2010). https:\/\/eprint.iacr.org\/2010\/191"},{"key":"1_CR58","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-540-24691-6_4","volume-title":"Information Security and Cryptology - ICISC 2003","author":"S Saeednia","year":"2004","unstructured":"Saeednia, S., Kremer, S., Markowitch, O.: An efficient strong designated verifier signature scheme. In: Lim, J.-I., Lee, D.-H. (eds.) ICISC 2003. LNCS, vol. 2971, pp. 40\u201354. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24691-6_4"},{"key":"1_CR59","doi-asserted-by":"publisher","unstructured":"Sahai, A., Waters, B.: How to use indistinguishability obfuscation: deniable encryption, and more. In; Shmoys, D.B. (ed.) 46th ACM STOC, pp. 475\u2013484. ACM Press (2014). https:\/\/doi.org\/10.1145\/2591796.2591825","DOI":"10.1145\/2591796.2591825"},{"key":"1_CR60","doi-asserted-by":"publisher","unstructured":"Shanks, D.: Class number, a theory of factorization, and genera. In: Lewis, D.J. (ed.) 1969 Number Theory Institute. Proceedings of Symposia in Pure Mathematics, Providence, Rhode Island, vol.\u00a020, pp. 415\u2013440. American Mathematical Society (1971). https:\/\/doi.org\/10.1090\/pspum\/020\/0316385. ISBN 0\u20138218\u20131420\u20136","DOI":"10.1090\/pspum\/020\/0316385"},{"issue":"2","key":"1_CR61","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/J.IPL.2007.11.021","volume":"107","author":"K-A Shim","year":"2008","unstructured":"Shim, K.-A.: Rogue-key attacks on the multi-designated verifiers signature scheme. Inf. Process. Lett. 107(2), 83\u201386 (2008). https:\/\/doi.org\/10.1016\/J.IPL.2007.11.021","journal-title":"Inf. Process. Lett."},{"key":"1_CR62","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/3-540-69053-0_18","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201997","author":"V Shoup","year":"1997","unstructured":"Shoup, V.: Lower bounds for discrete logarithms and related problems. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 256\u2013266. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-69053-0_18"},{"key":"1_CR63","unstructured":"Specter, M.A., Park, S., Green, M.: KeyForge: non-attributable email from forward-forgeable signatures. In: Bailey, M., Greenstadt, R. (eds.) USENIX Security 2021, pp. 1755\u20131773. USENIX Association (2021). https:\/\/www.usenix.org\/conference\/usenixsecurity21\/presentation\/specter-keyforge"},{"key":"1_CR64","doi-asserted-by":"publisher","unstructured":"Sun, X., Tian, H., Wang, Y.: Toward quantum-resistant strong designated verifier signature from isogenies. In: Xhafa, F., Barolli, L., Pop, F., Chen, X., Cristea, V. (eds.) 2012 Fourth International Conference on Intelligent Networking and Collaborative Systems, INCoS 2012, Bucharest, Romania, 19\u201321 September 2012, pp. 292\u2013296. IEEE (2012). https:\/\/doi.org\/10.1109\/INCOS.2012.70","DOI":"10.1109\/INCOS.2012.70"},{"key":"1_CR65","doi-asserted-by":"publisher","unstructured":"Thanalakshmi, P., Anitha, R., Anbazhagan, N., Park, C., Joshi, G.P., Seo, C.: A hash-based quantum-resistant designated verifier signature scheme. Mathematics 10(10) (2022). https:\/\/doi.org\/10.3390\/math10101642. ISSN 2227-7390","DOI":"10.3390\/math10101642"},{"key":"1_CR66","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-642-31448-3_20","volume-title":"Information Security and Privacy","author":"H Tian","year":"2012","unstructured":"Tian, H., Chen, X., Li, J.: A short non-delegatable strong designated verifier signature. In: Susilo, W., Mu, Y., Seberry, J. (eds.) ACISP 2012. LNCS, vol. 7372, pp. 261\u2013279. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31448-3_20"},{"key":"1_CR67","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/11599548_10","volume-title":"Information Security and Cryptology","author":"R Tso","year":"2005","unstructured":"Tso, R., Okamoto, T., Okamoto, E.: Practical strong designated verifier signature schemes based on double discrete logarithms. In: Feng, D., Lin, D., Yung, M. (eds.) CISC 2005. LNCS, vol. 3822, pp. 113\u2013127. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11599548_10"},{"key":"1_CR68","doi-asserted-by":"publisher","unstructured":"Unger, N., Goldberg, I.: Deniable key exchanges for secure messaging. In: Ray, I., Li, N., Kruegel, C. (eds.) ACM CCS 2015, pp. 1211\u20131223. ACM Press (2015). https:\/\/doi.org\/10.1145\/2810103.2813616","DOI":"10.1145\/2810103.2813616"},{"key":"1_CR69","doi-asserted-by":"publisher","unstructured":"Unger, N., Goldberg, I.: Improved strongly deniable authenticated key exchanges for secure messaging. PoPETs 2018.1, pp. 21\u201366 (2018). https:\/\/doi.org\/10.1515\/popets-2018-0003","DOI":"10.1515\/popets-2018-0003"},{"key":"1_CR70","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-030-57878-7_10","volume-title":"Applied Cryptography and Network Security","author":"N Vatandas","year":"2020","unstructured":"Vatandas, N., Gennaro, R., Ithurburn, B., Krawczyk, H.: On the cryptographic deniability of the signal protocol. In: Conti, M., Zhou, J., Casalicchio, E., Spognardi, A. (eds.) ACNS 2020, Part II. LNCS, vol. 12147, pp. 188\u2013209. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-57878-7_10"},{"key":"1_CR71","first-page":"11","volume":"25","author":"F Wang","year":"2012","unstructured":"Wang, F., Yupu, H., Wang, B.: Lattice-based strong designate verifier signature and its applications. Malays. J. Comput. Sci. 25, 11\u201322 (2012)","journal-title":"Malays. J. Comput. Sci."},{"key":"1_CR72","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/978-3-642-34601-9_25","volume-title":"Network and System Security","author":"Y Zhang","year":"2012","unstructured":"Zhang, Y., Au, M.H., Yang, G., Susilo, W.: (Strong) multi-designated verifiers signatures secure against rogue key attack. In: Xu, L., Bertino, E., Mu, Y. (eds.) NSS 2012. LNCS, vol. 7645, pp. 334\u2013347. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34601-9_25"}],"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-01913-4_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T08:22:54Z","timestamp":1755332574000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01913-4_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783032019127","9783032019134"],"references-count":72,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01913-4_1","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"}}]}}