The Named Information (ni) URI Scheme: Optional Features
draft-hallambaker-decade-ni-params-02

The information below is for an old version of the document
Document Type Active Internet-Draft (individual)
Last updated 2012-04-23
Stream (None)
Intended RFC status (None)
Formats plain text 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)
Internet Engineering Task Force                          P. Hallam-Baker
Internet-Draft                                         Comodo Group Inc.
Intended status: Standards Track                            R. Stradling
Expires: October 25, 2012                                 Comodo CA Ltd.
                                                              S. Farrell
                                                  Trinity College Dublin
                                                             D. Kutscher
                                                                     NEC
                                                               B. Ohlman
                                                                Ericsson
                                                          April 23, 2012

        The Named Information (ni) URI Scheme: Optional Features
                 draft-hallambaker-decade-ni-params-02

Abstract

   This document specifies optional things that one can do with "ni"
   URIs and related names.  Those include an additional hash algorithm
   for handling dynamic content, some specific query-strong parameters
   for ni URIs and a mechanism for embedding ni URIs into QR codes.

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 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 October 25, 2012.

Copyright Notice

   Copyright (c) 2012 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

Hallam-Baker, et al.    Expires October 25, 2012                [Page 1]
Internet-Draft            More ni Name Features               April 2012

   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.  Additional Algorithm  . . . . . . . . . . . . . . . . . . . . . 3
     2.1.  Hashed Dynamic Content  . . . . . . . . . . . . . . . . . . 3
   3.  Query String Paramaeters  . . . . . . . . . . . . . . . . . . . 4
     3.1.  Digest with Content Type  . . . . . . . . . . . . . . . . . 4
     3.2.  Additional Locators . . . . . . . . . . . . . . . . . . . . 5
     3.3.  Digest with Decryption Key  . . . . . . . . . . . . . . . . 6
     3.4.  Wrapped URL . . . . . . . . . . . . . . . . . . . . . . . . 7
   4.  QR Codes  . . . . . . . . . . . . . . . . . . . . . . . . . . . 7
   5.  Security Considerations . . . . . . . . . . . . . . . . . . . . 7
   6.  IANA Considerations . . . . . . . . . . . . . . . . . . . . . . 7
     6.1.  Additional algorithm in RFCXXXX registry  . . . . . . . . . 7
     6.2.  Creation of ni parameter registry . . . . . . . . . . . . . 7
   7.  Normative References  . . . . . . . . . . . . . . . . . . . . . 8
   Authors' Addresses  . . . . . . . . . . . . . . . . . . . . . . . . 8

Hallam-Baker, et al.    Expires October 25, 2012                [Page 2]
Internet-Draft            More ni Name Features               April 2012

1.  Introduction

   The ni URI scheme [nischeme] supports extensibility in terms of the
   algorithm used to derive a value (normally, but not always a strong
   digest algorithm) and via support for a query-string thay can contain
   a list of key=value pairs.  This document defines some uses for both
   of these extensibility points and creates IANA registries that can be
   used to register additional algorithms and key strings for use in the
   query part of an ni name.  We [[will]] also define a way to embed ni
   names in QR codes.

   The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT",
   "SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this
   document are to be interpreted as described in RFC 2119 [RFC2119].

   [[Comments are included in double-square brackets, like this.]]

   [[Note that the features here are less mature than the specification
   in the [nischeme] document.  The intent is to develop these as
Show full document text