The "id-" prefix for Digest Algorithms
draft-polli-id-digest-algorithms-01

Document Type Active Internet-Draft (individual)
Author Roberto Polli 
Last updated 2020-12-18
Stream (None)
Intended RFC status (None)
Formats plain text html xml pdf htmlized (tools) htmlized 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)
Network Working Group                                           R. Polli
Internet-Draft     Digital Transformation Department, Italian Government
Intended status: Standards Track                        18 December 2020
Expires: 21 June 2021

                 The "id-" prefix for Digest Algorithms
                  draft-polli-id-digest-algorithms-01

Abstract

   This document defines the "id-" prefix for digest-algorithms used in
   the Digest HTTP field.  This prefix explicits that the value of the
   digest-algorithm is independent from Content-Encoding.

Note to Readers

   _RFC EDITOR: please remove this section before publication_

   Discussion of this draft takes place on the HTTP working group
   mailing list (ietf-http-wg@w3.org), which is archived at
   https://lists.w3.org/Archives/Public/ietf-http-wg/
   (https://lists.w3.org/Archives/Public/ietf-http-wg/).

   The source code and issues list for this draft can be found at
   https://github.com/ioggstream/draft-polli-Retry-Scope
   (https://github.com/ioggstream/draft-polli-Retry-Scope).

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."

   This Internet-Draft will expire on 21 June 2021.

Polli                     Expires 21 June 2021                  [Page 1]
Internet-Draft   The "id-" prefix for Digest Algorithms    December 2020

Copyright Notice

   Copyright (c) 2020 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  . . . . . . . . . . . . . . . . . . . . . . . .   2
     1.1.  Notational Conventions  . . . . . . . . . . . . . . . . .   3
   2.  The "id-" prefix for digest-algorithms  . . . . . . . . . . .   3
   3.  Security Considerations . . . . . . . . . . . . . . . . . . .   4
     3.1.  Disclosure of encrypted content . . . . . . . . . . . . .   4
   4.  IANA Considerations . . . . . . . . . . . . . . . . . . . . .   4
     4.1.  TBD how to reserve "id-" prefix?  . . . . . . . . . . . .   4
   5.  Examples  . . . . . . . . . . . . . . . . . . . . . . . . . .   4
     5.1.  The id-crc32c digest-algorithm  . . . . . . . . . . . . .   4
   6.  Normative References  . . . . . . . . . . . . . . . . . . . .   4
   Appendix A.  Acknowledgements . . . . . . . . . . . . . . . . . .   5
   FAQ . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .   5
   Code Samples  . . . . . . . . . . . . . . . . . . . . . . . . . .   5
   Change Log  . . . . . . . . . . . . . . . . . . . . . . . . . . .   6
   Author's Address  . . . . . . . . . . . . . . . . . . . . . . . .   6

1.  Introduction

   The [DIGEST] defines a way to convey a checksum of a representation-
   data as specified in [SEMANTICS].

   As the representation data depends on the value of "Content-
   Encoding", it is useful to convey the checksum value of a
   representation without any content-coding applied.

   This proposal introduces the "id-" prefix to specify that the
   provided digest-algorithm value is computed on the representation-
   data without any content-coding applied.

Polli                     Expires 21 June 2021                  [Page 2]
Internet-Draft   The "id-" prefix for Digest Algorithms    December 2020

1.1.  Notational Conventions

   The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT",
   "SHOULD", "SHOULD NOT", "RECOMMENDED", "NOT RECOMMENDED", "MAY", and
   "OPTIONAL" in this document are to be interpreted as described in
   BCP 14 [RFC2119] [RFC8174] when, and only when, they appear in all
   capitals, as shown here.  These words may also appear in this
   document in lower case as plain English words, absent their normative
   meanings.

   This document uses the Augmented BNF defined in [RFC5234] and updated
   by [RFC7405].

   The definitions "representation", "selected representation",
Show full document text