• Computer Science, Mathematics
  • Published in ArXiv 2019

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… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-10 OF 24 REFERENCES

The knowledge complexity of interactive proof-systems

Proofs of Ignorance and Applications to 2-Message Witness Hiding

VIEW 1 EXCERPT

Report 2018/280

  • Jens Groth, Markulf Kohlweiss, +3 authors Universal Common Reference Strings with Applications to zk-S Archive
  • https://eprint.iacr.org/2018/ 280.
  • 2018

The Design of the Ceremony. 2016

  • Zooko Wilcox
  • url: https://z.cash/blog/ the-design-of-the-ceremony/ (visited on 2018-05-01)
  • 2018

Wikipedia

  • Wikipedia contributors. Constraint satisfaction
  • The Free Encyclopedia.
  • 2018
VIEW 1 EXCERPT

transparent

  • Eli Ben-Sasson, Iddo Bentov, Yinon Horesh, Michael Riabzev. Scalable
  • and post-quantum secure computational integrity. Cryptology ePrint Archive, Report 2018/046. https://eprint.iacr.org/2018/046.
  • 2018

zkSNARKs in a Nutshell. 2016

  • Christian Reitwiessner
  • url: https://blog.ethereum. org/2016/12/05/zksnarks-in-a-nutshell/ (visited on 2018-05-01)
  • 2018

Bulletproofs: Short Proofs for Confidential Transactions and More

Explaining SNARKs

  • Ariel Gabizon
  • https://z.cash/blog/snark-explain/.
  • 2017