DocumentCode
2298927
Title
Hierarchical Self-Destruction Method and Case Study on Distributed Computing System
Author
Lin, Junyu ; Wang, Huiqiang ; Qiu, Zhitao ; Feng, Guangsheng
Author_Institution
Coll. of Comput. Sci. & Technol., Harbin Eng. Univ., Harbin, China
fYear
2010
fDate
1-2 Nov. 2010
Firstpage
198
Lastpage
202
Abstract
Self-destruction technology is very important to protect privacy information and is the ultimate means for information security. To achieve self-destruction of distributed system, a hierarchical self-destruction system model is established. Based on rough set theory, self-destructive conditions are determined and self-destruction realization method is designed based on components. At last, self-destruction process is analyzed combined with application examples. The results show that the method can self-destruct distributed system effectively and the self-destructed part can not be recovered. Self-destruction correctness and time-efficiency is higher, which has good feasibility and practicality.
Keywords
data privacy; distributed processing; rough set theory; security of data; distributed computing system; hierarchical self-destruction method; information security; privacy information protection; rough set theory; time efficiency; Computer science; Educational institutions; Monitoring; Safety; Security; Set theory; Vectors; cognitive networks; perception; rough set theory; self-destruction;
fLanguage
English
Publisher
ieee
Conference_Titel
Internet Computing for Science and Engineering (ICICSE), 2010 Fifth International Conference on
Conference_Location
Heilongjiang
Print_ISBN
978-1-4244-9954-0
Type
conf
DOI
10.1109/ICICSE.2010.48
Filename
6076569
Link To Document