Memory checking for parallel RAMs

DOI10.1007/978-3-031-48618-0_15MaRDI QIDQ6582183zbMATH OpenFDO

Authors Surya Mathialagan

Publication date 2 August 2024

Full work available at URL https://doi.org/10.1007/978-3-031-48618-0_15

Mathematics Subject Classification ID

Database theory (68P15) Cryptography (94A60)

Cites work

• A lower bound for the time to assure interactive consistency
• Authenticated Algorithms for Byzantine Agreement
• Black-box parallel garbled RAM
• Checking the correctness of memories
• Circuit OPRAM: unifying statistically and computationally secure ORAMs and OPRAMs
• Compact proofs of retrievability
• Cryptography for parallel RAM from indistinguishability obfuscation
• Distributed Oblivious RAM for Secure Two-Party Computation
• Easy impossibility proofs for distributed consensus problems
• How Efficient Can Memory Checking Be?
• Oblivious hashing revisited, and applications to asymptotically efficient ORAM and OPRAM
• Oblivious parallel RAM and applications
• Oblivious parallel RAM: improved efficiency and generic constructions
• Oblivious RAM with \(O((\log N)^{3})\) worst-case cost
• Oblivious RAM with \textit{worst-case} logarithmic overhead
• On the depth of oblivious parallel RAM
• OptORAMa: optimal oblivious RAM
• Private database access with HE-over-ORAM architecture
• Reaching Agreement in the Presence of Faults
• Small-Bias Probability Spaces: Efficient Constructions and Applications
• The complexity of online memory checking
• The invasiveness of off-line memory checking

Cited in

(2)

• The complexity of memory checking with covert security
• Memory checking requires logarithmic overhead

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)