{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,29]],"date-time":"2026-09-29T16:50:03Z","timestamp":1790700603965,"version":"4.1.0"},"reference-count":35,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"National Key Research and Development Program of China","award":["2021YFB3101100"],"award-info":[{"award-number":["2021YFB3101100"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62441237"],"award-info":[{"award-number":["62441237"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U24A20336"],"award-info":[{"award-number":["U24A20336"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U22B2022"],"award-info":[{"award-number":["U22B2022"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62302326"],"award-info":[{"award-number":["62302326"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Wuhan Science and Technology Project for Key Research and Development","award":["2024050702030090"],"award-info":[{"award-number":["2024050702030090"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans.Inform.Forensic Secur."],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/tifs.2025.3546839","type":"journal-article","created":{"date-parts":[[2025,2,28]],"date-time":"2025-02-28T18:42:40Z","timestamp":1740768160000},"page":"2778-2792","source":"Crossref","is-referenced-by-count":1,"title":["NTTproofs: A Maintainable and Aggregatable Vector Commitment With Fast Openings and Updates"],"prefix":"10.1109","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-4625-5977","authenticated-orcid":false,"given":"Lijuan","family":"Huo","sequence":"first","affiliation":[{"name":"Key Laboratory of Aerospace Information Security and Trusted Computing, Ministry of Education, School of Cyber Science and Engineering, Wuhan University, Wuhan, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9897-1953","authenticated-orcid":false,"given":"Libing","family":"Wu","sequence":"additional","affiliation":[{"name":"Key Laboratory of Aerospace Information Security and Trusted Computing, Ministry of Education, School of Cyber Science and Engineering, Wuhan University, Wuhan, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Enshu","family":"Wang","sequence":"additional","affiliation":[{"name":"Key Laboratory of Aerospace Information Security and Trusted Computing, Ministry of Education, School of Cyber Science and Engineering, Wuhan University, Wuhan, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2921-2827","authenticated-orcid":false,"given":"Jinfei","family":"Liu","sequence":"additional","affiliation":[{"name":"ZJU-Hangzhou Global Scientific and Technological Innovation Center, Zhejiang University, Hangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chunshuo","family":"Li","sequence":"additional","affiliation":[{"name":"Key Laboratory of Aerospace Information Security and Trusted Computing, Ministry of Education, School of Cyber Science and Engineering, Wuhan University, Wuhan, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zemei","family":"Liu","sequence":"additional","affiliation":[{"name":"Key Laboratory of Aerospace Information Security and Trusted Computing, Ministry of Education, School of Cyber Science and Engineering, Wuhan University, Wuhan, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7749-2718","authenticated-orcid":false,"given":"Zhuangzhuang","family":"Zhang","sequence":"additional","affiliation":[{"name":"Key Laboratory of Aerospace Information Security and Trusted Computing, Ministry of Education, School of Cyber Science and Engineering, Wuhan University, Wuhan, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36362-7_5"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11799-2_30"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64834-3_1"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-57990-6_3"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417244"},{"key":"ref6","first-page":"3001","article-title":"Hyperproofs: Aggregating and maintaining proofs in vector commitments","volume-title":"31st USENIX Security Symposium (USENIX Security 22)","author":"Srinivasan"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3560591"},{"key":"ref8","first-page":"4409","article-title":"Balanceproofs: Maintainable vector commitments with fast aggregation","volume-title":"32nd USENIX Security Symposium (USENIX Security 23)","author":"Wang"},{"key":"ref9","first-page":"30:1","article-title":"Functional commitment schemes: From polynomial commitments to pairing-based accumulators from simple assumptions","volume-title":"Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming","volume":"55","author":"Libert"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26948-7_20"},{"key":"ref11","first-page":"2075","article-title":"Scaling verifiable computation using efficient set accumulators","volume-title":"29th USENIX Security Symposium (USENIX Security 20)","author":"Ozdemir"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2023.3287210"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.00020"},{"key":"ref14","first-page":"953","article-title":"Plonk: Permutations over lagrange-bases for oecumenical noninteractive arguments of knowledge","volume-title":"Cryptology ePrint Archive","author":"Gabizon","year":"2019"},{"key":"ref15","first-page":"519","article-title":"Poseidon: A new hash function for zero-knowledge proof systems","volume-title":"30th USENIX Security Symposium (USENIX Security 21)","author":"Grassi"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3560657"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2023.3271268"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2024.3357288"},{"key":"ref19","article-title":"Discovering transforms: A tutorial on circulant matrices, circular convolution, and the discrete fourier transform","volume-title":"arXiv preprint arXiv:1805.05533","author":"Bamieh","year":"2018"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00873"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26948-7_19"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17373-8_11"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36594-2_13"},{"key":"ref24","first-page":"968","article-title":"Edrax: A cryptocurrency with stateless transaction validation","volume-title":"Cryptology ePrint Archive","author":"Chepurnoy","year":"2018"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2022.3163581"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48184-2_32"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38348-9_22"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/2664168.2664177"},{"key":"ref29","first-page":"1469","article-title":"Slap: Succinct lattice-based polynomial commitments from standard assumptions","volume-title":"Cryptology ePrint Archive","author":"Albrecht","year":"2023"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-30620-4_13"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/SP40000.2020.00059"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-84242-0_23"},{"key":"ref33","first-page":"129","article-title":"Non-interactive and information-theoretic secure verifiable secret sharing","volume-title":"Proceedings of the 11th Annual International Cryptology Conference (CRYPTO\u201991)","volume":"576","author":"Pedersen"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-92078-4_3"},{"key":"ref35","first-page":"1516","article-title":"How to compute all pointproofs","volume-title":"Cryptology ePrint Archive","author":"Tomescu","year":"2020"}],"container-title":["IEEE Transactions on Information Forensics and Security"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10206\/10810755\/10908238.pdf?arnumber=10908238","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,14]],"date-time":"2025-03-14T17:46:31Z","timestamp":1741974391000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10908238\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":35,"URL":"https:\/\/doi.org\/10.1109\/tifs.2025.3546839","relation":{},"ISSN":["1556-6013","1556-6021"],"issn-type":[{"value":"1556-6013","type":"print"},{"value":"1556-6021","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]}}}