How Efficient Can Memory Checking Be?

DOI10.1007/978-3-642-00457-5_30zbMath1213.68247OpenAlexW1574603618MaRDI QIDQ3611785

Guy N. Rothblum, Moni Naor, Vinod Vaikuntanathan, Cynthia Dwork

Publication date: 3 March 2009

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00457-5_30

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Related Items (5)

\textsf{MacORAMa}: optimal oblivious RAM with integrity ⋮ Forward secret encrypted RAM: lower bounds and applications ⋮ Dynamic proofs of retrievability via oblivious RAM ⋮ Spartan: efficient and general-purpose zkSNARKs without trusted setup ⋮ Authenticated hash tables based on cryptographic accumulators

This page was built for publication: How Efficient Can Memory Checking Be?