Succinct arguments for RAM programs via projection codes
From MaRDI portal
Recommendations
- Sublinear zero-knowledge arguments for RAM programs
- Fast reductions from RAMs to delegatable succinct constraint satisfaction problems
- Proving as fast as computing: succinct arguments with constant prover overhead
- Public-coin, complexity-preserving, succinct arguments of knowledge for NP from collision-resistance
- Fully succinct garbled RAM
Cites work
- scientific article; zbMATH DE number 4205986 (Why is no real title available?)
- scientific article; zbMATH DE number 4213418 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound
- Automata, Languages and Programming
- Black-Box Constructions of Two-Party Protocols from One-Way Functions
- Black-box constructions of protocols for secure computation
- Black-box non-black-box zero knowledge
- Black-box parallel garbled RAM
- Constant round non-malleable protocols using one way functions
- Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
- Efficient Multi-Point Local Decoding of Reed-Muller Codes via Interleaved Codex
- Efficient zero-knowledge proofs of non-algebraic statements with sublinear amortized cost
- Fast reductions from RAMs to delegatable succinct constraint satisfaction problems
- Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
- Interactive oracle proofs
- Introduction to modern cryptography.
- Linear-time zero-knowledge proofs for arithmetic circuit satisfiability
- Locally decodable codes
- Logic at Botik '89. Symposium on logical foundations of Computer Science, Pereslavl-Zalessky, USSR, July 3-8, 1989. Proceedings
- Mercurial Commitments with Applications to Zero-Knowledge Sets
- On the concrete efficiency of probabilistically-checkable proofs
- On the efficiency of local decoding procedures for error-correcting codes
- On the round complexity of black-box secure MPC
- Orion: zero knowledge proof with linear prover time
- Private anonymous data access
- Probabilistic checking of proofs
- Proof verification and the hardness of approximation problems
- Proof-carrying data from arithmetized random oracles
- Proving as fast as computing: succinct arguments with constant prover overhead
- Quadratic span programs and succinct NIZKs without PCPs
- Recursive composition and bootstrapping for SNARKs and proof-carrying data
- Revisiting lower and upper bounds for selective decommitments
- Robust Characterizations of Polynomials with Applications to Program Testing
- Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Short pairing-based non-interactive zero-knowledge arguments
- Simple, Black-Box Constructions of Adaptively Secure Protocols
- Snarks for C: verifying program executions succinctly and in zero knowledge
- Software protection and simulation on oblivious RAMs
- Sublinear zero-knowledge arguments for RAM programs
- Succinct non-interactive arguments via linear interactive proofs
- The PCP theorem by gap amplification
- The hunting of the SNARK
- Universal Arguments and their Applications
- Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier
Cited in
(2)
This page was built for publication: Succinct arguments for RAM programs via projection codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6145783)
