Memory checking for parallel RAMs
From MaRDI portal
Publication:6582183
DOI10.1007/978-3-031-48618-0_15MaRDI QIDQ6582183
Publication date: 2 August 2024
Cites Work
- Checking the correctness of memories
- Easy impossibility proofs for distributed consensus problems
- A lower bound for the time to assure interactive consistency
- Black-box parallel garbled RAM
- Circuit OPRAM: unifying statistically and computationally secure ORAMs and OPRAMs
- OptORAMa: optimal oblivious RAM
- Oblivious RAM with \textit{worst-case} logarithmic overhead
- Compact proofs of retrievability
- On the depth of oblivious parallel RAM
- Oblivious hashing revisited, and applications to asymptotically efficient ORAM and OPRAM
- Private Database Access with HE-over-ORAM Architecture
- Oblivious Parallel RAM and Applications
- Oblivious Parallel RAM: Improved Efficiency and Generic Constructions
- Cryptography for Parallel RAM from Indistinguishability Obfuscation
- Authenticated Algorithms for Byzantine Agreement
- Oblivious RAM with O((logN)3) Worst-Case Cost
- Small-Bias Probability Spaces: Efficient Constructions and Applications
- The complexity of online memory checking
- The invasiveness of off-line memory checking
- How Efficient Can Memory Checking Be?
- Reaching Agreement in the Presence of Faults
- Distributed Oblivious RAM for Secure Two-Party Computation
This page was built for publication: Memory checking for parallel RAMs
