The complexity of online memory checking
From MaRDI portal
Publication:3452196
Recommendations
Cited in
(10)- Low communication complexity protocols, collision resistant hash functions and secret key-agreement protocols
- Tight Bounds on Online Checkpointing Algorithms
- How Efficient Can Memory Checking Be?
- A symmetric cryptographic scheme for data integrity verification in cloud databases
- Memory checking for parallel RAMs
- Quantum online memory checking
- Compact proofs of retrievability
- Generic constructions of PoRs from codes and instantiations
- A secure and effective anonymous integrity checking protocol for data storage in multicloud
- \textsf{MacORAMa}: optimal oblivious RAM with integrity
This page was built for publication: The complexity of online memory checking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3452196)