Key Chain YANG Data Model
draft-acee-rtg-yang-key-chain-09

Document Type Replaced Internet-Draft (individual)
Authors Acee Lindem  , Yingzhen Qu  , Derek Yeung  , Ing-Wher Chen  , Zhaohui Zhang  , Yi Yang 
Last updated 2015-10-15
Replaced by RFC 8177
Stream (None)
Intended RFC status (None)
Formats
Expired & archived
plain text pdf htmlized bibtex
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
Responsible AD (None)
Send notices to (None)

This Internet-Draft is no longer active. A copy of the expired Internet-Draft can be found at
https://www.ietf.org/archive/id/draft-acee-rtg-yang-key-chain-09.txt

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 (acee@cisco.com)
Yingzhen Qu (yiqu@cisco.com)
Derek Yeung (myeung@cisco.com)
Ing-Wher Chen (ing-wher.chen@ericsson.com)
Zhaohui Zhang (zzhang@juniper.net)
Yi Yang (yiya@cisco.com)

(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)