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)
- Plumo: an ultralight blockchain client (Q6045243) (← links)
- A survey of elliptic curves for proof systems (Q6063127) (← links)
- Rinocchio: SNARKs for ring arithmetic (Q6070447) (← links)
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions (Q6104342) (← links)
- NIZK from SNARGs (Q6110372) (← links)
- Obtaining simulation extractable NIZKs in the updatable CRS model generically (Q6118305) (← links)
- Counting vampires: from univariate sumcheck to updatable ZK-SNARK (Q6132412) (← links)
- Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier (Q6132419) (← links)
- What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable? (Q6134856) (← links)
- Short-lived zero-knowledge proofs and signatures (Q6135445) (← 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)
- Snarky ceremonies (Q6157546) (← links)
- Algebraic adversaries in the universal composability framework (Q6157553) (← 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)
- Scalable and transparent proofs over all large fields, via elliptic curves. ECFFT. II (Q6169368) (← links)
- Fully succinct batch arguments for \textsf{NP} from indistinguishability obfuscation (Q6169370) (← links)
- CRS-updatable asymmetric quasi-adaptive NIZK arguments (Q6169455) (← links)
- Updatable Trapdoor SPHFs: Modular Construction of Updatable Zero-Knowledge Arguments and More (Q6488375) (← 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)
