{"title":"Lazy revocation in cryptographic file systems","authors":"M. Backes, C. Cachin, Alina Oprea","doi":"10.1109/SISW.2005.7","DOIUrl":"https://doi.org/10.1109/SISW.2005.7","url":null,"abstract":"A crucial element of distributed cryptographic file systems are key management solutions that allow for flexible but secure data sharing. We consider efficient key management schemes for cryptographic file systems using lazy revocation. We give rigorous security definitions for three cryptographic schemes used in such systems, namely symmetric encryption, message-authentication codes and signature schemes. Additionally, we provide generic constructions for symmetric encryption and message-authentication codes with lazy revocation using key-updating schemes for lazy revocation, which have been introduced recently. We also give a construction of signature schemes with lazy revocation from identity-based signatures. Finally, we describe how our constructions improve the key rotation mechanism in the Plutus file system","PeriodicalId":402347,"journal":{"name":"Third IEEE International Security in Storage Workshop (SISW'05)","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122046349","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Adding secure deletion to your favorite file system","authors":"N. Joukov, E. Zadok","doi":"10.1109/SISW.2005.1","DOIUrl":"https://doi.org/10.1109/SISW.2005.1","url":null,"abstract":"Files or even their names often contain confidential or secret information. Most users believe that such information is erased as soon as they delete a file. Even those who know that this is not true often ignore the issue. Nevertheless, recovering deleted files is trivial and can be performed even by novice hackers. The problem is exacerbated by the widespread of portable and mobile storage devices. This type of unwanted after-deletion data recovery is in part an education problem. Users believe that deleted files are erased, even though they are not. Retraining and educating users is difficult. Therefore, storage systems should behave appropriately - the data should be erased from the storage on a per-delete basis. We found that existing solutions are either inconvenient, inefficient, or insecure. We have designed Purgefs: a file system extension that transparently overwrites files on the per-delete basis. Purgefs can be automatically added to a number of existing and future file systems, including networked and stackable file systems. Purgefs supports multiple policies to trade-off performance with the level of purging guarantees. We demonstrate that Purgefs does not add overheads or perturb users' activity under typical user workloads","PeriodicalId":402347,"journal":{"name":"Third IEEE International Security in Storage Workshop (SISW'05)","volume":"127 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122109659","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"File system design with assured delete","authors":"R. Perlman","doi":"10.1109/SISW.2005.5","DOIUrl":"https://doi.org/10.1109/SISW.2005.5","url":null,"abstract":"This paper describes a system that supports high availability of data, until the data should be expunged, at which time the system makes it impossible to recover the data. This design supports two types of assured delete; where the expiration time is known at file creation, and on-demand delete of individual files. The design assures previous work has described how to do this when the expiration time of a file is known at file creation time, and was particularly suited to supporting many independent clients. This paper reviews that work, but also describes how to support on-demand deletion of individual files","PeriodicalId":402347,"journal":{"name":"Third IEEE International Security in Storage Workshop (SISW'05)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125187989","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Towards protecting sensitive files in a compromised system","authors":"Xin Zhao, Kevin Borders, A. Prakash","doi":"10.1109/SISW.2005.17","DOIUrl":"https://doi.org/10.1109/SISW.2005.17","url":null,"abstract":"Protecting sensitive files from a compromised system helps administrators to thwart many attacks, discover intrusion trails, and fast restore the system to a safe state. However, most existing file protection mechanisms can be turned off after an attacker manages to exploit a vulnerability to gain privileged access. In this paper we propose SVFS, a secure virtual file system that uses virtual machine technology to store sensitive files in a virtual machine that is dedicated to providing secure data storage, and run applications in one or more guest virtual machines. Accesses to sensitive files must go through SVFS and are subject to access control policies. Because the access control policies are enforced independently in an isolated virtual machine, intruders cannot bypass file protection by compromising a guest VM. In addition, SVFS introduces a virtual remote procedure call mechanism as a substitute of standard RPC to deliver better performance in data exchanging across virtual machine boundaries. We implemented SVFS and tested it against attacks on a guest operating system using several available rootkits. SVFS was able to prevent most of the rootkits from being installed, and prevent all of them from persisting past reboot. We also compared the performance of SVFS to the native Ext3 file system and found that performance cost was reasonable considering the security benefits of SVFS. Our experimental results also show VRPC does improve the file system performance","PeriodicalId":402347,"journal":{"name":"Third IEEE International Security in Storage Workshop (SISW'05)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123366055","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Patrick R. Eaton, Hakim Weatherspoon, J. Kubiatowicz
{"title":"Efficiently binding data to owners in distributed content-addressable storage systems","authors":"Patrick R. Eaton, Hakim Weatherspoon, J. Kubiatowicz","doi":"10.1109/SISW.2005.4","DOIUrl":"https://doi.org/10.1109/SISW.2005.4","url":null,"abstract":"Distributed content-addressable storage systems use self-verifying data to protect data integrity and to enable graceful scaling. One feature commonly missing from these systems, however, is the ability to identify the owner of a piece of data in a non-repudiable manner. While a solution that associates a certificate with each block of data is conceptually simple, researchers have traditionally claimed that the cost of creating and maintaining certificates is too great. In this paper, we demonstrate that systems can, in fact, efficiently map data to its owner in a secure and non-repudiable fashion. To reduce the cost of creating and maintaining certificates, we extend the traditional content-addressable interface to allow the aggregation of many small data blocks into larger containers. The aggregation is performed in a way that also supports self-verifying data at the granularity of the block and container, fine-granularity access, and incremental updates. We describe two prototype implementations and present preliminary performance results from deployments on PlanetLab and a local cluster","PeriodicalId":402347,"journal":{"name":"Third IEEE International Security in Storage Workshop (SISW'05)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129840268","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Optimization of covert channel identification","authors":"Jianjun Shen, S. Qing, Qingni Shen, Liping Li","doi":"10.1109/SISW.2005.9","DOIUrl":"https://doi.org/10.1109/SISW.2005.9","url":null,"abstract":"We characterize the properties of covert channels and present a taxonomy of covert channels. Information flow sequence is adopted to represent information flows and covert channels. Covert channels are categorized according to their information flow characteristics. On this basis, we explore the optimization of covert channel identification with the shared resource matrix method adopted for demonstration. A general framework for covert channel identification founded on information flow analysis is proposed. We also review previous work within our framework. The application of our approach to a practical system is shown. At last, a new class of covert channels which used to be omitted by previous work is introduced","PeriodicalId":402347,"journal":{"name":"Third IEEE International Security in Storage Workshop (SISW'05)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125728376","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Efficient authentication of large, dynamic data sets using Galois/counter mode (GCM)","authors":"D. McGrew","doi":"10.1109/SISW.2005.3","DOIUrl":"https://doi.org/10.1109/SISW.2005.3","url":null,"abstract":"The Galois/counter mode (GCM) of operation can be used as an incremental message authentication code (MAC); in this respect, it is unique among the crypto algorithms used in practice. We show that it has this property, and show how to efficiently recompute a MAC after small changes within a message, after the appending or prepending of data to a message, or the truncation of data from the start or end of a message. Incremental MACs have great utility for protecting data at rest. In particular, they can be used to protect a large, dynamic data set using only a small, constant amount of memory","PeriodicalId":402347,"journal":{"name":"Third IEEE International Security in Storage Workshop (SISW'05)","volume":"161 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133926248","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
D. Thain, C. Moretti, Paul Madrid, P. Snowberger, J. Hemmes
{"title":"The consequences of decentralized security in a cooperative storage system","authors":"D. Thain, C. Moretti, Paul Madrid, P. Snowberger, J. Hemmes","doi":"10.1109/SISW.2005.11","DOIUrl":"https://doi.org/10.1109/SISW.2005.11","url":null,"abstract":"Traditional storage systems have considered security as a problem to be solved at the perimeter: once a user is authenticated, each device internal to the system trusts the decision made elsewhere. However, as storage systems become ever more distributed, shared, and dynamic, it becomes necessary to enforce security at the boundaries of each storage device, rather than around the system as a whole. This form of decentralized security presents several new challenges in the design and implementation of distributed storage systems. We explore challenges in distributed file systems, third party transfer, active storage, and group management in the context of a 200-node cooperative storage system deployed at the University of Notre Dame. These explorations result in three recommendations for future system designs","PeriodicalId":402347,"journal":{"name":"Third IEEE International Security in Storage Workshop (SISW'05)","volume":"156 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121395609","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
M. Factor, D. Nagle, D. Naor, E. Riedel, J. Satran
{"title":"The OSD security protocol","authors":"M. Factor, D. Nagle, D. Naor, E. Riedel, J. Satran","doi":"10.1109/SISW.2005.12","DOIUrl":"https://doi.org/10.1109/SISW.2005.12","url":null,"abstract":"The ANSI T10 object-based storage devices (OSD) standard is a new standard. It evolves the storage interface from fixed size blocks to variable size objects and includes an integrated security protocol that protects storage. This paper presents the requirements, the design tradeoffs, and the final security protocol as defined in the standard. The resulting protocol is based on a secure capability-based model, enabling fine-grained access control that protects both the entire storage device and individual objects from unauthorized access. The protocol defines three methods of security based on the applications' requirements. Furthermore, the protocol's key management algorithm allows keys to be changed quickly, without disrupting normal operations. Finally, the protocol is currently being enhanced for version 2.0 of the ANSI T10 OSD standard; future extensions include data-encryption and access-control on sections of storage objects","PeriodicalId":402347,"journal":{"name":"Third IEEE International Security in Storage Workshop (SISW'05)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132585350","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"POTSHARDS: storing data for the long-term without encryption","authors":"K. Greenan, M. Storer, E. L. Miller, C. Maltzahn","doi":"10.1109/SISW.2005.10","DOIUrl":"https://doi.org/10.1109/SISW.2005.10","url":null,"abstract":"Many archival storage systems rely on keyed encryption to ensure privacy. A data object in such a system is exposed once the key used to encrypt the data is compromised. When storing data for as long as a few decades or centuries, the use of keyed encryption becomes a real concern. The exposure of a key is bounded by computation effort and management of encryption keys becomes as much of a problem as the management of the data the key is protecting. POTSHARDS is a secure, distributed, very long-term archival storage system that eliminates the use of keyed encryption through the use of unconditionally secure secret sharing. A (m, n) unconditionally secure secret sharing scheme splits an object up into n shares, which provably gives no information about the object, unless m of the shares collaborate. POTSHARDS separates security and redundancy by utilizing two levels of secret sharing. This allows for secure reconstruction upon failure and more flexible storage patterns. The data structures used in POTSHARDS are organized in such a way that an unauthorized user attempting to collect shares will not go unnoticed since it is very difficult to launch a targeted attack on the system. A malicious user would have a difficult time finding the shares for a particular file in a timely or efficient manner. Since POTSHARDS provides secure storage for arbitrarily long periods of time, its data structures include built-in support for consistency checking and data migration. This enables reliable data churning and the movement of data between storage devices","PeriodicalId":402347,"journal":{"name":"Third IEEE International Security in Storage Workshop (SISW'05)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114866195","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}