Key Chain YANG Data Model
draft-acee-rtg-yang-key-chain-09
Document | Type |
Replaced Internet-Draft
(individual)
Expired & archived
|
|
---|---|---|---|
Authors | Acee Lindem , Yingzhen Qu , Derek M. Yeung , Ing-Wher (Helen) Chen , Zhaohui (Jeffrey) Zhang , Yi Yang | ||
Last updated | 2015-10-15 | ||
Replaced by | draft-ietf-rtgwg-yang-key-chain | ||
RFC stream | (None) | ||
Intended RFC status | (None) | ||
Formats | |||
Stream | Stream state | (No stream defined) | |
Consensus boilerplate | Unknown | ||
RFC Editor Note | (None) | ||
IESG | IESG state | Replaced by draft-ietf-rtgwg-yang-key-chain | |
Telechat date | (None) | ||
Responsible AD | (None) | ||
Send notices to | (None) |
This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:
Abstract
This document describes the key chain YANG data model. A key chain is a list of elements each containing a key, send lifetime, accept lifetime, and algorithm. By properly overlapping the send and accept lifetimes of multiple key chain elements, keys and algorithms may be gracefully updated. By representing them in a YANG data model, key distribution can be automated. Key chains are commonly used for routing protocol authentication and other applications. In some applications, the protocols do not use the key chain element key directly, but rather a key derivation function is used to derive a short-lived key from the key chain element key.
Authors
Acee Lindem
Yingzhen Qu
Derek M. Yeung
Ing-Wher (Helen) Chen
Zhaohui (Jeffrey) Zhang
Yi Yang
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)