TensorSwitch: nearly optimal polynomial commitments from tensor codes
From MaRDI portal
Cites work
- Computationally Sound Proofs
- Constant-round interactive proofs for delegating computation
- Constant-Size Commitments to Polynomials and Their Applications
- Fiat-Shamir transformation of multi-round interactive proofs (Extended version)
- How to use indistinguishability obfuscation
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
- Interactive proofs of proximity: delegating computation in sublinear time
- IOPs with inverse polynomial soundness error
- IP = PSPACE using error-correcting codes
- Ligero: lightweight sublinear arguments without a trusted setup
- Local proofs approaching the witness length
- Proving as fast as computing: succinct arguments with constant prover overhead
- Proximity testing with logarithmic randomness
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Succinct non-interactive arguments via linear interactive proofs
This page was built for publication: TensorSwitch: nearly optimal polynomial commitments from tensor codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7443632)