Succinct Non-Interactive Zero Knowledge Arguments from Span Programs and Linear Error-Correcting Codes
From MaRDI portal
Publication:2867210
DOI10.1007/978-3-642-42033-7_3zbMath1300.94080OpenAlexW112550803MaRDI QIDQ2867210
Publication date: 10 December 2013
Published in: Advances in Cryptology - ASIACRYPT 2013 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-42033-7_3
polynomial algebraverifiable computationnon-interactive zero knowledgelinear error-correcting codesCircuit-SATlinear PCPquadratic span programspan program
Related Items
On QA-NIZK in the BPK Model ⋮ On the statistical leak of the GGH13 multilinear map and some variants ⋮ BooLigero: improved sublinear zero knowledge proofs for Boolean circuits ⋮ A Unified Framework for Non-universal SNARKs ⋮ ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines ⋮ Scalable zero knowledge via cycles of elliptic curves ⋮ Rinocchio: SNARKs for ring arithmetic ⋮ Batch arguments for \textsf{NP} and more from standard bilinear group assumptions ⋮ 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 ⋮ Zero-knowledge succinct non-interactive arguments of knowledge based on sets of polynomials ⋮ Fully succinct batch arguments for \textsf{NP} from indistinguishability obfuscation ⋮ The hunting of the SNARK ⋮ Non-interactive zero-knowledge from non-interactive batch arguments ⋮ Succinct functional commitment for a large class of arithmetic circuits ⋮ Unnamed Item ⋮ Election control through social influence with unknown preferences ⋮ No-signaling linear PCPs ⋮ How to build time-lock encryption ⋮ No-signaling linear PCPs ⋮ On subversion-resistant SNARKs ⋮ On the Existence of Extractable One-Way Functions
Uses Software
