Protecting the Integrity of an Entire File System

Authors:
Fujita Tomonori;Ogawara Masanori
Affiliations:
-;-
Venue:
IEEE-IWIA '03 Proceedings of the First IEEE International Workshop on Information Assurance (IWIA'03)
Year:
2003

Citing 0
Cited 3

Protect Disk Integrity: Solid Security, Fine Performance and Fast Recovery

ISA '09 Proceedings of the 3rd International Conference and Workshops on Advances in Information Security and Assurance
An efficient way to build secure disk

ISPEC'06 Proceedings of the Second international conference on Information Security Practice and Experience
Protecting mass data basing on small trusted agent

ISPEC'05 Proceedings of the First international conference on Information Security Practice and Experience

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes Arbre, a file system designed to run on untrusted remote storage connected to a server by networking fabrics. Arbre structures all blocks as a tree and stores a pointer pointing to a block and a cryptographic hash of the block's contents together. This scheme allows Arbre to protect the integrity of the entire file system rather than the integrity of each block or each file individually. In addition, the root of a tree is not written to disk after until all modified data are written to disk, and modified data are always written to new locations on disk. With this scheme in the event of a system failure both meta-data and file-data are maintained in a consistent state and there is no possibility that users see any inconsistency between contents of a block and its hash.