Sublinear Zero-Knowledge Arguments for RAM Programs
From MaRDI portal
Publication:5738888
DOI10.1007/978-3-319-56620-7_18zbMath1411.94079OpenAlexW2594206091MaRDI QIDQ5738888
Payman Mohassel, Mike Rosulek, Alessandra Scafuro
Publication date: 13 June 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-56620-7_18
Related Items (7)
UC Updatable Databases and Applications ⋮ PrORAM ⋮ Efficient proof of RAM programs from any public-coin zero-knowledge system ⋮ Succinct arguments for RAM programs via projection codes ⋮ On black-box constructions of time and space efficient sublinear arguments from symmetric-key primitives ⋮ GUC-secure commitments via random oracles: new impossibility and feasibility ⋮ Endemic oblivious transfer via random oracles, revisited
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs
- SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
- Scalable Zero Knowledge via Cycles of Elliptic Curves
- Garbled RAM From One-Way Functions
- How to Efficiently Evaluate RAM Programs with Malicious Security
- Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity
- Efficient Zero-Knowledge Proofs of Non-algebraic Statements with Sublinear Amortized Cost
- Software protection and simulation on oblivious RAMs
- Succinct Non-interactive Arguments via Linear Interactive Proofs
- Distributed Oblivious RAM for Secure Two-Party Computation
- Quadratic Span Programs and Succinct NIZKs without PCPs
- Black-box non-black-box zero knowledge
- Resettably Sound Zero-Knowledge Arguments from OWFs - The (Semi) Black-Box Way
- Garbled RAM Revisited
- Advances in Cryptology - CRYPTO 2003
- Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
- Recursive composition and bootstrapping for SNARKS and proof-carrying data
- On the concrete efficiency of probabilistically-checkable proofs
This page was built for publication: Sublinear Zero-Knowledge Arguments for RAM Programs