The complexity of online memory checking
From MaRDI portal
Publication:3452196
DOI10.1145/1462153.1462155zbMATH Open1325.68080OpenAlexW2072058615MaRDI QIDQ3452196FDOQ3452196
Publication date: 11 November 2015
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1462153.1462155
Recommendations
Information storage and retrieval of data (68P20) Data encryption (aspects in computer science) (68P25)
Cited In (9)
- Memory checking for parallel RAMs
- Tight Bounds on Online Checkpointing Algorithms
- Compact proofs of retrievability
- Low communication complexity protocols, collision resistant hash functions and secret key-agreement protocols
- \textsf{MacORAMa}: optimal oblivious RAM with integrity
- A secure and effective anonymous integrity checking protocol for data storage in multicloud
- A symmetric cryptographic scheme for data integrity verification in cloud databases
- How Efficient Can Memory Checking Be?
- Generic constructions of PoRs from codes and instantiations
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)