Quadratic span programs and succinct NIZKs without PCPs
From MaRDI portal
Publication:4924436
Recommendations
- Square span programs with applications to succinct NIZK arguments
- Succinct non-interactive zero knowledge arguments from span programs and linear error-correcting codes
- Scalable zero knowledge via cycles of elliptic curves
- Aurora: transparent succinct arguments for R1CS
- Fully-succinct publicly verifiable delegation from constant-size assumptions
Cited in
(only showing first 100 items - show all)- Fine-grained secure computation
- Scalable zero knowledge via cycles of elliptic curves
- The hunting of the SNARK
- How to build time-lock encryption
- On subversion-resistant SNARKs
- Compact designated verifier NIZKs from the CDH assumption without pairings
- Multi-server verifiable delegation of computations: unconditional security and practical efficiency
- Transparent SNARKs from DARK compilers
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
- Compact NIZKs from standard assumptions on bilinear maps
- Stacked garbling for disjunctive zero-knowledge proofs
- Boosting verifiable computation on encrypted data
- Compactness of hashing modes and efficiency beyond Merkle tree
- Public verifiable private decision tree prediction
- Publicly verifiable zero knowledge from (collapsing) blockchains
- Flexible and efficient verifiable computation on encrypted data
- On succinct arguments and witness encryption from groups
- Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
- Non-interactive zero-knowledge arguments for QMA, with preprocessing
- TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures
- Succinct non-interactive secure computation
- \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments
- Subquadratic SNARGs in the random oracle model
- An algebraic framework for universal and updatable SNARKs
- Pushing the limits of Valiant's universal circuits: simpler, tighter and more compact
- Succinct non-interactive arguments via linear interactive proofs
- Signatures of knowledge for Boolean circuits under standard assumptions
- Somewhere statistically binding commitment schemes with applications
- Another look at extraction and randomization of Groth's zk-SNARK
- BooLigero: improved sublinear zero knowledge proofs for Boolean circuits
- Practical witness-key-agreement for blockchain-based dark pools financial trading
- MPC-in-multi-heads: a multi-prover zero-knowledge proof system (or: how to jointly prove any NP statements in ZK)
- More efficient amortization of exact zero-knowledge proofs for LWE
- Subversion-resistant quasi-adaptive NIZK and applications to modular zk-SNARKs
- A simple post-quantum non-interactive zero-knowledge proof from garbled circuits
- Pribank: confidential blockchain scaling using short commit-and-proof NIZK argument
- Efficient proof composition for verifiable computation
- Asymptotically quasi-optimal cryptography
- Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier
- On succinct non-interactive arguments in relativized worlds
- Gemini: elastic SNARKs for diverse environments
- Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions
- SNARGs for P from sub-exponential DDH and QR
- Efficient and scalable universal circuits
- Efficient chameleon hash functions in the enhanced collision resistant model
- Succinct functional commitment for a large class of arithmetic circuits
- Fully-succinct publicly verifiable delegation from constant-size assumptions
- Trinocchio: privacy-preserving outsourcing by distributed verifiable computation
- On the existence of extractable one-way functions
- Efficient zero-knowledge proof of algebraic and non-algebraic statements with applications to privacy preserving credentials
- Snarks for C: verifying program executions succinctly and in zero knowledge
- Succinct non-interactive zero knowledge arguments from span programs and linear error-correcting codes
- Square span programs with applications to succinct NIZK arguments
- A shuffle argument secure in the generic model
- On the (in)security of SNARKs in the presence of oracles
- Interactive oracle proofs
- Delegating RAM Computations
- An introduction to the use of zk-SNARKs in blockchains
- Multikey fully homomorphic encryption and applications
- Shorter arithmetization of nondeterministic computations
- Pinocchio-based adaptive zk-SNARKs and secure/correct adaptive function evaluation
- Constant-round interactive proofs for delegating computation
- Fast Reed-Solomon interactive oracle proofs of proximity
- Updateable Inner Product Argument with Logarithmic Verifier and Applications
- On QA-NIZK in the BPK model
- Signatures of Knowledge for Boolean Circuits Under Standard Assumptions
- UC Updatable Databases and Applications
- A unified framework for non-universal SNARKs
- \textsf{ECLIPSE}: enhanced compiling method for Pedersen-committed zkSNARK engines
- On the classification of knowledge-of-exponent assumptions in cyclic groups
- Lattice-based SNARGs and their application to more efficient obfuscation
- Computational integrity with a public random string from quasi-linear PCPs
- Sublinear zero-knowledge arguments for RAM programs
- Optimally sound sigma protocols under DCRA
- SPARKs: Succinct Parallelizable Arguments of Knowledge
- No-signaling linear PCPs
- No-signaling linear PCPs
- Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge
- SnarkPack: practical SNARK aggregation
- Zero knowledge proofs towards verifiable decentralized AI pipelines
- Witness-succinct universally-composable SNARKs
- Speed-stacking: fast sublinear zero-knowledge proofs for disjunctions
- HyperPlonk: Plonk with linear-time prover and high-degree custom gates
- Spartan and bulletproofs are simulation-extractable (for free!)
- A survey of elliptic curves for proof systems
- Ligero: lightweight sublinear arguments without a trusted setup
- Sok: vector OLE-based zero-knowledge protocols
- Non-interactive publicly-verifiable delegation of committed programs
- Rinocchio: SNARKs for ring arithmetic
- scientific article; zbMATH DE number 7746256 (Why is no real title available?)
- Practical sublinear proofs for R1CS from lattices
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
- Resumable zero-knowledge for circuits from symmetric key primitives
- NIZK from SNARGs
- Verifiable Computation and Succinct Arguments for NP
- On the impossibility of algebraic vector commitments in pairing-free groups
- Obtaining simulation extractable NIZKs in the updatable CRS model generically
This page was built for publication: Quadratic span programs and succinct NIZKs without PCPs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4924436)
