{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:51:07Z","timestamp":1743101467246,"version":"3.40.3"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031692307"},{"type":"electronic","value":"9783031692314"}],"license":[{"start":{"date-parts":[[2024,11,30]],"date-time":"2024-11-30T00:00:00Z","timestamp":1732924800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,30]],"date-time":"2024-11-30T00:00:00Z","timestamp":1732924800000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-69231-4_15","type":"book-chapter","created":{"date-parts":[[2024,11,29]],"date-time":"2024-11-29T08:24:24Z","timestamp":1732868664000},"page":"225-239","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["IZPR: Instant Zero Knowledge Proof of\u00a0Reserve"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-0527-1621","authenticated-orcid":false,"given":"Trevor","family":"Conley","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0008-6956-3035","authenticated-orcid":false,"given":"Nilsso","family":"Diaz","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0005-1970-5785","authenticated-orcid":false,"given":"Diego","family":"Espada","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0008-7757-6944","authenticated-orcid":false,"given":"Alvin","family":"Kuruvilla","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0002-3263-1993","authenticated-orcid":false,"given":"Stenton","family":"Mayne","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6608-1654","authenticated-orcid":false,"given":"Xiang","family":"Fu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,11,30]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Ganesh, C., Mohassel, P.: Non-interactive zero-knowledge proofs for composite statements. In: CRYPTO, pp. 643\u2013673 (2018)","DOI":"10.1007\/978-3-319-96878-0_22"},{"key":"15_CR2","unstructured":"arkworks contributors. arkworks zksnark ecosystem (2022)"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Baldimtsi, F., Chatzigiannis, P., Gordon, S., Le, P., McVicker, D.: gOTzilla: Efficient disjunctive zero-knowledge proofs from MPC in the head, with application to proofs of asset in cryptocurrencies. PoPETs 4, 229\u2013249 (2022)","DOI":"10.56553\/popets-2022-0107"},{"key":"15_CR4","unstructured":"Binance: Improving crypto transparency with zero-knowledge proof (2023). https:\/\/academy.binance.com\/en\/articles\/improving-crypto-transparency-with-zero-knowledge-proof"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"B\u00fcnz, B., Bootle, J., Boneh, D., Poelstra, A., Wuille, P., Maxwell, G.: Bulletproofs: short proofs for confidential transactions and more. In: SSP, pp. 315\u2013334 (2018)","DOI":"10.1109\/SP.2018.00020"},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/BFb0052252","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201997","author":"J Camenisch","year":"1997","unstructured":"Camenisch, J., Stadler, M.: Efficient group signature schemes for large groups. In: Kaliski, B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 410\u2013424. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0052252"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Campanelli, M., Faonio, A., Fiore, D., Li, T., Lipmaa, H.: Lookup arguments: improvements, extensions and applications to zero-knowledge decision trees (2023). https:\/\/hal.science\/hal-04234948\/document","DOI":"10.1007\/978-3-031-57722-2_11"},{"key":"15_CR8","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\u00a0toolbox for\u00a0more efficient universal and\u00a0updatable zkSNARKs and\u00a0commit-and-prove extensions. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021. LNCS, vol. 13092, pp. 3\u201333. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92078-4_1"},{"key":"15_CR9","unstructured":"Carter, N.: Nic\u2019s PoR wall of fame (2023). https:\/\/niccarter.info\/proof-of-reserves\/"},{"key":"15_CR10","unstructured":"Chalkias, K., Lewi, K., Mohassel, P., Nikolaenko, V.: Distributed auditing proofs of liabilities. IACR Cryptology ePrint Archive (2020). https:\/\/eprint.iacr.org\/2020\/468"},{"key":"15_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-030-78375-4_13","volume-title":"Applied Cryptography and Network Security","author":"P Chatzigiannis","year":"2021","unstructured":"Chatzigiannis, P., Baldimtsi, F., Chalkias, K.: SoK: auditability and accountability in distributed payment systems. In: Sako, K., Tippenhauer, N.O. (eds.) ACNS 2021. LNCS, vol. 12727, pp. 311\u2013337. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-78375-4_13"},{"key":"15_CR12","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. LNCS, vol. 12105, pp. 738\u2013768. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_26"},{"key":"15_CR13","unstructured":"Choudhuri, A., Garg, S., Goel, A., Sekar, S., Sinha, R.: SublonK: sublinear prover plonk (2023). https:\/\/eprint.iacr.org\/2023\/902"},{"key":"15_CR14","unstructured":"CoinDesk: Binance\u2019s bitcoin reserves are overcollateralized, new report says (2023). https:\/\/www.coindesk.com\/business\/2022\/12\/07\/binances-bitcoin-reserves-are-overcollateralized-says-audit"},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"Dagher, G., B\u00fcnz, B., Bonneau, J., Clark, J., Boneh, D.: Provisions: privacy-preserving proofs of solvency for bitcoin exchanges. In: CCS, pp. 720\u2013731 (2015)","DOI":"10.1145\/2810103.2813674"},{"key":"15_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/978-3-319-24177-7_28","volume-title":"Computer Security \u2013 ESORICS 2015","author":"C Decker","year":"2015","unstructured":"Decker, C., Guthrie, J., Seidel, J., Wattenhofer, R.: Making bitcoin exchanges transparent. In: Pernul, G., Ryan, P.Y.A., Weippl, E. (eds.) ESORICS 2015. LNCS, vol. 9327, pp. 561\u2013576. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24177-7_28"},{"key":"15_CR17","doi-asserted-by":"publisher","first-page":"3900","DOI":"10.1109\/TIFS.2021.3088035","volume":"16","author":"A Dutta","year":"2021","unstructured":"Dutta, A., Bagad, S., Vijayakumaran, S.: MProve$$+$$: privacy enhancing proof of reserves protocol for Monero. IEEE Trans. Inf. Forensics Secur. 16, 3900\u20133915 (2021)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"15_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-030-35423-7_10","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2019","author":"A Dutta","year":"2019","unstructured":"Dutta, A., Jana, A., Vijayakumaran, S.: Nummatus: a privacy preserving proof of reserves protocol for Quisquis. In: Hao, F., Ruj, S., Sen Gupta, S. (eds.) INDOCRYPT 2019. LNCS, vol. 11898, pp. 195\u2013215. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-35423-7_10"},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"Dutta, A., Vijayakumaran, S.: MProve: a proof of reserves protocol for Monero exchanges. In: Euros &p Workshops, pp. 330\u2013339 (2019)","DOI":"10.1109\/EuroSPW.2019.00043"},{"key":"15_CR20","doi-asserted-by":"crossref","unstructured":"Dutta, A., Vijayakumaran, S.: Revelio: a MimbleWimble proof of reserves protocol. In: CVCBT, pp. 7\u201311 (2021)","DOI":"10.1109\/CVCBT.2019.000-5"},{"key":"15_CR21","unstructured":"Eagen, L., Fiore, D., Gabizon, A.: cq: Cached quotients for fast lookups. IACR Cryptology ePrint Archive (2022). https:\/\/eprint.iacr.org\/2022\/1763"},{"key":"15_CR22","unstructured":"Gabizon, A., Khovratovich, D.: flookup: fractional decomposition-based lookups in quasi-linear time independent of table size. IACR Cryptology ePrint Archive (2022)"},{"key":"15_CR23","unstructured":"Gabizon, A., Williamson, Z., Ciobotaru, O.: PLONK: permutations over Lagrange-bases for Oecumenical noninteractive arguments of knowledge. IACR Cryptology ePrint Archive (2019). https:\/\/eprint.iacr.org\/2019\/953"},{"key":"15_CR24","unstructured":"Gabizon, A., Williamson, Z.J.: plookup: a simplified polynomial protocol for lookup tables. IACR Cryptology ePrint Archive (2020)"},{"key":"15_CR25","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":"15_CR26","unstructured":"Habock, U.: Multivariate lookups based on logarithmic derivatives. IACR Cryptology ePrint Archive (2022)"},{"key":"15_CR27","doi-asserted-by":"crossref","unstructured":"Ji, Y., Chalkias, K.: Generalized proof of liabilities. In: CCS, pp. 3465\u20133486 (2021)","DOI":"10.1145\/3460120.3484802"},{"key":"15_CR28","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":"15_CR29","unstructured":"OKX: One year of proof of reserves (2023). https:\/\/www.okx.com\/proof-of-reserves"},{"key":"15_CR30","doi-asserted-by":"crossref","unstructured":"Parno, B., Howell, J., Gentry, C., Raykova, M.: Pinocchio: nearly practical verifiable computation. In: SSP, pp. 238\u2013252 (2013)","DOI":"10.1109\/SP.2013.47"},{"key":"15_CR31","unstructured":"Posen, J., Kattis, A.: Caulk+: table-independent lookup arguments. IACR Cryptology ePrint Archive (2022)"},{"key":"15_CR32","unstructured":"Setty, S., Thaler, J., Wahby, R.: Unlocking the lookup singularity with lasso. IACR Cryptology ePrint Archive (2023). https:\/\/eprint.iacr.org\/2023\/1216"},{"key":"15_CR33","doi-asserted-by":"crossref","unstructured":"Srinivasan, S., Karantaidou, I., Baldimtsi, F., Papamanthou, C.: Batching, aggregation, and zero-knowledge proofs in bilinear accumulators. In: CCS, pp. 2719\u20132733 (2022)","DOI":"10.1145\/3548606.3560676"},{"key":"15_CR34","unstructured":"summa-dev: Monorepo for Summa proof of solvency protocol (2023). https:\/\/github.com\/summa-dev\/summa-solvency"},{"key":"15_CR35","unstructured":"Wilcox, Z.: Proving your Bitcoin reserves (2014). https:\/\/bitcointalk.org\/index.php?topic=595180.0"},{"key":"15_CR36","doi-asserted-by":"crossref","unstructured":"Zapico, A., Buterin, V., Khovratovich, D., Maller, M., Nitulescu, A., Simkin, M.: Caulk: lookup arguments in sublinear time. In: CCS, pp. 3121\u20133134 (2022)","DOI":"10.1145\/3548606.3560646"},{"key":"15_CR37","unstructured":"Zapico, A., Gabizon, A., Khovratovich, D., Maller, M., R\u00e0fols, C.: Baloo: nearly optimal Lookup Arguments. IACR Cryptology ePrint Archive (2022)"},{"key":"15_CR38","unstructured":"Zhang, Y., Genkin, D., Katz, J., Papadopoulos, D., Papamanthou, C.: A Zero-Knowledge Version of vSQL. IACR Cryptology ePrint Archive, vol. 2017, p. 1146 (2017)"}],"container-title":["Lecture Notes in Computer Science","Financial Cryptography and Data Security. FC 2024 International Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-69231-4_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,29]],"date-time":"2024-11-29T09:06:41Z","timestamp":1732871201000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-69231-4_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,30]]},"ISBN":["9783031692307","9783031692314"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-69231-4_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,11,30]]},"assertion":[{"value":"30 November 2024","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":"Willemstad","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cura\u00e7ao","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":"5 March 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 March 2024","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":"fc2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/fc24.ifca.ai\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}