{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T11:38:13Z","timestamp":1772192293971,"version":"3.50.1"},"publisher-location":"Cham","reference-count":46,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031229657","type":"print"},{"value":"9783031229664","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-22966-4_8","type":"book-chapter","created":{"date-parts":[[2023,1,29]],"date-time":"2023-01-29T16:02:41Z","timestamp":1675008161000},"page":"219-248","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Flashproofs: Efficient Zero-Knowledge Arguments of\u00a0Range and\u00a0Polynomial Evaluation with\u00a0Transparent Setup"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5399-1202","authenticated-orcid":false,"given":"Nan","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0362-2844","authenticated-orcid":false,"given":"Sid Chi-Kin","family":"Chau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,30]]},"reference":[{"key":"8_CR1","unstructured":"Alex, V., Sergey, V.: Solidity implementation of bulletproof (2018). https:\/\/github.com\/BANKEX\/BulletproofJS"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Ames, S., Hazay, C., Ishai, Y., Venkitasubramaniam, M.: Ligero: lightweight sublinear arguments without a trusted setup. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS 2017 (2017)","DOI":"10.1145\/3133956.3134104"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"646","DOI":"10.1007\/978-3-642-38348-9_38","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"S Bayer","year":"2013","unstructured":"Bayer, S., Groth, J.: Zero-knowledge argument for polynomial evaluation with application to blacklists. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 646\u2013663. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_38"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/BFb0054130","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 1998","author":"M Bellare","year":"1998","unstructured":"Bellare, M., Garay, J.A., Rabin, T.: Fast batch verification for modular exponentiation and digital signatures. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 236\u2013250. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054130"},{"key":"8_CR5","unstructured":"Ben-Sasson, E., Bentov, I., Horesh, Y., Riabzev, M.: Scalable, transparent, and post-quantum secure computational integrity. IACR Cryptol. ePrint Arch. (2018)"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-030-17653-2_4","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"E Ben-Sasson","year":"2019","unstructured":"Ben-Sasson, E., Chiesa, A., Riabzev, M., Spooner, N., Virza, M., Ward, N.P.: Aurora: transparent succinct arguments for R1CS. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11476, pp. 103\u2013128. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_4"},{"key":"8_CR7","unstructured":"Ben-Sasson, E., Chiesa, A., Tromer, E., Virza, M.: Succinct non-interactive zero knowledge for a von Neumann architecture. In: 23rd USENIX Security Symposium (USENIX Security 2014) (2014)"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Benarroch, D., Campanelli, M., Fiore, D., Gurkan, K., Kolonelos, D.: Zero-knowledge proofs for set membership: efficient, succinct, modular. In: Financial Cryptography and Data Security (2021)","DOI":"10.1007\/978-3-662-64322-8_19"},{"key":"8_CR9","unstructured":"Benedikt, B.: Java implementation of bulletproof (2017). https:\/\/github.com\/bbuenz\/BulletProofLib"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-662-49896-5_12","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"J Bootle","year":"2016","unstructured":"Bootle, J., Cerulli, A., Chaidos, P., Groth, J., Petit, C.: Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 327\u2013357. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_12"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Bootle, J., Groth, J.: Efficient batch zero-knowledge arguments for low degree polynomials. In: Public-Key Cryptography - PKC 2018 (2018)","DOI":"10.1007\/978-3-319-76581-5_19"},{"key":"8_CR12","unstructured":"BouncyCastle: Bouncycastle. https:\/\/www.bouncycastle.org\/"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Bunz, B., Bootle, J., Boneh, D., Poelstra, A., Wuille, P., Maxwell, G.: Bulletproofs: Short proofs for confidential transactions and more, pp. 315\u2013334, May 2018","DOI":"10.1109\/SP.2018.00020"},{"key":"8_CR14","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. LNCS, vol. 12105, pp. 677\u2013706. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_24"},{"key":"8_CR15","doi-asserted-by":"publisher","unstructured":"Camenisch, J., Chaabouni, R., shelat: Efficient protocols for set membership and range proofs. In: Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, vol. 5350, pp. 234\u2013252. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-89255-7_15","DOI":"10.1007\/978-3-540-89255-7_15"},{"key":"8_CR16","unstructured":"Cardozo, A.S., Williamson, Z.: https:\/\/eips.ethereum.org\/EIPS\/eip-1108"},{"key":"8_CR17","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. LNCS, vol. 12105, pp. 769\u2013793. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_27"},{"key":"8_CR18","unstructured":"Christian, R.: EIP-196: Precompiled contracts for addition and scalar multiplication on the elliptic curve $$alt_bn128$$ (2017). https:\/\/eips.ethereum.org\/EIPS\/eip-196"},{"key":"8_CR19","unstructured":"coindesk (2022). https:\/\/www.coindesk.com\/price\/ethereum"},{"key":"8_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-030-77883-5_9","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"G Couteau","year":"2021","unstructured":"Couteau, G., Kloo\u00df, M., Lin, H., Reichle, M.: Efficient range proofs with transparent setup from bounded integer commitments. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12698, pp. 247\u2013277. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77883-5_9"},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"Deng, C., Tang, X., You, L., Hu, G.: Cuproof: a novel range proof with constant size. IACR Cryptol. ePrint Arch. (2021)","DOI":"10.3390\/e24030334"},{"key":"8_CR22","unstructured":"Dobson, S., Galbraith, S., Smith, B.: Trustless unknown-order groups. Math. Cryptol. 1(2), 25\u201339 (2022). https:\/\/journals.flvc.org\/mathcryptology\/article\/view\/130579"},{"key":"8_CR23","unstructured":"Etherscan. https:\/\/ropsten.etherscan.io\/address\/0xa1f11d83a5222692c0eff9eca32254a7452c4f29#code#L1"},{"key":"8_CR24","unstructured":"Etherscan: https:\/\/etherscan.io\/gasTracker (2022)"},{"key":"8_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-47721-7_12","volume-title":"Advances in Cryptology \u2014 CRYPTO 1986","author":"A Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186\u2013194. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_12"},{"key":"8_CR26","unstructured":"Gregory, M.: Confidential transactions (2016). https:\/\/elementsproject.org\/features\/confidential-transactions\/investigation"},{"key":"8_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/11496137_32","volume-title":"Applied Cryptography and Network Security","author":"J Groth","year":"2005","unstructured":"Groth, J.: Non-interactive zero-knowledge arguments for voting. In: Ioannidis, J., Keromytis, A., Yung, M. (eds.) ACNS 2005. LNCS, vol. 3531, pp. 467\u2013482. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11496137_32"},{"key":"8_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-662-49896-5_11","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"J Groth","year":"2016","unstructured":"Groth, J.: On the size of pairing-based non-interactive arguments. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 305\u2013326. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_11"},{"key":"8_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-662-46803-6_9","volume-title":"Advances in Cryptology - EUROCRYPT 2015","author":"J Groth","year":"2015","unstructured":"Groth, J., Kohlweiss, M.: One-out-of-many proofs: or how to leak a secret and spend a coin. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9057, pp. 253\u2013280. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_9"},{"key":"8_CR30","unstructured":"HarryR: https:\/\/github.com\/HarryR\/ethsnarks"},{"key":"8_CR31","unstructured":"matter labs: Awesome zero knowledge proofs. https:\/\/github.com\/matter-labs\/awesome-zero-knowledge-proofs"},{"key":"8_CR32","unstructured":"Language, S.P.: https:\/\/docs.soliditylang.org"},{"key":"8_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/978-3-540-40061-5_26","volume-title":"Advances in Cryptology - ASIACRYPT 2003","author":"H Lipmaa","year":"2003","unstructured":"Lipmaa, H.: On Diophantine complexity and statistical zero-knowledge arguments. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol. 2894, pp. 398\u2013415. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-40061-5_26"},{"issue":"3","key":"8_CR34","doi-asserted-by":"publisher","first-page":"1647","DOI":"10.1109\/TCC.2020.3010235","volume":"10","author":"L Lyu","year":"2022","unstructured":"Lyu, L., Chau, S.C.K., Wang, N., Zheng, Y.: Cloud-based privacy-preserving collaborative consumption for sharing economy. IEEE Trans. Cloud Comput. 10(3), 1647\u20131660 (2022)","journal-title":"IEEE Trans. Cloud Comput."},{"key":"8_CR35","doi-asserted-by":"crossref","unstructured":"Maller, M., Bowe, S., Kohlweiss, M., Meiklejohn, S.: Sonic: Zero-knowledge snarks from linear-size universal and updatable structured reference strings. In: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, pp. 2111\u20132128 (2019)","DOI":"10.1145\/3319535.3339817"},{"key":"8_CR36","unstructured":"Michaud-Rodgers, P.: Sum of three squares (2019). https:\/\/warwick.ac.uk\/fac\/sci\/maths\/people\/staff\/michaud\/threesquarestalk.pdf"},{"key":"8_CR37","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":"8_CR38","unstructured":"Solidity: Solidity optimizer (2022). https:\/\/docs.soliditylang.org\/en\/v0.8.14\/internals\/optimizer.html#optimizer-parameter-runs"},{"key":"8_CR39","unstructured":"Suite, T.: https:\/\/www.trufflesuite.com"},{"key":"8_CR40","unstructured":"TornadoCash: Tornadocash (2021). https:\/\/tornado.cash\/"},{"key":"8_CR41","doi-asserted-by":"crossref","unstructured":"Wahby, R., Tzialla, I., Shelat, A., Thaler, J., Walfish, M.: Doubly-efficient zksnarks without trusted setup, pp. 926\u2013943, May 2018","DOI":"10.1109\/SP.2018.00060"},{"issue":"1","key":"8_CR42","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1145\/3508467.3508471","volume":"1","author":"N Wang","year":"2022","unstructured":"Wang, N., Chau, S.C.K., Zhou, Y.: Privacy-preserving energy storage sharing with blockchain and secure multi-party computation. ACM SIGENERGY Energy Inform. Rev. 1(1), 32\u201350 (2022). https:\/\/doi.org\/10.1145\/3508467.3508471","journal-title":"ACM SIGENERGY Energy Inform. Rev."},{"key":"8_CR43","unstructured":"Weisstein, E.W.: Lagrange\u2019s four-square theorem (2021). https:\/\/mathworld.wolfram.com\/LagrangesFour-SquareTheorem.html"},{"key":"8_CR44","unstructured":"Weisstein, E.W.: Maclaurin series (2021). https:\/\/mathworld.wolfram.com\/MaclaurinSeries.html"},{"key":"8_CR45","unstructured":"Williamson, Z.J.: The Aztec protocol (2018). https:\/\/github.com\/AztecProtocol\/AZTEC\/blob\/master\/AZTEC.pdf"},{"key":"8_CR46","doi-asserted-by":"crossref","unstructured":"Zhang, J., Xie, T., Zhang, Y., Song, D.X.: Transparent polynomial delegation and its applications to zero knowledge proof. In: 2020 IEEE Symposium on Security and Privacy (SP), pp. 859\u2013876 (2020)","DOI":"10.1109\/SP40000.2020.00052"}],"updated-by":[{"DOI":"10.1007\/978-3-031-22966-4_24","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2023,4,9]],"date-time":"2023-04-09T00:00:00Z","timestamp":1680998400000}}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22966-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T01:02:34Z","timestamp":1769648554000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22966-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031229657","9783031229664"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22966-4_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"30 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"9 April 2023","order":2,"name":"change_date","label":"Change Date","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Correction","order":3,"name":"change_type","label":"Change Type","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"A correction has been published.","order":4,"name":"change_details","label":"Change Details","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taipei","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"364","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"98","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"27% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}