# Why and How zk-SNARK Works

@article{Petkus2019WhyAH, title={Why and How zk-SNARK Works}, author={Maksym Petkus}, journal={ArXiv}, year={2019}, volume={abs/1906.07221} }

Despite the existence of multiple great resources on zk-SNARK construction, from original papers to explainers, due to the sheer number of moving parts the subject remains a black box for many. While some pieces of the puzzle are given one can not see the full picture without the missing ones. Hence the focus of this work is to shed light onto the topic with a straightforward and clean approach based on examples and answering many whys along the way so that more individuals can appreciate the…

## 8 Citations

Demystifying the Role of zk-SNARKs in Zcash

- Computer Science, Mathematics2020 IEEE Conference on Application, Information and Network Security (AINS)
- 2020

This paper elaborate and construct a concrete zk-SNARK proof from scratch and explain its role in the Zcash algorithm.

Blockchain Based Zero-Knowledge Proof of Location in IoT

- Computer ScienceICC 2020 - 2020 IEEE International Conference on Communications (ICC)
- 2020

This paper proposes a zero-knowledge proof of location (zk-PoL) protocol, which has excellent security to resist main attacks, the computational efficiency is independent of input parameters and the zk- PoL is appropriate to delay-tolerant LBSs.

ElectAnon: A Blockchain-Based, Anonymous, Robust and Scalable Ranked-Choice Voting Protocol

- Computer Science, MathematicsArXiv
- 2022

ElectAnon, a blockchain-based, ranked-choice election protocol focusing on anonymity, robustness, and scalability, is proposed, which achieves anonymity by enabling voters to cast their votes via zero-knowledge proofs anonymously.

ZGridBC: Zero-Knowledge Proof based Scalable and Private Blockchain Platform for Smart Grid

- Computer Science2021 IEEE International Conference on Blockchain and Cryptocurrency (ICBC)
- 2021

This work proposes mutually cooperative two novel methods to si-multaneously solve scalability, data size, and privacy problems in blockchain-based trading platforms for renewable energy environmental value.

Towards a Blockchain Database for Massive IoT Workloads

- Computer Science2021 IEEE 37th International Conference on Data Engineering Workshops (ICDEW)
- 2021

Triabase is proposed, a novel permissioned blockchain database system that carries out machine learning on the edge, abstracts machine learning models into primitive data blocks that are subsequently stored and retrieved from the blockchain.

Privacy Protection Model for Blockchain Data Sharing Based on zk-SNARK

- Computer Science, MathematicsICPCSEE
- 2021

In the era of big data, data sharing and communication play a crucial role. The blockchain data sharing model based on ciphertext policy attributed-based encryption (CP-ABE) is an existing solution…

Smart Contracts como uma plataforma para computação segura

- Anais Estendidos do XX Simpósio Brasileiro de Segurança da Informação e de Sistemas Computacionais (SBSeg Estendido 2020)
- 2020

Os smart contracts representam novas possibilidades de aplicações, sendo o comércio eletrônico e organizações financeiras descentralizadas exemplos dessas aplicações, as quais são capazes de obter…

## References

SHOWING 1-10 OF 26 REFERENCES

Sonic: Zero-Knowledge SNARKs from Linear-Size Universal and Updatable Structured Reference Strings

- Computer Science, MathematicsIACR Cryptol. ePrint Arch.
- 2019

A zero-knowledge SNARK, Sonic, which supports a universal and continually updatable structured reference string that scales linearly in size, and a generally useful technique in which untrusted "helpers" can compute advice that allows batches of proofs to be verified more efficiently.

On the Size of Pairing-Based Non-interactive Arguments

- Computer Science, MathematicsEUROCRYPT
- 2016

It is shown that linear interactive proofs cannot have a linear decision procedure, and it follows that SNARGs where the prover and verifier use generic asymmetric bilinear group operations cannot consist of a single group element.

Proofs of Ignorance and Applications to 2-Message Witness Hiding

- Computer Science, MathematicsIACR Cryptol. ePrint Arch.
- 2018

The notion of Proofs of Ignorance is defined, constructed and used to construct a 2-message witness hiding protocol for all of NP, and a new non-black-box technique is developed.

Designated Verifier Proofs and Their Applications

- Computer ScienceEUROCRYPT
- 1996

This work examplify the verifier designation method for the confirmation protocol for undeniable signatures, and demonstrates how a trap-door commitment scheme can be used to construct designated verifier proofs, both interactive and non-interactive.

Zerocash: Decentralized Anonymous Payments from Bitcoin

- Computer Science2014 IEEE Symposium on Security and Privacy
- 2014

This paper formulate and construct decentralized anonymous payment schemes (DAP schemes) and builds Zero cash, a practical instantiation of the DAP scheme construction that is orders of magnitude more efficient than the less-anonymous Zero coin and competitive with plain Bit coin.

Bulletproofs: Short Proofs for Confidential Transactions and More

- Mathematics, Computer Science2018 IEEE Symposium on Security and Privacy (SP)
- 2018

We propose Bulletproofs, a new non-interactive zero-knowledge proof protocol with very short proofs and without a trusted setup; the proof size is only logarithmic in the witness size. Bulletproofs…

Pinocchio: Nearly Practical Verifiable Computation

- Computer Science2013 IEEE Symposium on Security and Privacy
- 2013

This work introduces Pinocchio, a built system for efficiently verifying general computations while relying only on cryptographic assumptions, and is the first general-purpose system to demonstrate verification cheaper than native execution (for some apps).

Short Pairing-Based Non-interactive Zero-Knowledge Arguments

- Mathematics, Computer ScienceASIACRYPT
- 2010

This work constructs non-interactive zero-knowledge arguments for circuit satisfiability with perfect completeness, perfect zero- knowledge and computational soundness and security is based on two new cryptographic assumptions.

The knowledge complexity of interactive proof-systems

- Mathematics, Computer ScienceSTOC '85
- 1985

A computational complexity theory of the “knowledge” contained in a proof is developed and examples of zero-knowledge proof systems are given for the languages of quadratic residuosity and 'quadratic nonresiduosity.

Non-interactive zero-knowledge and its applications

- Computer Science, MathematicsSTOC '88
- 1988

It is shown that interaction in any zero-knowledge proof can be replaced by sharing a common, short, random string, and this result is used to construct the first public-key cryptosystem secure against chosen ciphertext attack.