Composite Keys and Signatures For Use In Internet PKI
draft-ounsworth-pq-composite-sigs-00

Document Type Active Internet-Draft (individual)
Last updated 2019-03-08
Stream (None)
Intended RFC status (None)
Formats plain text xml pdf html bibtex
Stream Stream state (No stream defined)
Consensus Boilerplate Unknown
RFC Editor Note (None)
IESG IESG state I-D Exists
Telechat date
Responsible AD (None)
Send notices to (None)
LAMPS                                                       M. Ounsworth
Internet-Draft                                                 S. Mister
Intended status: Standards Track                                 J. Gray
Expires: September 9, 2019                              Entrust Datacard
                                                              S. Fluhrer
                                                           P. Kampanakis
                                                           Cisco Systems
                                                          March 08, 2019

         Composite Keys and Signatures For Use In Internet PKI
                  draft-ounsworth-pq-composite-sigs-00

Abstract

   With the widespread adoption of post-quantum cryptography will come
   the need for an entity to possess multiple public keys on different
   cryptographic algorithms.  Since the trustworthiness of individual
   post-quantum algorithms is at question, a multi-key cryptographic
   operation will need to be performed in such a way that breaking it
   requires breaking each of the component algorithms individually.
   This requires defining new structures for holding composite public
   keys and composite signature data.

   This document defines the structures CompositePublicKey,
   CompositeSignatureAlgorithmParams, and CompositeSignatureValue which
   are sequences of the respective structure for each component
   algorithm.  This document also defines algorithms for generating and
   verifying composite signatures.  This document makes no assumptions
   about what the component algorithms are, provided that their
   algorithm identifiers and signature generation and verification
   algorithms are defined.

Status of This Memo

   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 https://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."

Ounsworth, et al.       Expires September 9, 2019               [Page 1]
Internet-Draft             PQ Composite Certs                 March 2019

   This Internet-Draft will expire on September 9, 2019.

Copyright Notice

   Copyright (c) 2019 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
   (https://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.

Table of Contents

   1.  Introduction  . . . . . . . . . . . . . . . . . . . . . . . .   3
   2.  Terminology . . . . . . . . . . . . . . . . . . . . . . . . .   4
   3.  Definitions and notation  . . . . . . . . . . . . . . . . . .   4
     3.1.  Definitions . . . . . . . . . . . . . . . . . . . . . . .   4
     3.2.  Notation  . . . . . . . . . . . . . . . . . . . . . . . .   5
   4.  Composite Structures  . . . . . . . . . . . . . . . . . . . .   5
     4.1.  Composite Public Key  . . . . . . . . . . . . . . . . . .   5
     4.2.  Composite Signature Algorithm . . . . . . . . . . . . . .   6
     4.3.  Encoding Composite Structures As Octet Strings and Bit
           Strings . . . . . . . . . . . . . . . . . . . . . . . . .   6
   5.  Composite Signature Algorithm . . . . . . . . . . . . . . . .   7
     5.1.  Composite Signature Generation  . . . . . . . . . . . . .   7
     5.2.  Composite Signature Verification  . . . . . . . . . . . .   7
   6.  Mechanisms to distribute verification policy to clients . . .   9
     6.1.  Local verifier policy . . . . . . . . . . . . . . . . . .   9
     6.2.  Extra metadata in the public key or signature . . . . . .   9
     6.3.  Extra metadata in the certificate . . . . . . . . . . . .  10
     6.4.  Policy certificate issued by the Certificate Authority  .  10
     6.5.  Policy constraints in a cross-certificate . . . . . . . .  10
     6.6.  Revoked Algorithms CRL Extension  . . . . . . . . . . . .  10
       6.6.1.  Implicit Revocation . . . . . . . . . . . . . . . . .  11
   7.  New Algorithm Identifiers . . . . . . . . . . . . . . . . . .  12
   8.  In Practice . . . . . . . . . . . . . . . . . . . . . . . . .  12
Show full document text