{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T16:01:20Z","timestamp":1775059280251,"version":"3.50.1"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030371098","type":"print"},{"value":"9783030371104","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-37110-4_16","type":"book-chapter","created":{"date-parts":[[2020,2,13]],"date-time":"2020-02-13T14:04:03Z","timestamp":1581602643000},"page":"233-249","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":47,"title":["An Introduction to the Use of zk-SNARKs in Blockchains"],"prefix":"10.1007","author":[{"given":"Alexandre Miranda","family":"Pinto","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,2,14]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Ganesh, C., Mohassel, P.: Non-interactive zero-knowledge proofs for composite statements. In: Shacham, H., Boldyreva, A. (eds.) Advances in Cryptology - CRYPTO 2018, pp. 643\u2013673. Springer International Publishing, Cham (2018)","DOI":"10.1007\/978-3-319-96878-0_22"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Backes, M., Barbosa, M., Fiore, D., et\u00a0al.: Adsnark: nearly-practical privacy-preserving proofs on authenticated data. In: Proceedings of the 36th IEEE Symposium on Security and Privacy (S&P), May 2015","DOI":"10.1109\/SP.2015.24"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Bellare, M., Palacio, A.: The knowledge-of-exponent assumptions and 3-round zero-knowledge protocols. In: Proceedings of Advances in Cryptology - CRYPTO 2004, 24th Annual International Cryptology Conference, Santa Barbara, California, USA, 15\u201319 August 2004. Lecture Notes in Computer Science, vol.\u00a03152, pp. 273\u2013289. Springer (2004)","DOI":"10.1007\/978-3-540-28628-8_17"},{"key":"16_CR4","first-page":"46","volume":"2018","author":"E Ben-Sasson","year":"2018","unstructured":"Ben-Sasson, E., Bentov, I., Horesh, Y., et al.: Scalable, transparent, and post-quantum secure computational integrity. IACR Cryptol. ePrint Archi. 2018, 46 (2018)","journal-title":"IACR Cryptol. ePrint Archi."},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Chiesa, A., Genkin, D., et\u00a0al.: Snarks for c: verifying program executions succinctly and in zero knowledge. In: Canetti, R., Garay, J.A. (eds.) CRYPTO (2). Lecture Notes in Computer Science, vol.\u00a08043, pp. 90\u2013108. Springer (2013)","DOI":"10.1007\/978-3-642-40084-1_6"},{"key":"16_CR6","unstructured":"Ben-Sasson, E., Chiesa, A., Tromer, E., et\u00a0al.: Succinct non-interactive zero knowledge for a von neumann architecture. In: Proceedings of the 23rd USENIX Conference on Security Symposium. SEC\u201914, pp. 781\u2013796 (2014)"},{"issue":"4","key":"16_CR7","doi-asserted-by":"publisher","first-page":"1102","DOI":"10.1007\/s00453-016-0221-0","volume":"79","author":"E Ben-Sasson","year":"2017","unstructured":"Ben-Sasson, E., Chiesa, A., Tromer, E., et al.: Scalable zero knowledge via cycles of elliptic curves. Algorithmica 79(4), 1102\u20131160 (2017). \nhttps:\/\/doi.org\/10.1007\/s00453-016-0221-0","journal-title":"Algorithmica"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Canetti, R., Chiesa, A., et\u00a0al.: From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again. In: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference. ITCS \u201912, pp. 326\u2013349. ACM, New York (2012)","DOI":"10.1145\/2090236.2090263"},{"issue":"6","key":"16_CR9","doi-asserted-by":"publisher","first-page":"1084","DOI":"10.1137\/0220068","volume":"20","author":"M Blum","year":"1991","unstructured":"Blum, M., De Santis, A., Micali, S., et al.: Noninteractive zero-knowledge. SIAM J. Comput. 20(6), 1084\u20131118 (1991)","journal-title":"SIAM J. Comput."},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Blum, M., Feldman, P., Micali, S.: Non-interactive zero-knowledge and its applications. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing. STOC \u201988, pp. 103\u2013112. ACM, New York (1988)","DOI":"10.1145\/62212.62222"},{"key":"16_CR11","unstructured":"B\u00fcnz, B., Agrawal, S., Zamani, M., et\u00a0al.: Zether: towards privacy in a smart contract world. IACR Cryptol. ePrint Arch. 2019, 191 (2019). \nhttps:\/\/eprint.iacr.org\/2019\/191"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"B\u00fcnz, B., Bootle, J., Boneh, D., et\u00a0al.: Bulletproofs: short proofs for confidential transactions and more. In: Proceedings of 2018 IEEE Symposium on Security and Privacy, SP 2018, San Francisco, California, USA, 21\u201323 May 2018, pp. 315\u2013334 (2018)","DOI":"10.1109\/SP.2018.00020"},{"key":"16_CR13","doi-asserted-by":"publisher","unstructured":"Ciampi, M., Persiano, G., Scafuro, A., et\u00a0al.: Improved or-composition of sigma-protocols. In: Proceedings of Theory of Cryptography - 13th International Conference, TCC 2016-A, Tel Aviv, Israel, Part II, 10\u201313 January 2016, pp. 112\u2013141 (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-662-49099-0_5\n\n,","DOI":"10.1007\/978-3-662-49099-0_5"},{"key":"16_CR14","unstructured":"Cramer, R., Damg\u00e5rd, I., Schoenmakers, B.: Proofs of partial knowledge and simplified design of witness hiding protocols. In: Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology. CRYPTO \u201994, pp. 174\u2013187. Springer, London (1994). \nhttp:\/\/dl.acm.org\/citation.cfm?id=646759.705842"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Danezis, G., Fournet, C., Groth, J., et\u00a0al.: Square span programs with applications to succinct NIZK arguments. In: ASIACRYPT (1). Lecture Notes in Computer Science, vol.\u00a08873, pp. 532\u2013550. Springer (2014)","DOI":"10.1007\/978-3-662-45611-8_28"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Proceedings on Advances in Cryptology\u2014CRYPTO \u201986, pp. 186\u2013194. Springer, London (1987)","DOI":"10.1007\/3-540-47721-7_12"},{"key":"16_CR17","unstructured":"Frankenfield, J.: Coinjoin, July 2018. \nhttps:\/\/www.investopedia.com\/terms\/c\/coinjoin.asp\n\n. Accessed 27 May 2019"},{"key":"16_CR18","first-page":"119","volume":"2019","author":"A Gabizon","year":"2019","unstructured":"Gabizon, A.: On the security of the BCTV pinocchio zk-snark variant. IACR Cryptol. ePrint Arch. 2019, 119 (2019)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Gentry, C., Parno, B., et\u00a0al.: Quadratic span programs and succinct nizks without pcps. In: Proceedings of Advances in Cryptology - EUROCRYPT 2013, 32nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Athens, Greece, 26\u201330 May 2013, pp. 626\u2013645 (2013)","DOI":"10.1007\/978-3-642-38348-9_37"},{"issue":"3","key":"16_CR20","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1145\/116825.116852","volume":"38","author":"O Goldreich","year":"1991","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: Proofs that yield nothing but their validity or all languages in np have zero-knowledge proof systems. J. ACM 38(3), 690\u2013728 (1991)","journal-title":"J. ACM"},{"key":"16_CR21","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof-systems. In: Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing. STOC \u201985, pp. 291\u2013304. ACM, New York (1985)","DOI":"10.1145\/22145.22178"},{"key":"16_CR22","doi-asserted-by":"crossref","unstructured":"Groth, J.: On the size of pairing-based non-interactive arguments. In: EUROCRYPT (2). Lecture Notes in Computer Science, vol.\u00a09666, pp. 305\u2013326. Springer (2016)","DOI":"10.1007\/978-3-662-49896-5_11"},{"key":"16_CR23","doi-asserted-by":"crossref","unstructured":"Groth, J., Maller, M.: Snarky signatures: minimal signatures of knowledge from simulation-extractable snarks. In: CRYPTO (2). Lecture Notes in Computer Science, vol. 10402, pp. 581\u2013612. Springer (2017)","DOI":"10.1007\/978-3-319-63715-0_20"},{"key":"16_CR24","unstructured":"Jedusor, T.E.: Mimblewimble (2016). \nhttps:\/\/download.wpsoftware.net\/bitcoin\/wizardry\/mimblewimble.txt\n\n. Accessed 27 May 2019"},{"issue":"3","key":"16_CR25","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R., Pease, M.: The byzantine generals problem. ACM Trans. Program. Lang. Syst. 4(3), 382\u2013401 (1982)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"2\u20133","key":"16_CR26","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1007\/s10623-015-0103-5","volume":"77","author":"U Maurer","year":"2015","unstructured":"Maurer, U.: Zero-knowledge proofs of knowledge for group homomorphisms. Des. Codes Cryptogr. 77(2\u20133), 663\u2013676 (2015). \nhttps:\/\/doi.org\/10.1007\/s10623-015-0103-5","journal-title":"Des. Codes Cryptogr."},{"key":"16_CR27","unstructured":"Meckler, I., Shapiro, E.: Coda: decentralized cryptocurrency at scale (2018). \nhttps:\/\/cdn.codaprotocol.com\/v2\/static\/coda-whitepaper-05-10-2018-0.pdf\n\n. Accessed 30 May 2019"},{"key":"16_CR28","unstructured":"Nakamoto, S.: Bitcoin: a peer-to-peer electronic cash system (2008). \nhttps:\/\/bitcoin.org\/bitcoin.pdf\n\n. Accessed 27 May 2019"},{"key":"16_CR29","doi-asserted-by":"crossref","unstructured":"Parno, B., Howell, J., Gentry, C., et\u00a0al.: Pinocchio: nearly practical verifiable computation. In: IEEE Symposium on Security and Privacy, pp. 238\u2013252. IEEE Computer Society (2013)","DOI":"10.1109\/SP.2013.47"},{"key":"16_CR30","unstructured":"Poelstra, A.: Mimblewimble (2016). \nhttps:\/\/download.wpsoftware.net\/bitcoin\/wizardry\/mimblewimble.pdf\n\n. Accessed 27 May 2019"},{"key":"16_CR31","doi-asserted-by":"crossref","unstructured":"Sasson, E.B., Chiesa, A., Garman, C., et\u00a0al.: Zerocash: decentralized anonymous payments from bitcoin. In: 2014 IEEE Symposium on Security and Privacy, May 2014, pp. 459\u2013474","DOI":"10.1109\/SP.2014.36"}],"container-title":["Springer Proceedings in Business and Economics","Mathematical Research for Blockchain Economy"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-37110-4_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,14]],"date-time":"2020-02-14T00:31:21Z","timestamp":1581640281000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-37110-4_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030371098","9783030371104"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-37110-4_16","relation":{},"ISSN":["2198-7246","2198-7254"],"issn-type":[{"value":"2198-7246","type":"print"},{"value":"2198-7254","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"14 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}