Pages that link to "Item:Q776013"

The following pages link to Updatable and universal common reference strings with applications to zk-SNARKs (Q776013):

Displaying 50 items.

• Multi-party revocation in sovrin: performance through distributed trust (Q826287) (← links)
• Election control through social influence with unknown preferences (Q2019485) (← links)
• On subversion-resistant SNARKs (Q2039405) (← links)
• Marlin: preprocessing zkSNARKs with universal and updatable SRS (Q2055641) (← links)
• \textsc{Fractal}: post-quantum and transparent recursive proofs from holography (Q2055643) (← links)
• Aggregatable distributed key generation (Q2056680) (← links)
• Towards accountability in CRS generation (Q2056795) (← links)
• Updatable signatures and message authentication codes (Q2061942) (← links)
• Publicly verifiable zero knowledge from (collapsing) blockchains (Q2061968) (← links)
• A non-PCP approach to succinct quantum-safe zero-knowledge (Q2096535) (← links)
• Spartan: efficient and general-purpose zkSNARKs without trusted setup (Q2104239) (← links)
• Key-and-argument-updatable QA-NIZKs (Q2106673) (← 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)
• An algebraic framework for universal and updatable SNARKs (Q2120103) (← 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)
• Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols (Q2170001) (← links)
• On succinct non-interactive arguments in relativized worlds (Q2170051) (← links)
• Incrementally aggregatable vector commitments and applications to verifiable decentralized storage (Q2692375) (← links)
• Acyclicity programming for sigma-protocols (Q2695643) (← links)
• Updateable Inner Product Argument with Logarithmic Verifier and Applications (Q5041169) (← links)
• A Unified Framework for Non-universal SNARKs (Q5087272) (← links)
• ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines (Q5087274) (← links)
• Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge (Q6045075) (← links)
• A survey of elliptic curves for proof systems (Q6063127) (← links)
• Ofelimos: combinatorial optimization via proof-of-useful-work. A provably secure blockchain protocol (Q6104339) (← links)
• Obtaining simulation extractable NIZKs in the updatable CRS model generically (Q6118305) (← links)
• Counting vampires: from univariate sumcheck to updatable ZK-SNARK (Q6132412) (← links)
• Inner product functional commitments with constant-size public parameters and openings (Q6134851) (← links)
• What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable? (Q6134856) (← 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)
• Orion: zero knowledge proof with linear prover time (Q6166953) (← links)
• CRS-updatable asymmetric quasi-adaptive NIZK arguments (Q6169455) (← links)
• Linear-map vector commitments and their practical applications (Q6175974) (← links)
• Updatable Trapdoor SPHFs: Modular Construction of Updatable Zero-Knowledge Arguments and More (Q6488375) (← links)
• Pairings in rank-1 constraint systems (Q6535081) (← links)
• On black-box knowledge-sound commit-and-prove SNARKs (Q6562559) (← links)
• Witness-authenticated key exchange, revisited: extensions to groups, improved models, simpler constructions (Q6573953) (← links)
• From polynomial IOP and commitments to non-malleable zkSNARKs (Q6582227) (← links)
• Distributed broadcast encryption from bilinear groups (Q6604936) (← links)
• \textsf{Testudo}: linear time prover SNARKs with constant size proofs and square root size universal setup (Q6619943) (← links)
• Benchmarking the setup of updatable zk-SNARKs (Q6619946) (← 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)
• Concurrently secure blind Schnorr signatures (Q6636502) (← links)
• Time-lock puzzles with efficient batch solving (Q6636509) (← links)