{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T23:28:04Z","timestamp":1784676484709,"version":"3.55.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2024,8,12]],"date-time":"2024-08-12T00:00:00Z","timestamp":1723420800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,8,12]],"date-time":"2024-08-12T00:00:00Z","timestamp":1723420800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key R$\\&$D Program of China","doi-asserted-by":"crossref","award":["2022YFB2701500"],"award-info":[{"award-number":["2022YFB2701500"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100012166","name":"National Key R$\\&$D Program of China","doi-asserted-by":"crossref","award":["2022YFB2701500"],"award-info":[{"award-number":["2022YFB2701500"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61925207"],"award-info":[{"award-number":["61925207"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61925207"],"award-info":[{"award-number":["61925207"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62372292"],"award-info":[{"award-number":["62372292"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Guangdong Major Project of Basic and Applied Basic Research","award":["2019B030302008"],"award-info":[{"award-number":["2019B030302008"]}]},{"name":"Guangdong Major Project of Basic and Applied Basic Research","award":["2019B030302008"],"award-info":[{"award-number":["2019B030302008"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s10623-024-01468-w","type":"journal-article","created":{"date-parts":[[2024,8,12]],"date-time":"2024-08-12T12:02:32Z","timestamp":1723464152000},"page":"3919-3953","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Functional commitments for arbitrary circuits of bounded sizes"],"prefix":"10.1007","volume":"92","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":[[2024,8,12]]},"reference":[{"key":"1468_CR1","doi-asserted-by":"publisher","unstructured":"Ajtai, M., Kumar, R., Sivakumar, D.: A sieve algorithm for the shortest lattice vector problem. In: Vitter, J.S., Spirakis, P.G., Yannakakis, M. (eds.) Proceedings on 33rd Annual ACM Symposium on Theory of Computing, July 6-8, 2001, Heraklion, Crete, Greece, pp. 601\u2013610. ACM, ??? (2001). https:\/\/doi.org\/10.1145\/380752.380857 .","DOI":"10.1145\/380752.380857"},{"key":"1468_CR2","doi-asserted-by":"crossref","unstructured":"Ajtai M.: Generating hard instances of lattice problems. In: Proceedings of the Twenty-eighth Annual ACM Symposium on Theory of Computing, pp. 99\u2013108 (1996).","DOI":"10.1145\/237814.237838"},{"key":"1468_CR3","doi-asserted-by":"crossref","unstructured":"Albrecht, M.R., Cini, V., Lai, R.W., Malavolta, G., Thyagarajan, S.A.: Lattice-based snarks: Publicly verifiable, preprocessing, and recursively composable. In: Annual International Cryptology Conference, pp. 102\u2013132 (2022). Springer","DOI":"10.1007\/978-3-031-15979-4_4"},{"key":"1468_CR4","unstructured":"Balb\u00e1s, D., Catalano, D., Fiore, D., Lai, R.W.: Functional commitments for circuits from falsifiable assumptions. Cryptology ePrint Archive (2022)"},{"key":"1468_CR5","doi-asserted-by":"crossref","unstructured":"Boneh, D., Drake, J., Fisch, B., Gabizon, A.: Halo infinite: Proof-carrying data from additive polynomial commitments. In: Advances in Cryptology\u2013CRYPTO 2021: 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, August 16\u201320, 2021, Proceedings, Part I 41, pp. 649\u2013680 (2021). Springer","DOI":"10.1007\/978-3-030-84242-0_23"},{"key":"1468_CR6","doi-asserted-by":"crossref","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: Advances in Cryptology\u2013EUROCRYPT 2014: 33rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Copenhagen, Denmark, May 11-15, 2014. Proceedings 33, pp. 533\u2013556 (2014). Springer","DOI":"10.1007\/978-3-642-55220-5_30"},{"key":"1468_CR7","doi-asserted-by":"crossref","unstructured":"B\u00fcnz, B., Fisch, B., Szepieniec, A.: Transparent snarks from dark compilers. In: Advances in Cryptology\u2013EUROCRYPT 2020: 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, May 10\u201314, 2020, Proceedings, Part I 39, pp. 677\u2013706 (2020). Springer","DOI":"10.1007\/978-3-030-45721-1_24"},{"key":"1468_CR8","doi-asserted-by":"crossref","unstructured":"Campanelli, M., Fiore, D., Greco, N., Kolonelos, D., Nizzardo, L.: Incrementally aggregatable vector commitments and applications to verifiable decentralized storage. In: Advances in Cryptology\u2013ASIACRYPT 2020: 26th International Conference on the Theory and Application of Cryptology and Information Security, Daejeon, South Korea, December 7\u201311, 2020, Proceedings, Part II 26, pp. 3\u201335 (2020). Springer","DOI":"10.1007\/978-3-030-64834-3_1"},{"key":"1468_CR9","doi-asserted-by":"crossref","unstructured":"Castro, L., Peikert, C.: Functional commitments for all functions, with transparent setup and from sis. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 287\u2013320 (2023). Springer","DOI":"10.1007\/978-3-031-30620-4_10"},{"key":"1468_CR10","doi-asserted-by":"crossref","unstructured":"Catalano, D., Fiore, D., Tucker, I.: Additive-homomorphic functional commitments and applications to homomorphic signatures. In: International Conference on the Theory and Application of Cryptology and Information Security, pp. 159\u2013188 (2022). Springer","DOI":"10.1007\/978-3-031-22972-5_6"},{"key":"1468_CR11","doi-asserted-by":"crossref","unstructured":"Catalano, D., Fiore, D.: Vector commitments and their applications. In: Public-Key Cryptography\u2013PKC 2013: 16th International Conference on Practice and Theory in Public-Key Cryptography, Nara, Japan, February 26\u2013March 1, 2013. Proceedings 16, pp. 55\u201372 (2013). Springer","DOI":"10.1007\/978-3-642-36362-7_5"},{"key":"1468_CR12","doi-asserted-by":"crossref","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: Practical solutions to identification and signature problems. In: Conference on the Theory and Application of Cryptographic Techniques, pp. 186\u2013194 (1986). Springer","DOI":"10.1007\/3-540-47721-7_12"},{"key":"1468_CR13","doi-asserted-by":"crossref","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing, pp. 197\u2013206 (2008)","DOI":"10.1145\/1374376.1374407"},{"key":"1468_CR14","doi-asserted-by":"crossref","unstructured":"Gentry, C., Sahai, A., Waters, B.: Homomorphic encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attribute-based. In: Advances in Cryptology\u2013CRYPTO 2013: 33rd Annual Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2013. Proceedings, Part I, pp. 75\u201392 (2013). Springer","DOI":"10.1007\/978-3-642-40041-4_5"},{"issue":"4","key":"1468_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2699436","volume":"62","author":"S Goldwasser","year":"2015","unstructured":"Goldwasser S., Kalai Y.T., Rothblum G.N.: Delegating computation: interactive proofs for muggles. Journal of the ACM (JACM) 62(4), 1\u201364 (2015).","journal-title":"Journal of the ACM (JACM)"},{"key":"1468_CR16","doi-asserted-by":"crossref","unstructured":"Gorbunov, S., Reyzin, L., Wee, H., Zhang, Z.: Pointproofs: Aggregating proofs for multiple vector commitments. In: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, pp. 2007\u20132023 (2020)","DOI":"10.1145\/3372297.3417244"},{"key":"1468_CR17","doi-asserted-by":"crossref","unstructured":"Gorbunov, S., Vaikuntanathan, V., Wichs, D.: Leveled fully homomorphic signatures from standard lattices. In: Proceedings of the Forty-seventh Annual ACM Symposium on Theory of Computing, pp. 469\u2013477 (2015)","DOI":"10.1145\/2746539.2746576"},{"issue":"4","key":"1468_CR18","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 28(4), 1364\u20131396 (1999).","journal-title":"SIAM Journal on Computing"},{"key":"1468_CR19","doi-asserted-by":"crossref","unstructured":"Kate, A., Zaverucha, G.M., Goldberg, I.: Constant-size commitments to polynomials and their applications. In: Advances in Cryptology-ASIACRYPT 2010: 16th International Conference on the Theory and Application of Cryptology and Information Security, Singapore, December 5-9, 2010. Proceedings 16, pp. 177\u2013194 (2010). Springer","DOI":"10.1007\/978-3-642-17373-8_11"},{"key":"1468_CR20","doi-asserted-by":"crossref","unstructured":"Lai, R.W., Malavolta, G.: Subvector commitments with application to succinct arguments. In: Advances in Cryptology\u2013CRYPTO 2019: 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18\u201322, 2019, Proceedings, Part I 39, pp. 530\u2013560 (2019). Springer","DOI":"10.1007\/978-3-030-26948-7_19"},{"key":"1468_CR21","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"AK Lenstra","year":"1982","unstructured":"Lenstra A.K., Lenstra H.W., Lov\u00e1sz L.: Factoring polynomials with rational coefficients. Mathematische annalen 261, 515\u2013534 (1982).","journal-title":"Mathematische annalen"},{"key":"1468_CR22","unstructured":"Libert, B., Ramanna, S.C., et al.: Functional commitment schemes: From polynomial commitments to pairing-based accumulators from simple assumptions. In: 43rd International Colloquium on Automata, Languages and Programming (ICALP 2016) (2016)"},{"key":"1468_CR23","doi-asserted-by":"crossref","unstructured":"Libert, B., Yung, M.: Concise mercurial vector commitments and independent zero-knowledge sets with short proofs. In: Theory of Cryptography Conference, pp. 499\u2013517 (2010). Springer","DOI":"10.1007\/978-3-642-11799-2_30"},{"key":"1468_CR24","doi-asserted-by":"crossref","unstructured":"Lipmaa, H., Pavlyk, K.: Succinct functional commitment for a large class of arithmetic circuits. In: International Conference on the Theory and Application of Cryptology and Information Security, pp. 686\u2013716 (2020). Springer","DOI":"10.1007\/978-3-030-64840-4_23"},{"issue":"4","key":"1468_CR25","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1145\/146585.146605","volume":"39","author":"C Lund","year":"1992","unstructured":"Lund C., Fortnow L., Karloff H., Nisan N.: Algebraic methods for interactive proof systems. Journal of the ACM (JACM) 39(4), 859\u2013868 (1992).","journal-title":"Journal of the ACM (JACM)"},{"key":"1468_CR26","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Peikert, C.: Trapdoors for lattices: Simpler, tighter, faster, smaller. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 700\u2013718 (2012). Springer","DOI":"10.1007\/978-3-642-29011-4_41"},{"issue":"1","key":"1468_CR27","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1137\/S0097539705447360","volume":"37","author":"D Micciancio","year":"2007","unstructured":"Micciancio D., Regev O.: Worst-case to average-case reductions based on gaussian measures. SIAM Journal on Computing 37(1), 267\u2013302 (2007).","journal-title":"SIAM Journal on Computing"},{"key":"1468_CR28","doi-asserted-by":"crossref","unstructured":"Papamanthou, C., Shi, E., Tamassia, R.: Signatures of correct computation. In: Theory of Cryptography Conference, pp. 222\u2013242 (2013). Springer","DOI":"10.1007\/978-3-642-36594-2_13"},{"key":"1468_CR29","doi-asserted-by":"crossref","unstructured":"Peikert, C., Pepin, Z., Sharp, C.: Vector and functional commitments from lattices. In: Theory of Cryptography: 19th International Conference, TCC 2021, Raleigh, NC, USA, November 8\u201311, 2021, Proceedings, Part III 19, pp. 480\u2013511 (2021). Springer","DOI":"10.1007\/978-3-030-90456-2_16"},{"key":"1468_CR30","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0304-3975(87)90064-8","volume":"53","author":"C Schnorr","year":"1987","unstructured":"Schnorr C.: A hierarchy of polynomial time lattice basis reduction algorithms. Theor. Comput. Sci. 53, 201\u2013224 (1987). https:\/\/doi.org\/10.1016\/0304-3975(87)90064-8.","journal-title":"Theor. Comput. Sci."},{"key":"1468_CR31","doi-asserted-by":"crossref","unstructured":"Wahby, R.S., Tzialla, I., Shelat, A., Thaler, J., Walfish, M.: Doubly-efficient zksnarks without trusted setup. In: 2018 IEEE Symposium on Security and Privacy (SP), pp. 926\u2013943 (2018). IEEE","DOI":"10.1109\/SP.2018.00060"},{"key":"1468_CR32","doi-asserted-by":"crossref","unstructured":"Wee, H., Wu, D.J.: Lattice-based functional commitments: Fast verification and cryptanalysis. In: International Conference on the Theory and Application of Cryptology and Information Security, pp. 201\u2013235 (2023). Springer","DOI":"10.1007\/978-981-99-8733-7_7"},{"key":"1468_CR33","doi-asserted-by":"crossref","unstructured":"Wee, H., Wu, D.J.: Succinct vector, polynomial, and functional commitments from lattices. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 385\u2013416 (2023). Springer","DOI":"10.1007\/978-3-031-30620-4_13"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01468-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-024-01468-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01468-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,22]],"date-time":"2024-11-22T21:23:28Z","timestamp":1732310608000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-024-01468-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,12]]},"references-count":33,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["1468"],"URL":"https:\/\/doi.org\/10.1007\/s10623-024-01468-w","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,8,12]]},"assertion":[{"value":"27 March 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 June 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 July 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 August 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"Not applicable.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}]}}