The complexity of online memory checking

DOI10.1145/1462153.1462155zbMath1325.68080OpenAlexW2072058615MaRDI QIDQ3452196

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

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

Related Items (6)

Compact proofs of retrievability ⋮ A secure and effective anonymous integrity checking protocol for data storage in multicloud ⋮ Low communication complexity protocols, collision resistant hash functions and secret key-agreement protocols ⋮ \textsf{MacORAMa}: optimal oblivious RAM with integrity ⋮ Generic constructions of PoRs from codes and instantiations ⋮ A symmetric cryptographic scheme for data integrity verification in cloud databases

This page was built for publication: The complexity of online memory checking