# [[Zero-Knowledge]] [[Cryptography]] [[Reading List]] ## High Level Explainer: Zero Knowledge Blog https://www.zeroknowledgeblog.com/index.php/zk-snarks ### Blog links and Resources #### First [[Vitalik Buterin|Vitalik]] blog posts - 1/3 Quadratic Arithmetic Programs: from Zero to Hero: https://medium.com/@VitalikButerin/quadratic-arithmetic-programs-from-zero-to-hero-f6d558cea649 - 2/3 Exploring Elliptic Curve Pairings: https://medium.com/@VitalikButerin/exploring-elliptic-curve-pairings-c73c1864e627 - 3/3 zk-SNARKs: Under the Hood: https://medium.com/@VitalikButerin/zk-snarks-under-the-hood-b33151a013f6 #### Then: [[Ariel Gabizon]] posts (formerly [[Zcash]]) - Part 1: Homomorphic Hidings - https://electriccoin.co/blog/snark-explain/ - Part 2: Blind Evaluation of Polynomials - https://electriccoin.co/blog/snark-explain2/ - Part 3: The Knowledge of Coefficient Test and Assumption - https://electriccoin.co/blog/snark-explain3/ - Part 4: How to make Blind Evaluation of Polynomials Verifiable - https://electriccoin.co/blog/snark-explain4/ - Part 5: From Computations to Polynomials - https://electriccoin.co/blog/snark-explain5/ - Part 6: The Pinocchio Protocol - https://electriccoin.co/blog/snark-explain6/ - Part 7: Pairs of Elliptic Curves - https://electriccoin.co/blog/snark-explain7/ #### Then B appendix, page 25, of “Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture” ## Papers ### [BCTV13] Succinct Non-Interactive Zero Knowledge for a von Neumann architecture ### [BCRSVW19] Aurora: Transparent Succinct Arguments for R1CS ### [BCGMMW19] - [[ZEXE]]: Enabling Decentralized Private Computation ### Check out [[Simplicity]] as another ZEXE-like zk computation solution. Related to zk-rollups ### [PG13] Pinocchio: Nearly Practical Verifiable Computation ### [KZMQCPPsS15] C∅C∅: A Framework for Building Composable Zero-Knowledge Proofs ### [BCGTV13] SNARKs for C - Verifying Program Executions Succinctly and in Zero Knowledge