{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T01:20:07Z","timestamp":1743038407936,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":39,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819609536"},{"type":"electronic","value":"9789819609543"}],"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-981-96-0954-3_11","type":"book-chapter","created":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T17:50:44Z","timestamp":1738345844000},"page":"209-228","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Tightly Secure Identity-Based Signature from\u00a0Cryptographic Group Actions"],"prefix":"10.1007","author":[{"given":"Xuan Thanh","family":"Khuc","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Willy","family":"Susilo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dung Hoang","family":"Duong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fuchun","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hyungrok","family":"Jo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tsuyoshi","family":"Takagi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,1]]},"reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1007\/978-3-642-29011-4_34","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"M Abdalla","year":"2012","unstructured":"Abdalla, M., Fouque, P.-A., Lyubashevsky, V., Tibouchi, M.: Tightly-secure signatures from lossy identification schemes. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 572\u2013590. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_34"},{"key":"11_CR2","unstructured":"Al Ebri, N., Baek, J., Shoufan, A., Vu, Q.H., Center, E.B.T.I.: Forward-secure identity-based signature: new generic constructions and their applications. J. Wirel. Mob. Networks Ubiquitous Comput. Dependable Appl. 4(1), 32\u201354 (2013)"},{"key":"11_CR3","unstructured":"Baldi, M.,et al.: NIST PQC Submission (2023). Accessed 06 Feb 2024"},{"issue":"2","key":"11_CR4","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1080\/23799927.2022.2048206","volume":"7","author":"A Barenghi","year":"2022","unstructured":"Barenghi, A., Biasse, J.-F., Ngo, T., Persichetti, E., Santini, P.: Advanced signature functionalities from the code equivalence problem. Int. J. Comput. Math. Comput. Syst. Theory 7(2), 112\u2013128 (2022)","journal-title":"Int. J. Comput. Math. Comput. Syst. Theory"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Battagliola, M.,\u00a0Borin, G.,\u00a0Meneghetti, A.,\u00a0Persichetti, E.: Cutting the GRASS: threshold group action signature schemes. IACR Cryptol. ePrint Arch., p. 859 (2023)","DOI":"10.1007\/978-3-031-58868-6_18"},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/3-540-48405-1_28","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 99","author":"M Bellare","year":"1999","unstructured":"Bellare, M., Miner, S.K.: A forward-secure digital signature scheme. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 431\u2013448. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_28"},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-031-62743-9_6","volume-title":"Post-Quantum Cryptography","author":"B Ben\u010dina","year":"2024","unstructured":"Ben\u010dina, B., Budroni, A., Chi-Dom\u00ednguez, J.-J., Kulkarni, M.: Properties of lattice isomorphism as a cryptographic group action. In: Saarinen, M.-J., Smith-Tone, D. (eds.) Post-Quantum Cryptography, pp. 170\u2013201. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-62743-9_6"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/978-3-030-64834-3_16","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"W Beullens","year":"2020","unstructured":"Beullens, W., Katsumata, S., Pintore, F.: Calamari and falafl: logarithmic (linkable) ring signatures from isogenies and lattices. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12492, pp. 464\u2013492. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64834-3_16"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/978-3-030-34578-5_9","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"W Beullens","year":"2019","unstructured":"Beullens, W., Kleinjung, T., Vercauteren, F.: CSI-FiSh: efficient isogeny based signatures through class group computations. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019. LNCS, vol. 11921, pp. 227\u2013247. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34578-5_9"},{"key":"11_CR10","unstructured":"Bl\u00e4ser, M., et al.: The ALTEQ signature scheme: algorithm specifications and supporting documentation. In: NIST PQC Submission (2023). Accessed 06 Feb 2024"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/3-540-38424-3_7","volume-title":"Advances in Cryptology-CRYPT0\u2019 90","author":"G Brassard","year":"1991","unstructured":"Brassard, G., Yung, M.: One-way group actions. In: Menezes, A.J., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol. 537, pp. 94\u2013107. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-38424-3_7"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Chen, J.,\u00a0Jo, H.,\u00a0Sato, S.,\u00a0Shikata, J.: A tightly secure identity-based signature scheme from isogenies. In:\u00a0Johansson, T.,\u00a0Smith-Tone, D. (eds.) Post-Quantum Cryptography - 14th International Workshop, PQCrypto 2023, College Park, MD, USA, August 16-18, 2023, Proceedings, vol. 14154, pp. 141\u2013163. Springer, Heidelberg (2023)","DOI":"10.1007\/978-3-031-40003-2_6"},{"key":"11_CR13","unstructured":"Chen, Z., Duong, D. H., Nguyen, T.N., Qiao, Y., Susilo, W., Tang, G.: On digital signatures based on isomorphism problems: QROM security and ring signatures. IACR Cryptol. ePrint Arch., 1184 (2022)"},{"issue":"1","key":"11_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1515\/jmc-2012-0016","volume":"8","author":"A Childs","year":"2014","unstructured":"Childs, A., Jao, D., Soukharev, V.: Constructing elliptic curve isogenies in quantum subexponential time. J. Math. Cryptol. 8(1), 1\u201329 (2014)","journal-title":"J. Math. Cryptol."},{"key":"11_CR15","unstructured":"Chou, T., et al.: The Matrix Equivalence Digital Signature (MEDS). In: NIST PQC Submission (2023). Accessed 06 Feb 2024"},{"key":"11_CR16","unstructured":"Couveignes, J.M.: Hard homogeneous spaces. IACR Cryptol. ePrint Arch. (2006)"},{"key":"11_CR17","unstructured":"D\u2019Alconzo, G.: A note on the hardness of problems from cryptographic group actions. arXiv preprint arXiv:2202.13810 (2022)"},{"key":"11_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-030-45388-6_7","volume-title":"Public-Key Cryptography \u2013 PKC 2020","author":"L De Feo","year":"2020","unstructured":"De Feo, L., Meyer, M.: Threshold schemes from isogeny assumptions. In: Kiayias, A., Kohlweiss, M., Wallden, P., Zikas, V. (eds.) PKC 2020. LNCS, vol. 12111, pp. 187\u2013212. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45388-6_7"},{"key":"11_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-030-45388-6_6","volume-title":"Public-Key Cryptography \u2013 PKC 2020","author":"A El Kaafarani","year":"2020","unstructured":"El Kaafarani, A., Katsumata, S., Pintore, F.: Lossy CSI-FiSh: efficient signature scheme with tight reduction to decisional CSIDH-512. In: Kiayias, A., Kohlweiss, M., Wallden, P., Zikas, V. (eds.) PKC 2020. LNCS, vol. 12111, pp. 157\u2013186. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45388-6_6"},{"key":"11_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1007\/978-3-030-17659-4_26","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"L De Feo","year":"2019","unstructured":"De Feo, L., Galbraith, S.D.: SeaSign: compact isogeny signatures from class group actions. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11478, pp. 759\u2013789. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_26"},{"key":"11_CR21","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":"11_CR22","doi-asserted-by":"crossref","unstructured":"Fukumitsu, M.,\u00a0Hasegawa, S.: A galindo-garcia-like identity-based signature with tight security reduction, revisited. In: Sixth International Symposium on Computing and Networking, CANDAR 2018, Takayama, Japan, 23\u201327 November 2018, pp. 92\u201398. IEEE Computer Society (2018)","DOI":"10.1109\/CANDAR.2018.00019"},{"key":"11_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/3-540-46035-7_3","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2002","author":"SD Galbraith","year":"2002","unstructured":"Galbraith, S.D., Hess, F., Smart, N.P.: Extending the GHS weil descent attack. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 29\u201344. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-46035-7_3"},{"issue":"3","key":"11_CR24","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1145\/116825.116852","volume":"38","author":"O Goldreich","year":"1991","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: Proofs that yield nothing but their validity for all languages in NP have zero-knowledge proof systems. J. ACM 38(3), 691\u2013729 (1991)","journal-title":"J. ACM"},{"key":"11_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-030-36030-6_11","volume-title":"Theory of Cryptography","author":"Z Ji","year":"2019","unstructured":"Ji, Z., Qiao, Y., Song, F., Yun, A.: General linear group action on tensors: a candidate for post-quantum cryptography. In: Hofheinz, D., Rosen, A. (eds.) TCC 2019. LNCS, vol. 11891, pp. 251\u2013281. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-36030-6_11"},{"key":"11_CR26","unstructured":"Kiltz, E.,\u00a0Neven, G.: Identity-based signatures. In:\u00a0Joye, M.,\u00a0Neven, G. (eds.) Identity-Based Cryptography, vol. 2 of Cryptology and Information Security Series, pp. 31\u201344. IOS Press (2009)"},{"issue":"4","key":"11_CR27","doi-asserted-by":"publisher","first-page":"517","DOI":"10.3934\/amc.2019034","volume":"13","author":"N Koblitz","year":"2019","unstructured":"Koblitz, N., Menezes, A.: Critical perspectives on provable security: fifteen years of \u201canother look\u2019\u2019 papers. Adv. Math. Commun. 13(4), 517\u2013558 (2019)","journal-title":"Adv. Math. Commun."},{"issue":"1","key":"11_CR28","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1137\/S0097539703436345","volume":"35","author":"G Kuperberg","year":"2005","unstructured":"Kuperberg, G.: A subexponential-time quantum algorithm for the dihedral hidden subgroup problem. SIAM J. Comput. 35(1), 170\u2013188 (2005)","journal-title":"SIAM J. Comput."},{"key":"11_CR29","unstructured":"Kuperberg, G.: Another subexponential-time quantum algorithm for the dihedral hidden subgroup problem. In: 8th Conference on the Theory of Quantum Computation, Communication and Cryptography, p.\u00a020 (2013)"},{"key":"11_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1007\/978-3-642-10366-7_35","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"V Lyubashevsky","year":"2009","unstructured":"Lyubashevsky, V.: Fiat-shamir with aborts: applications to lattice and factoring-based signatures. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 598\u2013616. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10366-7_35"},{"key":"11_CR31","unstructured":"National Institute of Standards and Technology. Call for additional digital signature schemes for the post-quantum cryptography standardization process (2022)"},{"key":"11_CR32","volume":"54","author":"C Peng","year":"2020","unstructured":"Peng, C., Chen, J., Zhou, L., Choo, K.-K.R., He, D.: Csiibs: a post-quantum identity-based signature scheme based on isogenies. J. Inf. Secur. Appl. 54, 102504 (2020)","journal-title":"J. Inf. Secur. Appl."},{"key":"11_CR33","unstructured":"Pohl, I.: Bidirectional and heuristic search in path problems. Technical Report 104 Stanford Linear Accelerator Center, Stanford, California (1969)"},{"key":"11_CR34","unstructured":"Regev, O.: A subexponential time algorithm for the dihedral hidden subgroup problem with polynomial space. arXiv preprint quant-ph\/0406151 (2004)"},{"key":"11_CR35","unstructured":"Samardjiska, S.,\u00a0Qiao, Y.: Digital signatures from equivalence problems - a closer look at MEDS and ALTEQ. In: NIST Post-Quantum Cryptography Seminars (2023)"},{"key":"11_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/3-540-39568-7_5","volume-title":"Advances in Cryptology","author":"A Shamir","year":"1985","unstructured":"Shamir, A.: Identity-based cryptosystems and signature schemes. In: Blakley, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 47\u201353. Springer, Heidelberg (1985). https:\/\/doi.org\/10.1007\/3-540-39568-7_5"},{"key":"11_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-3-030-90402-9_17","volume-title":"Provable and Practical Security","author":"S Shaw","year":"2021","unstructured":"Shaw, S., Dutta, R.: Identification scheme and forward-secure signature in identity-based setting from isogenies. In: Huang, Q., Yu, Yu. (eds.) ProvSec 2021. LNCS, vol. 13059, pp. 309\u2013326. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90402-9_17"},{"key":"11_CR38","unstructured":"Stolbunov, A.: Cryptographic schemes based on isogenies. PhD thesis, Norwegian University of Science and Technology (2012)"},{"key":"11_CR39","doi-asserted-by":"crossref","unstructured":"Tang, G., Duong, D.H.,\u00a0Joux, A.,\u00a0Plantard, T.,\u00a0Qiao, Y.,\u00a0Susilo, W.: Practical post-quantum signature schemes from isomorphism problems of trilinear forms. In:\u00a0Dunkelman, O.,\u00a0Dziembowski, S. (eds.) Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, 30 May\u20133 June 2022, Proceedings, Part III, vol. 13277 of Lecture Notes in Computer Science, pp. 582\u2013612. Springer, Heidelberg (2022)","DOI":"10.1007\/978-3-031-07082-2_21"}],"container-title":["Lecture Notes in Computer Science","Provable and Practical Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-0954-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T17:50:52Z","timestamp":1738345852000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-0954-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819609536","9789819609543"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-0954-3_11","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":"1 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ProvSec","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Provable Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gold Coast, QLD","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"provsec2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/provsec2024.github.io\/ProvSec2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}