Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/40205
DC FieldValue
dc.titleHiding data accesses in steganographic file system
dc.contributor.authorZhou, X.
dc.contributor.authorPang, H.
dc.contributor.authorTan, K.-L.
dc.date.accessioned2013-07-04T07:59:01Z
dc.date.available2013-07-04T07:59:01Z
dc.date.issued2004
dc.identifier.citationZhou, X.,Pang, H.,Tan, K.-L. (2004). Hiding data accesses in steganographic file system. Proceedings - International Conference on Data Engineering 20 : 572-583. ScholarBank@NUS Repository.
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/40205
dc.description.abstractTo support ubiquitous computing, the underlying data have to be persistent and available anywhere-anytime. The data thus have to migrate from devices local to individual computers, to shared storage volumes that are accessible over open network This potentially exposes the data to heightened security risks. We propose two mechanisms, in the context of a steganographic file system, to mitigate the risk of attacks initiated through analyzing data accesses from user applications. The first mechanism is intended to counter attempts to locate data through updates in between snapshots - in short, update analysis. The second mechanism prevents traffic analysis - identifying data from I/O traffic patterns. We have implemented the first mechanism on Linux and conducted experiments to demonstrate its effectiveness and practicality. Simulation results on the second mechanism also show its potential for real world applications.
dc.sourceScopus
dc.typeConference Paper
dc.contributor.departmentCOMPUTER SCIENCE
dc.description.sourcetitleProceedings - International Conference on Data Engineering
dc.description.volume20
dc.description.page572-583
dc.description.codenPIDEE
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.