Proactive security: Key refreshing algorithm for long term protection

Rajkumari Retoliya, Anshu Tripathi, Sapan Prajapati, Rupali Mehta · 2011

This Paper provides Proactive share key refreshing technique for maintaining the security of the system, even when some nodes are in control of attacker. It provides an automated recovery of the security of individual components, avoiding the use of expensive and inconvenient manual processes. The technique can be used with threshold cryptography, by providing periodic refreshments of the sensitive data held by the servers. This way the proactive approach guarantees uninterrupted security as long as not too many servers are broken at the same time. In this paper a solution is provided to enhance security among communication channel. For this a proactive share refreshing technique is represented in the form of algorithm in which some trusted nodes share the private key, which is a part of private-public key pair. Here the private key is not kept on a single system because there is a probability of attacking. It is distributed on some trusted systems according to threshold cryptography. Now once shares are distributed they must be refreshed otherwise attacker can easily achieve those shares and generate the key. The same work is represented here; once shares are distributed they must be refreshed after some period of time, so that long term protection against break ins can be achieved.

Read the paper · More papers on PaperTik