Pages that link to "Item:Q2055641"
From MaRDI portal
The following pages link to Marlin: preprocessing zkSNARKs with universal and updatable SRS (Q2055641):
Displaying 50 items.
- Marlin (Q1353387) (← links)
- Transparent SNARKs from DARK compilers (Q2055634) (← links)
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography (Q2055643) (← links)
- Flexible and efficient verifiable computation on encrypted data (Q2061972) (← links)
- TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures (Q2117059) (← links)
- \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments (Q2120097) (← links)
- Proof-carrying data without succinct arguments (Q2120099) (← links)
- Sumcheck arguments and their applications (Q2120101) (← links)
- An algebraic framework for universal and updatable SNARKs (Q2120103) (← links)
- Tight state-restoration soundness in the algebraic group model (Q2128989) (← links)
- Time- and space-efficient arguments from groups of unknown order (Q2139631) (← links)
- Composition with knowledge assumptions (Q2139641) (← links)
- BooLigero: improved sublinear zero knowledge proofs for Boolean circuits (Q2145410) (← links)
- Mining for privacy: how to bootstrap a snarky blockchain (Q2145411) (← links)
- Preprocessing succinct non-interactive arguments for rank-1 constraint satisfiability from holographic proofs (Q2163394) (← links)
- Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols (Q2170001) (← links)
- A PCP theorem for interactive proofs and applications (Q2170038) (← links)
- Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier (Q2170049) (← links)
- On succinct non-interactive arguments in relativized worlds (Q2170051) (← links)
- Families of SNARK-friendly 2-chains of elliptic curves (Q2170053) (← links)
- Gemini: elastic SNARKs for diverse environments (Q2170056) (← links)
- Succinct functional commitment for a large class of arithmetic circuits (Q2691602) (← links)
- Updateable Inner Product Argument with Logarithmic Verifier and Applications (Q5041169) (← links)
- Polynomial IOPs for Linear Algebra Relations (Q5087271) (← links)
- ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines (Q5087274) (← links)
- A survey of elliptic curves for proof systems (Q6063127) (← links)
- Rinocchio: SNARKs for ring arithmetic (Q6070447) (← links)
- NIZK from SNARGs (Q6110372) (← links)
- Obtaining simulation extractable NIZKs in the updatable CRS model generically (Q6118305) (← links)
- Pairings in rank-1 constraint systems (Q6535081) (← links)
- Bounded verification for finite-field-blasting. In a compiler for zero knowledge proofs (Q6535685) (← links)
- Efficient transparent polynomial commitments for zk-SNARKs (Q6558604) (← links)
- On black-box knowledge-sound commit-and-prove SNARKs (Q6562559) (← 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)
- Proof of necessary work: succinct state verification with fairness guarantees (Q6573988) (← links)
- Distributed-prover interactive proofs (Q6581784) (← links)
- Holographic SNARGs for P and batch-NP from (polynomially hard) learning with errors (Q6582222) (← links)
- From polynomial IOP and commitments to non-malleable zkSNARKs (Q6582227) (← links)
- How to compile polynomial IOP into simulation-extractable SNARKs: a modular approach (Q6582228) (← links)
- Lattice-based polynomial commitments: towards asymptotic and concrete efficiency (Q6595849) (← links)
- Towards zero knowledge argument for double discrete logarithm with constant cost (Q6615217) (← links)
- Folding schemes with selective verification (Q6619934) (← 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)
- Succinct verification of compressed sigma protocols in the updatable SRS setting (Q6635775) (← 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)
