Succinct non-interactive zero knowledge arguments from span programs and linear error-correcting codes

DOI10.1007/978-3-642-42033-7_3zbMATH Open1300.94080OpenAlexW112550803MaRDI QIDQ2867210FDOQ2867210

Authors: Helger Lipmaa 

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

Recommendations

• Quadratic span programs and succinct NIZKs without PCPs
• Square span programs with applications to succinct NIZK arguments
• Short pairing-based non-interactive zero-knowledge arguments
• Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments
• Short non-interactive zero-knowledge proofs

zbMATH Keywords

polynomial algebraverifiable computationnon-interactive zero knowledgelinear error-correcting codesCircuit-SATlinear PCPquadratic span programspan program

Mathematics Subject Classification ID

Cryptography (94A60) Linear codes (general theory) (94B05)

Cited In (34)

• Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments
• Quadratic span programs and succinct NIZKs without PCPs
• Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
• A unified framework for non-universal SNARKs
• A simple and efficient framework of proof systems for NP
• On black-box knowledge-sound commit-and-prove SNARKs
• No-signaling linear PCPs
• How to build time-lock encryption
• zk-SNARKs from codes with rank metrics
• On the statistical leak of the GGH13 multilinear map and some variants
• Election control through social influence with unknown preferences
• Title not available (Why is that?)
• Rinocchio: SNARKs for ring arithmetic
• \textsf{ECLIPSE}: enhanced compiling method for Pedersen-committed zkSNARK engines
• Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
• What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable?
• Gentry-Wichs is tight: a falsifiable non-adaptively sound SNARG
• On QA-NIZK in the BPK model
• BooLigero: improved sublinear zero knowledge proofs for Boolean circuits
• Non-interactive zero-knowledge from non-interactive batch arguments
• On subversion-resistant SNARKs
• Succinct verification of compressed sigma protocols in the updatable SRS setting
• Zero-knowledge succinct non-interactive arguments of knowledge based on sets of polynomials
• No-signaling linear PCPs
• Updatable Trapdoor SPHFs: Modular Construction of Updatable Zero-Knowledge Arguments and More
• Multikey fully homomorphic encryption and applications
• Scalable zero knowledge via cycles of elliptic curves
• Efficient NIZK arguments via parallel verification of Beneš networks
• Square span programs with applications to succinct NIZK arguments
• Adaptive security in SNARGs via iO and lossy functions
• Fully succinct batch arguments for \textsf{NP} from indistinguishability obfuscation
• The hunting of the SNARK
• Succinct functional commitment for a large class of arithmetic circuits
• On the existence of extractable one-way functions

Uses Software

• Pinocchio

This page was built for publication: Succinct non-interactive zero knowledge arguments from span programs and linear error-correcting codes

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