|
Published Articles >> Table of Contents >> Abstract
Twenty-Third Annual Computer Security Applications Conference (ACSAC 2007)
pp. 363-373
Bonsai: Balanced Lineage Authentication
Ashish Gehani
Ulf Lindqvist
Full Article Text:
 
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ACSAC.2007.45
Send link to a friend
| Abstract |
|
The provenance of a piece of data is of utility to a wide range of applications. Its availability can be drastically increased by automatically collecting lineage information during filesystem operations. However, when data is pro- cessed by multiple users in independent administrative do- mains, the resulting filesystem metadata can be trusted only if it has been cryptographically certified. This has three ramifications: it slows down filesystem operations, it re- quires more storage for metadata, and verification depends on attestations from remote nodes. We show that current schemes do not scale in a dis- tributed environment. In particular, as data is processed, the latency of filesystem operations will degrade exponen- tially. Further, the amount of storage needed for the lineage metadata will grow at a similar rate. Next, we examine a completely decentralized scheme that has fast filesystem operations with minimal storage overhead. We demonstrate that its verification operation will fail with an exponentially increasing likelihood as more nodes are unreachable (be- cause of being powered off or disconnected from the net- work). Finally, we present a new scheme, Bonsai, where the verification failure is significantly reduced by tolerat- ing a small increase in filesystem latency and storage over- head for certification compared to filesystems without lin- eage certification.
|
 Additional Information
|
Citation:
Ashish Gehani, Ulf Lindqvist,
"Bonsai: Balanced Lineage Authentication,"
acsac,
pp. 363-373,
Twenty-Third Annual Computer Security Applications Conference (ACSAC 2007),
2007
|
|
