{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T23:57:08Z","timestamp":1768435028415,"version":"3.49.0"},"publisher-location":"Cham","reference-count":42,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031683817","type":"print"},{"value":"9783031683824","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-68382-4_10","type":"book-chapter","created":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T09:02:41Z","timestamp":1723712561000},"page":"317-351","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Fully-Succinct Multi-key Homomorphic Signatures from\u00a0Standard Assumptions"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-3977-617X","authenticated-orcid":false,"given":"Gaspard","family":"Anthoine","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4864-1125","authenticated-orcid":false,"given":"David","family":"Balb\u00e1s","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7274-6600","authenticated-orcid":false,"given":"Dario","family":"Fiore","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,16]]},"reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-030-30530-7_14","volume-title":"Progress in Cryptology \u2013 LATINCRYPT 2019","author":"DF Aranha","year":"2019","unstructured":"Aranha, D.F., Pagnin, E.: The simplest multi-key linearly homomorphic signature scheme. In: Schwabe, P., Th\u00e9riault, N. (eds.) LATINCRYPT 2019. LNCS, vol. 11774, pp. 280\u2013300. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30530-7_14"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-642-19379-8_2","volume-title":"Public Key Cryptography \u2013 PKC 2011","author":"N Attrapadung","year":"2011","unstructured":"Attrapadung, N., Libert, B.: Homomorphic network coding signatures in the standard model. In: Catalano, D., Fazio, N., Gennaro, R., Nicolosi, A. (eds.) PKC 2011. LNCS, vol. 6571, pp. 17\u201334. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19379-8_2"},{"key":"10_CR3","doi-asserted-by":"publisher","unstructured":"Balb\u00e1s, D., Catalano, D., Fiore, D., Lai, R.W.F.: Chainable functional commitments for unbounded-depth circuits. In: Rothblum, G., Wee, H. (eds.) Theory of Cryptography. TCC 2023. Lecture Notes in Computer Science, vol. 14371. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-48621-0_13","DOI":"10.1007\/978-3-031-48621-0_13"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-642-00468-1_5","volume-title":"Public Key Cryptography \u2013 PKC 2009","author":"D Boneh","year":"2009","unstructured":"Boneh, D., Freeman, D., Katz, J., Waters, B.: Signing a linear subspace: signature schemes for network coding. In: Jarecki, S., Tsudik, G. (eds.) PKC 2009. LNCS, vol. 5443, pp. 68\u201387. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00468-1_5"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-642-20465-4_10","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"D Boneh","year":"2011","unstructured":"Boneh, D., Freeman, D.M.: Homomorphic signatures for polynomial functions. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 149\u2013168. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20465-4_10"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/3-540-39200-9_26","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2003","author":"D Boneh","year":"2003","unstructured":"Boneh, D., Gentry, C., Lynn, B., Shacham, H.: Aggregate and verifiably encrypted signatures from bilinear maps. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 416\u2013432. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-39200-9_26"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-642-36362-7_5","volume-title":"Public-Key Cryptography \u2013 PKC 2013","author":"D Catalano","year":"2013","unstructured":"Catalano, D., Fiore, D.: Vector commitments and their applications. In: Kurosawa, K., Hanaoka, G. (eds.) PKC 2013. LNCS, vol. 7778, pp. 55\u201372. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36362-7_5"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"680","DOI":"10.1007\/978-3-642-36594-2_38","volume-title":"Theory of Cryptography","author":"D Catalano","year":"2013","unstructured":"Catalano, D., Fiore, D., Gennaro, R., Vamvourellis, K.: Algebraic (trapdoor) one-way functions and their applications. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 680\u2013699. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36594-2_38"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/978-3-662-48000-7_13","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"D Catalano","year":"2015","unstructured":"Catalano, D., Fiore, D., Nizzardo, L.: Programmable hash functions go private: constructions and applications to (homomorphic) signatures with shorter public keys. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9216, pp. 254\u2013274. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48000-7_13"},{"key":"10_CR10","doi-asserted-by":"publisher","unstructured":"Catalano, D., Fiore, D., Tucker, I.: Additive-homomorphic functional commitments and applications to homomorphic signatures. In: Agrawal, S., Lin, D. (eds.) Advances in Cryptology \u2013 ASIACRYPT 2022. ASIACRYPT\u00a02022, Part\u00a0IV. LNCS, vol. 13794, pp. 159\u2013188. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22972-5_6","DOI":"10.1007\/978-3-031-22972-5_6"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"680","DOI":"10.1007\/978-3-642-30057-8_40","volume-title":"Public Key Cryptography \u2013 PKC 2012","author":"D Catalano","year":"2012","unstructured":"Catalano, D., Fiore, D., Warinschi, B.: Efficient network coding signatures in the standard model. In: Fischlin, M., Buchmann, J., Manulis, M. (eds.) PKC 2012. LNCS, vol. 7293, pp. 680\u2013696. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-30057-8_40"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/978-3-662-44371-2_21","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"D Catalano","year":"2014","unstructured":"Catalano, D., Fiore, D., Warinschi, B.: Homomorphic signatures with efficient verification for polynomial functions. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8616, pp. 371\u2013389. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44371-2_21"},{"key":"10_CR13","doi-asserted-by":"publisher","unstructured":"Choudhuri, A.R., Garg, S., Jain, A., Jin, Z., Zhang, J.: Correlation intractability and SNARGs from sub-exponential DDH. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology \u2013 CRYPTO 2023. CRYPTO\u00a02023, Part\u00a0IV. LNCS, vol. 14084, pp. 635\u2013668. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38551-3_20","DOI":"10.1007\/978-3-031-38551-3_20"},{"key":"10_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1007\/978-3-030-84259-8_14","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"AR Choudhuri","year":"2021","unstructured":"Choudhuri, A.R., Jain, A., Jin, Z.: Non-interactive Batch arguments for NP from standard assumptions. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12828, pp. 394\u2013423. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84259-8_14"},{"key":"10_CR15","doi-asserted-by":"publisher","unstructured":"Choudhuri, A.R., Jain, A., Jin, Z.: SNARGs for $$\\cal{P}$$ from LWE. In: 62nd FOCS, pp. 68\u201379. IEEE Computer Society Press (2022). https:\/\/doi.org\/10.1109\/FOCS52979.2021.00016","DOI":"10.1109\/FOCS52979.2021.00016"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Desmedt, Y.: Computer security by redefining what a computer is. In: NSPW (1993)","DOI":"10.1145\/283751.283834"},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/978-3-662-53890-6_17","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"D Fiore","year":"2016","unstructured":"Fiore, D., Mitrokotsa, A., Nizzardo, L., Pagnin, E.: Multi-key homomorphic authenticators. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10032, pp. 499\u2013530. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53890-6_17"},{"key":"10_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-662-53641-4_5","volume-title":"Theory of Cryptography","author":"D Fiore","year":"2016","unstructured":"Fiore, D., Nitulescu, A.: On the (In)security of SNARKs in the presence of oracles. In: Hirt, M., Smith, A. (eds.) TCC 2016. LNCS, vol. 9985, pp. 108\u2013138. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53641-4_5"},{"key":"10_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-319-98113-0_3","volume-title":"Security and Cryptography for Networks","author":"D Fiore","year":"2018","unstructured":"Fiore, D., Pagnin, E.: Matrioska: a compiler for multi-key homomorphic signatures. In: Catalano, D., De Prisco, R. (eds.) SCN 2018. LNCS, vol. 11035, pp. 43\u201362. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98113-0_3"},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1007\/978-3-642-30057-8_41","volume-title":"Public Key Cryptography \u2013 PKC 2012","author":"DM Freeman","year":"2012","unstructured":"Freeman, D.M.: Improved security for linearly homomorphic signatures: a generic framework. In: Fischlin, M., Buchmann, J., Manulis, M. (eds.) PKC 2012. LNCS, vol. 7293, pp. 697\u2013714. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-30057-8_41"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Gay, R., Ursu, B.: On Instantiating unleveled fully-homomorphic signatures from falsifiable assumptions. In: International Conference on Public Key Cryptography - PKC 2024 (2024), to appear","DOI":"10.1007\/978-3-031-57718-5_3"},{"key":"10_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-642-13013-7_9","volume-title":"Public Key Cryptography \u2013 PKC 2010","author":"R Gennaro","year":"2010","unstructured":"Gennaro, R., Katz, J., Krawczyk, H., Rabin, T.: Secure network coding over the integers. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol. 6056, pp. 142\u2013160. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13013-7_9"},{"key":"10_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/978-3-642-42045-0_16","volume-title":"Advances in Cryptology - ASIACRYPT 2013","author":"R Gennaro","year":"2013","unstructured":"Gennaro, R., Wichs, D.: Fully homomorphic message authenticators. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013. LNCS, vol. 8270, pp. 301\u2013320. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-42045-0_16"},{"key":"10_CR24","doi-asserted-by":"publisher","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Mitzenmacher, M. (ed.) 41st ACM STOC, pp. 169\u2013178. ACM Press (2009). https:\/\/doi.org\/10.1145\/1536414.1536440","DOI":"10.1145\/1536414.1536440"},{"key":"10_CR25","doi-asserted-by":"publisher","unstructured":"Gentry, C., Wichs, D.: Separating succinct non-interactive arguments from all falsifiable assumptions. In: Fortnow, L., Vadhan, S.P. (eds.) 43rd ACM STOC, pp. 99\u2013108. ACM Press (2011). https:\/\/doi.org\/10.1145\/1993636.1993651","DOI":"10.1145\/1993636.1993651"},{"key":"10_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/978-3-030-90459-3_18","volume-title":"Theory of Cryptography","author":"A Gonz\u00e1lez","year":"2021","unstructured":"Gonz\u00e1lez, A., Zacharakis, A.: Fully-succinct publicly verifiable delegation from constant-size assumptions. In: Nissim, K., Waters, B. (eds.) TCC 2021. LNCS, vol. 13042, pp. 529\u2013557. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90459-3_18"},{"key":"10_CR27","doi-asserted-by":"publisher","unstructured":"Gorbunov, S., Vaikuntanathan, V., Wichs, D.: Leveled fully homomorphic signatures from standard lattices. In: Servedio, R.A., Rubinfeld, R. (eds.) 47th ACM STOC, pp. 469\u2013477. ACM Press (2015). https:\/\/doi.org\/10.1145\/2746539.2746576","DOI":"10.1145\/2746539.2746576"},{"key":"10_CR28","doi-asserted-by":"publisher","unstructured":"Hubacek, P., Wichs, D.: On the communication complexity of secure function evaluation with long output. In: Roughgarden, T. (ed.) ITCS 2015, pp. 163\u2013172. ACM (2015). https:\/\/doi.org\/10.1145\/2688073.2688105","DOI":"10.1145\/2688073.2688105"},{"key":"10_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/3-540-45760-7_17","volume-title":"Topics in Cryptology \u2014 CT-RSA 2002","author":"R Johnson","year":"2002","unstructured":"Johnson, R., Molnar, D., Song, D., Wagner, D.: Homomorphic signature schemes. In: Preneel, B. (ed.) CT-RSA 2002. LNCS, vol. 2271, pp. 244\u2013262. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45760-7_17"},{"key":"10_CR30","doi-asserted-by":"publisher","unstructured":"Kalai, Y., Lombardi, A., Vaikuntanathan, V., Wichs, D.: Boosting batch arguments and ram delegation. In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing (STOC), pp. 1545\u20131552. STOC 2023, Association for Computing Machinery, New York, NY, USA (2023). https:\/\/doi.org\/10.1145\/3564246.3585200","DOI":"10.1145\/3564246.3585200"},{"key":"10_CR31","doi-asserted-by":"publisher","unstructured":"Kalai, Y.T., Paneth, O., Yang, L.: How to delegate computations publicly. In: Charikar, M., Cohen, E. (eds.) 51st ACM STOC, pp. 1115\u20131124. ACM Press (2019). https:\/\/doi.org\/10.1145\/3313276.3316411","DOI":"10.1145\/3313276.3316411"},{"key":"10_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/978-3-030-90459-3_12","volume-title":"Theory of Cryptography","author":"YT Kalai","year":"2021","unstructured":"Kalai, Y.T., Vaikuntanathan, V., Zhang, R.Y.: Somewhere statistical soundness, post-quantum security, and SNARGs. In: Nissim, K., Waters, B. (eds.) TCC 2021. LNCS, vol. 13042, pp. 330\u2013368. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90459-3_12"},{"key":"10_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1007\/978-3-030-17656-3_22","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"S Katsumata","year":"2019","unstructured":"Katsumata, S., Nishimaki, R., Yamada, S., Yamakawa, T.: Designated verifier\/prover and preprocessing NIZKs from Diffie-Hellman assumptions. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11477, pp. 622\u2013651. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17656-3_22"},{"key":"10_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/978-3-030-03329-3_16","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"RWF Lai","year":"2018","unstructured":"Lai, R.W.F., Tai, R.K.H., Wong, H.W.H., Chow, S.S.M.: Multi-key homomorphic signatures unforgeable under insider corruption. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11273, pp. 465\u2013492. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03329-3_16"},{"key":"10_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/978-3-642-40084-1_17","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"B Libert","year":"2013","unstructured":"Libert, B., Peters, T., Joye, M., Yung, M.: Linearly homomorphic structure-preserving signatures and their applications. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8043, pp. 289\u2013307. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40084-1_17"},{"key":"10_CR36","doi-asserted-by":"publisher","unstructured":"Libert, B., Ramanna, S.C., Yung, M.: Functional commitment schemes: from polynomial commitments to pairing-based accumulators from simple assumptions. In: Chatzigiannakis, I., Mitzenmacher, M., Rabani, Y., Sangiorgi, D. (eds.) ICALP 2016. LIPIcs, vol.\u00a055, pp. 30:1\u201330:14. Schloss Dagstuhl (2016). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2016.30","DOI":"10.4230\/LIPIcs.ICALP.2016.30"},{"key":"10_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-662-48797-6_6","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2015","author":"T Okamoto","year":"2015","unstructured":"Okamoto, T., Pietrzak, K., Waters, B., Wichs, D.: New realizations of somewhere statistically binding hashing and positional accumulators. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015. LNCS, vol. 9452, pp. 121\u2013145. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48797-6_6"},{"key":"10_CR38","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.tcs.2021.08.002","volume":"889","author":"SD Samarin","year":"2021","unstructured":"Samarin, S.D., Fiore, D., Venturi, D., Amini, M.: A compiler for multi-key homomorphic signatures for turing machines. Theor. Comput. Sci. 889, 145\u2013170 (2021). https:\/\/doi.org\/10.1016\/j.tcs.2021.08.002","journal-title":"Theor. Comput. Sci."},{"key":"10_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/978-3-030-12612-4_25","volume-title":"Topics in Cryptology \u2013 CT-RSA 2019","author":"L Schabh\u00fcser","year":"2019","unstructured":"Schabh\u00fcser, L., Butin, D., Buchmann, J.: Context hiding multi-key linearly homomorphic authenticators. In: Matsui, M. (ed.) CT-RSA 2019. LNCS, vol. 11405, pp. 493\u2013513. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-12612-4_25"},{"key":"10_CR40","doi-asserted-by":"publisher","unstructured":"Waters, B., Wu, D.J.: Batch arguments for NP and more from standard bilinear group assumptions. In: Dodis, Y., Shrimpton, T. (eds.) Advances in Cryptology \u2013 CRYPTO 2022. CRYPTO\u00a02022, Part\u00a0II. LNCS, vol. 13508, pp. 433\u2013463. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_15","DOI":"10.1007\/978-3-031-15979-4_15"},{"key":"10_CR41","doi-asserted-by":"publisher","unstructured":"Wee, H., Wu, D.J.: Lattice-based functional commitments: Fast verification and cryptanalysis. In: Guo, J., Steinfeld, R. (eds.) ASIACRYPT\u00a02023, Part\u00a0V. LNCS, vol. 14442, pp. 201\u2013235. Springer, Singapore (2023). https:\/\/doi.org\/10.1007\/978-981-99-8733-7_7","DOI":"10.1007\/978-981-99-8733-7_7"},{"key":"10_CR42","doi-asserted-by":"publisher","unstructured":"Wee, H., Wu, D.J.: Succinct Functional Commitments for Circuits from k-Lin. In: Joye, M., Leander, G. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2024. EUROCRYPT 2024. LNCS, pp. 280\u2013310. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58723-8_10","DOI":"10.1007\/978-3-031-58723-8_10"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-68382-4_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T09:07:16Z","timestamp":1723712836000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-68382-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031683817","9783031683824"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-68382-4_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"16 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}