zk-SNARKs

E773515

zk-SNARKs are a form of zero-knowledge cryptographic proof that allows one party to prove the validity of a statement to another without revealing any underlying information and with very short, quickly verifiable proofs.

Try in SPARQL Jump to: Surface forms Statements Referenced by

All labels observed (1)

Label Occurrences
zk-SNARKs canonical 1

Statements (49)

Predicate Object
instanceOf cryptographic primitive
zero-knowledge proof system
aimsTo hide witness information
prove statement correctness
basedOn bilinear pairings
elliptic curve cryptography
quadratic arithmetic programs
rank-1 constraint systems
comparedTo interactive zero-knowledge proofs
differsFrom bulletproofs
zk-STARKs NERFINISHED
ensures completeness
soundness
zero-knowledge property
formalizedAs non-interactive argument system in the common reference string model
fullForm zero-knowledge Succinct Non-interactive Argument of Knowledge
hasAdvantage very fast verification time
very small proof size
hasComponent prover algorithm
setup algorithm
verifier algorithm
hasDisadvantage reliance on pairing-friendly curves
trusted setup requirement in many schemes
hasOutput succinct proof
hasProperty argument of knowledge
fast verification
non-interactive
probabilistic soundness
publicly verifiable
short proofs
succinct
zero-knowledge
requires trusted setup in many constructions
researchArea blockchain privacy
modern cryptography
verifiable computation
securityAssumption cryptographic pairing hardness assumptions
discrete logarithm hardness
knowledge of exponent assumption
usedFor anonymous transactions
blockchain scalability
confidential smart contracts
privacy-preserving proofs
proofs of correct computation
verifiable computation
usedIn Zcash NERFINISHED
layer-2 blockchain protocols
privacy-focused cryptocurrencies
usedToProve knowledge of a witness for an NP statement

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.

Zcash usesTechnology zk-SNARKs