zk-SNARK
What is zk-SNARK?
zk-SNARKA Zero-Knowledge Succinct Non-Interactive Argument of Knowledge: a small, fast-to-verify proof that a computation was performed correctly, without revealing its inputs.
A zk-SNARK (Zero-Knowledge Succinct Non-Interactive Argument of Knowledge) is a non-interactive proof system that produces proofs only a few hundred bytes long and verifiable in milliseconds, regardless of the underlying computation size. Constructions such as Groth16, PLONK, and Halo2 rely on elliptic-curve pairings or polynomial commitments and usually require a trusted setup, typically generated through a multi-party ceremony to avoid a single point of trust. zk-SNARKs power privacy coins (Zcash), Ethereum zk-rollups (zkSync, Polygon zkEVM, Scroll), and confidential identity systems. Their main trade-offs are heavier prover cost and reliance on cryptographic assumptions that may be vulnerable to quantum attacks unless lattice-based variants are used.
● Examples
- 01
Zcash uses zk-SNARKs to hide transaction sender, receiver, and amount on a public blockchain.
- 02
zkSync Era and Polygon zkEVM compress thousands of Ethereum transactions into one on-chain SNARK proof.
● Frequently asked questions
What is zk-SNARK?
A Zero-Knowledge Succinct Non-Interactive Argument of Knowledge: a small, fast-to-verify proof that a computation was performed correctly, without revealing its inputs. It belongs to the Cryptography category of cybersecurity.
What does zk-SNARK mean?
A Zero-Knowledge Succinct Non-Interactive Argument of Knowledge: a small, fast-to-verify proof that a computation was performed correctly, without revealing its inputs.
How does zk-SNARK work?
A zk-SNARK (Zero-Knowledge Succinct Non-Interactive Argument of Knowledge) is a non-interactive proof system that produces proofs only a few hundred bytes long and verifiable in milliseconds, regardless of the underlying computation size. Constructions such as Groth16, PLONK, and Halo2 rely on elliptic-curve pairings or polynomial commitments and usually require a trusted setup, typically generated through a multi-party ceremony to avoid a single point of trust. zk-SNARKs power privacy coins (Zcash), Ethereum zk-rollups (zkSync, Polygon zkEVM, Scroll), and confidential identity systems. Their main trade-offs are heavier prover cost and reliance on cryptographic assumptions that may be vulnerable to quantum attacks unless lattice-based variants are used.
How do you defend against zk-SNARK?
Defences for zk-SNARK typically combine technical controls and operational practices, as detailed in the full definition above.
What are other names for zk-SNARK?
Common alternative names include: SNARK, Succinct Non-Interactive Argument of Knowledge.
● Related terms
- cryptography№ 1265
Zero-Knowledge Proof (ZKP)
A cryptographic protocol in which a prover convinces a verifier that a statement is true without revealing anything beyond the validity of the statement itself.
- cryptography№ 1270
zk-STARK
A Zero-Knowledge Scalable Transparent Argument of Knowledge: a post-quantum-friendly zero-knowledge proof system that needs no trusted setup and relies only on collision-resistant hash functions.
- cryptography№ 987
Secure Multi-Party Computation (MPC)
A family of cryptographic protocols that lets several parties jointly compute a function over their private inputs while revealing nothing beyond the output.
- cryptography№ 481
Homomorphic Encryption
An encryption scheme that allows computations to be performed directly on ciphertexts, producing encrypted results that match the operations on the underlying plaintexts.
- cryptography№ 321
Digital Signature
A public-key cryptographic mechanism that proves the authenticity, integrity and non-repudiation of a message or document.
- cryptography№ 879
Public-Key Cryptography
A branch of cryptography that uses paired public and private keys to enable encryption, key exchange, digital signatures, and authentication without a pre-shared secret.