{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,3]],"date-time":"2026-09-03T22:59:41Z","timestamp":1788476381427,"version":"build-2803163510"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"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":[[2026,6]]},"DOI":"10.1007\/s10623-026-01875-1","type":"journal-article","created":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T06:59:14Z","timestamp":1780729154000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The XHash family for ZK-friendly hash functions"],"prefix":"10.1007","volume":"94","author":[{"given":"Tomer","family":"Ashur","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Amit Singh","family":"Bhati","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Al","family":"Kindi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohammad","family":"Mahzoun","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"L\u00e9o","family":"Perrin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sundas","family":"Tariq","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,6]]},"reference":[{"key":"1875_CR1","first-page":"46","volume":"2018","author":"E Ben-Sasson","year":"2018","unstructured":"Ben-Sasson E., Bentov I., Horesh Y., Riabzev M.: Scalable, transparent, and post-quantum secure computational integrity. IACR Cryptol. ePrint Arch. 2018, 46 (2018).","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"1875_CR2","doi-asserted-by":"crossref","unstructured":"Ashur T., Mahzoun M., Toprakhisar D.: Chaghri\u2014a FHE-friendly block cipher. In: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, pp. 139\u2013150 (2022).","DOI":"10.1145\/3548606.3559364"},{"key":"1875_CR3","doi-asserted-by":"crossref","unstructured":"Grassi L., Hao Y., Rechberger C., Schofnegger M., Walch R., Wang Q.: Horst meets fluid-SPN: Griffin for zero-knowledge applications. In: Annual International Cryptology Conference, pp. 573\u2013606. Springer (2023).","DOI":"10.1007\/978-3-031-38548-3_19"},{"key":"1875_CR4","doi-asserted-by":"crossref","unstructured":"Bouvier C., Briaud P., Chaidos P., Perrin L., Salen R., Velichkov V., Willems D.: New design techniques for efficient arithmetization-oriented hash functions: anemoi permutations and Jive compression mode. In: Annual International Cryptology Conference, pp. 507\u2013539. Springer (2023).","DOI":"10.1007\/978-3-031-38548-3_17"},{"key":"1875_CR5","doi-asserted-by":"crossref","unstructured":"Albrecht M.R., Rechberger C., Schneider T., Tiessen T., Zohner M.: Ciphers for MPC and FHE. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 430\u2013454. Springer (2015).","DOI":"10.1007\/978-3-662-46800-5_17"},{"issue":"3","key":"1875_CR6","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1007\/s00145-017-9273-9","volume":"31","author":"A Canteaut","year":"2018","unstructured":"Canteaut A., Carpov S., Fontaine C., Lepoint T., Naya-Plasencia M., Paillier P., Sirdey R.: Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression. J. Cryptol. 31(3), 885\u2013916 (2018).","journal-title":"J. Cryptol."},{"key":"1875_CR7","doi-asserted-by":"crossref","unstructured":"M\u00e9aux P., Journault A., Standaert F..-X., Carlet C.: Towards stream ciphers for efficient FHE with low-noise ciphertexts. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 311\u2013343. Springer (2016).","DOI":"10.1007\/978-3-662-49890-3_13"},{"key":"1875_CR8","doi-asserted-by":"crossref","unstructured":"Dobraunig C., Eichlseder M., Grassi L., Lallemand V., Leander G., List E., Mendel F., Rechberger C.: Rasta: a cipher with low AND depth and few ANDs per bit. In: Annual International Cryptology Conference, pp. 662\u2013692. Springer (2018).","DOI":"10.1007\/978-3-319-96884-1_22"},{"key":"1875_CR9","doi-asserted-by":"crossref","unstructured":"Hebborn P., Leander G.: DASTA\u2014alternative linear layer for RASTA. IACR Trans. Symmetric Cryptol. 46\u201386 (2020).","DOI":"10.46586\/tosc.v2020.i3.46-86"},{"issue":"3","key":"1875_CR10","doi-asserted-by":"publisher","first-page":"30","DOI":"10.46586\/tches.v2023.i3.30-73","volume":"2023","author":"C Dobraunig","year":"2023","unstructured":"Dobraunig C., Grassi L., Helminger L., Rechberger C., Schofnegger M., Walch R.: Pasta: a case for hybrid homomorphic encryption. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2023(3), 30\u201373 (2023).","journal-title":"IACR Trans. Cryptogr. Hardw. Embed. Syst."},{"key":"1875_CR11","doi-asserted-by":"crossref","unstructured":"Cid C., Indr\u00f8y J.P., Raddum H.: FASTA\u2014a stream cipher for fast FHE evaluation. In: Cryptographers\u2019 Track at the RSA Conference, pp. 451\u2013483. Springer (2022).","DOI":"10.1007\/978-3-030-95312-6_19"},{"key":"1875_CR12","doi-asserted-by":"crossref","unstructured":"Ha J., Kim S., Lee B., Lee J., Son M.: Rubato: noisy ciphers for approximate homomorphic encryption. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 581\u2013610 (2022). Springer.","DOI":"10.1007\/978-3-031-06944-4_20"},{"key":"1875_CR13","unstructured":"Szepieniec A., Lemmens A., Sauer J.F., Threadbare B.: The Tip5 hash function for recursive starks. Cryptol. ePrint Arch. (2023)."},{"key":"1875_CR14","doi-asserted-by":"crossref","unstructured":"Albrecht M., Grassi L., Rechberger C., Roy A., Tiessen T.: MiMC: Efficient encryption and cryptographic hashing with minimal multiplicative complexity. In: International Conference on the Theory and Application of Cryptology and Information Security, pp. 191\u2013219. Springer (2016).","DOI":"10.1007\/978-3-662-53887-6_7"},{"key":"1875_CR15","doi-asserted-by":"crossref","unstructured":"Grassi L., Khovratovich D., Schofnegger M.: Poseidon2: a faster version of the Poseidon hash function. In: International Conference on Cryptology in Africa, pp. 177\u2013203. Springer (2023).","DOI":"10.1007\/978-3-031-37679-5_8"},{"key":"1875_CR16","doi-asserted-by":"crossref","unstructured":"Grassi L., Khovratovich D., L\u00fcftenegger R., Rechberger C., Schofnegger M., Walch R.: Monolith: circuit-friendly hash functions with new nonlinear layers for fast and constant-time implementations. IACR Trans. Symmetric Cryptol. 44\u201383 (2024).","DOI":"10.46586\/tosc.v2024.i3.44-83"},{"key":"1875_CR17","doi-asserted-by":"crossref","unstructured":"Aly A., Ashur T., Ben-Sasson E., Dhooghe S., Szepieniec A.: Design of symmetric-key primitives for advanced cryptographic protocols. IACR Trans. Symmetric Cryptol. 1\u201345 (2020).","DOI":"10.46586\/tosc.v2020.i3.1-45"},{"key":"1875_CR18","unstructured":"Grassi L., Khovratovich D., Rechberger C., Roy A., Schofnegger M.: Poseidon: a new hash function for Zero-Knowledge proof systems. In: 30th USENIX Security Symposium (USENIX Security 21), pp. 519\u2013535 (2021)."},{"key":"1875_CR19","unstructured":"Szepieniec A., Ashur T., Dhooghe S.: Rescue-Prime: a standard specification (SoK). Cryptol. ePrint Arch. (2020)."},{"key":"1875_CR20","unstructured":"Ashur T., Kindi A., Meier W., Szepieniec A., Threadbare B.: Rescue-Prime optimized. Cryptol. ePrint Arch. (2022)."},{"key":"1875_CR21","unstructured":"Roy A., Steiner M.J., Trevisani S.: Arion: arithmetization-oriented permutation and hashing from generalized triangular dynamical systems. arXiv Preprint (2023)."},{"key":"1875_CR22","doi-asserted-by":"crossref","unstructured":"Bariant A., Boeuf A., Lemoine A., Manterola Ayala I., \u00d8ygarden M., Perrin L., Raddum H.: The algebraic FreeLunch: efficient Gr\u00f6bner basis attacks against arithmetization-oriented primitives. In: Annual International Cryptology Conference, pp. 139\u2013173. Springer (2024).","DOI":"10.1007\/978-3-031-68385-5_5"},{"key":"1875_CR23","doi-asserted-by":"crossref","unstructured":"Daemen J., Rijmen V.: The design of Rijndael: AES\u2014the advanced encryption standard. In: Information Security and Cryptography, vol. 2, pp. 1\u2013238. Springer, Berlin, Heidelberg (2002).","DOI":"10.1007\/978-3-662-04722-4_1"},{"key":"1875_CR24","doi-asserted-by":"crossref","unstructured":"Bertoni G., Daemen J., Peeters M., Van Assche G.: On the indifferentiability of the sponge construction. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 181\u2013197. Springer (2008).","DOI":"10.1007\/978-3-540-78967-3_11"},{"key":"1875_CR25","doi-asserted-by":"crossref","unstructured":"Ashur T., Bhati A.S.: Generalized indifferentiable sponge and its application to polygon Miden VM. Cryptol. ePrint Arch. (2024).","DOI":"10.1007\/s10623-025-01742-5"},{"key":"1875_CR26","unstructured":"Aumasson J.-P., Khovratovich D., Mennink B., Quine P.: SAFE: sponge API for field elements. Cryptol. ePrint Arch. (2023)."},{"key":"1875_CR27","doi-asserted-by":"crossref","unstructured":"Khovratovich D., Beltr\u00e1n M.M., Mennink B.: Generic security of the SAFE API and its applications. In: International Conference on the Theory and Application of Cryptology and Information Security, pp. 301\u2013327. Springer (2023).","DOI":"10.1007\/978-981-99-8742-9_10"},{"key":"1875_CR28","doi-asserted-by":"crossref","unstructured":"Bariant A., Bouvier C., Leurent G., Perrin L.: Algebraic attacks against some arithmetization-oriented primitives. IACR Trans. Symmetric Cryptol. 73\u2013101 (2022).","DOI":"10.46586\/tosc.v2022.i3.73-101"},{"issue":"1\u20133","key":"1875_CR29","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/S0022-4049(99)00005-5","volume":"139","author":"J-C Faugere","year":"1999","unstructured":"Faugere J.-C.: A new efficient algorithm for computing Gr\u00f6bner basis (F4). J. Pure Appl. Algebra 139(1\u20133), 61\u201388 (1999).","journal-title":"J. Pure Appl. Algebra"},{"key":"1875_CR30","doi-asserted-by":"crossref","unstructured":"Faugere J.C.: A new efficient algorithm for computing Gr\u00f6bner basis without reduction to zero (F5). In: Proceedings of the 2002 International Symposium on Symbolic and Algebraic Computation, pp. 75\u201383 (2002).","DOI":"10.1145\/780506.780516"},{"issue":"4","key":"1875_CR31","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1006\/jsco.1993.1051","volume":"16","author":"J-C Faugere","year":"1993","unstructured":"Faugere J.-C., Gianni P., Lazard D., Mora T.: Efficient computation of zero-dimensional Gr\u00f6bner basis by change of ordering. J. Symb. Comput. 16(4), 329\u2013344 (1993).","journal-title":"J. Symb. Comput."},{"key":"1875_CR32","unstructured":"Tariq S.:https:\/\/github.com\/3MI-Labs\/XHash-Constants.git (2024)."},{"key":"1875_CR33","unstructured":"Hab\u00f6ck U.: A note on circulant MDS matrices. Private Correspondence (2024)."},{"key":"1875_CR34","doi-asserted-by":"crossref","unstructured":"Keller N., Rosemarin A.: Mind the middle layer: the HADES design strategy revisited. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 35\u201363. Springer (2021).","DOI":"10.1007\/978-3-030-77886-6_2"},{"key":"1875_CR35","first-page":"537","volume":"2023","author":"T Ashur","year":"2023","unstructured":"Ashur T., Buschman T., Mahzoun M.: Algebraic cryptanalysis of POSEIDON. IACR Cryptol. ePrint Arch. 2023, 537 (2023).","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"1875_CR36","unstructured":"Sauer J.F.: Gr\u00f6bner basis-attacking a tiny sponge. Technical report, AS Discrete Mathematics (2021)."},{"key":"1875_CR37","doi-asserted-by":"crossref","unstructured":"Yang H.-S., Zheng Q.-X., Yang J., Liu Q.-F., Tang D.: A new security evaluation method based on resultant for arithmetic-oriented algorithms. In: International Conference on the Theory and Application of Cryptology and Information Security, pp. 457\u2013489 (2024). Springer.","DOI":"10.1007\/978-981-96-0941-3_15"},{"key":"1875_CR38","doi-asserted-by":"crossref","unstructured":"Bariant A., Boeuf A., Briaud P., Hostettler M., \u00d8ygarden M., Raddum H.: Improved resultant attack against arithmetization-oriented primitives. In: Annual International Cryptology Conference, pp. 335\u2013367. Springer (2025).","DOI":"10.1007\/978-3-032-01901-1_11"},{"issue":"4","key":"1875_CR39","doi-asserted-by":"publisher","first-page":"270","DOI":"10.46586\/tosc.v2023.i4.270-298","volume":"2023","author":"A Boeuf","year":"2023","unstructured":"Boeuf A., Canteaut A., Perrin L.: Propagation of subspaces in primitives with monomial Sboxes: applications to rescue and variants of the AES. IACR Trans. Symmetric Cryptol. 2023(4), 270\u2013298 (2023).","journal-title":"IACR Trans. Symmetric Cryptol."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-026-01875-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-026-01875-1","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-026-01875-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,29]],"date-time":"2026-06-29T05:38:29Z","timestamp":1782711509000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-026-01875-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":39,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["1875"],"URL":"https:\/\/doi.org\/10.1007\/s10623-026-01875-1","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"28 April 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 May 2026","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 May 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 June 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"132"}}