Succinct arguments for RAM programs via projection codes

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Logic at Botik '89. Symposium on logical foundations of Computer Science, Pereslavl-Zalessky, USSR, July 3-8, 1989. Proceedings
Black-box parallel garbled RAM
The hunting of the SNARK
Linear-time zero-knowledge proofs for arithmetic circuit satisfiability
A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound
On the round complexity of black-box secure MPC
Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier
Private anonymous data access
SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
Fast reductions from RAMs to delegatable succinct constraint satisfaction problems
Black-Box Constructions of Protocols for Secure Computation
Short Pairing-Based Non-interactive Zero-Knowledge Arguments
Proof verification and the hardness of approximation problems
Interactive Oracle Proofs
On the efficiency of local decoding procedures for error-correcting codes
Efficient Zero-Knowledge Proofs of Non-algebraic Statements with Sublinear Amortized Cost
Simple, Black-Box Constructions of Adaptively Secure Protocols
Black-Box Constructions of Two-Party Protocols from One-Way Functions
Universal Arguments and their Applications
Probabilistic checking of proofs
Software protection and simulation on oblivious RAMs
Robust Characterizations of Polynomials with Applications to Program Testing
Succinct Non-interactive Arguments via Linear Interactive Proofs
Revisiting Lower and Upper Bounds for Selective Decommitments
Quadratic Span Programs and Succinct NIZKs without PCPs
Efficient Multi-Point Local Decoding of Reed-Muller Codes via Interleaved Codex
Black-box non-black-box zero knowledge
Mercurial Commitments with Applications to Zero-Knowledge Sets
Separating succinct non-interactive arguments from all falsifiable assumptions
Constant round non-malleable protocols using one way functions
Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
Automata, Languages and Programming
Recursive composition and bootstrapping for SNARKS and proof-carrying data
On the concrete efficiency of probabilistically-checkable proofs
Sublinear Zero-Knowledge Arguments for RAM Programs
Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding
Locally Decodable Codes
The PCP theorem by gap amplification
Proof-carrying data from arithmetized random oracles
Proving as fast as computing: succinct arguments with constant prover overhead
Orion: zero knowledge proof with linear prover time

This page was built for publication: Succinct arguments for RAM programs via projection codes