Prover-efficient commit-and-prove zero-knowledge SNARKs

DOI10.1007/978-3-319-31517-1_10MaRDI QIDQ2814707zbMATH OpenOpenAlexFDO

Authors Helger Lipmaa

Publication date 22 June 2016

Published in Progress in Cryptology – AFRICACRYPT 2016 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-31517-1_10

zbMATH Keywords

batch verificationcommit-and-proveCRSNIZKnumerical NP-complete languagesrange proofSubset-Sumsuccinct non-interactive zero-knowledge arguments of knowledgezk-SNARK

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Prover-efficient commit-and-prove zero-knowledge snarks
• \textsf{ECLIPSE}: enhanced compiling method for Pedersen-committed zkSNARK engines
• Scalable zero knowledge via cycles of elliptic curves
• Scalable zero knowledge via cycles of elliptic curves
• \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions

Cited in

(24)

• Prover-efficient commit-and-prove zero-knowledge snarks
• Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
• Scalable zero knowledge via cycles of elliptic curves
• On subversion-resistant SNARKs
• Spartan: efficient and general-purpose zkSNARKs without trusted setup
• On black-box extension of a non-interactive zero-knowledge proof system for secret equality
• Scalable zero knowledge via cycles of elliptic curves
• A shuffle argument secure in the generic model
• Pinocchio-based adaptive zk-SNARKs and secure/correct adaptive function evaluation
• \textsf{ECLIPSE}: enhanced compiling method for Pedersen-committed zkSNARK engines
• SnarkPack: practical SNARK aggregation
• \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions
• Gentry-Wichs is tight: a falsifiable non-adaptively sound SNARG
• Proofs for inner pairing products and applications
• Succinct publicly-certifiable proofs. Or, can a blockchain verify a designated-verifier proof?
• Optimized and Secure Pairing-Friendly Elliptic Curves Suitable for One Layer Proof Composition
• Efficient transparent polynomial commitments for zk-SNARKs
• On black-box knowledge-sound commit-and-prove SNARKs
• From polynomial IOP and commitments to non-malleable zkSNARKs
• \textsf{Testudo}: linear time prover SNARKs with constant size proofs and square root size universal setup
• Witness encryption for succinct functional commitments and applications
• Unlocking the lookup singularity with \textsf{Lasso}
• An efficient ZK compiler from SIMD circuits to general circuits
• Mangrove: a scalable framework for folding-based SNARKs

This page was built for publication: Prover-efficient commit-and-prove zero-knowledge SNARKs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2814707)