Efficient proof of RAM programs from any public-coin zero-knowledge system
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 5485433 (Why is no real title available?)
- scientific article; zbMATH DE number 7706037 (Why is no real title available?)
- Arya: nearly linear-time zero-knowledge proofs for correct program execution
- Aurora: transparent succinct arguments for R1CS
- Efficient zero-knowledge proofs of non-algebraic statements with sublinear amortized cost
- Linear Algebra with Sub-linear Zero-Knowledge Arguments
- On the size of pairing-based non-interactive arguments
- PrORAM
- Quadratic span programs and succinct NIZKs without PCPs
- Scalable zero knowledge via cycles of elliptic curves
- Snarks for C: verifying program executions succinctly and in zero knowledge
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Sublinear zero-knowledge arguments for RAM programs
- The knowledge complexity of interactive proof-systems
- \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions
Cited in
(3)
This page was built for publication: Efficient proof of RAM programs from any public-coin zero-knowledge system
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6134849)