{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,8]],"date-time":"2026-10-08T05:21:39Z","timestamp":1791436899904,"version":"4.3.3"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T00:00:00Z","timestamp":1719792000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,7]]},"DOI":"10.1145\/3634737.3645003","type":"proceedings-article","created":{"date-parts":[[2024,6,28]],"date-time":"2024-06-28T11:51:38Z","timestamp":1719575498000},"page":"289-305","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["zkMatrix: Batched Short Proof for Committed Matrix Multiplication"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5858-3411","authenticated-orcid":false,"given":"Mingshu","family":"Cong","sequence":"first","affiliation":[{"name":"The University of Hong Kong, Hong Kong, Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0629-6792","authenticated-orcid":false,"given":"Tsz Hon","family":"Yuen","sequence":"additional","affiliation":[{"name":"Monash University, Melbourne, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3975-8500","authenticated-orcid":false,"given":"Siu-Ming","family":"Yiu","sequence":"additional","affiliation":[{"name":"The University of Hong Kong, Hong Kong, Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,7]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Privacy-Preserving Data Mining. In SIGMOD 2000 (Dallas, Texas, USA) (Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data). ACM, 439--450","author":"Agrawal Rakesh","year":"2000","unstructured":"Rakesh Agrawal and Ramakrishnan Srikant. 2000. Privacy-Preserving Data Mining. In SIGMOD 2000 (Dallas, Texas, USA) (Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data). ACM, 439--450."},{"key":"e_1_3_2_2_2_1","volume-title":"CRYPTO 2021 (Lecture Notes in Computer Science","volume":"579","author":"Attema Thomas","year":"2021","unstructured":"Thomas Attema, Ronald Cramer, and Lisa Kohl. 2021. A compressed \u03a3-protocol theory for lattices. In CRYPTO 2021 (Lecture Notes in Computer Science, Vol. 12826), Tal Malkin and Chris Peikert (Eds.). Springer, 549--579."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-22318-1_5"},{"key":"e_1_3_2_2_4_1","volume-title":"Halo: Recursive proof composition without a trusted setup. Cryptology ePrint Archive","author":"Bowe Sean","year":"2019","unstructured":"Sean Bowe, Jack Grigg, and Daira Hopwood. 2019. Halo: Recursive proof composition without a trusted setup. Cryptology ePrint Archive (2019), 1021. https:\/\/eprint.iacr.org\/2019\/1021"},{"key":"e_1_3_2_2_5_1","volume-title":"Bulletproofs: Short proofs for confidential transactions and more. In S&P 2018 (Proceedings of 2018 IEEE symposium on security and privacy)","author":"B\u00fcnz Benedikt","year":"2018","unstructured":"Benedikt B\u00fcnz, Jonathan Bootle, Dan Boneh, Andrew Poelstra, Pieter Wuille, and Greg Maxwell. 2018. Bulletproofs: Short proofs for confidential transactions and more. In S&P 2018 (Proceedings of 2018 IEEE symposium on security and privacy). IEEE, 315--334."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45721-1_24"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3339820"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-30617-4_17"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45721-1_26"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45721-1_27"},{"key":"e_1_3_2_2_11_1","volume-title":"Practical Private Computation and Zero-Knowledge Tools for Privacy-Preserving Distributed Data Mining. In SDM 2008 (Proceedings of the SIAM International Conference on Data Mining). SIAM, 265--276","author":"Duan Yitao","unstructured":"Yitao Duan and John Canny. [n. d.]. Practical Private Computation and Zero-Knowledge Tools for Privacy-Preserving Distributed Data Mining. In SDM 2008 (Proceedings of the SIAM International Conference on Data Mining). SIAM, 265--276."},{"key":"e_1_3_2_2_12_1","volume-title":"Plonk: Permutations over lagrange-bases for oecumenical noninteractive arguments of knowledge. Cryptology ePrint Archive","author":"Gabizon Ariel","year":"2019","unstructured":"Ariel Gabizon, Zachary J Williamson, and Oana Ciobotaru. 2019. Plonk: Permutations over lagrange-bases for oecumenical noninteractive arguments of knowledge. Cryptology ePrint Archive (2019), 953. https:\/\/eprint.iacr.org\/2019\/953"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-06944-4_16"},{"key":"e_1_3_2_2_14_1","unstructured":"Jens Groth. 2004. Honest verifier zero-knowledge arguments applied. Ph.D.Dissertation. BRICS."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03356-8_12"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17373-8_19"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49896-5_11"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17373-8_11"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3485379"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3339817"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2856449"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40084-1_5"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASAP.2017.7995254"},{"key":"e_1_3_2_2_24_1","volume-title":"USENIX 2021 (Proceedings of the 28th USENIX Conference on Security Symposium), Michael Bailey and Rachel Greenstadt (Eds.). USENIX Association, 501--518","author":"Weng Chenkai","year":"2021","unstructured":"Chenkai Weng, Kang Yang, Xiang Xie, Jonathan Katz, and Xiao Wang. 2021. Mystique: Efficient Conversions for Zero-Knowledge Proofs with Applications to Machine Learning. In USENIX 2021 (Proceedings of the 28th USENIX Conference on Security Symposium), Michael Bailey and Rachel Greenstadt (Eds.). USENIX Association, 501--518."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26954-8_24"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484556"},{"key":"e_1_3_2_2_27_1","volume-title":"DualRing: Generic Construction of Ring Signatures with Efficient Instantiations. In CRYPTO 2021 (Lecture Notes in Computer Science","volume":"281","author":"Yuen Tsz Hon","year":"2021","unstructured":"Tsz Hon Yuen, Muhammed F. Esgin, Joseph K. Liu, Man Ho Au, and Zhimin Ding. 2021. DualRing: Generic Construction of Ring Signatures with Efficient Instantiations. In CRYPTO 2021 (Lecture Notes in Computer Science, Vol. 12825), Tal Malkin and Chris Peikert (Eds.). Springer, 251--281."}],"event":{"name":"ASIA CCS '24: 19th ACM Asia Conference on Computer and Communications Security","location":"Singapore Singapore","acronym":"ASIA CCS '24","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 19th ACM Asia Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3634737.3645003","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T23:44:06Z","timestamp":1750290246000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3634737.3645003"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7]]},"references-count":27,"alternative-id":["10.1145\/3634737.3645003","10.1145\/3634737"],"URL":"https:\/\/doi.org\/10.1145\/3634737.3645003","relation":{},"subject":[],"published":{"date-parts":[[2024,7]]},"assertion":[{"value":"2024-07-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}