Corpus ID: 189998427

Why and How zk-SNARK Works

  title={Why and How zk-SNARK Works},
  author={Maksym Petkus},
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… Expand
Blockchain Based Zero-Knowledge Proof of Location in IoT
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. Expand
ZGridBC: Zero-Knowledge Proof based Scalable and Private Blockchain Platform for Smart Grid
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. Expand
Towards a Blockchain Database for Massive IoT Workloads
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. Expand
Demystifying the Role of zk-SNARKs in Zcash
This paper elaborate and construct a concrete zk-SNARK proof from scratch and explain its role in the Zcash algorithm. Expand


Sonic: Zero-Knowledge SNARKs from Linear-Size Universal and Updatable Structured Reference Strings
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. Expand
On the Size of Pairing-Based Non-interactive Arguments
  • Jens Groth
  • Computer Science, Mathematics
  • 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. Expand
Proofs of Ignorance and Applications to 2-Message Witness Hiding
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. Expand
Designated Verifier Proofs and Their Applications
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. Expand
Zerocash: Decentralized Anonymous Payments from Bitcoin
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. Expand
Bulletproofs: Short Proofs for Confidential Transactions and More
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. BulletproofsExpand
Pinocchio: Nearly Practical Verifiable Computation
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). Expand
Short Pairing-Based Non-interactive Zero-Knowledge Arguments
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. Expand
Non-interactive zero-knowledge and its applications
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. Expand
Towards Practical Public Key Systems Secure Against Chosen Ciphertext Attacks
Two efficient constructions aimed at making public key systems secure against chosen ciphertext attacks are presented and a connection between such public-key systems and efficient identification schemes is pointed out. Expand