Square Span Programs with Applications to Succinct NIZK Arguments
From MaRDI portal
Publication:2938864
DOI10.1007/978-3-662-45611-8_28zbMath1306.94042OpenAlexW945570858MaRDI QIDQ2938864
Jens Groth, George Danezis, Markulf Kohlweiss, Cédric Fournet
Publication date: 16 January 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-45611-8_28
SNARKsquadratic span programnon-interactive zero-knowledge arguments of knowledgesquare span program
Related Items (30)
Updateable Inner Product Argument with Logarithmic Verifier and Applications ⋮ On QA-NIZK in the BPK Model ⋮ Succinct non-interactive arguments via linear interactive proofs ⋮ Signatures of knowledge for Boolean circuits under standard assumptions ⋮ Somewhere statistically binding commitment schemes with applications ⋮ Subversion-resistant quasi-adaptive NIZK and applications to modular zk-SNARKs ⋮ A Unified Framework for Non-universal SNARKs ⋮ Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge ⋮ Scalable zero knowledge via cycles of elliptic curves ⋮ A Shuffle Argument Secure in the Generic Model ⋮ Obtaining simulation extractable NIZKs in the updatable CRS model generically ⋮ Unconditionally secure NIZK in the fine-grained setting ⋮ What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable? ⋮ Multikey Fully Homomorphic Encryption and Applications ⋮ Gentry-Wichs is tight: a falsifiable non-adaptively sound SNARG ⋮ Snarky ceremonies ⋮ Succinct publicly-certifiable proofs. Or, can a blockchain verify a designated-verifier proof? ⋮ Zero-knowledge succinct non-interactive arguments of knowledge based on sets of polynomials ⋮ CRS-updatable asymmetric quasi-adaptive NIZK arguments ⋮ The hunting of the SNARK ⋮ Fully-succinct publicly verifiable delegation from constant-size assumptions ⋮ Unnamed Item ⋮ An Introduction to the Use of zk-SNARKs in Blockchains ⋮ No-signaling linear PCPs ⋮ No-signaling linear PCPs ⋮ On subversion-resistant SNARKs ⋮ Compact NIZKs from standard assumptions on bilinear maps ⋮ Pinocchio-Based Adaptive zk-SNARKs and Secure/Correct Adaptive Function Evaluation ⋮ Optimally Sound Sigma Protocols Under DCRA ⋮ On succinct arguments and witness encryption from groups
Uses Software
This page was built for publication: Square Span Programs with Applications to Succinct NIZK Arguments
