An Introduction to the Use of zk-SNARKs in Blockchains

DOI10.1007/978-3-030-37110-4_16zbMath1457.94174OpenAlexW3005587866MaRDI QIDQ3294800

Alexandre Miranda Pinto

Publication date: 29 June 2020

Published in: Mathematical Research for Blockchain Economy (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-37110-4_16

zbMATH Keywords

zero-knowledge proofszk-SNARKsprivacy in blockchains

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Uses Software

• Pinocchio
• SNARKs for C
• ADSNARK

Cites Work

• Unnamed Item
• Non-interactive zero-knowledge proofs for composite statements
• Zero-knowledge proofs of knowledge for group homomorphisms
• Snarky signatures: minimal signatures of knowledge from simulation-extractable snarks
• Scalable zero knowledge via cycles of elliptic curves
• Improved OR-Composition of Sigma-Protocols
• From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
• SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
• Square Span Programs with Applications to Succinct NIZK Arguments
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• The Byzantine Generals Problem
• Noninteractive Zero-Knowledge
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• The knowledge complexity of interactive proof-systems
• Quadratic Span Programs and Succinct NIZKs without PCPs
• Advances in Cryptology – CRYPTO 2004
• On the Size of Pairing-Based Non-interactive Arguments

This page was built for publication: An Introduction to the Use of zk-SNARKs in Blockchains