Accumulation without homomorphism
From MaRDI portal
Cites work
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
- \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments
- \textsf{Jolt}: SNARKs for virtual machines via lookups
- Arya: nearly linear-time zero-knowledge proofs for correct program execution
- Brakedown: linear-time and field-agnostic SNARKs for R1CS
- Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party
- Cluster computing in zero knowledge
- Constant-round interactive proofs for delegating computation
- Fast Reed-Solomon interactive oracle proofs of proximity
- Fiat-Shamir transformation of multi-round interactive proofs (Extended version)
- scientific article; zbMATH DE number 176545 (Why is no real title available?)
- HyperNova: recursive arguments for customizable constraint systems
- HyperPlonk: Plonk with linear-time prover and high-degree custom gates
- Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
- Interactive oracle proofs
- Interactive proofs of proximity: delegating computation in sublinear time
- Linear-time arguments with sublinear verification from tensor codes
- Linear-time encodable and decodable error-correcting codes
- Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications
- Nova: recursive zero-knowledge arguments from folding schemes
- Polynomial Codes Over Certain Finite Fields
- Proof-carrying data without succinct arguments
- Protostar: generic efficient accumulation/folding for special-sound protocols
- Proximity gaps for Reed-Solomon codes
- Proximity testing with logarithmic randomness
- Random oracles in a quantum world
- Recursive composition and bootstrapping for SNARKs and proof-carrying data
- Recursive proof composition from accumulation schemes
- Scalable zero knowledge via cycles of elliptic curves
- Scalable zero knowledge via cycles of elliptic curves
- STIR: Reed-Solomon proximity testing with fewer queries
- Succinct arguments in the quantum random oracle model
- Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier
This page was built for publication: Accumulation without homomorphism
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7296656)
