Pages that link to "Item:Q2104239"
From MaRDI portal
The following pages link to Spartan: efficient and general-purpose zkSNARKs without trusted setup (Q2104239):
Displaying 50 items.
- Marlin: preprocessing zkSNARKs with universal and updatable SRS (Q2055641) (← links)
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography (Q2055643) (← links)
- Spartan: efficient and general-purpose zkSNARKs without trusted setup (Q2104239) (← links)
- TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures (Q2117059) (← links)
- Threshold Schnorr with stateless deterministic signing from standard assumptions (Q2120070) (← links)
- \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments (Q2120097) (← links)
- Sumcheck arguments and their applications (Q2120101) (← links)
- An algebraic framework for universal and updatable SNARKs (Q2120103) (← links)
- Time- and space-efficient arguments from groups of unknown order (Q2139631) (← links)
- Non-interactive batch arguments for NP from standard assumptions (Q2139642) (← links)
- BooLigero: improved sublinear zero knowledge proofs for Boolean circuits (Q2145410) (← links)
- Preprocessing succinct non-interactive arguments for rank-1 constraint satisfiability from holographic proofs (Q2163394) (← links)
- Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier (Q2170049) (← links)
- Gemini: elastic SNARKs for diverse environments (Q2170056) (← links)
- Dory: efficient, transparent arguments for generalised inner products and polynomial commitments (Q2697847) (← links)
- ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines (Q5087274) (← links)
- SnarkPack: practical SNARK aggregation (Q6045200) (← links)
- On interactive oracle proofs for Boolean R1CS statements (Q6045202) (← links)
- Ligero: lightweight sublinear arguments without a trusted setup (Q6063128) (← links)
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions (Q6104342) (← links)
- Flashproofs: efficient zero-knowledge arguments of range and polynomial evaluation with transparent setup (Q6132411) (← links)
- Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier (Q6132419) (← links)
- Inner product functional commitments with constant-size public parameters and openings (Q6134851) (← links)
- Short-lived zero-knowledge proofs and signatures (Q6135445) (← links)
- Non-interactive zero-knowledge proofs to multiple verifiers (Q6135446) (← links)
- Hierarchical integrated signature and encryption. (or: key separation vs. key reuse: enjoy the best of both worlds) (Q6157529) (← links)
- \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions (Q6157543) (← links)
- Proofs for inner pairing products and applications (Q6157545) (← links)
- Succinct publicly-certifiable proofs. Or, can a blockchain verify a designated-verifier proof? (Q6157611) (← links)
- Lower bound on SNARGs in the random oracle model (Q6163944) (← links)
- Orion: zero knowledge proof with linear prover time (Q6166953) (← links)
- Nova: recursive zero-knowledge arguments from folding schemes (Q6166957) (← links)
- On black-box constructions of time and space efficient sublinear arguments from symmetric-key primitives (Q6169365) (← links)
- Fully succinct batch arguments for \textsf{NP} from indistinguishability obfuscation (Q6169370) (← links)
- Distilling Constraints in Zero-Knowledge Protocols (Q6487324) (← links)
- Efficient transparent polynomial commitments for zk-SNARKs (Q6558604) (← links)
- Fiat-Shamir security of FRI and related SNARKs (Q6562558) (← links)
- Polynomial IOPs for memory consistency checks in zero-knowledge virtual machines (Q6562561) (← links)
- A simple and efficient framework of proof systems for NP (Q6562565) (← links)
- Sigma protocols from verifiable secret sharing and their applications (Q6562568) (← links)
- Towards zero knowledge argument for double discrete logarithm with constant cost (Q6615217) (← links)
- \textsf{Testudo}: linear time prover SNARKs with constant size proofs and square root size universal setup (Q6619943) (← links)
- Simulation-extractable KZG polynomial commitments and applications to HyperPlonk (Q6635764) (← links)
- Lookup arguments: improvements, extensions and applications to zero-knowledge decision trees (Q6635776) (← links)
- Efficient KZG-based univariate sum-check and lookup argument (Q6635778) (← links)
- Concurrently secure blind Schnorr signatures (Q6636502) (← links)
- Public-coin, complexity-preserving, succinct arguments of knowledge for NP from collision-resistance (Q6637522) (← links)
- \textsf{Jolt}: SNARKs for virtual machines via lookups (Q6637560) (← links)
- Unlocking the lookup singularity with \textsf{Lasso} (Q6637567) (← links)
- \textsc{Zeromorph}: zero-knowledge multilinear-evaluation proofs from homomorphic univariate commitments (Q6639502) (← links)
