{"title":"保护整个文件系统的完整性","authors":"Fujita Tomonori, Ogawara Masanori","doi":"10.1109/IWIAS.2003.1192462","DOIUrl":null,"url":null,"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.","PeriodicalId":186507,"journal":{"name":"First IEEE International Workshop on Information Assurance, 2003. IWIAS 2003. Proceedings.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":"{\"title\":\"Protecting the integrity of an entire file system\",\"authors\":\"Fujita Tomonori, Ogawara Masanori\",\"doi\":\"10.1109/IWIAS.2003.1192462\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":186507,\"journal\":{\"name\":\"First IEEE International Workshop on Information Assurance, 2003. IWIAS 2003. Proceedings.\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-03-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"17\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"First IEEE International Workshop on Information Assurance, 2003. IWIAS 2003. Proceedings.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IWIAS.2003.1192462\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"First IEEE International Workshop on Information Assurance, 2003. IWIAS 2003. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IWIAS.2003.1192462","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
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.