Aurora: transparent succinct arguments for R1CS
From MaRDI portal
Publication:2292641
Recommendations
Cited in
(only showing first 100 items - show all)- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
- Sigma protocols for MQ, PKP and SIS, and fishy signature schemes
- Stacked garbling for disjunctive zero-knowledge proofs
- Boosting verifiable computation on encrypted data
- Banquet: short and fast signatures from AES
- Flexible and efficient verifiable computation on encrypted data
- A non-PCP approach to succinct quantum-safe zero-knowledge
- Practical product proofs for lattice commitments
- Post-quantum ID-based ring signatures from symmetric-key primitives
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures
- Threshold Schnorr with stateless deterministic signing from standard assumptions
- \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments
- Subquadratic SNARGs in the random oracle model
- Sumcheck arguments and their applications
- An algebraic framework for universal and updatable SNARKs
- Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices
- A compressed \(\varSigma \)-protocol theory for lattices
- Tight state-restoration soundness in the algebraic group model
- Does Fiat-Shamir require a cryptographic hash function?
- BooLigero: improved sublinear zero knowledge proofs for Boolean circuits
- More efficient amortization of exact zero-knowledge proofs for LWE
- Preprocessing succinct non-interactive arguments for rank-1 constraint satisfiability from holographic proofs
- Asymptotically quasi-optimal cryptography
- A PCP theorem for interactive proofs and applications
- Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier
- Gemini: elastic SNARKs for diverse environments
- Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions
- Succinct arguments in the quantum random oracle model
- Linear-size constant-query IOPs for delegating computation
- On the (In)security of Kilian-based SNARGs
- Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
- Efficient multivariate low-degree tests via interactive oracle proofs of proximity for polynomial codes
- Tight security bounds for Micali's SNARGs
- Acyclicity programming for sigma-protocols
- Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
- Quadratic span programs and succinct NIZKs without PCPs
- Concretely-efficient zero-knowledge arguments for arithmetic circuits and their application to lattice-based cryptography
- Updateable Inner Product Argument with Logarithmic Verifier and Applications
- Efficient post-quantum SNARKs for RSIS and RLWE and their applications to privacy
- Polynomial IOPs for linear algebra relations
- QMA-hardness of consistency of local density matrices with applications to quantum zero-knowledge
- On interactive oracle proofs for Boolean R1CS statements
- Zero knowledge proofs towards verifiable decentralized AI pipelines
- Witness-succinct universally-composable SNARKs
- Speed-stacking: fast sublinear zero-knowledge proofs for disjunctions
- Supersingular curves you can trust
- HyperPlonk: Plonk with linear-time prover and high-degree custom gates
- Spartan and bulletproofs are simulation-extractable (for free!)
- Ligero: lightweight sublinear arguments without a trusted setup
- Proving knowledge of isogenies: a survey
- Practical sublinear proofs for R1CS from lattices
- Verifiable decryption in the head
- Resumable zero-knowledge for circuits from symmetric key primitives
- Flashproofs: efficient zero-knowledge arguments of range and polynomial evaluation with transparent setup
- Counting vampires: from univariate sumcheck to updatable ZK-SNARK
- Improved straight-line extraction in the random oracle model with applications to signature aggregation
- Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection
- Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier
- Fiat-Shamir transformation of multi-round interactive proofs (Extended version)
- Efficient proof of RAM programs from any public-coin zero-knowledge system
- Inner product functional commitments with constant-size public parameters and openings
- Non-interactive zero-knowledge proofs to multiple verifiers
- Brakedown: linear-time and field-agnostic SNARKs for R1CS
- Lattice-based succinct arguments for NP with polylogarithmic-time verification
- Faster sounder succinct arguments and \textsf{IOP}s
- \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions
- Lower bound on SNARGs in the random oracle model
- Orion: zero knowledge proof with linear prover time
- Fiat-Shamir transformation of multi-round interactive proofs
- Vector commitments over rings and compressed -protocols
- On black-box constructions of time and space efficient sublinear arguments from symmetric-key primitives
- Linear-map vector commitments and their practical applications
- \textsf{Orbweaver}: succinct linear functional commitments from lattices
- \texttt{Horst} meets \textit{Fluid}-SPN: Griffin for zero-knowledge applications
- LaBRADOR: compact proofs for R1CS from Module-SIS
- Distilling Constraints in Zero-Knowledge Protocols
- Efficient isogeny proofs using generic techniques
- The Welch-Gong stream cipher -- evolutionary path
- Efficient transparent polynomial commitments for zk-SNARKs
- Fiat-Shamir security of FRI and related SNARKs
- Polynomial IOPs for memory consistency checks in zero-knowledge virtual machines
- Sigma protocols from verifiable secret sharing and their applications
- A generic construction of an anonymous reputation system and instantiations from lattices
- Beyond MPC-in-the-head: black-box constructions of short zero-knowledge proofs
- Distributed-prover interactive proofs
- From polynomial IOP and commitments to non-malleable zkSNARKs
- Threshold linear secret sharing to the rescue of MPC-in-the-head
- Towards zero knowledge argument for double discrete logarithm with constant cost
- Malleable commitments from group actions and zero-knowledge proofs for circuits based on isogenies
- eSTARK: extending STARKs with arguments
- Lookup arguments: improvements, extensions and applications to zero-knowledge decision trees
- Efficient KZG-based univariate sum-check and lookup argument
- Concurrently secure blind Schnorr signatures
- SLAP: succinct lattice-based polynomial commitments from standard assumptions
- \textsc{Zeromorph}: zero-knowledge multilinear-evaluation proofs from homomorphic univariate commitments
- Loquat: a SNARK-friendly post-quantum signature based on the Legendre PRF with applications in ring and aggregate signatures
- Sometimes you can't distribute random-oracle-based proofs
- FRIDA: data availability sampling from FRI
Describes a project that uses
Uses Software
This page was built for publication: Aurora: transparent succinct arguments for R1CS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2292641)
