{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:52:16Z","timestamp":1742917936500,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031828409"},{"type":"electronic","value":"9783031828416"}],"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-031-82841-6_7","type":"book-chapter","created":{"date-parts":[[2025,3,12]],"date-time":"2025-03-12T12:24:27Z","timestamp":1741782267000},"page":"169-182","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Univariate Attack Against the\u00a0Limited-Data Instance of\u00a0Ciminion"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0415-6785","authenticated-orcid":false,"given":"Augustin","family":"Bariant","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,3,13]]},"reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/978-3-030-34618-8_13","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"MR Albrecht","year":"2019","unstructured":"Albrecht, M.R., et al.: Algebraic cryptanalysis of\u00a0stark-friendly designs: application to MARVELlous and MiMC. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019, Part III. LNCS, vol. 11923, pp. 371\u2013397. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34618-8_13"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-662-53887-6_7","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"M Albrecht","year":"2016","unstructured":"Albrecht, M., Grassi, L., Rechberger, C., Roy, A., Tiessen, T.: MiMC: efficient encryption and cryptographic hashing with minimal multiplicative complexity. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016, Part I. LNCS, vol. 10031, pp. 191\u2013219. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53887-6_7"},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1007\/978-3-662-46800-5_17","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","author":"MR Albrecht","year":"2015","unstructured":"Albrecht, M.R., Rechberger, C., Schneider, T., Tiessen, T., Zohner, M.: Ciphers for MPC and FHE. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015, Part I. LNCS, vol. 9056, pp. 430\u2013454. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_17"},{"key":"7_CR4","doi-asserted-by":"publisher","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. 2020(3), 1\u201345 (2020)https:\/\/doi.org\/10.13154\/tosc.v2020.i3.1-45","DOI":"10.13154\/tosc.v2020.i3.1-45"},{"key":"7_CR5","unstructured":"Ashur, T., Dhooghe, S.: MARVELlous: a STARK-friendly family of cryptographic primitives. Cryptology ePrint Archive, Report 2018\/1098 (2018). https:\/\/eprint.iacr.org\/2018\/1098"},{"key":"7_CR6","doi-asserted-by":"publisher","unstructured":"Bariant, A., Bouvier, C., Leurent, G., Perrin, L.: Algebraic attacks against some arithmetization-oriented primitives. IACR Trans. Symmetric Cryptol. 2022(3), 73\u2013101 (2022). https:\/\/doi.org\/10.46586\/tosc.v2022.i3.73-101","DOI":"10.46586\/tosc.v2022.i3.73-101"},{"key":"7_CR7","unstructured":"Ben-Sasson, E., Bentov, I., Horesh, Y., Riabzev, M.: Scalable, transparent, and post-quantum secure computational integrity. Cryptology ePrint Archive, Report 2018\/046 (2018). https:\/\/eprint.iacr.org\/2018\/046"},{"key":"7_CR8","doi-asserted-by":"publisher","unstructured":"Bertoni, G., Daemen, J., Hoffert, S., Peeters, M., Assche, G.V., Keer, R.V.: Farfalle: parallel permutation-based cryptography. IACR Trans. Symmetric Cryptol. 2017(4), 1\u201338 (2017). https:\/\/doi.org\/10.13154\/tosc.v2017.i4.1-38","DOI":"10.13154\/tosc.v2017.i4.1-38"},{"key":"7_CR9","unstructured":"Bertoni, G., Daemen, J., Peeters, M., Van\u00a0Assche, G.: Sponge functions. In: ECRYPT Hash Workshop, vol.\u00a02007 (2007)"},{"key":"7_CR10","doi-asserted-by":"publisher","unstructured":"Bitansky, N., Canetti, R., Chiesa, A., Tromer, E.: From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again. In: Goldwasser, S. (ed.) ITCS 2012: 3rd Innovations in Theoretical Computer Science, pp. 326\u2013349. Association for Computing Machinery, Cambridge (2012). https:\/\/doi.org\/10.1145\/2090236.2090263","DOI":"10.1145\/2090236.2090263"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/978-3-031-38548-3_17","volume-title":"Advances in Cryptology \u2013 CRYPTO 2023","author":"C Bouvier","year":"2023","unstructured":"Bouvier, C., et al.: New design techniques for efficient arithmetization-oriented hash functions: Anemoi permutations and Jive compression mode. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023, Part III. LNCS, vol. 14083, pp. 507\u2013539. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38548-3_17"},{"key":"7_CR12","doi-asserted-by":"publisher","unstructured":"Cantor, D.G., Kaltofen, E.L.: On fast multiplication of polynomials over arbitrary algebras. Acta Inform. 28(7), 693\u2013701 (1991). https:\/\/doi.org\/10.1007\/BF01178683","DOI":"10.1007\/BF01178683"},{"issue":"154","key":"7_CR13","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1090\/S0025-5718-1981-0606517-5","volume":"36","author":"DG Cantor","year":"1981","unstructured":"Cantor, D.G., Zassenhaus, H.: A new algorithm for factoring polynomials over finite fields. Math. Comput. 36(154), 587\u2013592 (1981)","journal-title":"Math. Comput."},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/978-3-319-10879-7_23","volume-title":"Security and Cryptography for Networks","author":"I Damg\u00e5rd","year":"2014","unstructured":"Damg\u00e5rd, I., Lauritsen, R., Toft, T.: An empirical study and some improvements of the MiniMac protocol for secure computation. In: Abdalla, M., De Prisco, R. (eds.) SCN 2014. LNCS, vol. 8642, pp. 398\u2013415. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10879-7_23"},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/978-3-642-32009-5_38","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"I Damg\u00e5rd","year":"2012","unstructured":"Damg\u00e5rd, I., Pastro, V., Smart, N., Zakarias, S.: Multiparty computation from somewhat homomorphic encryption. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 643\u2013662. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_38"},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1007\/978-3-642-36594-2_35","volume-title":"Theory of Cryptography","author":"I Damg\u00e5rd","year":"2013","unstructured":"Damg\u00e5rd, I., Zakarias, S.: Constant-overhead secure computation of Boolean circuits using preprocessing. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 621\u2013641. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36594-2_35"},{"key":"7_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-77886-6_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"C Dobraunig","year":"2021","unstructured":"Dobraunig, C., Grassi, L., Guinet, A., Kuijsters, D.: Ciminion: symmetric encryption based on Toffoli-gates over large finite fields. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12697, pp. 3\u201334. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77886-6_1"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Dobraunig, C., Grassi, L., Guinet, A., Kuijsters, D.: Ciminion: symmetric encryption based on toffoli-gates over large finite fields. Cryptology ePrint Archive, Report 2021\/267 (2021). https:\/\/eprint.iacr.org\/2021\/267","DOI":"10.1007\/978-3-030-77886-6_1"},{"key":"7_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/978-3-031-38548-3_19","volume-title":"Advances in Cryptology - CRYPTO 2023","author":"L Grassi","year":"2023","unstructured":"Grassi, L., Hao, Y., Rechberger, C., Schofnegger, M., Walch, R., Wang, Q.: Horst meets fluid-SPN: Griffin for zero-knowledge applications. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023, Part III. LNCS, vol. 14083, pp. 573\u2013606. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-38548-3_19"},{"key":"7_CR20","unstructured":"Grassi, L., Khovratovich, D., Rechberger, C., Roy, A., Schofnegger, M.: Poseidon: a new hash function for zero-knowledge proof systems. In: Bailey, M., Greenstadt, R. (eds.) USENIX Security 2021: 30th USENIX Security Symposium, pp. 519\u2013535. USENIX Association (2021)"},{"key":"7_CR21","doi-asserted-by":"publisher","unstructured":"Grassi, L., \u00d8ygarden, M., Schofnegger, M., Walch, R.: From farfalle to megafono via ciminion: the PRF hydra for MPC applications. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023, Part\u00a0IV. LNCS, vol. 14007, pp. 255\u2013286. Springer, Heidelberg (2023).https:\/\/doi.org\/10.1007\/978-3-031-30634-1_9","DOI":"10.1007\/978-3-031-30634-1_9"},{"key":"7_CR22","doi-asserted-by":"publisher","unstructured":"Grassi, L., Rechberger, C., Rotaru, D., Scholl, P., Smart, N.P.: MPC-friendly symmetric key primitives. In: Weippl, E.R., Katzenbeisser, S., Kruegel, C., Myers, A.C., Halevi, S. (eds.) ACM CCS 2016: 23rd Conference on Computer and Communications Security, pp. 430\u2013443. ACM Press, Vienna (2016). https:\/\/doi.org\/10.1145\/2976749.2978332","DOI":"10.1145\/2976749.2978332"},{"key":"7_CR23","doi-asserted-by":"publisher","unstructured":"Kaltofen, E.L., Shoup, V.: Subquadratic-time factoring of polynomials over finite fields. Math. Comput. 67(223), 1179\u20131197 (1998). https:\/\/doi.org\/10.1090\/S0025-5718-98-00944-2","DOI":"10.1090\/S0025-5718-98-00944-2"},{"key":"7_CR24","doi-asserted-by":"publisher","unstructured":"Moenck, R.T.: Fast computation of GCDS. In: Aho, A.V., et al. (eds.) Proceedings of the 5th Annual ACM Symposium on Theory of Computing, 30 April\u20132 May 1973, Austin, Texas, USA, pp. 142\u2013151. ACM (1973). https:\/\/doi.org\/10.1145\/800125.804045","DOI":"10.1145\/800125.804045"},{"key":"7_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-81897-4_4","volume-title":"The Fast Fourier Transform","author":"HJ Nussbaumer","year":"1982","unstructured":"Nussbaumer, H.J., Nussbaumer, H.J.: The Fast Fourier Transform. Springer, Heidelberg (1982)"},{"key":"7_CR26","doi-asserted-by":"publisher","unstructured":"Strassen, V.: Die berechnungskomplexit\u00e4t der symbolischen differentiation von interpolationspolynomen. Theor. Comput. Sci. 1(1), 21\u201325 (1975). https:\/\/doi.org\/10.1016\/0304-3975(75)90010-9","DOI":"10.1016\/0304-3975(75)90010-9"},{"key":"7_CR27","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/978-3-031-26553-2_12","volume-title":"Information Security and Cryptology","author":"L Zhang","year":"2023","unstructured":"Zhang, L., Liu, M., Li, S., Lin, D.: Cryptanalysis of ciminion. In: Deng, Y., Yung, M. (eds.) Information Security and Cryptology, pp. 234\u2013251. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-26553-2_12"}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography \u2013 SAC 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-82841-6_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,12]],"date-time":"2025-03-12T12:24:31Z","timestamp":1741782271000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-82841-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031828409","9783031828416"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-82841-6_7","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":"13 March 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Selected Areas in Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Montreal, QC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","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":"29 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sacrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sacworkshop.org\/SAC24\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}