{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T19:49:10Z","timestamp":1777060150902,"version":"3.51.4"},"publisher-location":"Singapore","reference-count":24,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819690947","type":"print"},{"value":"9789819690954","type":"electronic"}],"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-981-96-9095-4_11","type":"book-chapter","created":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T10:39:09Z","timestamp":1751884749000},"page":"205-223","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Faster VOLEitH Signatures from\u00a0All-But-One Vector Commitment and\u00a0Half-Tree"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7049-733X","authenticated-orcid":false,"given":"Dung","family":"Bui","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2636-4406","authenticated-orcid":false,"given":"Kelong","family":"Cong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0147-2566","authenticated-orcid":false,"given":"Cyprien Delpech","family":"de Saint Guilhem","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,7,7]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","unstructured":"Aguilar Melchor, C., Gama, N., Howe, J., H\u00fclsing, A., Joseph, D., Yue, D.: The return of the SDitH. In: Hazay, C., Stam, M. (eds.) EUROCRYPT\u00a02023, Part\u00a0V. LNCS, vol. 14008, pp. 564\u2013596. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_20","DOI":"10.1007\/978-3-031-30589-4_20"},{"key":"11_CR2","doi-asserted-by":"publisher","unstructured":"Baum, C., et al.: One tree to rule them all: optimizing GGM trees and OWFs for post-quantum signatures. In: Advances in Cryptology - ASIACRYPT 2024: 30th International Conference on the Theory and Application of Cryptology and Information Security, Kolkata, India, 9\u201313 December 2024, Proceedings, Part I, pp. 463\u2013493. Springer, Heidelberg (2024). https:\/\/doi.org\/10.1007\/978-981-96-0875-1_15","DOI":"10.1007\/978-981-96-0875-1_15"},{"key":"11_CR3","doi-asserted-by":"publisher","unstructured":"Baum, C., et al.: Publicly verifiable zero-knowledge and post-quantum signatures from VOLE-in-the-head. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology - CRYPTO 2023 - 43rd Annual International Cryptology Conference, CRYPTO 2023, Santa Barbara, CA, USA, 20\u201324 August 2023, Proceedings, Part V. Lecture Notes in Computer Science, vol. 14085, pp. 581\u2013615. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-38554-4_19","DOI":"10.1007\/978-3-031-38554-4_19"},{"key":"11_CR4","doi-asserted-by":"publisher","unstructured":"Baum, C., Delpech de Saint Guilhem, C., Kales, D., Orsini, E., Scholl, P., Zaverucha, G.: Banquet: short and fast signatures from AES. In: Garay, J. (ed.) PKC\u00a02021, Part\u00a0I. LNCS, vol. 12710, pp. 266\u2013297. Springer, Heidelberg (2021). https:\/\/doi.org\/10.1007\/978-3-030-75245-3_11","DOI":"10.1007\/978-3-030-75245-3_11"},{"key":"11_CR5","doi-asserted-by":"publisher","unstructured":"Baum, C., Malozemoff, A.J., Rosen, M.B., Scholl, P.: $$\\sf Mac^{\\prime}n^{\\prime}Cheese$$: zero-knowledge proofs for\u00a0boolean and arithmetic circuits with\u00a0nested disjunctions. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12828, pp. 92\u2013122. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84259-8_4","DOI":"10.1007\/978-3-030-84259-8_4"},{"key":"11_CR6","doi-asserted-by":"publisher","unstructured":"Baum, C., Nof, A.: Concretely-efficient zero-knowledge arguments for arithmetic circuits and their application to lattice-based cryptography. In: Kiayias, A., Kohlweiss, M., Wallden, P., Zikas, V. (eds.) PKC 2020. LNCS, vol. 12110, pp. 495\u2013526. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45374-9_17","DOI":"10.1007\/978-3-030-45374-9_17"},{"key":"11_CR7","doi-asserted-by":"publisher","unstructured":"Bellare, M., Hoang, V.T., Keelveedhi, S., Rogaway, P.: Efficient garbling from a fixed-key blockcipher. In: 2013 IEEE Symposium on Security and Privacy, pp. 478\u2013492. IEEE Computer Society Press (2013).https:\/\/doi.org\/10.1109\/SP.2013.39","DOI":"10.1109\/SP.2013.39"},{"key":"11_CR8","doi-asserted-by":"publisher","unstructured":"Black, J., Rogaway, P., Shrimpton, T.: Black-box analysis of the block-cipher-based hash-function constructions from PGV. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 320\u2013335. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45708-9_21","DOI":"10.1007\/3-540-45708-9_21"},{"key":"11_CR9","doi-asserted-by":"publisher","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Scholl, P.: Efficient pseudorandom correlation generators: silent OT extension and more. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11694, pp. 489\u2013518. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_16","DOI":"10.1007\/978-3-030-26954-8_16"},{"key":"11_CR10","unstructured":"Bui, D., Cong, K., de\u00a0Saint\u00a0Guilhem, C.D.: Improved all-but-one vector commitment with applications to post-quantum signatures. Cryptology ePrint Archive, Paper 2024\/097 (2024). https:\/\/eprint.iacr.org\/2024\/097"},{"key":"11_CR11","doi-asserted-by":"publisher","unstructured":"Carozza, E., Couteau, G., Joux, A.: Short signatures from regular syndrome decoding in the head. In: Hazay, C., Stam, M. (eds.) EUROCRYPT\u00a02023, Part\u00a0V. LNCS, vol. 14008, pp. 532\u2013563. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_19","DOI":"10.1007\/978-3-031-30589-4_19"},{"key":"11_CR12","doi-asserted-by":"publisher","unstructured":"Coron, J.-S., Patarin, J., Seurin, Y.: The random oracle model and the ideal cipher model are equivalent. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 1\u201320. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_1","DOI":"10.1007\/978-3-540-85174-5_1"},{"key":"11_CR13","unstructured":"Cui, H., Liu, H., Yan, D., Yang, K., Yu, Y., Zhang, K.: Resolved: shorter signatures from regular syndrome decoding and vole-in-the-head. Cryptology ePrint Archive, Paper 2024\/040 (2024). https:\/\/eprint.iacr.org\/2024\/040"},{"key":"11_CR14","doi-asserted-by":"publisher","unstructured":"Delpech de Saint Guilhem, C., Orsini, E., Tanguy, T.: Limbo: efficient zero-knowledge MPCitH-based arguments. In: Vigna, G., Shi, E. (eds.) ACM CCS 2021, pp. 3022\u20133036. ACM Press (2021). https:\/\/doi.org\/10.1145\/3460120.3484595","DOI":"10.1145\/3460120.3484595"},{"key":"11_CR15","doi-asserted-by":"publisher","unstructured":"Feneuil, T., Joux, A., Rivain, M.: Syndrome decoding in the head: shorter signatures from zero-knowledge proofs. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO\u00a02022, Part\u00a0II. LNCS, vol. 13508, pp. 541\u2013572. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_19","DOI":"10.1007\/978-3-031-15979-4_19"},{"key":"11_CR16","doi-asserted-by":"publisher","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186\u2013194. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_12","DOI":"10.1007\/3-540-47721-7_12"},{"key":"11_CR17","doi-asserted-by":"publisher","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions (extended abstract). In: 25th FOCS, pp. 464\u2013479. IEEE Computer Society Press (1984). https:\/\/doi.org\/10.1109\/SFCS.1984.715949","DOI":"10.1109\/SFCS.1984.715949"},{"key":"11_CR18","doi-asserted-by":"publisher","unstructured":"Guo, C., Katz, J., Wang, X., Yu, Y.: Efficient and secure multiparty computation from fixed-key block ciphers. In: 2020 IEEE Symposium on Security and Privacy, pp. 825\u2013841. IEEE Computer Society Press (2020). https:\/\/doi.org\/10.1109\/SP40000.2020.00016","DOI":"10.1109\/SP40000.2020.00016"},{"key":"11_CR19","doi-asserted-by":"publisher","unstructured":"Guo, X., et al.: Half-tree: halving the cost of tree expansion in COT and DPF. In: Hazay, C., Stam, M. (eds.) EUROCRYPT\u00a02023, Part\u00a0I. LNCS, vol. 14004, pp. 330\u2013362. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-30545-0_12","DOI":"10.1007\/978-3-031-30545-0_12"},{"key":"11_CR20","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Zero-knowledge from secure multiparty computation. In: Johnson, D.S., Feige, U. (eds.) 39th ACM STOC, pp. 21\u201330. ACM Press (2007). https:\/\/doi.org\/10.1145\/1250790.1250794","DOI":"10.1145\/1250790.1250794"},{"key":"11_CR21","doi-asserted-by":"publisher","unstructured":"Katz, J., Kolesnikov, V., Wang, X.: Improved non-interactive zero knowledge with applications to post-quantum signatures. In: Lie, D., Mannan, M., Backes, M., Wang, X. (eds.) ACM CCS 2018, pp. 525\u2013537. ACM Press (2018). https:\/\/doi.org\/10.1145\/3243734.3243805","DOI":"10.1145\/3243734.3243805"},{"key":"11_CR22","doi-asserted-by":"publisher","unstructured":"Weng, C., Yang, K., Katz, J., Wang, X.: Wolverine: fast, scalable, and communication-efficient zero-knowledge proofs for boolean and arithmetic circuits. In: 2021 IEEE Symposium on Security and Privacy, pp. 1074\u20131091. IEEE Computer Society Press (2021). https:\/\/doi.org\/10.1109\/SP40001.2021.00056","DOI":"10.1109\/SP40001.2021.00056"},{"key":"11_CR23","doi-asserted-by":"publisher","unstructured":"Winternitz, R.S.: A secure one-way hash function built from DES. In: 1984 IEEE Symposium on Security and Privacy, Oakland, CA, USA, p. 88. IEEE (1984). https:\/\/doi.org\/10.1109\/SP.1984.10027. http:\/\/ieeexplore.ieee.org\/document\/6234813\/","DOI":"10.1109\/SP.1984.10027"},{"key":"11_CR24","doi-asserted-by":"publisher","unstructured":"Yang, K., Sarkar, P., Weng, C., Wang, X.: QuickSilver: efficient and affordable zero-knowledge proofs for circuits and polynomials over any field. In: Vigna, G., Shi, E. (eds.) ACM CCS 2021, pp. 2986\u20133001. ACM Press (2021). https:\/\/doi.org\/10.1145\/3460120.3484556","DOI":"10.1145\/3460120.3484556"}],"container-title":["Lecture Notes in Computer Science","Information Security and Privacy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-9095-4_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T19:23:03Z","timestamp":1777058583000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-9095-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819690947","9789819690954"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-9095-4_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"7 July 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACISP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australasian Conference on Information Security and Privacy","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wollongong, NSW","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 July 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"acisp2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/uow-ic2.github.io\/acisp2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}