SIDR | O. Muravskiy |
Internet-Draft | T. Bruijnzeels |
Intended status: Informational | RIPE NCC |
Expires: January 9, 2017 | July 8, 2016 |
RPKI Certificate Tree Validation by a Relying Party Tool
draft-ietf-sidr-rpki-tree-validation-01
This document describes the approach to validate the content of the RPKI certificate tree, as used by the RIPE NCC RPKI Validator. This approach is independent of a particular object retrieval mechanism. This allows it to be used with repositories available over the rsync protocol, the RPKI Repository Delta Protocol, and repositories that use a mix of both.
This algorithm does not rely on content of repository directories, but uses the Authority Key Identifier (AKI) field of a manifest and a certificate revocation list (CRL) objects to discover manifest and CRL objects issued by a particular Certificate Authority (CA). It further uses the hashes of manifest entries to discover other objects issued by the CA.
This Internet-Draft is submitted in full conformance with the provisions of BCP 78 and BCP 79.
Internet-Drafts are working documents of the Internet Engineering Task Force (IETF). Note that other groups may also distribute working documents as Internet-Drafts. The list of current Internet-Drafts is at http://datatracker.ietf.org/drafts/current/.
Internet-Drafts are draft documents valid for a maximum of six months and may be updated, replaced, or obsoleted by other documents at any time. It is inappropriate to use Internet-Drafts as reference material or to cite them other than as "work in progress."
This Internet-Draft will expire on January 9, 2017.
Copyright (c) 2016 IETF Trust and the persons identified as the document authors. All rights reserved.
This document is subject to BCP 78 and the IETF Trust's Legal Provisions Relating to IETF Documents (http://trustee.ietf.org/license-info) in effect on the date of publication of this document. Please review these documents carefully, as they describe your rights and restrictions with respect to this document. Code Components extracted from this document must include Simplified BSD License text as described in Section 4.e of the Trust Legal Provisions and are provided without warranty as described in the Simplified BSD License.
In order to use information published in RPKI repositories, Relying Parties (RP) need to retrieve and validate the content of certificates, CRLs, and other RPKI signed objects. To validate a particular object, one must ensure that all certificates in the certificate chain up to the Trust Anchor (TA) are valid. Therefore the validation of a certificate tree is usually performed top-down, starting from the TA certificate and descending down the certificate chain, validating every encountered certificate and its products. The result of this process is a list of all encountered RPKI objects with a validity status attached to each of them. These results may later be used by a Relying Party in taking routing decisions, etc.
Traditionally RPKI data is made available to RPs through the repositories [RFC6481] accessible over rsync protocol. Relying parties are advised to keep a local copy of repository data, and perform regular updates of this copy from the repository (Section 5 of [RFC6481]). The RPKI Repository Delta Protocol [I-D.ietf-sidr-delta-protocol] introduces another method to fetch repository data and keep the local copy up to date with the repository.
This document describes how the RIPE NCC RPKI Validator discovers RPKI objects to download, builds certificate paths, and validates RPKI objects, independently from what repository access protocol is used. To achieve this, it puts downloaded RPKI objects in an object store, where objects could be found by their URI, hash of their content, value of the object's AKI field, or combination of these. It also keeps track of download and validation time for every object, to perform cleanups of the local copy.
This algorithm relies on the properties of the file hash algorithm (defined in [RFC6485]) to compute the hash of repository objects. It assumes that any two objects for which the hash value is the same, are identical.
The hash comparison is used when matching objects in the repository with entries on the manifest, and when looking up objects in the object store (Section 5).
There are several possible ways of discovering products of a CA certificate: one could use all objects located in a repository directory designated as a publication point for a CA, or only objects mentioned on the manifest located at that publication point (see Section 6 of [RFC6486]), or use all objects whose AKI field matches the SKI field of a CA certificate.
Since the current set of RPKI standards requires use of the manifest [RFC6486] to describe the content of a publication point, this implementation requires a consistency between the publication point content and manifest content. Therefore it will not use in the validation process objects that are found in the publication point but do not match any of the entries of that publication point's manifest (see Section 3.2.2). It will also issue warnings for all found mismatches, so that the responsible operators could be made aware of inconsistencies and fix them.
The following steps are performed in order to fetch the Trust Anchor Certificate:
The following steps describe the validation of a single resource certificate:
For every entry in the manifest object:
At the end of the TA tree validation the store cleanup is performed:
Shortening the time interval used in step 2 will free disk space used by the store, to the expense of downloading removed objects again if they are still published in the repository.
Extending the time interval used in step 3 will prevent repeated downloads of repository objects, with the risk that such objects, if created massively by mistake or adversely, will fill up local disk space, if they are not cleaned up promptly.
The fetcher is responsible for downloading objects from remote repositories (described in Section 3 of [RFC6481]) using rsync protocol ([rsync]), or RPKI Repository Delta Protocol (RRDP) ([I-D.ietf-sidr-delta-protocol]).
For every successfully visited URI the fetcher keeps track of the last time it happened.
This operation receives one parameter – a URI. For rsync protocol this URI points to a directory in a remote repository. For RRDP repository it points to the repository's notification file.
The fetcher performs following steps:
The time interval used in the step 1 should be chosen based on the acceptable delay in receiving repository updates.
This operation receives one parameter – a URI that points to an object in a repository.
The fetcher performs following operations:
Put given object in the store, along with its type, URI, hash, and AKI, if there is no record with the same hash and URI fields.
Retrieve all objects from the store whose hash attribute matches the given hash.
Retrieve from the store all objects of type certificate, whose URI attribute matches the given URI.
Retrieve from the store all objects of type manifest, whose AKI attribute matches the given AKI.
For a given URI, delete all objects in the store with matching URI attribute.
For a given URI and a list of hashes, delete all objects in the store with matching URI, whose hash attribute is not in the given list of hashes.
For all objects in the store whose hash attribute matches the given hash, set the last validation time attribute to the given timestamp.
This document describes the algorithm as it is implemented by the software development team at the RIPE NCC. The authors would also like to acknowledge contributions by Carlos Martinez, Andy Newton, and Rob Austein.
This document has no actions for IANA.
This implementation will not detect possible hash collisions in the hashes of repository objects (calculated using the file hash algorithm specified in [RFC6485]), and considers objects with same hash values as identical.
This algorithm uses the content of a manifest object to discover other objects issued by a specified CA. It verifies that the manifest is located in the publication point designated in the CA Certificate. However, if there are other (not listed in the manifest) objects located in that publication point directory, they will be ignored, even if their content is correct and they are issued by the same CA as the manifest.
In contrast, objects whose content hash matches the hash listed in the manifest, but that are not located in the publication directory listed in their CA certificate, will be used in the validation process (although a warning will be issued in that case).
The store cleanup procedure described in Section 3.3 tries to minimise removal and subsequent re-fetch of objects that are published in a repository but not used in the validation. Once such objects are removed from the remote repository, they will be discarded from the local object store after a period of time specified by a local policy. By generating an excessive amount of syntactically valid RPKI objects, a man-in-the-middle attack between a validating tool and a repository could force an implementation to fetch and store those objects in the object store before they are validated and discarded, leading to an out-of-memory or out-of-disk-space conditions, and, subsequently, a denial of service.
[I-D.ietf-sidr-delta-protocol] | Bruijnzeels, T., Muravskiy, O., Weber, B., Austein, R. and D. Mandelberg, RPKI Repository Delta Protocol", Internet-Draft draft-ietf-sidr-delta-protocol-02, March 2016. |
[rsync] | Rsync home page" | , "