Memory checking requires logarithmic overhead
From MaRDI portal
Cites work
- \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments
- \textsf{MacORAMa}: optimal oblivious RAM with integrity
- A logarithmic lower bound for oblivious RAM (for all Parameters)
- A lower bound for one-round oblivious RAM
- A Pseudorandom Generator from any One-way Function
- An average-case depth hierarchy theorem for Boolean circuits
- Checking the correctness of memories
- Compact proofs of retrievability
- Dynamic proofs of retrievability via oblivious RAM
- Foundations of Cryptography
- Gemini: elastic SNARKs for diverse environments
- How Efficient Can Memory Checking Be?
- scientific article; zbMATH DE number 1088254 (Why is no real title available?)
- Is there an oblivious RAM lower bound?
- Libra: succinct zero-knowledge proofs with optimal prover computation
- Linear relaxed locally decodable and correctable codes do not need adaptivity and two-sided error
- Logarithmic Lower Bounds in the Cell-Probe Model
- Memory checking for parallel RAMs
- Oblivious RAM with worst-case logarithmic overhead
- Optimal non-adaptive cell probe dictionaries and hashing
- OptORAMa: Optimal oblivious RAM
- PanORAMa: oblivious RAM with logarithmic overhead
- Parallelizable Authentication Trees
- Path ORAM
- Proofs for inner pairing products and applications
- Rounds in Communication Complexity Revisited
- Software protection and simulation on oblivious RAMs
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- The complexity of online memory checking
- Time space tradeoffs for attacks against one-way functions and PRGs
- Yes, there is an oblivious RAM lower bound!
This page was built for publication: Memory checking requires logarithmic overhead
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6966599)
