{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T17:11:59Z","timestamp":1775754719281,"version":"3.50.1"},"publisher-location":"Cham","reference-count":48,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032226945","type":"print"},{"value":"9783032226952","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-22695-2_9","type":"book-chapter","created":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T16:29:57Z","timestamp":1775752197000},"page":"252-286","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["$$\\textsf {ABBA}$$: Lattice-Based Commitments from\u00a0Commutators"],"prefix":"10.1007","author":[{"given":"Alberto","family":"Centelles","sequence":"first","affiliation":[]},{"given":"Andrew","family":"Mendelsohn","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,4,10]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","unstructured":"Ajtai, M.: Generating hard instances of lattice problems. In: Electron. Coll. Comput. Complex. TR96 (1996). https:\/\/doi.org\/10.1145\/237814.237838","DOI":"10.1145\/237814.237838"},{"key":"9_CR2","doi-asserted-by":"publisher","unstructured":"Albert, A.A., Muckenhoupt, B.: On matrices of trace zeros. In: Mich. Math. J. 4.1 (1957), pp. 1\u20133. https:\/\/doi.org\/10.1307\/mmj\/1028990168","DOI":"10.1307\/mmj\/1028990168"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Albert, A.A.: Structure of Algebras. AMS colloquium publications v. 24. American Mathematical Society, 1939. ISBN: 9780821810248","DOI":"10.1090\/coll\/024"},{"key":"9_CR4","unstructured":"Albrecht, M.: SIS with Hints Zoo (2024). https:\/\/malb.io\/sis-with-hints.html. Accessed 14\/10\/2024"},{"key":"9_CR5","doi-asserted-by":"publisher","unstructured":"Albrecht, M.R., Player, R., Scott, S.: On the concrete hardness of Learning with Errors. J. Math. Cryptol. 9(3), 169\u2013203 (2015). https:\/\/doi.org\/10.1515\/jmc-2015-0016","DOI":"10.1515\/jmc-2015-0016"},{"key":"9_CR6","unstructured":"Arbitman, Y., Dogon, G., Lyubashevsky, V., Micciancio, D., Peikert, C., Rosen, A.: SWIFFTX: A proposal for the SHA-3 standard. Nov. 2008. https:\/\/www.alonrosen.net\/PAPERS\/lattices\/swifftx.pdf"},{"key":"9_CR7","unstructured":"Boneh, D., Chen, B.: LatticeFold: A Lattice-based Folding Scheme and its Applications to Succinct Proof Systems. Cryptology ePrint Archive, Paper 2024\/257 (2024). https:\/\/eprint.iacr.org\/2024\/257"},{"key":"9_CR8","doi-asserted-by":"publisher","unstructured":"Boneh, D., Chen, B.: LatticeFold+: faster, Simpler, Shorter Lattice-Based Folding for Succinct Proof Systems. In: CRYPTO 2025. Ed. by Y. Tauman Kalai and S. F. Kamara, vol. 16006. LNCS. Springer Nature Switzerland, 2025, pp. 327\u2013361. https:\/\/doi.org\/10.1007\/978-3-032-01907-3_11","DOI":"10.1007\/978-3-032-01907-3_11"},{"key":"9_CR9","doi-asserted-by":"publisher","unstructured":"de Groote, H.F.: On the complexity of quaternion multiplication. In: Inf. Process. Lett. 3(6), 177\u2013179 (1975). https:\/\/doi.org\/10.1016\/0020-0190(75)90036-8","DOI":"10.1016\/0020-0190(75)90036-8"},{"key":"9_CR10","doi-asserted-by":"publisher","unstructured":"Dol\u017ean, D.: The probability of zero multiplication in finite rings. In: Bul. Aust. Math. Soc. 106(1), 83\u201388 (2022). https:\/\/doi.org\/10.1017\/S0004972721001246","DOI":"10.1017\/S0004972721001246"},{"issue":"1","key":"9_CR11","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/0021-8693(70)90042-6","volume":"16","author":"D Eisenbud","year":"1970","unstructured":"Eisenbud, D., Robson, J.C.: Hereditary Noetherian prime rings. J. Algebra 16(1), 86\u2013104 (1970). https:\/\/doi.org\/10.1016\/0021-8693(70)90042-6","journal-title":"J. Algebra"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0024-3795(81)90279-2","volume":"35","author":"DR Estes","year":"1981","unstructured":"Estes, D.R., Taussky, O.: Remarks concerning sums of three squares and quaternion commutator identities. Linear Algebra Appl. 35, 279\u2013285 (1981). https:\/\/doi.org\/10.1016\/0024-3795(81)90279-2","journal-title":"Linear Algebra Appl."},{"key":"9_CR13","doi-asserted-by":"publisher","unstructured":"Genise, N., Micciancio, D., Peikert, C., Walter, M.: Improved discrete gaussian and subgaussian analysis for lattice cryptography. In: Kiayias, A., Kohlweiss, M., Wallden, P., Zikas, V. (eds.) PKC 2020, vol. 12110. LNCS, pp. 623\u2013651. Springer (2020). https:\/\/doi.org\/10.1007\/978-3-030-45374-9_21","DOI":"10.1007\/978-3-030-45374-9_21"},{"key":"9_CR14","doi-asserted-by":"publisher","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: STOC \u201908. Assoc. for Computing Machinery, 2008, pp. 197\u2013206. https:\/\/doi.org\/10.1145\/1374376.1374407","DOI":"10.1145\/1374376.1374407"},{"key":"9_CR15","doi-asserted-by":"publisher","unstructured":"Goldreich, O., Goldwasser, S., Halevi, S.: Collision-free hashing from lattice problems. In: Goldreich, O. (ed.) Studies in Complexity and Cryptography, pp. 30\u201339. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22670-0_5","DOI":"10.1007\/978-3-642-22670-0_5"},{"key":"9_CR16","doi-asserted-by":"publisher","unstructured":"Grover, C., Mendelsohn, A., Ling, C., Vehkalahti, R.: Non-commutative ring learning with errors from cyclic algebras. In: J. Cryptol. 35, July 2022. https:\/\/doi.org\/10.1007\/s00145-022-09430-6","DOI":"10.1007\/s00145-022-09430-6"},{"key":"9_CR17","unstructured":"Howell, T.D., Lafon, J.C.: The Complexity of the Quaternion Product (1975). https:\/\/api.semanticscholar.org\/CorpusID:14227616"},{"key":"9_CR18","doi-asserted-by":"publisher","unstructured":"Impagliazzo, R., Zuckerman, D.: How to recycle random bits. In: FOCS 1989, pp. 248\u2013253 (1989). https:\/\/doi.org\/10.1109\/SFCS.1989.63486","DOI":"10.1109\/SFCS.1989.63486"},{"key":"9_CR19","doi-asserted-by":"publisher","unstructured":"Langlois, A., Stehl\u00e9, D.: Worst-case to average-case reductions for module lattices. Des. Codes Cryptogr. 75(3), 565\u2013599 (2015). https:\/\/doi.org\/10.1007\/s10623-014-9938-4","DOI":"10.1007\/s10623-014-9938-4"},{"key":"9_CR20","doi-asserted-by":"publisher","unstructured":"Levy, L.S., Robson, J.C.: Hereditary noetherian prime rings 1. Integrality and Simple Modules. J. Algebra 218(2), 307\u2013337 (1999). https:\/\/doi.org\/10.1006\/jabr.1999.7884","DOI":"10.1006\/jabr.1999.7884"},{"key":"9_CR21","doi-asserted-by":"publisher","unstructured":"Ling, C., Mendelsohn, A.: Algebraic equipage for learning with errors in cyclic division algebras. In: NuTMiC 2024. LNCS, vol. 14966 (2024). https:\/\/doi.org\/10.1007\/978-3-031-82380-0_6","DOI":"10.1007\/978-3-031-82380-0_6"},{"key":"9_CR22","doi-asserted-by":"publisher","unstructured":"Ling, C., Mendelsohn, A.: NTRU in quaternion algebras of bounded discriminant. In: Johansson, T., Smith-Tone, D. (eds.) PQCrypto 2023, vol. 14154. LNCS, pp. 256\u2013290. Springer, Switzerland (2023). https:\/\/doi.org\/10.1007\/978-3-031-40003-2_10","DOI":"10.1007\/978-3-031-40003-2_10"},{"key":"9_CR23","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V., Micciancio, D.: Asymptotically efficient lattice-based digital signatures. In: Canetti, R. (ed.) TCC 2008, vol. 4948. LNCS, pp. 37\u201354. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78524-8_3","DOI":"10.1007\/978-3-540-78524-8_3"},{"key":"9_CR24","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V., Micciancio, D.: Asymptotically efficient lattice-based digital signatures. J. Cryptol. 31, October 2017. https:\/\/doi.org\/10.1007\/s00145-017-9270-z","DOI":"10.1007\/s00145-017-9270-z"},{"key":"9_CR25","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V., Micciancio, D.: Generalized compact knapsacks are collision resistant. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) Automata, Languages and Programming, pp. 144\u2013155. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11787006_13","DOI":"10.1007\/11787006_13"},{"key":"9_CR26","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V., Micciancio, D., Peikert, C., Rosen, A.: SWIFFT: a modest proposal for FFT hashing. In: Nyberg, K. (eds) FSE 2008, pp. 54\u201372. Springer, Heidelberg, 2008. https:\/\/doi.org\/10.1007\/978-3-540-71039-4_4","DOI":"10.1007\/978-3-540-71039-4_4"},{"key":"9_CR27","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V., Nguyen, N.K., Plancon, M.: Efficient lattice-based blind signatures via gaussian one-time signatures. In: Hanaoka, G., Shikata, J., Watanabe, Y. PKC 2022, vol. 13178. LNCS. Springer International, pp. 498\u2013527 (2022). https:\/\/doi.org\/10.1007\/978-3-030-97131-1_17","DOI":"10.1007\/978-3-030-97131-1_17"},{"key":"9_CR28","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V., Seiler, G.: NTTRU: truly fast NTRU using NTT. In: TCHES 2019.3 (2019) 180\u2013201. https:\/\/doi.org\/10.13154\/tches.v2019.i3.180-201.","DOI":"10.13154\/tches.v2019.i3.180-201"},{"key":"9_CR29","doi-asserted-by":"crossref","unstructured":"McConnell, J.C., Robson, J.C., Small, L.W.: Noncommutative Noetherian Rings GSM. American Mathematical Society (2001). ISBN: 0821821695","DOI":"10.1090\/gsm\/030"},{"key":"9_CR30","doi-asserted-by":"publisher","unstructured":"Micciancio, D.: Almost perfect lattices, the covering radius problem, and applications to Ajtai\u2019s connection factor. SIAM J. Comput. 34(1), 118\u2013169 (2004). https:\/\/doi.org\/10.1137\/S0097539703433511","DOI":"10.1137\/S0097539703433511"},{"key":"9_CR31","doi-asserted-by":"publisher","unstructured":"Micciancio, D.: Generalized compact knapsacks, cyclic lattices, and efficient one-way functions. Comput. Complex. 16(4), 365\u2013411 (2007). https:\/\/doi.org\/10.1007\/s00037-007-0234-9","DOI":"10.1007\/s00037-007-0234-9"},{"key":"9_CR32","doi-asserted-by":"publisher","unstructured":"Micciancio, D.: Generalized compact knapsacks, cyclic lattices, and efficient one-way functions from worst-case complexity assumptions. In: FOCS 2002. 2002, pp. 356\u2013365. https:\/\/doi.org\/10.1109\/SFCS.2002.1181960","DOI":"10.1109\/SFCS.2002.1181960"},{"key":"9_CR33","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Goldwasser, S.: Complexity of Lattice Problems: a cryptographic perspective, Vol. 671. The Kluwer International Series in Engineering and Computer Science. Kluwer Academic Publishers (2002)","DOI":"10.1007\/978-1-4615-0897-7_8"},{"key":"9_CR34","doi-asserted-by":"publisher","unstructured":"Micciancio, D., Regev, O.: Worst-case to average-case reductions based on Gaussian measures. In: FOCS 2004, pp. 372\u2013381 (2004). https:\/\/doi.org\/10.1109\/FOCS.2004.72","DOI":"10.1109\/FOCS.2004.72"},{"key":"9_CR35","doi-asserted-by":"publisher","unstructured":"Nerurkar, A.P., Cai, J.: An improved worst-case to average-case connection for lattice problems. In: FOCS 1997, p. 468. IEEE Computer Society, October 1997. https:\/\/doi.org\/10.1109\/SFCS.1997.646135","DOI":"10.1109\/SFCS.1997.646135"},{"key":"9_CR36","unstructured":"Nguyen, W., Setty, S.: Neo: Lattice-based folding scheme for CCS over small fields and pay-per-bit commitments. Cryptology ePrint Archive, Paper 2025\/294 (2025). https:\/\/eprint.iacr.org\/2025\/294"},{"key":"9_CR37","doi-asserted-by":"crossref","unstructured":"Oggier, F., Berhuy, G.: An Introduction to Central Simple Algebras and Their Applications to Wireless Communication. AMS Mathematical Surveys and Monographs, AMS (2013) 978-0-8218-4937-8","DOI":"10.1090\/surv\/191"},{"issue":"4","key":"9_CR38","doi-asserted-by":"publisher","first-page":"441","DOI":"10.3934\/amc.2013.7.441","volume":"7","author":"F Oggier","year":"2013","unstructured":"Oggier, F., Sethuraman, B.A.: Quotients of orders in cyclic algebras and space-time codes. Adv. Math. Commun. 7(4), 441\u2013461 (2013). https:\/\/doi.org\/10.3934\/amc.2013.7.441","journal-title":"Adv. Math. Commun."},{"key":"9_CR39","doi-asserted-by":"publisher","unstructured":"Peikert, C.: Limits on the Hardness of Lattice Problems in $$\\ell _p$$ Norms. In: CCC \u201907. 2007, pp. 333\u2013346. https:\/\/doi.org\/10.1109\/CCC.2007.12","DOI":"10.1109\/CCC.2007.12"},{"key":"9_CR40","doi-asserted-by":"publisher","unstructured":"Peikert, C., Rosen, A.: Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices. In: TCC 2006. Halevi, S., and T. Rabin., vol. 3876. LNCS, pp. 145\u2013166. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11681878_8","DOI":"10.1007\/11681878_8"},{"key":"9_CR41","doi-asserted-by":"publisher","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM 56 (6 2009). https:\/\/doi.org\/10.1145\/1568318","DOI":"10.1145\/1568318"},{"key":"9_CR42","doi-asserted-by":"publisher","unstructured":"Rogaway, P., Shrimpton, T.: Cryptographic hash-function basics: definitions, implications, and separations for preimage resistance, second-preimage resistance, and collision resistance. In: FSE 2004. Roy, B., Meier, W. (ed.) Springer, Heidelberg, pp. 371\u2013388 (2004). https:\/\/doi.org\/10.1007\/978-3-540-25937-4_24","DOI":"10.1007\/978-3-540-25937-4_24"},{"key":"9_CR43","unstructured":"Seiler, G.: Faster AVX2 optimized NTT multiplication for Ring-LWE lattice cryptography Cryptology ePrint Archive, Paper 2018\/039 (2018). https:\/\/eprint.iacr.org\/2018\/039"},{"key":"9_CR44","unstructured":"Setty, S., Thaler, J., Wahby, R.: Customizable constraint systems for succinct arguments. Cryptology ePrint Archive, Paper 2023\/552 (2023). https:\/\/eprint.iacr.org\/2023\/552"},{"key":"9_CR45","unstructured":"Smart, N.P.: Cryptography Made Simple, 1st. Springer Publishing Company (2015). ISBN: 3319219359"},{"key":"9_CR46","doi-asserted-by":"publisher","unstructured":"National Institute of Standards and Technology: Module-Lattice-Based Digital Signature Standard (2024). https:\/\/doi.org\/10.6028\/NIST.FIPS.204.ipd","DOI":"10.6028\/NIST.FIPS.204.ipd"},{"key":"9_CR47","doi-asserted-by":"crossref","unstructured":"Voight, J.: Quaternion Algebras. Graduate Texts in Mathematics. Springer International (2021). ISBN: 9783030566944","DOI":"10.1007\/978-3-030-56694-4"},{"key":"9_CR48","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0024-3795(95)00543-9","volume":"251","author":"F Zhang","year":"1997","unstructured":"Zhang, F.: Quaternions and matrices of quaternions. Linear Algebra Appl. 251, 21\u201357 (1997). https:\/\/doi.org\/10.1016\/0024-3795(95)00543-9","journal-title":"Linear Algebra Appl."}],"container-title":["Lecture Notes in Computer Science","Post-Quantum Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-22695-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T16:30:00Z","timestamp":1775752200000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-22695-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032226945","9783032226952"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-22695-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"10 April 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PQCrypto","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Post-Quantum Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Saint-Malo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 April 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 April 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pqcrypto2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}