DocumentCode
2508231
Title
Data privacy and integrity appropriate for disk protection
Author
Hou, Fangyong ; Gu, Dawu ; Xiao, Nong ; Tang, Yuhua
Author_Institution
Sch. of Comput., Nat. Univ. of Defense Technol., Changsha
fYear
2008
fDate
8-11 July 2008
Firstpage
414
Lastpage
419
Abstract
To protect data privacy and integrity, it encrypts each protected disk sector and creates hash tree upon all the protected sectors to resist against any possible attacks. To make it an appropriate way for disk protection, it designs the required solutions of disk layout, performance optimizing and consistency maintaining. Disk layout uses a fixed disk region to preserve hash tree nodes; performance optimizing utilizes system memory to buffer those frequently used hash tree nodes to offload the big working cost; and consistency maintaining logs disk modifications to recovery the valid result after unexpected failures. The implementation cost is low and running performance is satisfiable. Analysis and experimental simulations show that it is a practical and available way to build secure disk.
Keywords
data privacy; hard discs; tree data structures; data integrity; data privacy; disk layout; disk sector protection; hard disks; hash tree; Appropriate technology; Authentication; Computer science; Cryptography; Data engineering; Data privacy; File systems; Protection; Resists; Solids;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer and Information Technology, 2008. CIT 2008. 8th IEEE International Conference on
Conference_Location
Sydney, NSW
Print_ISBN
978-1-4244-2357-6
Electronic_ISBN
978-1-4244-2358-3
Type
conf
DOI
10.1109/CIT.2008.4594711
Filename
4594711
Link To Document