Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
From MaRDI portal
Recommendations
- Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier
- Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
- Efficient batch zero-knowledge arguments for low degree polynomials
- Linear-time zero-knowledge proofs for arithmetic circuit satisfiability
- Linear Algebra with Sub-linear Zero-Knowledge Arguments
Cited in
(only showing first 100 items - show all)- Linear-time zero-knowledge proofs for arithmetic circuit satisfiability
- Efficient batch zero-knowledge arguments for low degree polynomials
- Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
- Transparent SNARKs from DARK compilers
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- On succinct arguments and witness encryption from groups
- A non-PCP approach to succinct quantum-safe zero-knowledge
- Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures
- Zero-knowledge proofs for committed symmetric Boolean functions
- Public-coin zero-knowledge arguments with (almost) minimal time and space overheads
- Tighter security for Schnorr identification and signatures: a high-moment forking lemma for \({\varSigma }\)-protocols
- DualRing: generic construction of ring signatures with efficient instantiations
- \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments
- Proof-carrying data without succinct arguments
- 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
- Compressing proofs of \(k\)-out-of-\(n\) partial knowledge
- \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions
- Time- and space-efficient arguments from groups of unknown order
- Generic plaintext equality and inequality proofs
- BooLigero: improved sublinear zero knowledge proofs for Boolean circuits
- High-threshold AVSS with optimal communication complexity
- 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
- A simple post-quantum non-interactive zero-knowledge proof from garbled circuits
- Improved zero-knowledge argument of encrypted extended permutation
- Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier
- Gemini: elastic SNARKs for diverse environments
- Shorter pairing-based arguments under standard assumptions
- Shorter lattice-based zero-knowledge proofs for the correctness of a shuffle
- An optimized inner product argument with more application scenarios
- Succinct Diophantine-satisfiability arguments
- Public-key generation with verifiable randomness
- Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
- Round-efficient sub-linear zero-knowledge arguments for linear algebra
- Efficient zero-knowledge arguments from two-tiered homomorphic commitments
- Linear Algebra with Sub-linear Zero-Knowledge Arguments
- Polylogarithmic two-round argument systems
- scientific article; zbMATH DE number 1031001 (Why is no real title available?)
- Concretely-efficient zero-knowledge arguments for arithmetic circuits and their application to lattice-based cryptography
- Updateable Inner Product Argument with Logarithmic Verifier and Applications
- Compact privacy protocols from post-quantum and timed classical assumptions
- Making private function evaluation safer, faster, and simpler
- Polynomial IOPs for linear algebra relations
- \textsf{ECLIPSE}: enhanced compiling method for Pedersen-committed zkSNARK engines
- Computational integrity with a public random string from quasi-linear PCPs
- Information Security and Cryptology - ICISC 2005
- Compressed $$\varSigma $$-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures
- On interactive oracle proofs for Boolean R1CS statements
- Witness-succinct universally-composable SNARKs
- Speed-stacking: fast sublinear zero-knowledge proofs for disjunctions
- Supersingular curves you can trust
- Spartan and bulletproofs are simulation-extractable (for free!)
- A survey of elliptic curves for proof systems
- Resumable zero-knowledge for circuits from symmetric key primitives
- DualDory: logarithmic-verifier linkable ring signatures through preprocessing
- Efficient unique ring signatures from lattices
- On the impossibility of algebraic vector commitments in pairing-free groups
- Trustworthy sealed-bid auction with low communication cost atop blockchain
- Flashproofs: efficient zero-knowledge arguments of range and polynomial evaluation with transparent setup
- Counting vampires: from univariate sumcheck to updatable ZK-SNARK
- Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier
- Fiat-Shamir transformation of multi-round interactive proofs (Extended version)
- Inner product functional commitments with constant-size public parameters and openings
- MyOPE: malicious security for oblivious polynomial evaluation
- What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable?
- Non-interactive zero-knowledge proofs to multiple verifiers
- Lattice-based succinct arguments for NP with polylogarithmic-time verification
- Precise zero-knowledge arguments with poly-logarithmic efficiency
- Parallel repetition of \((k_1,\dots ,k_{\mu }) \)-special-sound multi-round interactive proofs
- \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions
- Proofs for inner pairing products and applications
- Lattice-based inner product argument
- Lower bound on SNARGs in the random oracle model
- Nova: recursive zero-knowledge arguments from folding schemes
- Threshold signatures with private accountability
- Quantum rewinding for many-round protocols
- Fiat-Shamir transformation of multi-round interactive proofs
- Vector commitments over rings and compressed -protocols
- \textsf{Bingo}: adaptivity and asynchrony in verifiable secret sharing and distributed key generation
- Lattice-based succinct arguments from vanishing polynomials (extended abstract)
- \textsf{Orbweaver}: succinct linear functional commitments from lattices
- Correlation intractability and SNARGs from sub-exponential DDH
- Algebraic reductions of knowledge
- On the impossibility of algebraic NIZK in pairing-free groups
- LaBRADOR: compact proofs for R1CS from Module-SIS
- Compact Multi-Party Confidential Transactions
- Efficient isogeny proofs using generic techniques
- Efficient transparent polynomial commitments for zk-SNARKs
- Fiat-Shamir security of FRI and related SNARKs
- Sigma protocols from verifiable secret sharing and their applications
- Predicate aggregate signatures and applications
- Tighter security for Schnorr identification and signatures: a high-moment forking lemma for -protocols
- Distributed-prover interactive proofs
This page was built for publication: Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5739207)
