Please use this identifier to cite or link to this item:
https://idr.nitk.ac.in/jspui/handle/123456789/8385
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Spoorthi, V. | |
dc.contributor.author | Rajendran, B. | |
dc.contributor.author | Chandrasekaran, K. | |
dc.date.accessioned | 2020-03-30T10:18:34Z | - |
dc.date.available | 2020-03-30T10:18:34Z | - |
dc.date.issued | 2013 | |
dc.identifier.citation | Proceedings - 2nd International Conference on Advanced Computing, Networking and Security, ADCONS 2013, 2013, Vol., , pp.253-258 | en_US |
dc.identifier.uri | http://idr.nitk.ac.in/jspui/handle/123456789/8385 | - |
dc.description.abstract | Public-Key Infrastructure (PKI) provides robust and scalable security services like authentication and non-repudiation using digital certificates. An efficient key management is necessary for a long term implementation of PKI. As a part of key management, key pair of all the entities within the PKI system is updated regularly to minimize overuse of keys and to comply with the organization's policies. In a hierarchical PKI system, root Certificate Authority (CA) is the highest trust anchor and hence updating its key pair is a challenging task. It requires proper authentication of certificate issuing entities to its subordinates and storage of keys for future reference. This paper discusses the various mechanisms available for updating root CA key pairs and brings out pros and cons in each. Considering the shortcomings of these methods, a new method for key pair update has been proposed, which is less complex and easy to implement. In addition, some of the open-source tools available to implement these techniques and open challenges which need to be addressed to have been highlighted. � 2013 IEEE. | en_US |
dc.title | Key update mechanism in PKI: Study & a new approach | en_US |
dc.type | Book chapter | en_US |
Appears in Collections: | 2. Conference Papers |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.