Users of online-collaboration tools and network storage services place considerable trust in their providers. This paper presents
a novel approach for protecting data integrity in revision control systems hosted by an untrusted provider. It guarantees
atomic read and write operations on the shared data when the service is correct and preserves fork-linearizability when the
service is faulty. A prototype has been implemented on top of the Subversion revision control system; benchmarks show that
the approach is practical.
Keywords Hash trees - memory checking - fork linearizability - storage security - applied cryptography