Zero-knowledge RAM: doubly efficient and black-box

DOI10.1007/978-3-031-91134-7_13MaRDI QIDQ6891314zbMATH OpenFDO

Authors Yuval Ishai, Rafail Ostrovsky, Akash Shah

Publication date 2 December 2025

Full work available at URL https://doi.org/10.1007/978-3-031-91134-7_13

zbMATH Keywords

circuitcommunication complexitysecure protocolwitness lengthzero-knowledge proof

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions
• Automata, Languages and Programming
• Concise mercurial vector commitments and independent zero-knowledge sets with short proofs
• Delegating computation: interactive proofs for muggles
• Efficient zero-knowledge proofs of non-algebraic statements with sublinear amortized cost
• Foundations of Cryptography
• How to share a secret
• How to withstand mobile virus attacks (extended abstract)
• scientific article; zbMATH DE number 5485433 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 1031003 (Why is no real title available?)
• scientific article; zbMATH DE number 1559545 (Why is no real title available?)
• HyperNova: recursive arguments for customizable constraint systems
• Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
• Locally decodable codes
• Locally updatable and 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
• Minimum disclosure proofs of knowledge
• Nova: recursive zero-knowledge arguments from folding schemes
• On doubly-efficient interactive proof systems
• On the concrete efficiency of probabilistically-checkable proofs
• On the existence of statistically hiding bit commitment schemes and fail-stop signatures
• On the size of pairing-based non-interactive arguments
• Practical and provably-secure commitment schemes from collision-free hashing
• Private anonymous data access
• Probabilistically checkable proofs of proximity with zero-knowledge
• Protostar: generic efficient accumulation/folding for special-sound protocols
• Quadratic span programs and succinct NIZKs without PCPs
• Robust Characterizations of Polynomials with Applications to Program Testing
• Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding
• Scalable and Unconditionally Secure Multiparty Computation
• Security and composition of multiparty cryptographic protocols
• Short pairing-based non-interactive zero-knowledge arguments
• Software protection and simulation on oblivious RAMs
• Stacked garbling for disjunctive zero-knowledge proofs
• Statistical secrecy and multibit commitments
• Sublinear zero-knowledge arguments for RAM programs
• Succinct arguments for RAM programs via projection codes
• The Knowledge Complexity of Interactive Proof Systems
• Vector commitments and their applications

Cited in

(2)

• Black-box constant-round secure 2PC with succinct communication
• \textsf{Justvengers}: batched VOLE ZK disjunctions in \(\mathcal{O}(R+B+C)\) communication

This page was built for publication: Zero-knowledge RAM: doubly efficient and black-box

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6891314)