How to Update Dependable Secure Computing Systems from a Survivability Assessment Perspective?

Author

Bai, Li ; Biswas, Saroj ; Sendaula, Musoke

Author_Institution

Temple Univ., Philadelphia

fYear

2007

fDate

25-26 Sept. 2007

Firstpage

95

Lastpage

99

Abstract

In this paper, we investigate how to compute an updating time for a dependable secure computing (DSC) system from a survivability assessment perspective. Generally speaking, to prevent adversaries from learning secret information in a DSC system, the secret information has to be updated in the system. The proposed method is based on a novel concept of survivability of reconfigurable systems presented earlier in [1]. It is shown that secret updating time increases with k, which is the number of secret shares for reconstructing the secret. The proposed method presents a solution for an important problem in the DSC system which is how to determine an appropriate updating time.

Keywords

cryptography; dependable secure computing system; reconfigurable system; secret sharing; secret updating time; survivability assessment perspective; Cryptography; Fault tolerant systems; Information entropy; Information security; Interpolation; Polynomials; Time sharing computer systems; dependable secure computing; k-out-of-n secret; sharing system; updating time.;

fLanguage

English

Publisher

ieee

Conference_Titel

Dependable, Autonomic and Secure Computing, 2007. DASC 2007. Third IEEE International Symposium on

Conference_Location

Columbia, MD

Print_ISBN

978-0-7695-2985-1

Type

conf

DOI

10.1109/DASC.2007.21

Filename

4351393