Pages that link to "Item:Q2304944"

The following pages link to Libra: succinct zero-knowledge proofs with optimal prover computation (Q2304944):

Displaying 32 items.

• Libra (Q1353385) (← links)
• Transparent SNARKs from DARK compilers (Q2055634) (← links)
• Marlin: preprocessing zkSNARKs with universal and updatable SRS (Q2055641) (← links)
• \textsc{Fractal}: post-quantum and transparent recursive proofs from holography (Q2055643) (← links)
• Stacked garbling for disjunctive zero-knowledge proofs (Q2055668) (← links)
• Boosting verifiable computation on encrypted data (Q2055689) (← links)
• Flexible and efficient verifiable computation on encrypted data (Q2061972) (← 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)
• Sumcheck arguments and their applications (Q2120101) (← links)
• An algebraic framework for universal and updatable SNARKs (Q2120103) (← links)
• BooLigero: improved sublinear zero knowledge proofs for Boolean circuits (Q2145410) (← links)
• MPC-in-multi-heads: a multi-prover zero-knowledge proof system (or: how to jointly prove any NP statements in ZK) (Q2148762) (← links)
• A simple post-quantum non-interactive zero-knowledge proof from garbled circuits (Q2151307) (← links)
• Asymptotically quasi-optimal cryptography (Q2170004) (← links)
• Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier (Q2170049) (← links)
• Gemini: elastic SNARKs for diverse environments (Q2170056) (← 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)
• Ligero: lightweight sublinear arguments without a trusted setup (Q6063128) (← links)
• Polynomial IOPs for memory consistency checks in zero-knowledge virtual machines (Q6562561) (← links)
• Beyond MPC-in-the-head: black-box constructions of short zero-knowledge proofs (Q6581781) (← links)
• Towards zero knowledge argument for double discrete logarithm with constant cost (Q6615217) (← links)
• Simulation-extractable KZG polynomial commitments and applications to HyperPlonk (Q6635764) (← links)
• Efficient KZG-based univariate sum-check and lookup argument (Q6635778) (← links)
• \textsc{Zeromorph}: zero-knowledge multilinear-evaluation proofs from homomorphic univariate commitments (Q6639502) (← links)
• Zero-knowledge IOPs approaching witness length (Q6660294) (← links)
• Field-agnostic SNARKs from expand-accumulate codes (Q6660301) (← links)
• Mangrove: a scalable framework for folding-based SNARKs (Q6660304) (← links)
• How to prove statements obliviously? (Q6660309) (← links)