Prover-Efficient Commit-and-Prove Zero-Knowledge SNARKs

DOI10.1007/978-3-319-31517-1_10zbMath1404.94092OpenAlexW2471959228MaRDI QIDQ2814707

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 verificationCRScommit-and-proveNIZKnumerical NP-complete languagesrange proofzk-SNARKSubset-Sumsuccinct non-interactive zero-knowledge arguments of knowledge

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (7)

On black-box extension of a non-interactive zero-knowledge proof system for secret equality ⋮ Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs ⋮ ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines ⋮ A Shuffle Argument Secure in the Generic Model ⋮ Gentry-Wichs is tight: a falsifiable non-adaptively sound SNARG ⋮ On subversion-resistant SNARKs ⋮ Pinocchio-Based Adaptive zk-SNARKs and Secure/Correct Adaptive Function Evaluation

This page was built for publication: Prover-Efficient Commit-and-Prove Zero-Knowledge SNARKs