The complexity of online memory checking

DOI10.1145/1462153.1462155MaRDI QIDQ3452196zbMATH OpenOpenAlexFDO

Authors Moni Naor, Guy N. Rothblum

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

zbMATH Keywords

authenticationmemory checking

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Data encryption (aspects in computer science) (68P25)

Recommendations

• How Efficient Can Memory Checking Be?
• Quantum online memory checking
• Checking the correctness of memories
• Authentication in the bounded storage model
• Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models

Cited in

(13)

• A secure and effective anonymous integrity checking protocol for data storage in multicloud
• Generic constructions of PoRs from codes and instantiations
• Compact proofs of retrievability
• How Efficient Can Memory Checking Be?
• Tight Bounds on Online Checkpointing Algorithms
• Quantum online memory checking
• Low communication complexity protocols, collision resistant hash functions and secret key-agreement protocols
• \textsf{MacORAMa}: optimal oblivious RAM with integrity
• Memory checking for parallel RAMs
• Merkle mountain ranges are optimal: on witness update frequency for cryptographic accumulators
• The complexity of memory checking with covert security
• Memory checking requires logarithmic overhead
• A symmetric cryptographic scheme for data integrity verification in cloud databases

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)