FastVer: Making Data Integrity a Commodity
Arvind Arasua, Badrish Chandramoulia, Johannes E. Gehrkea, Esha Ghosha, Donald Kossmanna, Jonathan Protzenkoa, Ravi Ramamurthya, Tahina Ramananandroa, Aseem Rastogib, Srinath Settya, Nikhil Swamya, Alexander van Renenc, Min Xud
- aMicrosoft Research, Redmond, WA, USA
- bMicrosoft Research, Bengaluru, India
- cTechnical University of Munich, Munich, Germany
- dUniversity of Chicago, Chicago, IL, USA
Papers open inside SciRah from the original publisher or repository; SciRah never hosts them.
Abstract
We present FastVer, a high-performance key-value store with strong data integrity guarantees. FastVer is built as an extension of FASTER, an open-source, high-performance key-value store. It offers the same key-value API as FASTER plus an additional verify() method that detects if an unauthorized attacker tampered with the database and checks whether results of all read operations are consistent with historical updates. FastVer is based on a novel approach that combines the advantages of Merkle trees and deferred memory verification. We show that this approach achieves one to two orders of magnitudes higher throughputs than traditional approaches based on either Merkle trees or memory verification. We have formally proven the correctness of our approach in a proof assistant, ensuring that verify() detects any inconsistencies, except if a collision can be found on a cryptographic hash.
TL;DRFastVer is built as an extension of FASTER, an open-source, high-performance key-value store with strong data integrity guarantees, and formally proven the correctness of the approach in a proof assistant, ensuring that verify() detects any inconsistencies, except if a collision can be found on a cryptographic hash. (Semantic Scholar)