{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T01:59:48Z","timestamp":1778291988421,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T00:00:00Z","timestamp":1733097600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"the Major Basic Research Program of the Shandong Provincial Natural Science Foundation under Grant","award":["ZR2020ZD01"],"award-info":[{"award-number":["ZR2020ZD01"]}]},{"name":"the Key Research Project of Zhejiang Laboratory under Grant","award":["2022PD0AC01"],"award-info":[{"award-number":["2022PD0AC01"]}]},{"name":"the National Natural Science Foundation of China under Grants","award":["U23B2002"],"award-info":[{"award-number":["U23B2002"]}]},{"name":"the National Natural Science Foundation of China under Grants","award":["62272425"],"award-info":[{"award-number":["62272425"]}]},{"name":"the National Natural Science Foundation of China under Grants","award":["62272238"],"award-info":[{"award-number":["62272238"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,12,2]]},"DOI":"10.1145\/3658644.3670324","type":"proceedings-article","created":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T12:19:20Z","timestamp":1733746760000},"page":"3152-3166","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["A Succinct Range Proof for Polynomial-based Vector Commitment"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-3829-216X","authenticated-orcid":false,"given":"Rui","family":"Gao","sequence":"first","affiliation":[{"name":"Jiangsu Cryptographic Technology Engineering Research Center, Nanjing University of Posts and Telecommunications & Zhejiang Lab, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1319-1224","authenticated-orcid":false,"given":"Zhiguo","family":"Wan","sequence":"additional","affiliation":[{"name":"Zhejiang Lab, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8338-3507","authenticated-orcid":false,"given":"Yuncong","family":"Hu","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7254-6465","authenticated-orcid":false,"given":"Huaqun","family":"Wang","sequence":"additional","affiliation":[{"name":"Jiangsu Cryptographic Technology Engineering Research Center, Nanjing University of Posts and Telecommunications, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,12,9]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"245","volume-title":"AUSCRYPT 1990","author":"Chaum D.","year":"1990","unstructured":"D. Chaum, \"Showing credentials without identification transferring signatures between unconditionally unlinkable pseudonyms,\" in Advances in Cryptology, AUSCRYPT 1990, Sydney, Australia. Springer, 1990, pp. 245--264."},{"key":"e_1_3_2_1_2_1","first-page":"467","volume-title":"ACNS 2005","author":"Groth J.","year":"2005","unstructured":"J. Groth, \"Non-interactive zero-knowledge arguments for voting,\" in Applied Cryptography and Network Security, ACNS 2005, New York, NY, USA. Springer, 2005, pp. 467--482."},{"key":"e_1_3_2_1_3_1","first-page":"302","volume-title":"Compact e-cash,\" in Advances in Cryptology - EUROCRYPT","author":"Camenisch J.","year":"2005","unstructured":"J. Camenisch, S. Hohenberger, and A. Lysyanskaya, \"Compact e-cash,\" in Advances in Cryptology - EUROCRYPT 2005, Aarhus, Denmark. Springer, 2005, pp. 302--321."},{"key":"e_1_3_2_1_4_1","first-page":"87","volume-title":"FC 2002, Southampton, Bermuda. Springer","author":"Lipmaa H.","year":"2003","unstructured":"H. Lipmaa, N. Asokan, and V. Niemi, \"Secure vickrey auctions without threshold trust,\" in Financial Cryptography, FC 2002, Southampton, Bermuda. Springer, 2003, pp. 87--101."},{"key":"e_1_3_2_1_5_1","first-page":"70","volume-title":"ICEC 2006","author":"Parkes D. C.","year":"2006","unstructured":"D. C. Parkes, M. O. Rabin, S. M. Shieber, and C. A. Thorpe, \"Practical secrecypreserving, verifiably correct and trustworthy auctions,\" in Proceedings of the 8th international conference on Electronic commerce, ICEC 2006, Fredericton, New Brunswick, Canada, 2006, pp. 70--81."},{"key":"e_1_3_2_1_6_1","first-page":"738","volume-title":"ICALP 2012","author":"Rabin M. O.","year":"2012","unstructured":"M. O. Rabin, Y. Mansour, S. Muthukrishnan, and M. Yung, \"Strictly-black-box zero-knowledge and efficient validation of financial transactions,\" in International Colloquium on Automata, Languages, and Programming, ICALP 2012, Warwick, UK. Springer, 2012, pp. 738--749."},{"key":"e_1_3_2_1_7_1","first-page":"459","volume-title":"IEEE","author":"Sasson E. B.","year":"2014","unstructured":"E. B. Sasson, A. Chiesa, C. Garman, M. Green, I. Miers, E. Tromer, and M. Virza, \"Zerocash: Decentralized anonymous payments from bitcoin,\" in IEEE symposium on security and privacy, S&P 2014. IEEE, 2014, pp. 459--474."},{"key":"e_1_3_2_1_8_1","first-page":"45","volume-title":"SCN 2020","author":"Tomescu A.","year":"2020","unstructured":"A. Tomescu, I. Abraham, V. Buterin, J. Drake, D. Feist, and D. Khovratovich, \"Aggregatable subvector commitments for stateless cryptocurrencies,\" in International Conference on Security and Cryptography for Networks, SCN 2020, Amalfi, Italy. Springer, 2020, pp. 45--64."},{"key":"e_1_3_2_1_9_1","first-page":"527","volume-title":"PKC 2020","author":"Daza V.","year":"2020","unstructured":"V. Daza, C. R\u00e0fols, and A. Zacharakis, \"Updateable inner product argument with logarithmic verifier and applications,\" in Public-Key Cryptography, PKC 2020, Edinburgh, UK. Springer, 2020, pp. 527--557."},{"key":"e_1_3_2_1_10_1","first-page":"315","volume-title":"S&P","author":"B\u00fcnz B.","year":"2018","unstructured":"B. B\u00fcnz, J. Bootle, D. Boneh, A. Poelstra, P.Wuille, and G. Maxwell, \"Bulletproofs: Short proofs for confidential transactions and more,\" in IEEE symposium on security and privacy, S&P 2018, San Francisco, CA, USA. IEEE, 2018, pp. 315--334."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45539-6_31"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-77883-5_9"},{"key":"e_1_3_2_1_13_1","first-page":"609","volume-title":"CCS 2022","author":"Couteau G.","year":"2022","unstructured":"G. Couteau, D. Goudarzi, M. Kloo\u00df, and M. Reichle, \"Sharp: Short relaxed range proofs,\" in Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, CCS 2022, Los Angeles, CA, USA, 2022, pp. 609--622."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-56877-1_18"},{"key":"e_1_3_2_1_15_1","volume-title":"Proposal: The turbo-plonk program syntax for specifying snark programs","author":"Gabizon A.","year":"2020","unstructured":"A. Gabizon and Z. J. Williamson, \"Proposal: The turbo-plonk program syntax for specifying snark programs,\" 2020. [Online]. Available: https:\/\/docs.zkproof.org\/ pages\/standards\/accepted-workshop3\/proposal-turbo_plonk.pdf"},{"key":"e_1_3_2_1_16_1","first-page":"86","volume":"2022","author":"Pearson L.","year":"2022","unstructured":"L. Pearson, J. Fitzgerald, H. Masip, M. Bell\u00e9s-Mu\u00f1oz, and J. L. Mu\u00f1oz-Tapia, \"Plonkup: Reconciling plonk with plookup,\" Cryptology ePrint Archive, vol. 2022, p. 86, 2022.","journal-title":"Print Archive"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45721-1_24"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17373-8_11"},{"key":"e_1_3_2_1_19_1","volume-title":"ICALP","volume":"14","author":"Ben-Sasson E.","year":"2018","unstructured":"E. Ben-Sasson, I. Bentov, Y. Horesh, and M. Riabzev, \"Fast reed-solomon interactive oracle proofs of proximity,\" in international colloquium on automata, languages, and programming, ICALP 2018, Prague, Czech Republic, vol. 14. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2018, pp. 1--17."},{"key":"e_1_3_2_1_20_1","first-page":"31","volume-title":"TCC 2016","author":"Ben-Sasson E.","year":"2016","unstructured":"E. Ben-Sasson, A. Chiesa, and N. Spooner, \"Interactive oracle proofs,\" in Theory of Cryptography, TCC 2016, Beijing, China. Springer, 2016, pp. 31--60."},{"key":"e_1_3_2_1_21_1","first-page":"186","volume-title":"CRYPTO 1986","author":"Fiat A.","year":"1986","unstructured":"A. Fiat and A. Shamir, \"How to prove yourself: Practical solutions to identification and signature problems,\" in Advances in Cryptology, CRYPTO 1986, Santa Barbara, California, USA. Springer, 1986, pp. 186--194."},{"key":"e_1_3_2_1_22_1","first-page":"55","volume-title":"PKC 2013","author":"Catalano D.","year":"2013","unstructured":"D. Catalano and D. Fiore, \"Vector commitments and their applications,\" in Public-Key Cryptography, PKC 2013, Nara, Japan. Springer, 2013, pp. 55--72."},{"key":"e_1_3_2_1_23_1","first-page":"2007","volume-title":"CCS 2020","author":"Gorbunov S.","year":"2020","unstructured":"S. Gorbunov, L. Reyzin, H. Wee, and Z. Zhang, \"Pointproofs: Aggregating proofs for multiple vector commitments,\" in Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, CCS 2020, Virtual Event, USA, 2020, pp. 2007--2023."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45721-1_26"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-56877-1_25"},{"key":"e_1_3_2_1_26_1","first-page":"222","volume-title":"TCC 2013","author":"Papamanthou C.","year":"2013","unstructured":"C. Papamanthou, E. Shi, and R. Tamassia, \"Signatures of correct computation,\" in Theory of Cryptography Conference, TCC 2013, Tokyo, Japan. Springer, 2013, pp. 222--242."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-30617-4_17"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17653-2_4"},{"key":"e_1_3_2_1_29_1","first-page":"1400","volume":"2019","author":"Kattis A.","year":"2019","unstructured":"A. Kattis, K. Panarin, and A. Vlasov, \"Redshift: Transparent snarks from list polynomial commitment iops,\" IACR Cryptol. ePrint Arch., vol. 2019, p. 1400, 2019.","journal-title":"ePrint Arch."},{"key":"e_1_3_2_1_30_1","first-page":"859","volume-title":"S&P","author":"Zhang J.","year":"2020","unstructured":"J. Zhang, T. Xie, Y. Zhang, and D. Song, \"Transparent polynomial delegation and its applications to zero knowledge proof,\" in IEEE Symposium on Security and Privacy, S&P 2020, San Francisco, CA, USA. IEEE, 2020, pp. 859--876."},{"key":"e_1_3_2_1_31_1","volume-title":"USA","author":"Zhang Z.","year":"2024","unstructured":"Z. Zhang, W. Li, Y. Guo, K. Shi, S. S. Chow, X. Liu, and J. Dong, \"Fast rs-iop multivariate polynomial commitments and verifiable secret sharing,\" in USENIX Security 2024, Philadelphia, PA, USA, 2024."}],"event":{"name":"CCS '24: ACM SIGSAC Conference on Computer and Communications Security","location":"Salt Lake City UT USA","acronym":"CCS '24","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3658644.3670324","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3658644.3670324","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T06:20:04Z","timestamp":1755843604000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3658644.3670324"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,2]]},"references-count":31,"alternative-id":["10.1145\/3658644.3670324","10.1145\/3658644"],"URL":"https:\/\/doi.org\/10.1145\/3658644.3670324","relation":{},"subject":[],"published":{"date-parts":[[2024,12,2]]},"assertion":[{"value":"2024-12-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}