Memory checking for parallel RAMs
From MaRDI portal
Publication:6582183
DOI10.1007/978-3-031-48618-0_15MaRDI QIDQ6582183FDOQ6582183
Authors: Surya Mathialagan 
Publication date: 2 August 2024
Cites Work
- Small-Bias Probability Spaces: Efficient Constructions and Applications
- How Efficient Can Memory Checking Be?
- Checking the correctness of memories
- Authenticated Algorithms for Byzantine Agreement
- Reaching Agreement in the Presence of Faults
- A lower bound for the time to assure interactive consistency
- Easy impossibility proofs for distributed consensus problems
- Oblivious RAM with \(O((\log N)^{3})\) worst-case cost
- The complexity of online memory checking
- Circuit OPRAM: unifying statistically and computationally secure ORAMs and OPRAMs
- On the depth of oblivious parallel RAM
- Oblivious hashing revisited, and applications to asymptotically efficient ORAM and OPRAM
- Oblivious parallel RAM and applications
- Oblivious parallel RAM: improved efficiency and generic constructions
- Cryptography for parallel RAM from indistinguishability obfuscation
- Distributed Oblivious RAM for Secure Two-Party Computation
- Black-box parallel garbled RAM
- OptORAMa: optimal oblivious RAM
- Compact proofs of retrievability
- Private database access with HE-over-ORAM architecture
- Oblivious RAM with \textit{worst-case} logarithmic overhead
- The invasiveness of off-line memory checking
This page was built for publication: Memory checking for parallel RAMs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6582183)
