{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:11:37Z","timestamp":1757617897484,"version":"3.44.0"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T00:00:00Z","timestamp":1746144000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T00:00:00Z","timestamp":1746144000000},"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":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2025,8]]},"DOI":"10.1007\/s10623-025-01633-9","type":"journal-article","created":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T11:29:59Z","timestamp":1746185399000},"page":"3207-3225","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Avoiding trusted setup in isogeny-based commitments"],"prefix":"10.1007","volume":"93","author":[{"given":"Gustave","family":"Tchoffo\u00a0Saah","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tako Boris","family":"Fouotsa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emmanuel","family":"Fouotsa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C\u00e9lestin","family":"Nkuimi-Jugnia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,5,2]]},"reference":[{"key":"1633_CR1","doi-asserted-by":"crossref","unstructured":"Basso A., Chen M., Fouotsa T.B., Kutas P., Laval A., Marco L., Saah G.T.: Exploring SIDH-based signature parameters. In: International Conference on Applied Cryptography and Network Security, 2024, pp. 432\u2013456. Springer (2024).","DOI":"10.1007\/978-3-031-54770-6_17"},{"key":"1633_CR2","doi-asserted-by":"crossref","unstructured":"Basso A., Codogni G., Connolly D., De\u00a0Feo L., Fouotsa T.B., Lido G.M., Morrison T., Panny L., Patranabis S., Wesolowski B.: Supersingular curves you can trust. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2023, pp. 405\u2013437. Springer (2023).","DOI":"10.1007\/978-3-031-30617-4_14"},{"key":"1633_CR3","unstructured":"Bencina B., Kutas P., Merz S.-P., Petit C., Stopar M., Weitkamper C.: Improved algorithms for finding fixed-degree isogenies between supersingular elliptic curves. Cryptology ePrint Archive, Paper 2023\/1618 (2023). https:\/\/eprint.iacr.org\/2023\/1618."},{"key":"1633_CR4","doi-asserted-by":"crossref","unstructured":"Biasse J.-F., Jao D., Sankar A.: A quantum algorithm for computing isogenies between supersingular elliptic curves. In: International Conference on Cryptology in India, 2014, pp. 428\u2013442. Springer (2014).","DOI":"10.1007\/978-3-319-13039-2_25"},{"issue":"1","key":"1633_CR5","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/1008908.1008911","volume":"15","author":"M Blum","year":"1983","unstructured":"Blum M.: Coin flipping by telephone a protocol for solving impossible problems. ACM SIGACT News 15(1), 23\u201327 (1983).","journal-title":"ACM SIGACT News"},{"key":"1633_CR6","unstructured":"Booher J., Bowden R., Doliskani J., Fouotsa T.B., Galbraith S.D., Kunzweiler S., Merz S.-P., Petit C., Smith B., Stange K.E., et al.: Failing to hash into supersingular isogeny graphs. arXiv preprint (2022). arXiv:2205.00135."},{"issue":"3","key":"1633_CR7","first-page":"269","volume":"1","author":"R Br\u00f6ker","year":"2009","unstructured":"Br\u00f6ker R.: Constructing supersingular elliptic curves. J. Comb. Number Theory 1(3), 269\u2013273 (2009).","journal-title":"J. Comb. Number Theory"},{"issue":"1","key":"1633_CR8","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s00145-007-9002-x","volume":"22","author":"DX Charles","year":"2009","unstructured":"Charles D.X., Lauter K.E., Goren E.Z.: Cryptographic hash functions from expander graphs. J. Cryptol. 22(1), 93\u2013113 (2009).","journal-title":"J. Cryptol."},{"issue":"A","key":"1633_CR9","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1112\/S1461157014000254","volume":"17","author":"I Chevyrev","year":"2014","unstructured":"Chevyrev I., Galbraith S.D.: Constructing supersingular elliptic curves with a given endomorphism ring. LMS J. Comput. Math. 17(A), 71\u201391 (2014).","journal-title":"LMS J. Comput. Math."},{"key":"1633_CR10","first-page":"33","volume":"46","author":"G Cornacchia","year":"1908","unstructured":"Cornacchia G.: Su di un metodo per la risoluzione in numeri interi dell\u2019equazione $$\\sum _{h=0}^n c_h x^{n-h}y^h= p$$. G. Mat. Battagl. 46, 33\u201390 (1908).","journal-title":"G. Mat. Battagl."},{"key":"1633_CR11","doi-asserted-by":"crossref","unstructured":"Cramer R., Franklin M., Schoenmakers B., Yung M.: Multi-authority secret-ballot elections with linear work. In: Maurer U. (ed.) Advances in Cryptology\u2014EUROCRYPT \u201996, 1996, pp. 72\u201383. Springer, Berlin (1996).","DOI":"10.1007\/3-540-68339-9_7"},{"key":"1633_CR12","doi-asserted-by":"crossref","unstructured":"Damgard I.: Commitment schemes and zero-knowledge protocols. In: Lectures on Data Security: Modern Cryptology in Theory and Practice, vol. 1561, p. 63. Springer, Berlin (1999).","DOI":"10.1007\/3-540-48969-X_3"},{"key":"1633_CR13","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd I.B.: On the existence of bit commitment schemes and zero-knowledge proofs. In: Advances in Cryptology\u00e2\u20ac \u201cCRYPTO\u00e2\u20ac\u212289 Proceedings 9, 1990, pp. 17\u201327. Springer (1990).","DOI":"10.1007\/0-387-34805-0_3"},{"issue":"158","key":"1633_CR14","first-page":"2","volume":"6","author":"A Darwish","year":"2017","unstructured":"Darwish A., El-Gendy M.: A new cryptographic voting verifiable scheme for e-voting system based on bit commitment and blind signature. Int. J. Swarm Intell. Evol. Comput. 6(158), 2 (2017).","journal-title":"Int. J. Swarm Intell. Evol. Comput."},{"key":"1633_CR15","doi-asserted-by":"crossref","unstructured":"De\u00a0Feo L., Kohel D., Leroux A., Petit C., Wesolowski B.: SQISign: compact post-quantum signatures from quaternions and isogenies. In: Advances in Cryptology\u2014ASIACRYPT 2020: 26th International Conference on the Theory and Application of Cryptology and Information Security, , Proceedings, Part I 26, Daejeon, South Korea, 7\u201311 December 2020, pp. 64\u201393. Springer (2020).","DOI":"10.1007\/978-3-030-64837-4_3"},{"key":"1633_CR16","doi-asserted-by":"crossref","unstructured":"De Feo L., Dobson S., Galbraith S.D., Zobernig L.: SIDH proof of knowledge. In: Agrawal S., Lin D. (eds.) Advances in Cryptology\u2014ASIACRYPT 2022, 2022, pp. 310\u2013339. Springer, Cham (2022).","DOI":"10.1007\/978-3-031-22966-4_11"},{"key":"1633_CR17","unstructured":"Doliskani J., Pereira G.C., Barreto P.S.: Faster cryptographic hash function from supersingular isogeny graphs. Cryptology ePrint Archive (2017)."},{"issue":"1","key":"1633_CR18","doi-asserted-by":"publisher","first-page":"215","DOI":"10.2140\/obs.2020.4.215","volume":"4","author":"K Eisentr\u00e4ger","year":"2020","unstructured":"Eisentr\u00e4ger K., Hallgren S., Leonardi C., Morrison T., Park J.: Computing endomorphism rings of supersingular elliptic curves and connections to path-finding in isogeny graphs. Open Book Ser. 4(1), 215\u2013232 (2020).","journal-title":"Open Book Ser."},{"key":"1633_CR19","doi-asserted-by":"crossref","unstructured":"Eisentr\u00e4ger K., Hallgren S., Lauter K., Morrison T., Petit C.: Supersingular isogeny graphs and endomorphism rings: reductions and solutions. In: Advances in Cryptology\u2014EUROCRYPT 2018: 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings, Part III 37, Tel Aviv, Israel, 29 April 29\u20133 May 2018, pp. 329\u2013368. Springer (2018).","DOI":"10.1007\/978-3-319-78372-7_11"},{"key":"1633_CR20","doi-asserted-by":"crossref","unstructured":"Eriksen J.K., Leroux A.: Computing Orientations from the Endomorphism Ring of Supersingular Curves and Applications. Cryptology ePrint Archive, Paper 2024\/146 (2024). https:\/\/eprint.iacr.org\/2024\/146.","DOI":"10.62056\/ae0fhbmo"},{"key":"1633_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-27712-7","volume-title":"Digital Signatures","author":"J Katz","year":"2010","unstructured":"Katz J.: Digital Signatures, vol. 1. Springer, Berlin (2010)."},{"issue":"A","key":"1633_CR22","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1112\/S1461157014000151","volume":"17","author":"D Kohel","year":"2014","unstructured":"Kohel D., Lauter K., Petit C., Tignol J.-P.: On the quaternion-isogeny path problem. LMS J. Comput. Math. 17(A), 418\u2013432 (2014).","journal-title":"LMS J. Comput. Math."},{"key":"1633_CR23","unstructured":"Leroux A.: Quaternion algebra and isogeny-based cryptography. PhD Thesis, Ecole doctorale de l\u2019Institut Polytechnique de Paris (2022)."},{"key":"1633_CR24","unstructured":"Mula M., Murru N., Pintore F.: On Random Sampling of Supersingular Elliptic Curves. Cryptology ePrint Archive, Paper 2022\/528 (2022). https:\/\/eprint.iacr.org\/2022\/528."},{"key":"1633_CR25","unstructured":"Onuki H., Aikawa Y., Takagi T.: The existence of cycles in the supersingular isogeny graphs used in SIKE. In: 2020 International Symposium on Information Theory and Its Applications (ISITA), 2020, pp. 358\u2013362. IEEE (2020)."},{"issue":"1","key":"1633_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/PL00003816","volume":"12","author":"PC Oorschot","year":"1999","unstructured":"Oorschot P.C., Wiener M.J.: Parallel collision search with cryptanalytic applications. J. Cryptol. 12(1), 1\u201328 (1999). https:\/\/doi.org\/10.1007\/PL00003816.","journal-title":"J. Cryptol."},{"key":"1633_CR27","doi-asserted-by":"crossref","unstructured":"Pedersen T.P.: Non-interactive and information-theoretic secure verifiable secret sharing. In: Feigenbaum J. (ed.) Advances in Cryptology\u2014CRYPTO \u201991, 1992, pp. 129\u2013140. Springer, Berlin (1992).","DOI":"10.1007\/3-540-46766-1_9"},{"key":"1633_CR28","unstructured":"Petit C., Smith S.: An improvement to the quaternion analogue of the \u2018-isogeny\u2019 problem In: Conference Talk at MathCrypt, 2018 (2018)."},{"key":"1633_CR29","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1016\/0021-8693(80)90151-9","volume":"64","author":"A Pizer","year":"1980","unstructured":"Pizer A.: An algorithm for computing modular forms on $$\\gamma _0(n)^*$$. J. Algebra 64, 340\u2013390 (1980).","journal-title":"J. Algebra"},{"key":"1633_CR30","doi-asserted-by":"publisher","unstructured":"Shor P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994, pp. 124\u2013134 (1994). https:\/\/doi.org\/10.1109\/SFCS.1994.365700.","DOI":"10.1109\/SFCS.1994.365700"},{"key":"1633_CR31","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-09494-6","volume-title":"The Arithmetic of Elliptic Curves","author":"JH Silverman","year":"2009","unstructured":"Silverman J.H.: The Arithmetic of Elliptic Curves, vol. 106. Springer, Berlin (2009)."},{"issue":"2","key":"1633_CR32","first-page":"40","volume":"1","author":"B Sterner","year":"2022","unstructured":"Sterner B.: Commitment schemes from supersingular elliptic curve isogeny graphs. Math. Cryptol. 1(2), 40\u201351 (2022).","journal-title":"Math. Cryptol."},{"key":"1633_CR33","first-page":"238","volume":"273","author":"J V\u00e9lu","year":"1935","unstructured":"V\u00e9lu J.: Isogenies entre courbes ellitiques. C. R. Acad. Sci. Paris 273, 238\u2013394 (1935).","journal-title":"C. R. Acad. Sci. Paris"},{"key":"1633_CR34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-56694-4","volume-title":"Quaternion Algebras","author":"J Voight","year":"2021","unstructured":"Voight J.: Quaternion Algebras. Springer, Berlin (2021)."},{"key":"1633_CR35","doi-asserted-by":"publisher","DOI":"10.1201\/9781420071474","volume-title":"Elliptic Curves: Number Theory and Cryptography","author":"LC Washington","year":"2008","unstructured":"Washington L.C.: Elliptic Curves: Number Theory and Cryptography. Chapman and Hall\/CRC, New York (2008)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01633-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-025-01633-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01633-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T13:03:16Z","timestamp":1757163796000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-025-01633-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,2]]},"references-count":35,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2025,8]]}},"alternative-id":["1633"],"URL":"https:\/\/doi.org\/10.1007\/s10623-025-01633-9","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2025,5,2]]},"assertion":[{"value":"19 March 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 March 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 April 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 May 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"This work is carried out with the supervision of \u201cLaboratoire d\u2019Alg\u00e8bre, G\u00e9om\u00e9trie et Application\u201d (LAGA), supported by \u201cEquipe de Recherche en Alg\u00e8bre et Logique\u201d (ERAL).","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This work is original and is not submitted anywhere else.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"The authors are available for participating at any discussion or project related to this paper.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed consent"}},{"value":"All the authors are agree for publication of this paper.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"Not applicable.","order":6,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code availability"}}]}}