Pages that link to "Item:Q2304940"
From MaRDI portal
The following pages link to Scalable zero knowledge with no trusted setup (Q2304940):
Displaying 50 items.
- Multi-party revocation in sovrin: performance through distributed trust (Q826287) (← links)
- Scalable zero knowledge via cycles of elliptic curves (Q1688401) (← links)
- Security of the Poseidon hash function against non-binary differential and linear attacks (Q2044012) (← links)
- Transparent SNARKs from DARK compilers (Q2055634) (← links)
- Marlin: preprocessing zkSNARKs with universal and updatable SRS (Q2055641) (← links)
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography (Q2055643) (← links)
- Stacked garbling for disjunctive zero-knowledge proofs (Q2055668) (← links)
- On succinct arguments and witness encryption from groups (Q2096510) (← links)
- A non-PCP approach to succinct quantum-safe zero-knowledge (Q2096535) (← links)
- New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust (Q2104237) (← links)
- Spartan: efficient and general-purpose zkSNARKs without trusted setup (Q2104239) (← links)
- Privacy-preserving data aggregation with probabilistic range validation (Q2117046) (← links)
- \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments (Q2120097) (← links)
- Subquadratic SNARGs in the random oracle model (Q2120100) (← links)
- An algebraic framework for universal and updatable SNARKs (Q2120103) (← links)
- Tight state-restoration soundness in the algebraic group model (Q2128989) (← links)
- \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions (Q2139630) (← links)
- Does Fiat-Shamir require a cryptographic hash function? (Q2139639) (← links)
- SoK: communication across distributed ledgers (Q2147221) (← links)
- Layering quantum-resistance into classical digital signature algorithms (Q2154036) (← links)
- Asymptotically quasi-optimal cryptography (Q2170004) (← links)
- A PCP theorem for interactive proofs and applications (Q2170038) (← links)
- Succinct arguments in the quantum random oracle model (Q2175929) (← links)
- Linear-size constant-query IOPs for delegating computation (Q2175951) (← links)
- Efficient multivariate low-degree tests via interactive oracle proofs of proximity for polynomial codes (Q2692970) (← links)
- Tight security bounds for Micali's SNARGs (Q2695642) (← links)
- Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography (Q5041168) (← links)
- Updateable Inner Product Argument with Logarithmic Verifier and Applications (Q5041169) (← links)
- Polynomial IOPs for Linear Algebra Relations (Q5087271) (← links)
- Ligero: lightweight sublinear arguments without a trusted setup (Q6063128) (← links)
- Merkle tree ladder mode: reducing the size impact of NIST PQC signature algorithms in practice (Q6080919) (← links)
- Parallelizable delegation from LWE (Q6114288) (← links)
- Flashproofs: efficient zero-knowledge arguments of range and polynomial evaluation with transparent setup (Q6132411) (← links)
- Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection (Q6132417) (← 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)
- \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions (Q6157543) (← links)
- Lattice-based inner product argument (Q6160829) (← links)
- Lower bound on SNARGs in the random oracle model (Q6163944) (← links)
- Orion: zero knowledge proof with linear prover time (Q6166953) (← links)
- Moz\(\mathbb{Z}_{2^k}\)arella: efficient vector-OLE and zero-knowledge proofs over \(\mathbb{Z}_{2^k}\) (Q6166955) (← 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)
- Scalable and transparent proofs over all large fields, via elliptic curves. ECFFT. II (Q6169368) (← links)
- GUC-secure commitments via random oracles: new impossibility and feasibility (Q6175972) (← links)
- Bounded verification for finite-field-blasting. In a compiler for zero knowledge proofs (Q6535685) (← links)
- Beyond MPC-in-the-head: black-box constructions of short zero-knowledge proofs (Q6581781) (← 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)
