{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T14:10:22Z","timestamp":1778249422467,"version":"3.51.4"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032253354","type":"print"},{"value":"9783032253361","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-25336-1_6","type":"book-chapter","created":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T13:14:12Z","timestamp":1778246052000},"page":"148-177","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["$$\\textsf{Spectra}$$: Interval-Agnostic Vector Range Argument for\u00a0Unstructured Range Assertions"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-9747-8213","authenticated-orcid":false,"given":"Hao","family":"Gao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4604-1142","authenticated-orcid":false,"given":"Qianhong","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9548-8306","authenticated-orcid":false,"given":"Bo","family":"Qin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-7929-7212","authenticated-orcid":false,"given":"Fudong","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-3190-2204","authenticated-orcid":false,"given":"Zhenyang","family":"Ding","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1319-1224","authenticated-orcid":false,"given":"Zhiguo","family":"Wan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,9]]},"reference":[{"issue":"4","key":"6_CR1","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1145\/2534169.2486038","volume":"43","author":"S Angel","year":"2013","unstructured":"Angel, S., Walfish, M.: Verifiable auctions for online ad exchanges. SIGCOMM Comput. Commun. Rev. 43(4), 195\u2013206 (2013). https:\/\/doi.org\/10.1145\/2534169.2486038","journal-title":"SIGCOMM Comput. Commun. Rev."},{"key":"6_CR2","doi-asserted-by":"publisher","unstructured":"Belenkiy, M., Camenisch, J., Chase, M., Kohlweiss, M., Lysyanskaya, A., Shacham, H.: Randomizable proofs and delegatable anonymous credentials. In: Halevi, S. (ed.) Advances in Cryptology - CRYPTO 2009, pp. 108\u2013125. Springer, Berlin, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03356-8_7","DOI":"10.1007\/978-3-642-03356-8_7"},{"key":"6_CR3","unstructured":"Boneh, D., Drake, J., Fisch, B., Gabizon, A.: Efficient polynomial commitment schemes for multiple points and polynomials. Cryptology ePrint Archive, Paper 2020\/081 (2020). https:\/\/eprint.iacr.org\/2020\/081"},{"key":"6_CR4","unstructured":"Boneh, D., Fisch, B., Gabizon, A., Williamson, Z.: A simple range proof from polynomial commitments (2020). https:\/\/hackmd.io\/@dabo\/B1U4kx8XI"},{"key":"6_CR5","doi-asserted-by":"publisher","unstructured":"B\u00fcnz, B., Bootle, J., Boneh, D., Poelstra, A., Wuille, P., Maxwell, G.: Bulletproofs: short proofs for confidential transactions and more. In: 2018 IEEE Symposium on Security and Privacy (SP), pp. 315\u2013334 (2018). https:\/\/doi.org\/10.1109\/SP.2018.00020","DOI":"10.1109\/SP.2018.00020"},{"key":"6_CR6","doi-asserted-by":"publisher","unstructured":"Campanelli, M., Faonio, A., Fiore, D., Li, T., Lipmaa, H.: Lookup arguments: Improvements, extensions and applications to zero-knowledge decision trees. In: Public-Key Cryptography \u2013 PKC 2024: 27th IACR International Conference on Practice and Theory of Public-Key Cryptography, Sydney, NSW, Australia, April 15\u201317, 2024, Proceedings, Part II, pp. 337\u2013369. Springer-Verlag, Berlin, Heidelberg (2024). https:\/\/doi.org\/10.1007\/978-3-031-57722-2_11","DOI":"10.1007\/978-3-031-57722-2_11"},{"key":"6_CR7","doi-asserted-by":"publisher","unstructured":"Campanelli, M., Faonio, A., Fiore, D., Querol, A., Rodr\u00edguez, H.: Lunar: a toolbox for more efficient universal and updatable zksnarks and commit-and-prove extensions. In: Tibouchi, M., Wang, H. (eds.) Advances in Cryptology \u2013 ASIACRYPT 2021, pp. 3\u201333. Springer International Publishing, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92078-4_1","DOI":"10.1007\/978-3-030-92078-4_1"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"76","DOI":"10.2478\/popets-2021-0061","volume":"2021","author":"KK Chalkias","year":"2021","unstructured":"Chalkias, K.K., Cohen, S., Lewi, K., Moezinia, F., Romailler, Y.: Hashwires: hyperefficient credential-based range proofs. Proc. Privacy Enhancing Technol. 2021, 76\u201395 (2021). https:\/\/doi.org\/10.2478\/popets-2021-0061","journal-title":"Proc. Privacy Enhancing Technol."},{"key":"6_CR9","doi-asserted-by":"publisher","unstructured":"Chan, A., Frankel, Y., Tsiounis, Y.: Easy come \u2014 easy go divisible cash. In: Nyberg, K. (ed.) Advances in Cryptology \u2014 EUROCRYPT\u201998, pp. 561\u2013575. Springer, Berlin, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054154","DOI":"10.1007\/BFb0054154"},{"key":"6_CR10","unstructured":"Chung, H., Han, K., Ju, C., Kim, M., Seo, J.H.: Bulletproofs+: shorter proofs for privacy-enhanced distributed ledger. Cryptology ePrint Archive, Paper 2020\/735 (2020). https:\/\/eprint.iacr.org\/2020\/735"},{"key":"6_CR11","doi-asserted-by":"publisher","unstructured":"Daza, V., R\u00e0fols, C., Zacharakis, A.: Updateable inner product argument with logarithmic verifier and applications. In: Kiayias, A., Kohlweiss, M., Wallden, P., Zikas, V. (eds.) Public-Key Cryptography \u2013 PKC 2020, pp. 527\u2013557. Springer International Publishing, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45374-9_18","DOI":"10.1007\/978-3-030-45374-9_18"},{"key":"6_CR12","unstructured":"Eagen, L., Fiore, D., Gabizon, A.: CQ: cached quotients for fast lookups. Cryptology ePrint Archive, Paper 2022\/1763 (2022). https:\/\/eprint.iacr.org\/2022\/1763"},{"key":"6_CR13","doi-asserted-by":"publisher","unstructured":"Eagen, L., Kanjalkar, S., Ruffing, T., Nick, J.: Bulletproofs++: next generation confidential transactions via reciprocal set membership arguments. In: Joye, M., Leander, G. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2024, pp. 249\u2013279. Springer Nature Switzerland, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58740-5_9","DOI":"10.1007\/978-3-031-58740-5_9"},{"key":"6_CR14","unstructured":"Feist, D., Khovratovich, D.: Fast amortized KZG proofs. Cryptology ePrint Archive, Paper 2023\/033 (2023). https:\/\/eprint.iacr.org\/2023\/033"},{"key":"6_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.) Advances in Cryptology \u2013 CRYPTO\u2019 86, pp. 186\u2013194. Springer, Berlin, Heidelberg (1987)","DOI":"10.1007\/3-540-47721-7_12"},{"key":"6_CR16","doi-asserted-by":"publisher","unstructured":"Fuchsbauer, G., Kiltz, E., Loss, J.: The algebraic group model and its applications. In: Shacham, H., Boldyreva, A. (eds.) Advances in Cryptology \u2013 CRYPTO 2018, pp. 33\u201362. Springer International Publishing, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96881-0_2","DOI":"10.1007\/978-3-319-96881-0_2"},{"key":"6_CR17","unstructured":"Gabizon, A., Williamson, Z.J.: plookup: a simplified polynomial protocol for lookup tables. Cryptology ePrint Archive, Paper 2020\/315 (2020)"},{"key":"6_CR18","unstructured":"Gabizon, A., Williamson, Z.J., Ciobotaru, O.: PLONK: permutations over lagrange-bases for oecumenical noninteractive arguments of knowledge. Cryptology ePrint Archive, Paper 2019\/953 (2019). https:\/\/eprint.iacr.org\/2019\/953"},{"key":"6_CR19","doi-asserted-by":"publisher","unstructured":"Gao, R., Wan, Z., Hu, Y., Wang, H.: A succinct range proof for polynomial-based vector commitment. In: Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, pp. 3152\u20133166. CCS \u201924, Association for Computing Machinery, New York (2024). https:\/\/doi.org\/10.1145\/3658644.3670324","DOI":"10.1145\/3658644.3670324"},{"key":"6_CR20","doi-asserted-by":"publisher","unstructured":"Kate, A., Zaverucha, G.M., Goldberg, I.: Constant-size commitments to polynomials and their applications. In: Abe, M. (ed.) Advances in Cryptology - ASIACRYPT 2010, pp. 177\u2013194. Springer, Berlin, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17373-8_11","DOI":"10.1007\/978-3-642-17373-8_11"},{"key":"6_CR21","doi-asserted-by":"publisher","unstructured":"Lipmaa, H.: Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments. In: Cramer, R. (ed.) Theory of Cryptography, pp. 169\u2013189. Springer, Berlin, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28914-9_10","DOI":"10.1007\/978-3-642-28914-9_10"},{"key":"6_CR22","unstructured":"Pearson, L., Fitzgerald, J., Masip, H., Bell\u00e9s-Mu\u00f1oz, M., Mu\u00f1oz-Tapia, J.L.: PlonKup: reconciling PlonK with plookup. Cryptology ePrint Archive, Paper 2022\/086 (2022). https:\/\/eprint.iacr.org\/2022\/086"},{"key":"6_CR23","doi-asserted-by":"publisher","unstructured":"Setty, S., Thaler, J., Wahby, R.: Unlocking the lookup singularity with lasso. In: Joye, M., Leander, G. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2024, pp. 180\u2013209. Springer Nature Switzerland, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58751-1_7","DOI":"10.1007\/978-3-031-58751-1_7"},{"key":"6_CR24","unstructured":"Tomescu, A., et al.: UTT: Decentralized ecash with accountable privacy. Cryptology ePrint Archive, Paper 2022\/452 (2022). https:\/\/eprint.iacr.org\/2022\/452"},{"key":"6_CR25","doi-asserted-by":"publisher","unstructured":"Yuen, T.H., et al.: Ringct 3.0 for blockchain confidential transaction: shorter size and stronger security. In: Bonneau, J., Heninger, N. (eds.) Financial Cryptography and Data Security, pp. 464\u2013483. Springer International Publishing, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51280-4_25","DOI":"10.1007\/978-3-030-51280-4_25"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2026"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-25336-1_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T13:14:28Z","timestamp":1778246068000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-25336-1_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032253354","9783032253361"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-25336-1_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"9 May 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 May 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 May 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}