Pages that link to "Item:Q2055634"
From MaRDI portal
The following pages link to Transparent SNARKs from DARK compilers (Q2055634):
Displaying 50 items.
- Transparent SNARKs from DARK compilers (Q2055634) (← 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)
- Threshold Schnorr with stateless deterministic signing from standard assumptions (Q2120070) (← links)
- \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments (Q2120097) (← links)
- Subquadratic SNARGs in the random oracle model (Q2120100) (← links)
- Sumcheck arguments and their applications (Q2120101) (← links)
- An algebraic framework for universal and updatable SNARKs (Q2120103) (← links)
- Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices (Q2128574) (← links)
- Tight state-restoration soundness in the algebraic group model (Q2128989) (← links)
- Succinct non-interactive arguments via linear interactive proofs (Q2136170) (← links)
- Time- and space-efficient arguments from groups of unknown order (Q2139631) (← links)
- Mining for privacy: how to bootstrap a snarky blockchain (Q2145411) (← links)
- High-threshold AVSS with optimal communication complexity (Q2147255) (← links)
- Gemini: elastic SNARKs for diverse environments (Q2170056) (← links)
- Succinct Diophantine-satisfiability arguments (Q2691605) (← links)
- Vector and functional commitments from lattices (Q2697903) (← 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)
- On interactive oracle proofs for Boolean R1CS statements (Q6045202) (← links)
- HyperPlonk: Plonk with linear-time prover and high-degree custom gates (Q6061371) (← links)
- Spartan and bulletproofs are simulation-extractable (for free!) (Q6061373) (← links)
- A survey of elliptic curves for proof systems (Q6063127) (← links)
- Functional commitments for all functions, with transparent setup and from SIS (Q6063522) (← links)
- Succinct vector, polynomial, and functional commitments from lattices (Q6063525) (← links)
- Private polynomial commitments and applications to MPC (Q6067356) (← links)
- Certifying giant nonprimes (Q6070774) (← links)
- (Q6081719) (← links)
- \textsf{Dew}: a transparent constant-sized polynomial commitment scheme (Q6088998) (← links)
- Practical statistically-sound proofs of exponentiation in any group (Q6104340) (← links)
- NIZK from SNARGs (Q6110372) (← links)
- I want to ride my \texttt{BICYCL} : \texttt{BICYCL} implements cryptography in class groups (Q6110377) (← links)
- Threshold linearly homomorphic encryption on \(\mathrm{Z}/2^k\mathrm{Z}\) (Q6132407) (← 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)
- Fiat-Shamir transformation of multi-round interactive proofs (Extended version) (Q6134420) (← 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)
- Brakedown: linear-time and field-agnostic SNARKs for R1CS (Q6145784) (← links)
- Lattice-based succinct arguments for NP with polylogarithmic-time verification (Q6145785) (← links)
- Parallel repetition of \((k_1,\dots ,k_{\mu }) \)-special-sound multi-round interactive proofs (Q6155262) (← links)
- On time-lock cryptographic assumptions in abelian hidden-order groups (Q6157523) (← 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)
- 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)