{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T14:50:22Z","timestamp":1768920622090,"version":"3.49.0"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031385476","type":"print"},{"value":"9783031385483","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-38548-3_4","type":"book-chapter","created":{"date-parts":[[2023,8,8]],"date-time":"2023-08-08T19:02:27Z","timestamp":1691521347000},"page":"101-126","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Graph-Theoretic Algorithms for\u00a0the\u00a0Alternating Trilinear Form Equivalence Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0888-283X","authenticated-orcid":false,"given":"Ward","family":"Beullens","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,8,9]]},"reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/978-3-030-64837-4_17","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"M Bardet","year":"2020","unstructured":"Bardet, M., et al.: Improvements of algebraic attacks for solving the rank decoding and MinRank problems. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12491, pp. 507\u2013536. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64837-4_17"},{"issue":"1\u20132","key":"4_CR2","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/s00208-019-01949-7","volume":"379","author":"V Benedetti","year":"2021","unstructured":"Benedetti, V., Manivel, L., Tanturri, F.: The geometry of the Coble cubic and orbital degeneracy loci. Mathe. Ann. 379(1\u20132), 415\u2013440 (2021)","journal-title":"Mathe. Ann."},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-030-81652-0_15","volume-title":"Selected Areas in Cryptography","author":"W Beullens","year":"2021","unstructured":"Beullens, W.: Not enough LESS: an improved algorithm for solving code equivalence problems over $$\\mathbb{F}_q$$. In: Dunkelman, O., Jacobson, Jr., M.J., O\u2019Flynn, C. (eds.) SAC 2020. LNCS, vol. 12804, pp. 387\u2013403. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81652-0_15"},{"key":"4_CR4","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":"4_CR5","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":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-030-51938-4_3","volume-title":"Progress in Cryptology - AFRICACRYPT 2020","author":"J-F Biasse","year":"2020","unstructured":"Biasse, J.-F., Micheli, G., Persichetti, E., Santini, P.: LESS is more: code-based signatures without syndromes. In: Nitaj, A., Youssef, A. (eds.) AFRICACRYPT 2020. LNCS, vol. 12174, pp. 45\u201365. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51938-4_3"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/978-3-642-19379-8_29","volume-title":"Public Key Cryptography \u2013 PKC 2011","author":"C Bouillaguet","year":"2011","unstructured":"Bouillaguet, C., Faug\u00e8re, J.-C., Fouque, P.-A., Perret, L.: Practical cryptanalysis of the identification scheme based on the isomorphism of polynomial with one secret problem. In: Catalano, D., Fazio, N., Gennaro, R., Nicolosi, A. (eds.) PKC 2011. LNCS, vol. 6571, pp. 473\u2013493. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19379-8_29"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-3-642-38348-9_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"C Bouillaguet","year":"2013","unstructured":"Bouillaguet, C., Fouque, P.-A., V\u00e9ber, A.: Graph-theoretic algorithms for the \u201cIsomorphism of Polynomials\u2019\u2019 problem. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 211\u2013227. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_13"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Carlitz, L.: Representations by quadratic forms in a finite field (1954)","DOI":"10.1215\/S0012-7094-54-02114-6"},{"key":"4_CR10","unstructured":"Chen, Z., Duong, D.H., Nguyen, N.T., Qiao, Y., Susilo, W., Tang, G.: QROM security and ring signatures. Cryptology ePrint Archive, On digital signatures based on isomorphism problems (2022)"},{"key":"4_CR11","unstructured":"Couveignes, J.-M.: Hard homogeneous spaces. Cryptology ePrint Archive, Report 2006\/291 (2006). https:\/\/eprint.iacr.org\/2006\/291"},{"key":"4_CR12","unstructured":"D\u2019Alconzo, G., Gangemi, A.: TRIFORS: Linkable trilinear forms ring signature. Cryptology ePrint Archive (2022)"},{"key":"4_CR13","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"},{"issue":"3","key":"4_CR14","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 or all languages in NP have zero-knowledge proof systems. J. ACM 38(3), 691\u2013729 (1991)","journal-title":"J. ACM"},{"key":"4_CR15","unstructured":"Grochow, J.A., Qiao, Y.: On the complexity of isomorphism problems for tensors, groups, and polynomials I: tensor isomorphism-completeness. In: 12th Innovations in Theoretical Computer Science Conference (ITCS 2021). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Gruson, L., Sam, S.V.: Alternating trilinear forms on a nine-dimensional space and degenerations of (3,3)-polarized Abelian surfaces. Proc. London Math. Soc. 110(3), 755\u2013785 (2015)","DOI":"10.1112\/plms\/pdu050"},{"key":"4_CR17","doi-asserted-by":"publisher","unstructured":"Gruson, L., Sam, S.V., Weyman, J.: Moduli of Abelian varieties, Vinberg $$\\theta $$-groups, and free resolutions. In: Peeva, I. (ed.) Commutative Algebra: Expository Papers Dedicated to David Eisenbud on the Occasion of His 65th Birthday, pp. 419\u2013469. Springer, New York (2013). https:\/\/doi.org\/10.1007\/978-1-4614-5292-8_13","DOI":"10.1007\/978-1-4614-5292-8_13"},{"issue":"8","key":"4_CR18","doi-asserted-by":"publisher","first-page":"3459","DOI":"10.1080\/00927872.2014.927475","volume":"43","author":"J Hora","year":"2015","unstructured":"Hora, J., Pudl\u00e1k, P.: Classification of 8-dimensional trilinear alternating forms over GF(2). Comm. Algebra 43(8), 3459\u20133471 (2015)","journal-title":"Comm. Algebra"},{"key":"4_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2020.101788","volume":"70","author":"J Hora","year":"2021","unstructured":"Hora, J., Pudl\u00e1k, P.: Classification of 9-dimensional trilinear alternating forms over GF(2). Finite Fields Appl. 70, 101788 (2021)","journal-title":"Finite Fields Appl."},{"key":"4_CR20","unstructured":"Leroux, A., Rom\u00e9as, M.: Updatable encryption from group actions. Cryptology ePrint Archive (2022)"},{"key":"4_CR21","unstructured":"Parisse, B., De Graeve, R.: Giac\/Xcas, version 1.9.0 (2022). https:\/\/www-fourier.univ-grenoble-alpes.fr\/parisse\/giac.html"},{"key":"4_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/3-540-68339-9_4","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201996","author":"J Patarin","year":"1996","unstructured":"Patarin, J.: Hidden fields equations (HFE) and isomorphisms of polynomials (IP): two new families of asymmetric algorithms. In: Maurer, U. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 33\u201348. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68339-9_4"},{"issue":"4","key":"4_CR23","doi-asserted-by":"publisher","first-page":"935","DOI":"10.2140\/ant.2018.12.935","volume":"12","author":"E Rains","year":"2018","unstructured":"Rains, E., Sam, S.: Invariant theory of $$\\bigwedge ^3(9)$$ and genus-2 curves. Algebra Number Theory 12(4), 935\u2013957 (2018)","journal-title":"Algebra Number Theory"},{"key":"4_CR24","doi-asserted-by":"crossref","unstructured":"Sutherland, A.: Isogeny volcanoes. Open Book Ser. 1(1), 507\u2013530 (2013)","DOI":"10.2140\/obs.2013.1.507"},{"key":"4_CR25","doi-asserted-by":"publisher","unstructured":"Tang, G., Duong, D.H., Joux, A., Plantard, T., Qiao, Y., Susilo, W.: Practical post-quantum signature schemes from isomorphism problems of trilinear forms. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022, Part III. LNCS, vol. 13277, pp. 582\u2013612. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-07082-2_21","DOI":"10.1007\/978-3-031-07082-2_21"},{"key":"4_CR26","doi-asserted-by":"crossref","unstructured":"Tang, G., Qiao, Y., Grochow, J.A.: Average-case algorithms for testing isomorphism of polynomials, algebras, and multilinear forms. J. Groups Complex. Cryptol. 14 (2022)","DOI":"10.46298\/jgcc.2022.14.1.9431"},{"key":"4_CR27","unstructured":"The Sage Developers: SageMath, the Sage Mathematics Software System (Version 9.7) (2022). https:\/\/www.sagemath.org"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-38548-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,26]],"date-time":"2025-07-26T22:02:27Z","timestamp":1753567347000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-38548-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031385476","9783031385483"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-38548-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"9 August 2023","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"43","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"479","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"124","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}