{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T23:28:29Z","timestamp":1784676509389,"version":"3.55.0"},"publisher-location":"Singapore","reference-count":24,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819690978","type":"print"},{"value":"9789819690985","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-9098-5_2","type":"book-chapter","created":{"date-parts":[[2025,7,10]],"date-time":"2025-07-10T09:26:49Z","timestamp":1752139609000},"page":"23-41","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Multi-instance Vector Commitment and\u00a0Application to\u00a0Post-quantum Signatures"],"prefix":"10.1007","author":[{"given":"Dung","family":"Bui","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,7,7]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","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 2023, Part\u00a0V. LNCS, vol. 14008, pp. 564\u2013596. Springer, Heidelberg (2023)","DOI":"10.1007\/978-3-031-30589-4_20"},{"key":"2_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 \u2013 ASIACRYPT 2024: 30th International Conference on the Theory and Application of Cryptology and Information Security, Kolkata, India, 9\u201313 December 2024, Proceedings, Part I, p. 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":"2_CR3","doi-asserted-by":"crossref","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)","DOI":"10.1007\/978-3-031-38554-4_19"},{"key":"2_CR4","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-030-84259-8_4","volume-title":"CRYPTO 2021, Part IV","author":"C Baum","year":"2021","unstructured":"Baum, C., Malozemoff, A.J., Rosen, M.B., Scholl, P.: Mac\u2019n\u2019cheese: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021, Part IV. LNCS, vol. 12828, pp. 92\u2013122. Springer, Heidelberg, Virtual Event (Aug (2021)"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Boneh, D., Waters, B.: Constrained pseudorandom functions and their applications. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013, Part II. LNCS, vol. 8270, pp. 280\u2013300. Springer, Heidelberg (2013)","DOI":"10.1007\/978-3-642-42045-0_15"},{"key":"2_CR6","doi-asserted-by":"crossref","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, Part III. LNCS, vol. 11694, pp. 489\u2013518. Springer, Cham (2019)","DOI":"10.1007\/978-3-030-26954-8_16"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Boyle, E., Gilboa, N., Ishai, Y.: Function secret sharing: improvements and extensions. In: Weippl, E.R., Katzenbeisser, S., Kruegel, C., Myers, A.C., Halevi, S. (eds.) ACM CCS 2016, pp. 1292\u20131303. ACM Press (2016)","DOI":"10.1145\/2976749.2978429"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Boyle, E., Goldwasser, S., Ivan, I.: Functional signatures and pseudorandom functions. In: Krawczyk, H. (ed.) PKC 2014. LNCS, vol. 8383, pp. 501\u2013519. Springer, Heidelberg (2014)","DOI":"10.1007\/978-3-642-54631-0_29"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Bui, D., Carozza, E., Couteau, G., Goudarzi, D., Joux, A.: Faster signatures from MPC-in-the-head. Cryptology ePrint Archive, Paper 2024\/252 (2024). https:\/\/eprint.iacr.org\/2024\/252","DOI":"10.1007\/978-981-96-0875-1_13"},{"key":"2_CR10","unstructured":"Bui, D., et al.: An efficient ZK compiler from SIMD circuits to general circuits. Cryptology ePrint Archive, Paper 2023\/1610 (2023). https:\/\/eprint.iacr.org\/2023\/1610"},{"key":"2_CR11","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":"2_CR12","doi-asserted-by":"crossref","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)","DOI":"10.1007\/978-3-031-30589-4_19"},{"key":"2_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":"2_CR14","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/978-3-031-15979-4_19","volume-title":"CRYPTO 2022, Part II","author":"T Feneuil","year":"2022","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 2022, Part II. LNCS, vol. 13508, pp. 541\u2013572. Springer, Heidelberg (2022)"},{"key":"2_CR15","doi-asserted-by":"crossref","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)","DOI":"10.1007\/3-540-47721-7_12"},{"key":"2_CR16","doi-asserted-by":"crossref","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)","DOI":"10.1109\/SFCS.1984.715949"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Guo, X., et al.: Half-tree: halving the cost of tree expansion in COT and DPF. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023, Part I. LNCS, vol. 14004, pp. 330\u2013362. Springer, Heidelberg (Apr (2023)","DOI":"10.1007\/978-3-031-30545-0_12"},{"key":"2_CR18","doi-asserted-by":"crossref","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)","DOI":"10.1145\/1250790.1250794"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Kiayias, A., Papadopoulos, S., Triandopoulos, N., Zacharias, T.: Delegatable pseudorandom functions and applications. In: Sadeghi, A.R., Gligor, V.D., Yung, M. (eds.) ACM CCS 2013, pp. 669\u2013684. ACM Press (2013)","DOI":"10.1145\/2508859.2516668"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"M\u00fcnch, J.P., Schneider, T., Yalame, H.: VASA: vector AES instructions for security applications. Cryptology ePrint Archive, Paper 2021\/1493 (2021). https:\/\/eprint.iacr.org\/2021\/1493","DOI":"10.1145\/3485832.3485897"},{"key":"2_CR21","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1007\/978-3-031-15802-5_23","volume-title":"CRYPTO 2022, Part I","author":"L Roy","year":"2022","unstructured":"Roy, L.: SoftSpokenOT: quieter OT extension from small-field silent VOLE in the minicrypt model. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022, Part I. LNCS, vol. 13507, pp. 657\u2013687. Springer, Heidelberg (Aug (2022)"},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: 35th FOCS, pp. 124\u2013134. IEEE Computer Society Press (1994)","DOI":"10.1109\/SFCS.1994.365700"},{"key":"2_CR23","doi-asserted-by":"crossref","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)","DOI":"10.1109\/SP40001.2021.00056"},{"key":"2_CR24","doi-asserted-by":"crossref","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)","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-9098-5_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,10]],"date-time":"2025-07-10T09:26:52Z","timestamp":1752139612000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-9098-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819690978","9789819690985"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-9098-5_2","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"}}]}}