{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T10:58:14Z","timestamp":1772276294362,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":38,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662643211","type":"print"},{"value":"9783662643228","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-662-64322-8_23","type":"book-chapter","created":{"date-parts":[[2021,10,22]],"date-time":"2021-10-22T18:17:23Z","timestamp":1634926643000},"page":"476-496","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["BooLigero: Improved Sublinear Zero Knowledge Proofs for Boolean Circuits"],"prefix":"10.1007","author":[{"given":"Yaron","family":"Gvili","sequence":"first","affiliation":[]},{"given":"Sarah","family":"Scheffler","sequence":"additional","affiliation":[]},{"given":"Mayank","family":"Varia","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,23]]},"reference":[{"key":"23_CR1","doi-asserted-by":"publisher","unstructured":"Ames, S., Hazay, C., Ishai, Y., Venkitasubramaniam, M.: Ligero: lightweight sublinear arguments without a trusted setup. In: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) ACM CCS 2017, pp. 2087\u20132104. ACM Press, Dallas, TX, USA, 31 October\u20132 November 2017. https:\/\/doi.org\/10.1145\/3133956.3134104","DOI":"10.1145\/3133956.3134104"},{"key":"23_CR2","doi-asserted-by":"publisher","unstructured":"Baum, C., Nof, A.: Concretely-efficient zero-knowledge arguments for arithmetic circuits and their application to lattice-based cryptography. In: Kiayias, A., Kohlweiss, M., Wallden, P., Zikas, V. (eds.) PKC 2020, Part I. LNCS, vol. 12110, pp. 495\u2013526. Springer, Heidelberg, 4\u20137 May 2020, Germany, Edinburgh, UK. https:\/\/doi.org\/10.1007\/978-3-030-45374-9_17","DOI":"10.1007\/978-3-030-45374-9_17"},{"key":"23_CR3","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":"23_CR4","doi-asserted-by":"publisher","unstructured":"Ben-Sasson, E., et al.: Zerocash: decentralized anonymous payments from bitcoin. In: 2014 IEEE Symposium on Security and Privacy, pp. 459\u2013474. IEEE Computer Society Press, 18\u201321 May 2014, Berkeley, CA, USA. https:\/\/doi.org\/10.1109\/SP.2014.36","DOI":"10.1109\/SP.2014.36"},{"key":"23_CR5","doi-asserted-by":"publisher","unstructured":"Ben-Sasson, E., Chiesa, A., Genkin, D., Tromer, E., Virza, M.: SNARKs for C: verifying program executions succinctly and in zero knowledge. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part II. LNCS, vol. 8043, pp. 90\u2013108. Springer, Heidelberg, 18\u201322 August 2013, Germany, Santa Barbara, CA, USA. https:\/\/doi.org\/10.1007\/978-3-642-40084-1_6","DOI":"10.1007\/978-3-642-40084-1_6"},{"key":"23_CR6","doi-asserted-by":"publisher","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, Part I. LNCS, vol. 11476, pp. 103\u2013128. Springer, Heidelberg, 19\u201323 May 2019, Darmstadt, Germany. DOI: https:\/\/doi.org\/10.1007\/978-3-030-17653-2_4","DOI":"10.1007\/978-3-030-17653-2_4"},{"key":"23_CR7","doi-asserted-by":"publisher","unstructured":"Ben-Sasson, E., Chiesa, A., Spooner, N.: Interactive oracle proofs. In: Hirt, M., Smith, A.D. (eds.) TCC 2016-B, Part II. LNCS, vol. 9986, pp. 31\u201360. Springer, Heidelberg, 31 October\u20133 November 2016, Germany, Beijing, China. https:\/\/doi.org\/10.1007\/978-3-662-53644-5_2","DOI":"10.1007\/978-3-662-53644-5_2"},{"key":"23_CR8","unstructured":"Ben-Sasson, E., Chiesa, A., Tromer, E., Virza, M.: Succinct non-interactive zero knowledge for a von neumann architecture. In: Fu, K., Jung, J. (eds.) USENIX Security 2014, pp. 781\u2013796. USENIX Association, 20\u201322 August 2014, San Diego, CA, USA (2014)"},{"key":"23_CR9","doi-asserted-by":"publisher","unstructured":"Bitansky, N., Chiesa, A., Ishai, Y., Ostrovsky, R., Paneth, O.: Succinct non-interactive arguments via linear interactive proofs. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 315\u2013333. Springer, Heidelberg, Germany, Tokyo, Japan, 3\u20136 March 2013. https:\/\/doi.org\/10.1007\/978-3-642-36594-2_18","DOI":"10.1007\/978-3-642-36594-2_18"},{"key":"23_CR10","doi-asserted-by":"publisher","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, Part II. LNCS, vol. 9666, pp. 327\u2013357. Springer, Heidelberg, 8\u201312 May 2016, Germany, Vienna, Austria. https:\/\/doi.org\/10.1007\/978-3-662-49896-5_12","DOI":"10.1007\/978-3-662-49896-5_12"},{"key":"23_CR11","doi-asserted-by":"publisher","unstructured":"Chase, M., et al.: Post-quantum zero-knowledge and signatures from symmetric-key primitives. In: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) ACM CCS 2017, pp. 1825\u20131842. ACM Press, 31 October\u20132 November 2017, Dallas, TX, USA (2017). https:\/\/doi.org\/10.1145\/3133956.3133997","DOI":"10.1145\/3133956.3133997"},{"key":"23_CR12","doi-asserted-by":"publisher","unstructured":"Chiesa, A., Hu, Y., Maller, M., Mishra, P., Vesely, N., Ward, N.P.: 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, Heidelberg, 10\u201314 May 2020, Germany, Zagreb, Croatia (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_26","DOI":"10.1007\/978-3-030-45721-1_26"},{"key":"23_CR13","doi-asserted-by":"publisher","unstructured":"Costello, C., et al.: Geppetto: versatile verifiable computation. In: 2015 IEEE Symposium on Security and Privacy, pp. 253\u2013270. IEEE Computer Society Press, 17\u201321 May 2015, San Jose, CA, USA. https:\/\/doi.org\/10.1109\/SP.2015.23","DOI":"10.1109\/SP.2015.23"},{"key":"23_CR14","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":"23_CR15","doi-asserted-by":"publisher","unstructured":"Ganesh, C., Orlandi, C., Tschudi, D.: Proof-of-stake protocols for privacy-aware blockchains. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019, Part I. LNCS, vol. 11476, pp. 690\u2013719. Springer, Heidelberg, 19\u201323 May 2019, Darmstadt, Germany. https:\/\/doi.org\/10.1007\/978-3-030-17653-2_23","DOI":"10.1007\/978-3-030-17653-2_23"},{"key":"23_CR16","doi-asserted-by":"publisher","unstructured":"Gennaro, R., Gentry, C., Parno, B., Raykova, M.: Quadratic span programs and succinct NIZKs without PCPs. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 626\u2013645. Springer, Heidelberg, 26\u201330 May 2013, Germany, Athens, Greece. https:\/\/doi.org\/10.1007\/978-3-642-38348-9_37","DOI":"10.1007\/978-3-642-38348-9_37"},{"key":"23_CR17","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, 6\u20138 June 2011, San Jose, CA, USA. https:\/\/doi.org\/10.1145\/1993636.1993651","DOI":"10.1145\/1993636.1993651"},{"key":"23_CR18","unstructured":"Giacomelli, I., Madsen, J., Orlandi, C.: ZKBoo: faster zero-knowledge for Boolean circuits. In: Holz, T., Savage, S. (eds.) USENIX Security 2016, pp. 1069\u20131083. USENIX Association, Austin, TX, USA, 10\u201312 August 2016"},{"key":"23_CR19","doi-asserted-by":"publisher","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: Aho, A. (ed.) 19th ACM STOC, pp. 218\u2013229. ACM Press, 25\u201327 May 1987, New York City, NY, USA (1987). https:\/\/doi.org\/10.1145\/28395.28420","DOI":"10.1145\/28395.28420"},{"key":"23_CR20","doi-asserted-by":"publisher","unstructured":"Groth, J.: On the size of pairing-based non-interactive arguments. In: Fischlin, M., Coron, J.S. (eds.) EUROCRYPT 2016, Part II. LNCS, vol. 9666, pp. 305\u2013326. Springer, Heidelberg, 8\u201312 May 2016, Germany, Vienna, Austria (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_11","DOI":"10.1007\/978-3-662-49896-5_11"},{"key":"23_CR21","doi-asserted-by":"publisher","unstructured":"Groth, J., Kohlweiss, M., Maller, M., Meiklejohn, S., Miers, I.: Updatable and universal common reference strings with applications to zk-SNARKs. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018, Part III. LNCS, vol. 10993, pp. 698\u2013728. Springer, Heidelberg, 19\u201323 August 2018, Germany, Santa Barbara, CA, USA (2018). https:\/\/doi.org\/10.1007\/978-3-319-96878-0_24","DOI":"10.1007\/978-3-319-96878-0_24"},{"key":"23_CR22","unstructured":"Gvili, Y., Scheffler, S., Varia, M.: BooLigero: improved sublinear zero knowledge proofs for Boolean circuits. Cryptology ePrint Archive, Report 2021\/121 (2021). https:\/\/eprint.iacr.org\/2021\/121"},{"key":"23_CR23","doi-asserted-by":"publisher","unstructured":"Hoffmann, M., Kloo\u00df, M., Rupp, A.: Efficient zero-knowledge arguments in the discrete log setting, revisited. In: Cavallaro, L., Kinder, J., Wang, X., Katz, J. (eds.) ACM CCS 2019, pp. 2093\u20132110. ACM Press, 11\u201315 November 2019 (2019). https:\/\/doi.org\/10.1145\/3319535.3354251","DOI":"10.1145\/3319535.3354251"},{"key":"23_CR24","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Zero-knowledge from secure multiparty computation. In: Johnson, D.S., Feige, U. (eds.) 39th ACM STOC, pp. 21\u201330. ACM Press, 11\u201313 June 2007, San Diego, CA, USA (2007). https:\/\/doi.org\/10.1145\/1250790.1250794","DOI":"10.1145\/1250790.1250794"},{"key":"23_CR25","doi-asserted-by":"publisher","unstructured":"Jawurek, M., Kerschbaum, F., Orlandi, C.: Zero-knowledge using garbled circuits: how to prove non-algebraic statements efficiently. In: Sadeghi, A.R., Gligor, V.D., Yung, M. (eds.) ACM CCS 2013, pp. 955\u2013966. ACM Press, 4\u20138 November 2013, Berlin, Germany. https:\/\/doi.org\/10.1145\/2508859.2516662","DOI":"10.1145\/2508859.2516662"},{"key":"23_CR26","doi-asserted-by":"publisher","unstructured":"Kalai, Y.T., Raz, R.: Interactive PCP. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol. 5126, pp. 536\u2013547. Springer, Heidelberg, 7\u201311 July 2008, Germany, Reykjavik, Iceland (2008). https:\/\/doi.org\/10.1007\/978-3-540-70583-3_44","DOI":"10.1007\/978-3-540-70583-3_44"},{"key":"23_CR27","doi-asserted-by":"crossref","unstructured":"Kerber, T., Kohlweiss, M., Kiayias, A., Zikas, V.: Ouroboros crypsinous: Privacy-preserving proof-of-stake. Cryptology ePrint Archive, Report 2018\/1132 (2018). https:\/\/eprint.iacr.org\/2018\/1132","DOI":"10.1109\/SP.2019.00063"},{"key":"23_CR28","doi-asserted-by":"publisher","unstructured":"Kilian, J.: A note on efficient zero-knowledge proofs and arguments (extended abstract). In: 24th ACM STOC, pp. 723\u2013732. ACM Press, 4\u20136 May 1992, Victoria, BC, Canada (1992). https:\/\/doi.org\/10.1145\/129712.129782","DOI":"10.1145\/129712.129782"},{"key":"23_CR29","doi-asserted-by":"publisher","unstructured":"Kondi, Y., Patra, A.: Privacy-free garbled circuits for formulas: size zero and information-theoretic. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017, Part I. LNCS, vol. 10401, pp. 188\u2013222. Springer, Heidelberg, 20\u201324 August 2017, Germany, Santa Barbara, CA, USA (2017). DOI: https:\/\/doi.org\/10.1007\/978-3-319-63688-7_7","DOI":"10.1007\/978-3-319-63688-7_7"},{"key":"23_CR30","doi-asserted-by":"publisher","unstructured":"Lipmaa, H.: Succinct non-interactive zero knowledge arguments from span programs and linear error-correcting codes. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013, Part I. LNCS, vol. 8269, pp. 41\u201360. Springer, Heidelberg, 1\u20135 December 2013, Germany, Bengalore, India (2013). https:\/\/doi.org\/10.1007\/978-3-642-42033-7_3","DOI":"10.1007\/978-3-642-42033-7_3"},{"key":"23_CR31","doi-asserted-by":"publisher","unstructured":"Maller, M., Bowe, S., Kohlweiss, M., Meiklejohn, S.: Sonic: zero-knowledge SNARKs from linear-size universal and updatable structured reference strings. In: Cavallaro, L., Kinder, J., Wang, X., Katz, J. (eds.) ACM CCS 2019, pp. 2111\u20132128. ACM Press, 11\u201315 November 2019. https:\/\/doi.org\/10.1145\/3319535.3339817","DOI":"10.1145\/3319535.3339817"},{"key":"23_CR32","doi-asserted-by":"publisher","unstructured":"Miers, I., Garman, C., Green, M., Rubin, A.D.: Zerocoin: anonymous distributed E-cash from Bitcoin. In: 2013 IEEE Symposium on Security and Privacy, pp. 397\u2013411. IEEE Computer Society Press, 19\u201322 May 2013, Berkeley, CA, USA (2013). https:\/\/doi.org\/10.1109\/SP.2013.34","DOI":"10.1109\/SP.2013.34"},{"key":"23_CR33","doi-asserted-by":"publisher","unstructured":"Parno, B., Howell, J., Gentry, C., Raykova, M.: Pinocchio: nearly practical verifiable computation. In: 2013 IEEE Symposium on Security and Privacy, pp. 238\u2013252. IEEE Computer Society Press, 19\u201322 May 2013, Berkeley, CA, USA (2013). https:\/\/doi.org\/10.1109\/SP.2013.47","DOI":"10.1109\/SP.2013.47"},{"key":"23_CR34","doi-asserted-by":"publisher","unstructured":"Setty, S.: Spartan: Efficient and general-purpose zkSNARKs without trusted setup. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020, Part III. LNCS, vol. 12172, pp. 704\u2013737. Springer, Heidelberg, 17\u201321 August 2020, Germany, Santa Barbara, CA, USA (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_25","DOI":"10.1007\/978-3-030-56877-1_25"},{"key":"23_CR35","unstructured":"Venkitasubramaniam, M.: Personal communication, September 2020"},{"key":"23_CR36","doi-asserted-by":"publisher","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, pp. 926\u2013943. IEEE Computer Society Press, 21\u201323 May 2018, San Francisco, CA, USA. https:\/\/doi.org\/10.1109\/SP.2018.00060","DOI":"10.1109\/SP.2018.00060"},{"key":"23_CR37","unstructured":"Weng, C., Yang, K., Katz, J., Wang, X.: Wolverine: fast, scalable, and communication-efficient zero-knowledge proofs for Boolean and arithmetic circuits. Cryptology ePrint Archive, Report 2020\/925 (2020). https:\/\/eprint.iacr.org\/2020\/925"},{"key":"23_CR38","doi-asserted-by":"publisher","unstructured":"Xie, T., Zhang, J., Zhang, Y., Papamanthou, C., Song, D.: Libra: succinct zero-knowledge proofs with optimal prover computation. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019, Part III. LNCS, vol. 11694, pp. 733\u2013764. Springer, Heidelberg, 18\u201322 August 2019, Germany, Santa Barbara, CA, USA (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_24","DOI":"10.1007\/978-3-030-26954-8_24"}],"container-title":["Lecture Notes in Computer Science","Financial Cryptography and Data Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-64322-8_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,22]],"date-time":"2021-10-22T18:33:41Z","timestamp":1634927621000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-64322-8_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783662643211","9783662643228"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-64322-8_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"23 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Financial Cryptography and Data Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 March 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 March 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fc2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/fc21.ifca.ai\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}