Username   Password       Forgot your password?  Forgot your username? 

ISSUES BY YEAR

Volume 8 - 2012

No.1 January 2012
No.2 March 2012
No.3 May 2012

Volume 7 - 2011

No.1 January 2011
No.2 March 2011
No.3 May 2011
No.4 July 2011
No.5 September 2011
No.6 November 2011

Volume 6 - 2010

No.1 January 2010
No.2 March 2010
No.3 May 2010
No.4 July 2010
No.5 September 2010
No.6 November 2010

Volume 5 - 2009

No.1 January 2009
No.2 January 2009
No.3 April 2009
No.4 July 2009
No.5 October 2009

Volume 4 - 2008

No.1 January 2008
No.2 April 2008
No.3 July 2008
No.4 October 2008

Volume 3 - 2007

No.1 January 2007
No.2 April 2007
No.3 July 2007
No.4 October 2007

Volume 2 - 2006

No.1 January 2006
No.2 April 2006
No.3 July 2006
No.4 October 2006

Volume 1 - 2005

No.1 July 2005
No.2 October 2005

Updating Time for Dependable Secure Computing Systems

Volume 3, Number 3, July 2007 - SC 4   - pp. 379 - 381

Li Bai, Saroj Biswas, and Musoke Sendaula

ECE, College of Engineering, Temple University, Philadelphia, PA 19122, U.S.A.

(Received on April 12, 2007)


Abstract:

In this paper, we investigate an important and interesting problem in a dependable secure computing system. The problem is to determine an optimal time that the secret shares should be updated on a (k, n) threshold-based secret sharing system with the proactive secret sharing (PSS) capability. In an earlier survivability study for a reconfigurable system, we developed a new definition for the survivability assessment. We extend this new definition for the survivability of the dependable secure computing system. From the survivability assessment perspective, we can easily determine an appropriate updating time for safeguarding secret information on the dependable secure computing system.

 

References: 04

 

Please note : You will need Adobe Acrobat viewer to view the full articles.Get Free Adobe Reader