Pages that link to "Item:Q5739207"

The following pages link to Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting (Q5739207):

Displaying 46 items.

• Lattice-based zero-knowledge arguments for additive and multiplicative relations (Q831178) (← links)
• Efficient lattice-based polynomial evaluation and batch ZK arguments (Q832321) (← links)
• Transparent SNARKs from DARK compilers (Q2055634) (← links)
• Marlin: preprocessing zkSNARKs with universal and updatable SRS (Q2055641) (← links)
• On succinct arguments and witness encryption from groups (Q2096510) (← links)
• A non-PCP approach to succinct quantum-safe zero-knowledge (Q2096535) (← links)
• Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics (Q2102078) (← links)
• Spartan: efficient and general-purpose zkSNARKs without trusted setup (Q2104239) (← links)
• TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures (Q2117059) (← links)
• Zero-knowledge proofs for committed symmetric Boolean functions (Q2118554) (← links)
• Tighter security for Schnorr identification and signatures: a high-moment forking lemma for \({\varSigma }\)-protocols (Q2120075) (← links)
• DualRing: generic construction of ring signatures with efficient instantiations (Q2120078) (← links)
• \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments (Q2120097) (← links)
• Proof-carrying data without succinct arguments (Q2120099) (← links)
• Subquadratic SNARGs in the random oracle model (Q2120100) (← links)
• Sumcheck arguments and their applications (Q2120101) (← links)
• An algebraic framework for universal and updatable SNARKs (Q2120103) (← links)
• Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices (Q2128574) (← links)
• A compressed \(\varSigma \)-protocol theory for lattices (Q2128575) (← links)
• Tight state-restoration soundness in the algebraic group model (Q2128989) (← links)
• Compressing proofs of \(k\)-out-of-\(n\) partial knowledge (Q2139628) (← links)
• Time- and space-efficient arguments from groups of unknown order (Q2139631) (← links)
• Generic plaintext equality and inequality proofs (Q2145406) (← links)
• BooLigero: improved sublinear zero knowledge proofs for Boolean circuits (Q2145410) (← links)
• High-threshold AVSS with optimal communication complexity (Q2147255) (← links)
• MPC-in-multi-heads: a multi-prover zero-knowledge proof system (or: how to jointly prove any NP statements in ZK) (Q2148762) (← links)
• More efficient amortization of exact zero-knowledge proofs for LWE (Q2148770) (← links)
• A simple post-quantum non-interactive zero-knowledge proof from garbled circuits (Q2151307) (← links)
• Improved zero-knowledge argument of encrypted extended permutation (Q2151308) (← links)
• Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier (Q2170049) (← links)
• Gemini: elastic SNARKs for diverse environments (Q2170056) (← links)
• Shorter lattice-based zero-knowledge proofs for the correctness of a shuffle (Q2670855) (← links)
• An optimized inner product argument with more application scenarios (Q2673065) (← links)
• Succinct Diophantine-satisfiability arguments (Q2691605) (← links)
• Public-key generation with verifiable randomness (Q2692338) (← links)
• Dory: efficient, transparent arguments for generalised inner products and polynomial commitments (Q2697847) (← links)
• Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography (Q5041168) (← links)
• Updateable Inner Product Argument with Logarithmic Verifier and Applications (Q5041169) (← links)
• Compact Privacy Protocols from Post-quantum and Timed Classical Assumptions (Q5041222) (← links)
• Making Private Function Evaluation Safer, Faster, and Simpler (Q5087263) (← links)
• Polynomial IOPs for Linear Algebra Relations (Q5087271) (← links)
• ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines (Q5087274) (← links)
• Computational Integrity with a Public Random String from Quasi-Linear PCPs (Q5270376) (← links)
• A survey of elliptic curves for proof systems (Q6063127) (← links)
• Trustworthy sealed-bid auction with low communication cost atop blockchain (Q6126676) (← links)
• Fiat-Shamir transformation of multi-round interactive proofs (Extended version) (Q6134420) (← links)