{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T17:59:17Z","timestamp":1773511157069,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":41,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,11,7]],"date-time":"2022-11-07T00:00:00Z","timestamp":1667779200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100007219","name":"Natural Science Foundation of Shanghai","doi-asserted-by":"publisher","award":["21ZR1443000"],"award-info":[{"award-number":["21ZR1443000"]}],"id":[{"id":"10.13039\/100007219","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,11,7]]},"DOI":"10.1145\/3548606.3560591","type":"proceedings-article","created":{"date-parts":[[2022,11,7]],"date-time":"2022-11-07T11:41:28Z","timestamp":1667821288000},"page":"2041-2054","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Matproofs"],"prefix":"10.1145","author":[{"given":"Jing","family":"Liu","sequence":"first","affiliation":[{"name":"ShanghaiTech University, Shanghai, China"}]},{"given":"Liang Feng","family":"Zhang","sequence":"additional","affiliation":[{"name":"ShanghaiTech University, Shanghai, China"}]}],"member":"320","published-online":{"date-parts":[[2022,11,7]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64840-4_28"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/168588.168596"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24676-3_14"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/11426639_26"},{"key":"e_1_3_2_2_5_1","volume-title":"Annual international cryptology conference","author":"Boneh Dan","unstructured":"Dan Boneh , Xavier Boyen , and Hovav Shacham . 2004. Short group signatures . In Annual international cryptology conference . Springer , 41--55. Dan Boneh, Xavier Boyen, and Hovav Shacham. 2004. Short group signatures. In Annual international cryptology conference. Springer, 41--55."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26948-7_20"},{"key":"e_1_3_2_2_7_1","volume-title":"Annual international cryptology conference","author":"Boneh Dan","unstructured":"Dan Boneh and Matt Franklin . 2001. Identity-based encryption from the Weil pairing . In Annual international cryptology conference . Springer , 213--229. Dan Boneh and Matt Franklin. 2001. Identity-based encryption from the Weil pairing. In Annual international cryptology conference. Springer, 213--229."},{"key":"e_1_3_2_2_8_1","volume-title":"Annual international cryptology conference","author":"Boneh Dan","unstructured":"Dan Boneh , Craig Gentry , and Brent Waters . 2005 b. Collusion resistant broadcast encryption with short ciphertexts and private keys . In Annual international cryptology conference . Springer , 258--275. Dan Boneh, Craig Gentry, and Brent Waters. 2005 b. Collusion resistant broadcast encryption with short ciphertexts and private keys. In Annual international cryptology conference. Springer, 258--275."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-56880-1_16"},{"key":"e_1_3_2_2_10_1","volume-title":"International Conference on Financial Cryptography and Data Security. Springer, 64--77","author":"Bowe Sean","year":"2018","unstructured":"Sean Bowe , Ariel Gabizon , and Matthew D Green . 2018 . A multi-party protocol for constructing the public parameters of the Pinocchio zk-SNARK . In International Conference on Financial Cryptography and Data Security. Springer, 64--77 . Sean Bowe, Ariel Gabizon, and Matthew D Green. 2018. A multi-party protocol for constructing the public parameters of the Pinocchio zk-SNARK. In International Conference on Financial Cryptography and Data Security. Springer, 64--77."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85538-5_3"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-92078-4_3"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64834-3_1"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36362-7_5"},{"key":"e_1_3_2_2_15_1","volume-title":"Edrax: A cryptocurrency with stateless transaction validation. Cryptology ePrint Archive","author":"Chepurnoy Alexander","year":"2018","unstructured":"Alexander Chepurnoy , Charalampos Papamanthou , Shravan Srinivasan , and Yupeng Zhang . 2018 . Edrax: A cryptocurrency with stateless transaction validation. Cryptology ePrint Archive (2018). Alexander Chepurnoy, Charalampos Papamanthou, Shravan Srinivasan, and Yupeng Zhang. 2018. Edrax: A cryptocurrency with stateless transaction validation. Cryptology ePrint Archive (2018)."},{"key":"e_1_3_2_2_16_1","volume-title":"URL: https:\/\/ethereum. org [accessed 2020-07-07]","author":"Ethereum W","year":"2014","unstructured":"W Ethereum . 2014. Ethereum Whitepaper . Ethereum. URL: https:\/\/ethereum. org [accessed 2020-07-07] ( 2014 ). W Ethereum. 2014. Ethereum Whitepaper. Ethereum. URL: https:\/\/ethereum. org [accessed 2020-07-07] (2014)."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96881-0_2"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417244"},{"key":"e_1_3_2_2_19_1","volume-title":"30th USENIX Security Symposium (USENIX Security 21)","author":"Grassi Lorenzo","year":"2021","unstructured":"Lorenzo Grassi , Dmitry Khovratovich , Christian Rechberger , Arnab Roy , and Markus Schofnegger . 2021 . Poseidon: A New Hash Function for {Zero-Knowledge} Proof Systems . In 30th USENIX Security Symposium (USENIX Security 21) . 519--535. Lorenzo Grassi, Dmitry Khovratovich, Christian Rechberger, Arnab Roy, and Markus Schofnegger. 2021. Poseidon: A New Hash Function for {Zero-Knowledge} Proof Systems. In 30th USENIX Security Symposium (USENIX Security 21). 519--535."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25385-0_23"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49896-5_11"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17373-8_11"},{"key":"e_1_3_2_2_23_1","volume-title":"Efficient Zero-Knowledge Argument in Discrete Logarithm Setting: Sublogarithmic Proof or Sublinear Verifier. Cryptology ePrint Archive","author":"Kim Sungwook","year":"2021","unstructured":"Sungwook Kim , Hyeonbum Lee , and Jae Hong Seo . 2021. Efficient Zero-Knowledge Argument in Discrete Logarithm Setting: Sublogarithmic Proof or Sublinear Verifier. Cryptology ePrint Archive ( 2021 ). Sungwook Kim, Hyeonbum Lee, and Jae Hong Seo. 2021. Efficient Zero-Knowledge Argument in Discrete Logarithm Setting: Sublogarithmic Proof or Sublinear Verifier. Cryptology ePrint Archive (2021)."},{"key":"e_1_3_2_2_24_1","volume-title":"Verkle Trees","volume":"1","author":"Kuszmaul John","year":"2019","unstructured":"John Kuszmaul . 2019 . Verkle trees . Verkle Trees , Vol. 1 (2019). John Kuszmaul. 2019. Verkle trees. Verkle Trees, Vol. 1 (2019)."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26948-7_19"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-90453-1_1"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11799-2_30"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/11586821_1"},{"key":"e_1_3_2_2_29_1","volume-title":"Conference on the theory and application of cryptographic techniques. Springer, 369--378","author":"Merkle Ralph C","year":"1987","unstructured":"Ralph C Merkle . 1987 . A digital signature based on a conventional encryption function . In Conference on the theory and application of cryptographic techniques. Springer, 369--378 . Ralph C Merkle. 1987. A digital signature based on a conventional encryption function. In Conference on the theory and application of cryptographic techniques. Springer, 369--378."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02113297"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36594-2_13"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38348-9_22"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2856449"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2664168.2664177"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70972-7_21"},{"key":"e_1_3_2_2_36_1","volume-title":"MCL: a portable and fast pairing-based cryptography library","author":"Shigeo Mitsunari","year":"2020","unstructured":"Mitsunari Shigeo . 2020. MCL: a portable and fast pairing-based cryptography library , 2020 . GitHub Repository. Accessed ( 2020), 05--23. https:\/\/github.com\/herumi\/mcl\/ Mitsunari Shigeo. 2020. MCL: a portable and fast pairing-based cryptography library, 2020. GitHub Repository. Accessed (2020), 05--23. https:\/\/github.com\/herumi\/mcl\/"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-69053-0_18"},{"key":"e_1_3_2_2_38_1","volume-title":"31st USENIX Security Symposium (USENIX Security 22)","author":"Srinivasan Shravan","year":"2022","unstructured":"Shravan Srinivasan , Alexander Chepurnoy , Charalampos Papamanthou , Alin Tomescu , and Yupeng Zhang . 2022 . Hyperproofs: Aggregating and maintaining proofs in vector commitments . In 31st USENIX Security Symposium (USENIX Security 22) . 3001--3018. Shravan Srinivasan, Alexander Chepurnoy, Charalampos Papamanthou, Alin Tomescu, and Yupeng Zhang. 2022. Hyperproofs: Aggregating and maintaining proofs in vector commitments. In 31st USENIX Security Symposium (USENIX Security 22). 3001--3018."},{"key":"e_1_3_2_2_39_1","volume-title":"How to compute all Pointproofs. Cryptology ePrint Archive","author":"Tomescu Alin","year":"2020","unstructured":"Alin Tomescu . 2020a. How to compute all Pointproofs. Cryptology ePrint Archive ( 2020 ). Alin Tomescu. 2020a. How to compute all Pointproofs. Cryptology ePrint Archive (2020)."},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-57990-6_3"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP40000.2020.00059"}],"event":{"name":"CCS '22: 2022 ACM SIGSAC Conference on Computer and Communications Security","location":"Los Angeles CA USA","acronym":"CCS '22","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3548606.3560591","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3548606.3560591","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:50:58Z","timestamp":1750182658000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3548606.3560591"}},"subtitle":["Maintainable Matrix Commitment with Efficient Aggregation"],"short-title":[],"issued":{"date-parts":[[2022,11,7]]},"references-count":41,"alternative-id":["10.1145\/3548606.3560591","10.1145\/3548606"],"URL":"https:\/\/doi.org\/10.1145\/3548606.3560591","relation":{},"subject":[],"published":{"date-parts":[[2022,11,7]]},"assertion":[{"value":"2022-11-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}