YANG Data Model for Key Chains

Yanze Qu, Dit‐Yan Yeung, I‐Jen Chen, J. Zhang2017 · DOI

TL;DR

This paper introduces a YANG data model for managing cryptographic key chains, a crucial component for securing network protocols. By standardizing key chain configurations, this model enables automated key distribution and graceful key updates, significantly enhancing network security and operational efficiency.

What Problem Does This Paper Address?

In modern networking, securing communication between devices is paramount. Many routing protocols and other network applications rely on symmetric keys for authentication and encryption. Managing these keys, especially when they need to be updated or rotated without disrupting service (a process called "key rollover"), is a complex and error-prone task. Traditionally, this management has been vendor-specific, leading to interoperability issues and manual configuration burdens. The problem is the lack of a standardized, machine-readable way to define and manage these key chains, which hinders automation and consistent security practices across diverse network environments.

Methods

The core contribution of this paper is the definition of a YANG (Yet Another Next Generation) data model for key chains. YANG is a data modeling language used for configuring and managing network devices. The proposed model defines a key-chain as a list of key elements. Each key can contain:

  • Key ID: A unique identifier for the key.
  • Key String: The actual secret key material.
  • Crypto Algorithm: The cryptographic algorithm to be used with the key (e.g., HMAC-SHA-256).
  • Lifetimes: This is a key innovation. The model supports defining send and accept lifetimes, which can be:
  • Always valid: The key is perpetually active.
  • Start and end times: Explicitly defined validity periods.
  • Duration: A key is valid for a specified duration from its activation.
  • Independent Send/Accept Lifetimes: Crucially, the model allows for separate send and accept lifetimes. This is essential for graceful key rollover, where a new key might be accepted for a period before it's used for sending, ensuring a smooth transition.

The model also includes features for optional elements like accept-tolerance and aes-key-wrap for enhanced security and flexibility.

Datasets

Not discussed in the paper. This paper defines a data model, not an experiment that uses datasets.

Key Insights and Ideas

  • Standardization is Key: A standardized YANG model for key chains is essential for interoperability and automation across different network vendors.
  • Graceful Key Rollover: The ability to define independent send and accept lifetimes is critical for implementing secure and non-disruptive key updates. This allows for a transition period where new keys are accepted before they are actively used for transmission, preventing service interruptions.
  • Flexibility through Features: The use of YANG features allows vendors to implement only the capabilities they support, such as hexadecimal key strings or acceptance tolerance, while still adhering to the core model.
  • Security by Design: The model incorporates security considerations, such as the recommendation to use AES key wrapping for sensitive key strings and the inclusion of less secure algorithms only for backward compatibility.

Key Results

The primary "result" of this paper is the definition of a robust and flexible YANG data model for key chains. This model provides the foundation for:

  • Automated Key Distribution: Network devices can be configured with key chain information programmatically, reducing manual effort and errors.
  • Enhanced Security: Consistent application of cryptographic algorithms and lifetimes across the network.
  • Simplified Key Management: A clear and structured way to manage the lifecycle of cryptographic keys.
  • Support for Key Rollover: The model explicitly facilitates graceful key updates, a critical operational requirement.

The paper includes example YANG configurations demonstrating simple key chains, keys with different lifetimes, and independent send/accept lifetimes, illustrating the model's practical application.

Limitations and Future Work

The authors acknowledge that the YANG key chain model described herein does not include key selection criteria. However, they point to other work (like [YANG-CRYPTO-KEYTABLE]) that describes augmentations to support such criteria. Future work could involve further integration with other security-related YANG models and expanding the set of supported cryptographic algorithms. The paper also emphasizes the importance of implementing security best practices when handling keys, even with the provided model.

Summary updated

Abstract

This document describes the key chain YANG data model. Key chains are commonly used for routing protocol authentication and other applications requiring symmetric keys. A key chain is a list containing one or more elements containing a Key ID, key string, send/accept lifetimes, and the associated authentication or encryption algorithm. By properly overlapping the send and accept lifetimes of multiple key chain elements, key strings and algorithms may be gracefully updated. By representing them in a YANG data model, key distribution can be automated.
BibTeX
@misc{qu2017yang,
  author = {Yanze Qu and Dit‐Yan Yeung and I‐Jen Chen and J. Zhang},
  title = {{YANG Data Model for Key Chains}},
  year = {2017},
  doi = {10.17487/rfc8177},
}
Figure