{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,4]],"date-time":"2026-09-04T07:12:53Z","timestamp":1788505973631,"version":"build-2803163510"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2026,9,4]],"date-time":"2026-09-04T00:00:00Z","timestamp":1788480000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,9,4]],"date-time":"2026-09-04T00:00:00Z","timestamp":1788480000000},"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":["Front. Comput. Sci."],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1007\/s11704-026-52118-4","type":"journal-article","created":{"date-parts":[[2026,9,4]],"date-time":"2026-09-04T06:29:29Z","timestamp":1788503369000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Dual functional commitments for arbitrary circuits of bounded sizes"],"prefix":"10.1007","volume":"20","author":[{"given":"Jinrui","family":"Sha","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shengli","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shuai","family":"Han","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,9,4]]},"reference":[{"key":"52118_CR1","first-page":"287","volume-title":"Proceedings of the 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques","author":"L de Castro","year":"2023","unstructured":"de Castro L, Peikert C. Functional commitments for all functions, with transparent setup and from sis. In: Proceedings of the 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques. 2023, 287\u2013320"},{"key":"52118_CR2","first-page":"201","volume-title":"Proceedings of the 29th International Conference on the Theory and Application of Cryptology and Information Security","author":"H Wee","year":"2023","unstructured":"Wee H, Wu D J. Lattice-based functional commitments: Fast verification and cryptanalysis. In: Proceedings of the 29th International Conference on the Theory and Application of Cryptology and Information Security. 2023, 201\u2013235"},{"key":"52118_CR3","first-page":"159","volume-title":"Proceedings of the 28th International Conference on the Theory and Application of Cryptology and Information Security","author":"D Catalano","year":"2022","unstructured":"Catalano D, Fiore D, Tucker I. Additive-homomorphic functional commitments and applications to homomorphic signatures. In: Proceedings of the 28th International Conference on the Theory and Application of Cryptology and Information Security. 2022, 159\u2013188"},{"key":"52118_CR4","first-page":"2007","volume-title":"Proceedings of 2020 ACM SIGSAC Conference on Computer and Communications Security","author":"S Gorbunov","year":"2020","unstructured":"Gorbunov S, Reyzin L, Wee H, Zhang Z. Pointproofs: aggregating proofs for multiple vector commitments. In: Proceedings of 2020 ACM SIGSAC Conference on Computer and Communications Security. 2020, 2007\u20132023"},{"key":"52118_CR5","first-page":"3","volume-title":"Proceedings of the 26th International Conference on the Theory and Application of Cryptology and Information Security","author":"M Campanelli","year":"2020","unstructured":"Campanelli M, Fiore D, Greco N, Kolonelos D, Nizzardo L. Incrementally aggregatable vector commitments and applications to verifiable decentralized storage. In: Proceedings of the 26th International Conference on the Theory and Application of Cryptology and Information Security. 2020, 3\u201335"},{"key":"52118_CR6","first-page":"677","volume-title":"Proceedings of the 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques","author":"B B\u00fcnz","year":"2020","unstructured":"B\u00fcnz B, Fisch B, Szepieniec A. Transparent SNARKs from DARK compilers. In: Proceedings of the 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques. 2020, 677\u2013706"},{"key":"52118_CR7","first-page":"649","volume-title":"Proceedings of the 41st Annual International Cryptology Conference","author":"D Boneh","year":"2021","unstructured":"Boneh D, Drake J, Fisch B, Gabizon A. Halo Infinite: Proofcarrying data from additive polynomial commitments. In: Proceedings of the 41st Annual International Cryptology Conference. 2021, 649\u2013680"},{"key":"52118_CR8","volume-title":"Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming","author":"B Libert","year":"2016","unstructured":"Libert B, Ramanna S C, Yung M. Functional commitment schemes: from polynomial commitments to pairing-based accumulators from simple assumptions. In: Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming. 2016"},{"key":"52118_CR9","first-page":"530","volume-title":"Proceedings of the 39th Annual International Cryptology Conference","author":"R W F Lai","year":"2019","unstructured":"Lai R W F, Malavolta G. Subvector commitments with application to succinct arguments. In: Proceedings of the 39th Annual International Cryptology Conference. 2019, 530\u2013560"},{"key":"52118_CR10","first-page":"686","volume-title":"Proceedings of the 26th International Conference on the Theory and Application of Cryptology and Information Security","author":"H Lipmaa","year":"2020","unstructured":"Lipmaa H, Pavlyk K. Succinct functional commitment for a large class of arithmetic circuits. In: Proceedings of the 26th International Conference on the Theory and Application of Cryptology and Information Security. 2020, 686\u2013716"},{"key":"52118_CR11","first-page":"1342","volume":"2021","author":"D Boneh","year":"2021","unstructured":"Boneh D, Nguyen W D, Ozdemir A. Efficient functional commitments: how to commit to private functions. Cryptology ePrint Archive, 2021, 2021: 1342","journal-title":"Cryptology ePrint Archive"},{"key":"52118_CR12","first-page":"480","volume-title":"Proceedings of the 19th International Conference on Theory of Cryptography","author":"C Peikert","year":"2021","unstructured":"Peikert C, Pepin Z, Sharp C. Vector and functional commitments from lattices. In: Proceedings of the 19th International Conference on Theory of Cryptography. 2021, 480\u2013511"},{"key":"52118_CR13","first-page":"102","volume-title":"Proceedings of the 42nd Annual International Cryptology Conference","author":"M R Albrecht","year":"2022","unstructured":"Albrecht M R, Cini V, Lai R W F, Malavolta G, Thyagarajan S A. Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable. In: Proceedings of the 42nd Annual International Cryptology Conference. 2022, 102\u2013132"},{"key":"52118_CR14","first-page":"1365","volume":"2022","author":"D Balb\u00e1s","year":"2022","unstructured":"Balb\u00e1s D, Catalano D, Fiore D, Lai R W F. Functional commitments for circuits from falsifiable assumptions. Cryptology ePrint Archive, 2022, 2022: 1365","journal-title":"Cryptology ePrint Archive"},{"key":"52118_CR15","first-page":"385","volume-title":"Proceedings of the 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques","author":"H Wee","year":"2023","unstructured":"Wee H, Wu D J. Succinct vector, polynomial, and functional commitments from lattices. In: Proceedings of the 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques. 2023, 385\u2013416"},{"issue":"12","key":"52118_CR16","doi-asserted-by":"publisher","first-page":"3919","DOI":"10.1007\/s10623-024-01468-w","volume":"92","author":"J Sha","year":"2024","unstructured":"Sha J, Liu S, Han S. Functional commitments for arbitrary circuits of bounded sizes. Designs, Codes and Cryptography, 2024, 92(12): 3919\u20133953","journal-title":"Designs, Codes and Cryptography"},{"key":"52118_CR17","first-page":"617","volume-title":"Proceedings of the 45th Annual International Cryptology Conference","author":"H Wee","year":"2025","unstructured":"Wee H. Functional commitments and SNARGs for P\/poly from SIS. In: Proceedings of the 45th Annual International Cryptology Conference. 2025, 617\u2013640"},{"key":"52118_CR18","first-page":"178","volume-title":"Proceedings of the 44th Annual International Cryptology Conference","author":"H Wee","year":"2024","unstructured":"Wee H. Circuit ABE with poly(depth, \u03bb)-sized ciphertexts and keys from lattices. In: Proceedings of the 44th Annual International Cryptology Conference. 2024, 178\u2013209"},{"key":"52118_CR19","first-page":"75","volume-title":"Proceedings of the 33rd Annual Cryptology Conference","author":"C Gentry","year":"2013","unstructured":"Gentry C, Sahai A, Waters B. Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based. In: Proceedings of the 33rd Annual Cryptology Conference. 2013, 75\u201392"},{"key":"52118_CR20","first-page":"469","volume-title":"Proceedings of the 47th Annual ACM Symposium on Theory of Computing","author":"S Gorbunov","year":"2015","unstructured":"Gorbunov S, Vaikuntanathan V, Wichs D. Leveled fully homomorphic signatures from standard lattices. In: Proceedings of the 47th Annual ACM Symposium on Theory of Computing. 2015, 469\u2013477"},{"issue":"4","key":"52118_CR21","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"A K Lenstra","year":"1982","unstructured":"Lenstra A K, LenstraJr H W, Lov\u00e1sz L. Factoring polynomials with rational coefficients. Mathematische Annalen, 1982, 261(4): 515\u2013534","journal-title":"Mathematische Annalen"},{"issue":"2\u20133","key":"52118_CR22","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0304-3975(87)90064-8","volume":"53","author":"C P Schnorr","year":"1987","unstructured":"Schnorr C P. A hierarchy of polynomial time lattice basis reduction algorithms. Theoretical Computer Science, 1987, 53(2\u20133): 201\u2013224","journal-title":"Theoretical Computer Science"},{"key":"52118_CR23","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1145\/380752.380857","volume-title":"Proceedings of the 33rd Annual ACM Symposium on Theory of Computing","author":"M Ajtai","year":"2001","unstructured":"Ajtai M, Kumar R, Sivakumar D. A sieve algorithm for the shortest lattice vector problem. In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing. 2001, 601\u2013610"},{"key":"52118_CR24","first-page":"533","volume-title":"Proceedings of the 33rd Annual International Conference on the Theory and Applications of Cryptographic Techniques","author":"D Boneh","year":"2014","unstructured":"Boneh D, Gentry C, Gorbunov S, Halevi S, Nikolaenko V, Segev G, Vaikuntanathan V, Vinayagamurthy D. Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits. In: Proceedings of the 33rd Annual International Conference on the Theory and Applications of Cryptographic Techniques. 2014, 533\u2013556"},{"key":"52118_CR25","first-page":"700","volume-title":"Proceedings of the 31st Annual International Conference on the Theory and Applications of Cryptographic Techniques","author":"D Micciancio","year":"2012","unstructured":"Micciancio D, Peikert C. Trapdoors for lattices: simpler, tighter, faster, smaller. In: Proceedings of the 31st Annual International Conference on the Theory and Applications of Cryptographic Techniques. 2012, 700\u2013718"},{"key":"52118_CR26","first-page":"523","volume-title":"Proceedings of International Conference on the Theory and Applications of Cryptographic Techniques","author":"Y Dodis","year":"2004","unstructured":"Dodis Y, Reyzin L, Smith A. Fuzzy extractors: how to generate strong keys from biometrics and other noisy data. In: Proceedings of International Conference on the Theory and Applications of Cryptographic Techniques. 2004, 523\u2013540"},{"issue":"4","key":"52118_CR27","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J H\u00e5stad","year":"1999","unstructured":"H\u00e5stad J, Impagliazzo R, Levin L A, Luby M. A pseudorandom generator from any one-way function. SIAM Journal on Computing, 1999, 28(4): 1364\u20131396","journal-title":"SIAM Journal on Computing"},{"key":"52118_CR28","first-page":"99","volume-title":"Proceedings of the 28th Annual ACM Symposium on Theory of Computing","author":"M Ajtai","year":"1996","unstructured":"Ajtai M. Generating hard instances of lattice problems (extended abstract). In: Proceedings of the 28th Annual ACM Symposium on Theory of Computing. 1996, 99\u2013108"}],"container-title":["Frontiers of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-026-52118-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11704-026-52118-4","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-026-52118-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,9,4]],"date-time":"2026-09-04T06:29:34Z","timestamp":1788503374000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11704-026-52118-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9,4]]},"references-count":28,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2026,10]]}},"alternative-id":["52118"],"URL":"https:\/\/doi.org\/10.1007\/s11704-026-52118-4","relation":{},"ISSN":["2095-2228","2095-2236"],"issn-type":[{"value":"2095-2228","type":"print"},{"value":"2095-2236","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,9,4]]},"assertion":[{"value":"29 December 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 March 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 September 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no competing interests or financial conflicts to disclose.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"2010818"}}