Square span programs with applications to succinct NIZK arguments
From MaRDI portal
Recommendations
- Quadratic span programs and succinct NIZKs without PCPs
- Succinct non-interactive zero knowledge arguments from span programs and linear error-correcting codes
- Short pairing-based non-interactive zero-knowledge arguments
- Scalable zero knowledge via cycles of elliptic curves
- Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
Cited in
(44)- Scalable zero knowledge via cycles of elliptic curves
- The hunting of the SNARK
- On subversion-resistant SNARKs
- Compact NIZKs from standard assumptions on bilinear maps
- On succinct arguments and witness encryption from groups
- 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
- Fully-succinct publicly verifiable delegation from constant-size assumptions
- Succinct non-interactive zero knowledge arguments from span programs and linear error-correcting codes
- A shuffle argument secure in the generic model
- An introduction to the use of zk-SNARKs in blockchains
- Multikey fully homomorphic encryption and applications
- Quadratic span programs and succinct NIZKs without PCPs
- Pinocchio-based adaptive zk-SNARKs and secure/correct adaptive function evaluation
- Updateable Inner Product Argument with Logarithmic Verifier and Applications
- On QA-NIZK in the BPK model
- A unified framework for non-universal SNARKs
- Optimally sound sigma protocols under DCRA
- No-signaling linear PCPs
- No-signaling linear PCPs
- Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge
- scientific article; zbMATH DE number 7746256 (Why is no real title available?)
- 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?
- 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
- Updatable Trapdoor SPHFs: Modular Construction of Updatable Zero-Knowledge Arguments and More
- Secure formation of public parameters and elimination of vulnerabilities of zero-knowledge succint non-interactive arguments of knowledge
- On black-box knowledge-sound commit-and-prove SNARKs
- A simple and efficient framework of proof systems for NP
- Compact NIZKs from standard assumptions on bilinear maps
- Algebraic group model with oblivious sampling
- zk-SNARKs from codes with rank metrics
- Succinct functional commitments for circuits from \(k\)-\textsf{Lin}
- How to share an NP statement or combiners for zero-knowledge proofs
- Designated-verifier SNARGs with one group element
- Pairing-based batch arguments for NP with a linear-size CRS
- The art of linearization: from a KZG's trick to a general commitment framework
This page was built for publication: Square span programs with applications to succinct NIZK arguments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2938864)
