{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T14:07:38Z","timestamp":1779286058294,"version":"3.51.4"},"publisher-location":"Cham","reference-count":59,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032267368","type":"print"},{"value":"9783032267375","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-26737-5_7","type":"book-chapter","created":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T13:16:50Z","timestamp":1779283010000},"page":"197-230","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["General Techniques for\u00a0Building SNARKs over the Integers"],"prefix":"10.1007","author":[{"given":"Matteo","family":"Campanelli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mathias","family":"Hall-Andersen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,21]]},"reference":[{"key":"7_CR1","unstructured":"Arora, S., Barak, B.: Computational Complexity: A Modern Approach. Cambridge University Press (2006). https:\/\/theory.cs.princeton.edu\/complexity\/book.pdf"},{"key":"7_CR2","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1007\/978-3-030-97121-2_21","volume-title":"PKC 2022, Part I","author":"DF Aranha","year":"2022","unstructured":"Aranha, D.F., Bennedsen, E.M., Campanelli, M., Ganesh, C., Orlandi, C., Takahashi, A.: ECLIPSE: enhanced compiling method for Pedersen-committed zkSNARK engines. In: Hanaoka, G., Shikata, J., Watanabe, Y. (eds.) PKC 2022, Part I. LNCS, vol. 13177, pp. 584\u2013614. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-97121-2_21"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Ambrona, M., Beunardeau, M., Schmitt, A.-L., Toledo, R.R.: aplonk: aggregated p lon k from multi-polynomial commitment schemes. In: International Workshop on Security, pp. 195\u2013213. Springer, Cham (2023)","DOI":"10.1007\/978-3-031-41326-1_11"},{"key":"7_CR4","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1007\/978-3-031-31371-4_19","volume-title":"PKC 2023, Part II","author":"A Arun","year":"2023","unstructured":"Arun, A., Ganesh, C., Lokam, S.V., Mopuri, T., Sridhar, S.: Dew: a transparent constant-sized polynomial commitment scheme. In: Boldyreva, A., Kolesnikov, V. (eds.) PKC 2023, Part II. LNCS, vol. 13941, pp. 542\u2013571. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-31371-4_19"},{"key":"7_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, pp. 315\u2013334. IEEE Computer Society Press (2018). https:\/\/doi.org\/10.1109\/SP.2018.00020","DOI":"10.1109\/SP.2018.00020"},{"key":"7_CR6","unstructured":"Ben-Sasson, E., Bentov, I., Horesh, Y., Riabzev, M.: Scalable, transparent, and post-quantum secure computational integrity. Cryptology ePrint Archive, Report 2018\/046 (2018). https:\/\/eprint.iacr.org\/2018\/046"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/978-3-662-64322-8_19","volume-title":"Financial Cryptography and Data Security","author":"D Benarroch","year":"2021","unstructured":"Benarroch, D., Campanelli, M., Fiore, D., Gurkan, K., Kolonelos, D.: Zero-knowledge proofs for set membership: efficient, succinct, modular. In: Borisov, N., Diaz, C. (eds.) FC 2021, Part I. LNCS, vol. 12674, pp. 393\u2013414. Springer, Heidelberg (2021). https:\/\/doi.org\/10.1007\/978-3-662-64322-8_19"},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-662-53644-5_2","volume-title":"Theory of Cryptography","author":"E Ben-Sasson","year":"2016","unstructured":"Ben-Sasson, E., Chiesa, A., Spooner, N.: Interactive oracle proofs. In: Hirt, M., Smith, A. (eds.) TCC 2016, Part II. LNCS, vol. 9986, pp. 31\u201360. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53644-5_2"},{"key":"7_CR9","unstructured":"B\u00fcnz, B., Fisch, B., Szepieniec, A.: Transparent SNARKs from DARK compilers. Cryptology ePrint Archive, Report 2019\/1229 (2019). https:\/\/eprint.iacr.org\/2019\/1229"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1007\/978-3-030-45721-1_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"B B\u00fcnz","year":"2020","unstructured":"B\u00fcnz, B., Fisch, B., Szepieniec, A.: Transparent SNARKs from DARK compilers. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020, Part I. LNCS, vol. 12105, pp. 677\u2013706. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_24"},{"key":"7_CR11","unstructured":"Borges, J.L., Guerrero, M., Toledo, F., Toledo, F.: Manual de zoolog\u00eda fant\u00e1stica, vol. 125. Fondo de cultura econ\u00f3mica M\u00e9xico (1957)"},{"key":"7_CR12","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (Leveled) fully homomorphic encryption without bootstrapping. In: Goldwasser, S. (eds.) ITCS 2012: 3rd Innovations in Theoretical Computer Science, pp. 309\u2013325. Association for Computing Machinery (2012). https:\/\/doi.org\/10.1145\/2090236.2090262","DOI":"10.1145\/2090236.2090262"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-030-84259-8_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"AR Block","year":"2021","unstructured":"Block, A.R., Holmgren, J., Rosen, A., Rothblum, R.D., Soni, P.: Time- and space-efficient arguments from groups of unknown order. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021, Part IV. LNCS, vol. 12828, pp. 123\u2013152. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84259-8_5"},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"868","DOI":"10.1007\/978-3-642-32009-5_50","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"Z Brakerski","year":"2012","unstructured":"Brakerski, Z.: Fully homomorphic encryption without modulus switching from classical GapSVP. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 868\u2013886. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_50"},{"key":"7_CR15","unstructured":"Ben-Sasson, E., Carmon, D., Kopparty, S., Levit, D.: Elliptic curve fast Fourier transform (ecfft) part I: fast polynomial algorithms over all finite fields (2021). https:\/\/arxiv.org\/abs\/2107.08473"},{"key":"7_CR16","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/978-3-031-30617-4_17","volume-title":"EUROCRYPT 2023, Part II","author":"B Chen","year":"2023","unstructured":"Chen, B., B\u00fcnz, B., Boneh, D., Zhang, Z.: HyperPlonk: plonk with linear-time prover and high-degree custom gates. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023, Part II. LNCS, vol. 14005, pp. 499\u2013530. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30617-4_17"},{"key":"7_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-92078-4_1","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2021","author":"M Campanelli","year":"2021","unstructured":"Campanelli, M., Faonio, A., Fiore, D., Querol, A., Rodr\u00edguez, H.: Lunar: a toolbox for more efficient universal and updatable zkSNARKs and\u00a0commit-and-prove extensions. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021, Part III. LNCS, vol. 13092, pp. 3\u201333. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92078-4_1"},{"issue":"1","key":"7_CR18","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/s00145-024-09535-0","volume":"38","author":"M Campanelli","year":"2025","unstructured":"Campanelli, M., Fiore, D., Gennaro, R.: Natively compatible super-efficient lookup arguments and how to apply them. J. Cryptol. 38(1), 14 (2025)","journal-title":"J. Cryptol."},{"key":"7_CR19","doi-asserted-by":"publisher","unstructured":"Campanelli, M., Fiore, D., Han, S., Kim, J., Kolonelos, D., Oh, H.: Succinct zero-knowledge batch proofs for set accumulators. In: Yin, H., Stavrou, A., Cremers, C., Shi, E. (eds.) ACM CCS 2022: 29th Conference on Computer and Communications Security, pp. 455\u2013469. ACM Press (2022). https:\/\/doi.org\/10.1145\/3548606.3560677","DOI":"10.1145\/3548606.3560677"},{"key":"7_CR20","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-031-57722-2_5","volume-title":"PKC 2024, Part II","author":"M Campanelli","year":"2024","unstructured":"Campanelli, M., Fiore, D., Khoshakhlagh, H.: Witness encryption for succinct functional commitments and applications. In: Tang, Q., Teague, V. (eds.) PKC 2024, Part II. LNCS, vol. 14602, pp. 132\u2013167. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-57722-2_5"},{"key":"7_CR21","doi-asserted-by":"publisher","unstructured":"Campanelli, M., Fiore, D., Querol, A.: LegoSNARK: modular design and composition of succinct zero-knowledge proofs. In: Cavallaro, L., Kinder, J., Wang, X., Katz, J. (eds.) ACM CCS 2019: 26th Conference on Computer and Communications Security, pp. 2075\u20132092. ACM Press (2019). https:\/\/doi.org\/10.1145\/3319535.3339820","DOI":"10.1145\/3319535.3339820"},{"key":"7_CR22","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-031-22972-5_6","volume-title":"ASIACRYPT 2022, Part IV","author":"D Catalano","year":"2022","unstructured":"Catalano, D., Fiore, D., Tucker, I.: Additive-homomorphic functional commitments and applications to homomorphic signatures. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT 2022, Part IV. LNCS, vol. 13794, pp. 159\u2013188. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22972-5_6"},{"key":"7_CR23","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/978-3-031-44469-2_17","volume-title":"LATINCRYPT 2023","author":"M Campanelli","year":"2023","unstructured":"Campanelli, M., Gailly, N., Gennaro, R., Jovanovic, P., Mihali, M., Thaler, J.: Testudo: linear time prover SNARKs with constant size proofs and square root size universal setup. In: Aly, A., Tibouchi, M. (eds.) LATINCRYPT 2023. LNCS, vol. 14168, pp. 331\u2013351. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-44469-2_17"},{"key":"7_CR24","unstructured":"Campanelli, M., Hall-Andersen, M.: Fully succinct arguments over the integers from first principles. Cryptology ePrint Archive, Report 2024\/1548 (2024). https:\/\/eprint.iacr.org\/2024\/1548"},{"key":"7_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1007\/978-3-030-45721-1_26","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"A Chiesa","year":"2020","unstructured":"Chiesa, A., Hu, Y., Maller, M., Mishra, P., Vesely, N., Ward, N.: Marlin: preprocessing zkSNARKs with universal and updatable SRS. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020, Part I. LNCS, vol. 12105, pp. 738\u2013768. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_26"},{"key":"7_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/3-540-45708-9_5","volume-title":"Advances in Cryptology \u2014 CRYPTO 2002","author":"J Camenisch","year":"2002","unstructured":"Camenisch, J., Lysyanskaya, A.: Dynamic accumulators and application to efficient revocation of anonymous credentials. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 61\u201376. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45708-9_5"},{"key":"7_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1007\/978-3-030-45721-1_27","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"A Chiesa","year":"2020","unstructured":"Chiesa, A., Ojha, D., Spooner, N.: Fractal: post-quantum and transparent recursive proofs from holography. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020, Part I. LNCS, vol. 12105, pp. 769\u2013793. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_27"},{"key":"7_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/3-540-36178-2_8","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2002","author":"I Damg\u00e5rd","year":"2002","unstructured":"Damg\u00e5rd, I., Fujisaki, E.: A statistically-hiding integer commitment scheme based on groups with hidden order. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 125\u2013142. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36178-2_8"},{"key":"7_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/BFb0052225","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201997","author":"E Fujisaki","year":"1997","unstructured":"Fujisaki, E., Okamoto, T.: Statistical zero knowledge protocols to prove modular polynomial relations. In: Kaliski, B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 16\u201330. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0052225"},{"key":"7_CR30","unstructured":"Fan, J., Vercauteren, F.: Somewhat practical fully homomorphic encryption. Cryptology ePrint Archive, Report 2012\/144 (2012). https:\/\/eprint.iacr.org\/2012\/144"},{"key":"7_CR31","doi-asserted-by":"publisher","unstructured":"Goldwasser, S., Kalai, Y.T., Rothblum, G.N.: Delegating computation: interactive proofs for muggles. In: Ladner, R.E., Dwork, C. (eds.) 40th Annual ACM Symposium on Theory of Computing, pp. 113\u2013122. ACM Press (2008). https:\/\/doi.org\/10.1145\/1374376.1374396","DOI":"10.1145\/1374376.1374396"},{"key":"7_CR32","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-031-38545-2_7","volume-title":"CRYPTO 2023, Part II","author":"A Golovnev","year":"2023","unstructured":"Golovnev, A., Lee, J., Setty, S.T.V., Thaler, J., Wahby, R.S.: Brakedown: linear-time and field-agnostic SNARKs for R1CS. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023, Part II. LNCS, vol. 14082, pp. 193\u2013226. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38545-2_7"},{"key":"7_CR33","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-031-18283-9_10","volume-title":"FC 2022","author":"N Gailly","year":"2022","unstructured":"Gailly, N., Maller, M., Nitulescu, A.: SnarkPack: practical SNARK aggregation. In: Eyal, I., Garay, J.A. (eds.) FC 2022. LNCS, vol. 13411, pp. 203\u2013229. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-18283-9_10"},{"issue":"4","key":"7_CR34","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s00145-023-09481-3","volume":"36","author":"C Ganesh","year":"2023","unstructured":"Ganesh, C., Nitulescu, A., Soria-Vazquez, E.: Rinocchio: SNARKs for ring arithmetic. J. Cryptol. 36(4), 41 (2023). https:\/\/doi.org\/10.1007\/s00145-023-09481-3","journal-title":"J. Cryptol."},{"key":"7_CR35","unstructured":"Ganesh, C., Patranabis, S., Prakash, S., Singh, N.: GAPP: generic aggregation of polynomial protocols. Cryptology ePrint Archive, Report 2024\/1685 (2024). https:\/\/eprint.iacr.org\/2024\/1685"},{"key":"7_CR36","unstructured":"Goldberg, L., Papini, S., Riabzev, M.: Cairo \u2013 a Turing-complete STARK-friendly CPU architecture. Cryptology ePrint Archive, Report 2021\/1063 (2021). https:\/\/eprint.iacr.org\/2021\/1063"},{"key":"7_CR37","unstructured":"Gabizon, A., Williamson, Z.J., Ciobotaru, O.: PLONK: permutations over Lagrange-bases for oecumenical noninteractive arguments of knowledge. Cryptology ePrint Archive, Report 2019\/953 (2019). https:\/\/eprint.iacr.org\/2019\/953"},{"key":"7_CR38","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-032-01907-3_9","volume-title":"CRYPTO 2025, Part VII","author":"A Garreta","year":"2025","unstructured":"Garreta, A., et al.: Zinc: succinct arguments with small arithmetization overheads from IOPs of proximity to the integers. In: Kalai, Y.T., Kamara, S.F. (eds.) CRYPTO 2025, Part VII. LNCS, vol. 16006, pp. 259\u2013291. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-032-01907-3_9"},{"key":"7_CR39","doi-asserted-by":"publisher","unstructured":"Kilian, J.: A note on efficient zero-knowledge proofs and arguments (extended abstract). In: 24th Annual ACM Symposium on Theory of Computing, pp. 723\u2013732. ACM Press (1992). https:\/\/doi.org\/10.1145\/129712.129782","DOI":"10.1145\/129712.129782"},{"key":"7_CR40","doi-asserted-by":"publisher","unstructured":"Kosba, A.E., Papamanthou, C., Shi, E.: xJsnark: a framework for efficient verifiable computation. In: 2018 IEEE Symposium on Security and Privacy, pp. 944\u2013961. IEEE Computer Society Press (2018). https:\/\/doi.org\/10.1109\/SP.2018.00018","DOI":"10.1109\/SP.2018.00018"},{"key":"7_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-17373-8_11","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"A Kate","year":"2010","unstructured":"Kate, A., Zaverucha, G.M., Goldberg, I.: Constant-size commitments to polynomials and their applications. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 177\u2013194. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17373-8_11"},{"key":"7_CR42","unstructured":"Protocol Labs. Snarkpack v2: a new version of filecoin\u2019s proof aggregator. https:\/\/filecoin.io\/blog\/posts\/snarkpack-v2-a-new-version-of-filecoin-s-proof-aggregator\/"},{"key":"7_CR43","unstructured":"LayerEdge. What is layeredge? https:\/\/docs.layeredge.io\/docs\/introduction-to-layerEdge\/what-is-layerEdge"},{"key":"7_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1007\/978-3-030-26948-7_19","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"RWF Lai","year":"2019","unstructured":"Lai, R.W.F., Malavolta, G.: Subvector commitments with application to succinct arguments. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11692, pp. 530\u2013560. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26948-7_19"},{"key":"7_CR45","unstructured":"Luo, H., Sun, W.: Addition is all you need for energy-efficient language models (2024). https:\/\/arxiv.org\/abs\/2410.00907"},{"key":"7_CR46","doi-asserted-by":"crossref","unstructured":"Orr\u00f9, M., Kadianakis, G., Maller, M., Zaverucha, G.: Beyond the circuit: how to minimize foreign arithmetic in ZKP circuits. Cryptology ePrint Archive, Report 2024\/265 (2024). https:\/\/eprint.iacr.org\/2024\/265","DOI":"10.62056\/an-4c3c2h"},{"key":"7_CR47","doi-asserted-by":"crossref","unstructured":"Rosser, B.: Explicit bounds for some functions of prime numbers. Am. J. Math. 63(1), 211\u2013232 (1941). http:\/\/www.jstor.org\/stable\/2371291","DOI":"10.2307\/2371291"},{"issue":"2","key":"7_CR48","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"RL Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120\u2013126 (1978)","journal-title":"Commun. ACM"},{"key":"7_CR49","unstructured":"Seres, I.A., Burcsi, P.: Behemoth: transparent polynomial commitment scheme with constant opening proof size and verifier time. Cryptology ePrint Archive, Report 2023\/670 (2023). https:\/\/eprint.iacr.org\/2023\/670"},{"key":"7_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1007\/978-3-030-56877-1_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"S Setty","year":"2020","unstructured":"Setty, S.: Spartan: efficient and general-purpose zkSNARKs without trusted setup. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12172, pp. 704\u2013737. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_25"},{"key":"7_CR51","unstructured":"Setty, S., Lee, J.: Quarks: auadruple-efficient transparent zksnarks. Cryptology ePrint Archive (2020)"},{"key":"7_CR52","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/978-3-031-22318-1_18","volume-title":"TCC 2022, Part I","author":"E Soria-Vazquez","year":"2022","unstructured":"Soria-Vazquez, E.: Doubly efficient interactive proofs over infinite and non-commutative rings. In: Kiltz, E., Vaikuntanathan, V. (eds.) TCC 2022, Part I. LNCS, vol. 13747, pp. 497\u2013525. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22318-1_18"},{"key":"7_CR53","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-031-58751-1_7","volume-title":"EUROCRYPT 2024, Part VI","author":"STV Setty","year":"2024","unstructured":"Setty, S.T.V., Thaler, J., Wahby, R.S.: Unlocking the lookup singularity with Lasso. In: Joye, M., Leander, G. (eds.) EUROCRYPT 2024, Part VI. LNCS, vol. 14656, pp. 180\u2013209. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58751-1_7"},{"key":"7_CR54","unstructured":"Sato, K., Young, C.: An in-depth look at Google\u2019s first tensor processing unit. https:\/\/cloud.google.com\/blog\/products\/ai-machine-learning\/an-in-depth-look-at-googles-first-tensor-processing-unit-tpu"},{"key":"7_CR55","doi-asserted-by":"crossref","unstructured":"Thaler, J.: Proofs, Arguments, and Zero-Knowledge (2023). https:\/\/people.cs.georgetown.edu\/jthaler\/ProofsArgsAndZK","DOI":"10.1561\/9781638281252"},{"key":"7_CR56","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"774","DOI":"10.1007\/978-3-030-64840-4_26","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"P Towa","year":"2020","unstructured":"Towa, P., Vergnaud, D.: Succinct Diophantine-satisfiability arguments. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020, Part III. LNCS, vol. 12493, pp. 774\u2013804. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64840-4_26"},{"key":"7_CR57","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-3-030-17659-4_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"B Wesolowski","year":"2019","unstructured":"Wesolowski, B.: Efficient verifiable delay functions. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019, Part III. LNCS, vol. 11478, pp. 379\u2013407. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_13"},{"key":"7_CR58","unstructured":"Yang, X., Zhang, C., Ryan, M., Meng, G.: Multivariate multi-polynomial commitment and its applications. Cryptology ePrint Archive, Report 2024\/827 (2024). https:\/\/eprint.iacr.org\/2024\/827"},{"key":"7_CR59","doi-asserted-by":"publisher","unstructured":"Zhang, Y., Genkin, D., Katz, J., Papadopoulos, D., Papamanthou, C.: vRAM: faster verifiable RAM with program-independent preprocessing. In: 2018 IEEE Symposium on Security and Privacy, pp. 908\u2013925. IEEE Computer Society Press (2018). https:\/\/doi.org\/10.1109\/SP.2018.00013","DOI":"10.1109\/SP.2018.00013"}],"container-title":["Lecture Notes in Computer Science","Public-Key Cryptography \u2013 PKC 2026"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-26737-5_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T13:16:57Z","timestamp":1779283017000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-26737-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032267368","9783032267375"],"references-count":59,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-26737-5_7","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":"21 May 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PKC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IACR International Conference on Public-Key Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"West Palm Beach, FL","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":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 May 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 May 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pkc2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pkc.iacr.org\/2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}