| 1 |
<pre>Internet Engineering Task Force (IETF) S. Farrell |
| 2 |
Request for Comments: 6920 Trinity College Dublin |
| 3 |
Category: Standards Track D. Kutscher |
| 4 |
ISSN: 2070-1721 NEC |
| 5 |
C. Dannewitz |
| 6 |
University of Paderborn |
| 7 |
B. Ohlman |
| 8 |
A. Keranen |
| 9 |
Ericsson |
| 10 |
P. Hallam-Baker |
| 11 |
Comodo Group Inc. |
| 12 |
April 2013 |
| 13 |
|
| 14 |
|
| 15 |
<span class="h1">Naming Things with Hashes</span> |
| 16 |
|
| 17 |
Abstract |
| 18 |
|
| 19 |
This document defines a set of ways to identify a thing (a digital |
| 20 |
object in this case) using the output from a hash function. It |
| 21 |
specifies a new URI scheme for this purpose, a way to map these to |
| 22 |
HTTP URLs, and binary and human-speakable formats for these names. |
| 23 |
The various formats are designed to support, but not require, a |
| 24 |
strong link to the referenced object, such that the referenced object |
| 25 |
may be authenticated to the same degree as the reference to it. The |
| 26 |
reason for this work is to standardise current uses of hash outputs |
| 27 |
in URLs and to support new information-centric applications and other |
| 28 |
uses of hash outputs in protocols. |
| 29 |
|
| 30 |
Status of This Memo |
| 31 |
|
| 32 |
This is an Internet Standards Track document. |
| 33 |
|
| 34 |
This document is a product of the Internet Engineering Task Force |
| 35 |
(IETF). It represents the consensus of the IETF community. It has |
| 36 |
received public review and has been approved for publication by the |
| 37 |
Internet Engineering Steering Group (IESG). Further information on |
| 38 |
Internet Standards is available in <a href="./rfc5741#section-2">Section 2 of RFC 5741</a>. |
| 39 |
|
| 40 |
Information about the current status of this document, any errata, |
| 41 |
and how to provide feedback on it may be obtained at |
| 42 |
<a href="http://www.rfc-editor.org/info/rfc6920">http://www.rfc-editor.org/info/rfc6920</a>. |
| 43 |
|
| 44 |
|
| 45 |
|
| 46 |
|
| 47 |
|
| 48 |
|
| 49 |
|
| 50 |
|
| 51 |
|
| 52 |
<span class="grey">Farrell, et al. Standards Track [Page 1]</span></pre> |
| 53 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-2" ></span> |
| 54 |
<span class="grey"><a href="./rfc6920">RFC 6920</a> Naming Things with Hashes April 2013</span> |
| 55 |
|
| 56 |
|
| 57 |
Copyright Notice |
| 58 |
|
| 59 |
Copyright (c) 2013 IETF Trust and the persons identified as the |
| 60 |
document authors. All rights reserved. |
| 61 |
|
| 62 |
This document is subject to <a href="https://www.rfc-editor.org/bcp/bcp78">BCP 78</a> and the IETF Trust's Legal |
| 63 |
Provisions Relating to IETF Documents |
| 64 |
(<a href="http://trustee.ietf.org/license-info">http://trustee.ietf.org/license-info</a>) in effect on the date of |
| 65 |
publication of this document. Please review these documents |
| 66 |
carefully, as they describe your rights and restrictions with respect |
| 67 |
to this document. Code Components extracted from this document must |
| 68 |
include Simplified BSD License text as described in Section 4.e of |
| 69 |
the Trust Legal Provisions and are provided without warranty as |
| 70 |
described in the Simplified BSD License. |
| 71 |
|
| 72 |
Table of Contents |
| 73 |
|
| 74 |
<a href="#section-1">1</a>. Introduction . . . . . . . . . . . . . . . . . . . . . . . . . <a href="#page-3">3</a> |
| 75 |
<a href="#section-2">2</a>. Hashes Are What Count . . . . . . . . . . . . . . . . . . . . <a href="#page-4">4</a> |
| 76 |
<a href="#section-3">3</a>. Named Information (ni) URI Format . . . . . . . . . . . . . . <a href="#page-6">6</a> |
| 77 |
<a href="#section-3.1">3.1</a>. Content Type Query String Attribute . . . . . . . . . . . <a href="#page-8">8</a> |
| 78 |
<a href="#section-4">4</a>. .well-known URI . . . . . . . . . . . . . . . . . . . . . . . <a href="#page-9">9</a> |
| 79 |
<a href="#section-5">5</a>. URL Segment Format . . . . . . . . . . . . . . . . . . . . . . <a href="#page-10">10</a> |
| 80 |
<a href="#section-6">6</a>. Binary Format . . . . . . . . . . . . . . . . . . . . . . . . <a href="#page-10">10</a> |
| 81 |
<a href="#section-7">7</a>. Human-Speakable (nih) URI Format . . . . . . . . . . . . . . . <a href="#page-11">11</a> |
| 82 |
<a href="#section-8">8</a>. Examples . . . . . . . . . . . . . . . . . . . . . . . . . . . <a href="#page-13">13</a> |
| 83 |
<a href="#section-8.1">8.1</a>. Hello World! . . . . . . . . . . . . . . . . . . . . . . . <a href="#page-13">13</a> |
| 84 |
<a href="#section-8.2">8.2</a>. Public Key Examples . . . . . . . . . . . . . . . . . . . <a href="#page-13">13</a> |
| 85 |
<a href="#section-8.3">8.3</a>. nih Usage Example . . . . . . . . . . . . . . . . . . . . <a href="#page-14">14</a> |
| 86 |
<a href="#section-9">9</a>. IANA Considerations . . . . . . . . . . . . . . . . . . . . . <a href="#page-15">15</a> |
| 87 |
<a href="#section-9.1">9.1</a>. Assignment of ni URI Scheme . . . . . . . . . . . . . . . <a href="#page-15">15</a> |
| 88 |
<a href="#section-9.2">9.2</a>. Assignment of nih URI Scheme . . . . . . . . . . . . . . . <a href="#page-15">15</a> |
| 89 |
<a href="#section-9.3">9.3</a>. Assignment of .well-known 'ni' URI . . . . . . . . . . . . <a href="#page-16">16</a> |
| 90 |
<a href="#section-9.4">9.4</a>. Creation of Named Information Hash Algorithm Registry . . <a href="#page-16">16</a> |
| 91 |
<a href="#section-9.5">9.5</a>. Creation of Named Information Parameter Registry . . . . . <a href="#page-18">18</a> |
| 92 |
<a href="#section-10">10</a>. Security Considerations . . . . . . . . . . . . . . . . . . . <a href="#page-18">18</a> |
| 93 |
<a href="#section-11">11</a>. Acknowledgments . . . . . . . . . . . . . . . . . . . . . . . <a href="#page-20">20</a> |
| 94 |
<a href="#section-12">12</a>. References . . . . . . . . . . . . . . . . . . . . . . . . . . <a href="#page-20">20</a> |
| 95 |
<a href="#section-12.1">12.1</a>. Normative References . . . . . . . . . . . . . . . . . . . <a href="#page-20">20</a> |
| 96 |
<a href="#section-12.2">12.2</a>. Informative References . . . . . . . . . . . . . . . . . . <a href="#page-21">21</a> |
| 97 |
|
| 98 |
|
| 99 |
|
| 100 |
|
| 101 |
|
| 102 |
|
| 103 |
|
| 104 |
|
| 105 |
|
| 106 |
|
| 107 |
|
| 108 |
<span class="grey">Farrell, et al. Standards Track [Page 2]</span></pre> |
| 109 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-3" ></span> |
| 110 |
<span class="grey"><a href="./rfc6920">RFC 6920</a> Naming Things with Hashes April 2013</span> |
| 111 |
|
| 112 |
|
| 113 |
<span class="h2"><a class="selflink" id="section-1" href="#section-1">1</a>. Introduction</span> |
| 114 |
|
| 115 |
Identifiers -- names or locators -- are used in various protocols to |
| 116 |
identify resources. In many scenarios, those identifiers contain |
| 117 |
values that are obtained from hash functions. Different deployments |
| 118 |
have chosen different ways to include the hash function outputs in |
| 119 |
their identifiers, resulting in interoperability problems. |
| 120 |
|
| 121 |
This document defines the "Named Information" identifier, which |
| 122 |
provides a set of standard ways to use hash function outputs in |
| 123 |
names. We begin with a few example uses for various ways to include |
| 124 |
hash function output in a name, with the specifics defined later in |
| 125 |
this document. Figure 1 shows an example of the Named Information |
| 126 |
(ni) URI scheme that this document defines. |
| 127 |
|
| 128 |
ni:///sha-256;UyaQV-Ev4rdLoHyJJWCi11OHfrYv9E1aGQAlMO2X_-Q |
| 129 |
|
| 130 |
Figure 1: Example ni URI |
| 131 |
|
| 132 |
Hash function outputs can be used to ensure uniqueness in terms of |
| 133 |
mapping URIs [<a href="./rfc3986" title=""Uniform Resource Identifier (URI): Generic Syntax"">RFC3986</a>] to a specific resource or to make URIs hard to |
| 134 |
guess for security reasons. Since there is no standard way to |
| 135 |
interpret those strings today, in general only the creator of the URI |
| 136 |
knows how to use the hash function output. Other protocols, such as |
| 137 |
application-layer protocols for accessing "smart objects" in |
| 138 |
constrained environments, also require more compact (e.g., binary) |
| 139 |
forms of such identifiers. In yet other situations, people may have |
| 140 |
to speak such values, e.g., in a voice call (see <a href="#section-8.3">Section 8.3</a>), in |
| 141 |
order to confirm the presence or absence of a resource. |
| 142 |
|
| 143 |
As another example, protocols for accessing in-network storage |
| 144 |
servers need a way to identify stored resources uniquely and in a |
| 145 |
location-independent way so that replicas on different servers can be |
| 146 |
accessed by the same name. Also, such applications may require |
| 147 |
verification that a resource representation that has been obtained |
| 148 |
actually corresponds to the name that was used to request the |
| 149 |
resource, i.e., verifying the binding between the data and the name, |
| 150 |
which is here termed "name-data integrity". |
| 151 |
|
| 152 |
Similarly, in the context of information-centric networking |
| 153 |
[<a href="#ref-NETINF-ARCHITECTURE">NETINF-ARCHITECTURE</a>] [<a href="#ref-CCN" title=""Networking Named Content"">CCN</a>] and elsewhere, there is value in being |
| 154 |
able to compare a presented resource against the URI that was used to |
| 155 |
access that resource. If a cryptographically strong comparison |
| 156 |
function can be used, then this allows for many forms of in-network |
| 157 |
storage, without requiring as much trust in the infrastructure used |
| 158 |
to present the resource. The outputs of hash functions can be used |
| 159 |
in this manner, if they are presented in a standard way. |
| 160 |
|
| 161 |
|
| 162 |
|
| 163 |
|
| 164 |
<span class="grey">Farrell, et al. Standards Track [Page 3]</span></pre> |
| 165 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-4" ></span> |
| 166 |
<span class="grey"><a href="./rfc6920">RFC 6920</a> Naming Things with Hashes April 2013</span> |
| 167 |
|
| 168 |
|
| 169 |
Additional applications might include creating references from web |
| 170 |
pages delivered over HTTP/TLS; DNS resource records signed using |
| 171 |
DNSSEC or data values embedded in certificates, Certificate |
| 172 |
Revocation Lists (CRLs), or other signed data objects. |
| 173 |
|
| 174 |
The Named Identifier can be represented in a number of ways: using |
| 175 |
the ni URI scheme that we specifically define for the name (which is |
| 176 |
very similar to the "magnet link" that is informally defined in other |
| 177 |
protocols [<a href="#ref-Magnet" title=""Magnet URI scheme"">Magnet</a>]), or using other mechanisms also defined herein. |
| 178 |
However it is represented, the Named Identifier *names* a resource, |
| 179 |
and the mechanism used to dereference the name and to *locate* the |
| 180 |
named resource needs to be known by the entity that dereferences it. |
| 181 |
|
| 182 |
Media content-type, alternative locations for retrieval, and other |
| 183 |
additional information about a resource named using this scheme can |
| 184 |
be provided using a query string. "The Named Information (ni) URI |
| 185 |
Scheme: Optional Features" [<a href="#ref-DECPARAMS">DECPARAMS</a>] describes specific values that |
| 186 |
can be used in such query strings for these various purposes and |
| 187 |
other extensions to this basic format specification. |
| 188 |
|
| 189 |
In addition, we define a ".well-known" URL equivalent, a way to |
| 190 |
include a hash as a segment of an HTTP URL, a binary format for use |
| 191 |
in protocols that require more compact names, and a human-speakable |
| 192 |
text form that could be used, e.g., for reading out (parts of) the |
| 193 |
name over a voice connection. |
| 194 |
|
| 195 |
Not all uses of these names require use of the full hash output -- |
| 196 |
truncated hashes can be safely used in some environments. For this |
| 197 |
reason, we define a new IANA registry for hash functions to be used |
| 198 |
with this specification so as not to mix strong and weak (truncated) |
| 199 |
hash algorithms in other protocol registries. |
| 200 |
|
| 201 |
The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", |
| 202 |
"SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this |
| 203 |
document are to be interpreted as described in <a href="./rfc2119">RFC 2119</a> [<a href="./rfc2119" title=""Key words for use in RFCs to Indicate Requirement Levels"">RFC2119</a>]. |
| 204 |
|
| 205 |
Syntax definitions in this memo are specified according to ABNF |
| 206 |
[<a href="./rfc5234" title=""Augmented BNF for Syntax Specifications: ABNF"">RFC5234</a>]. |
| 207 |
|
| 208 |
<span class="h2"><a class="selflink" id="section-2" href="#section-2">2</a>. Hashes Are What Count</span> |
| 209 |
|
| 210 |
This section contains basic considerations related to how we use hash |
| 211 |
function outputs that are common to all formats. |
| 212 |
|
| 213 |
When comparing two names of the form defined here, an implementation |
| 214 |
MUST only consider the digest algorithm and the digest value, i.e., |
| 215 |
it MUST NOT consider other fields defined below (such as an authority |
| 216 |
field from a URI or any parameters). Implementations MUST consider |
| 217 |
|
| 218 |
|
| 219 |
|
| 220 |
<span class="grey">Farrell, et al. Standards Track [Page 4]</span></pre> |
| 221 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-5" ></span> |
| 222 |
<span class="grey"><a href="./rfc6920">RFC 6920</a> Naming Things with Hashes April 2013</span> |
| 223 |
|
| 224 |
|
| 225 |
two hashes identical, regardless of encoding, if the decoded hashes |
| 226 |
are based on the same algorithm and have the same length and the same |
| 227 |
binary value. In that case, the two names can be treated as |
| 228 |
referring to the same thing. |
| 229 |
|
| 230 |
The sha-256 algorithm as specified in [<a href="#ref-SHA-256" title=""Secure Hash Standard"">SHA-256</a>] is mandatory to |
| 231 |
implement; that is, implementations MUST be able to generate/send and |
| 232 |
to accept/process names based on a sha-256 hash. However, |
| 233 |
implementations MAY support additional hash algorithms and MAY use |
| 234 |
those for specific names, for example, in a constrained environment |
| 235 |
where sha-256 is non-optimal or where truncated names are needed to |
| 236 |
fit into corresponding protocols (when a higher collision probability |
| 237 |
can be tolerated). |
| 238 |
|
| 239 |
Truncated hashes MAY be supported. When a hash value is truncated, |
| 240 |
the name MUST indicate this. Therefore, we use different hash |
| 241 |
algorithm strings in these cases, such as sha-256-32 for a 32-bit |
| 242 |
truncation of a sha-256 output. A 32-bit truncated hash is |
| 243 |
essentially useless for security in almost all cases but might be |
| 244 |
useful for naming. With current best practices [<a href="./rfc3766" title=""Determining Strengths For Public Keys Used For Exchanging Symmetric Keys"">RFC3766</a>], very few, |
| 245 |
if any, applications making use of names with less than 100-bit |
| 246 |
hashes will have useful security properties. |
| 247 |
|
| 248 |
When a hash value is truncated to N bits, the leftmost N bits (that |
| 249 |
is, the most significant N bits in network byte order) from the |
| 250 |
binary representation of the hash value MUST be used as the truncated |
| 251 |
value. An example of a 128-bit hash output truncated to 32 bits is |
| 252 |
shown in Figure 2. |
| 253 |
|
| 254 |
128-bit hash: 0x265357902fe1b7e2a04b897c6025d7a2 |
| 255 |
32-bit truncated hash: 0x26535790 |
| 256 |
|
| 257 |
Figure 2: Example of Truncated Hash |
| 258 |
|
| 259 |
When the input to the hash algorithm is a public key value, as may be |
| 260 |
used by various security protocols, the hash SHOULD be calculated |
| 261 |
over the public key in an X.509 SubjectPublicKeyInfo structure |
| 262 |
(<a href="./rfc5280#section-4.1">Section 4.1 of [RFC5280]</a>). This input has been chosen primarily for |
| 263 |
compatibility with the DANE TSLA protocol [<a href="./rfc6698" title=""The DNS-Based Authentication of Named Entities (DANE) Transport Layer Security (TLS) Protocol: TLSA"">RFC6698</a>] but also includes |
| 264 |
any relevant public key parameters in the hash input, which is |
| 265 |
sometimes necessary for security reasons. This does not force use of |
| 266 |
X.509 or full compliance with [<a href="./rfc5280" title=""Internet X.509 Public Key Infrastructure Certificate and Certificate Revocation List (CRL) Profile"">RFC5280</a>] since formatting any public |
| 267 |
key as a SubjectPublicKeyInfo is relatively straightforward and well |
| 268 |
supported by libraries. |
| 269 |
|
| 270 |
Any of the formats defined below can be used to represent the |
| 271 |
resulting name for a public key. |
| 272 |
|
| 273 |
|
| 274 |
|
| 275 |
|
| 276 |
<span class="grey">Farrell, et al. Standards Track [Page 5]</span></pre> |
| 277 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-6" ></span> |
| 278 |
<span class="grey"><a href="./rfc6920">RFC 6920</a> Naming Things with Hashes April 2013</span> |
| 279 |
|
| 280 |
|
| 281 |
Other than in the aforementioned special case where public keys are |
| 282 |
used, we do not specify the hash function input here. Other |
| 283 |
specifications are expected to define this. |
| 284 |
|
| 285 |
<span class="h2"><a class="selflink" id="section-3" href="#section-3">3</a>. Named Information (ni) URI Format</span> |
| 286 |
|
| 287 |
A Named Information (ni) URI consists of the following nine |
| 288 |
components: |
| 289 |
|
| 290 |
Scheme Name: The scheme name is 'ni'. |
| 291 |
|
| 292 |
Colon and Slashes: The literal "://" |
| 293 |
|
| 294 |
Authority: The optional authority component may assist applications |
| 295 |
in accessing the object named by an ni URI. There is no default |
| 296 |
value for the authority field. (See <a href="./rfc3986#section-3.2.2">Section 3.2.2 of [RFC3986]</a> |
| 297 |
for details.) While ni names with and without an authority differ |
| 298 |
syntactically from ni names with different authorities, all three |
| 299 |
refer to the same object if and only if the digest algorithm, |
| 300 |
length, and value are the same. |
| 301 |
|
| 302 |
One slash: The literal "/" |
| 303 |
|
| 304 |
Digest Algorithm: The name of the digest algorithm, as specified in |
| 305 |
the IANA registry defined in <a href="#section-9.4">Section 9.4</a> below. |
| 306 |
|
| 307 |
Separator: The literal ";" |
| 308 |
|
| 309 |
Digest Value: The digest value MUST be encoded using the base64url |
| 310 |
[<a href="./rfc4648" title=""The Base16, Base32, and Base64 Data Encodings"">RFC4648</a>] encoding, with no "=" padding characters. |
| 311 |
|
| 312 |
Query Parameter separator '?': The query parameter separator acts as |
| 313 |
a separator between the digest value and the query parameters (if |
| 314 |
specified). For compatibility with Internationalized Resource |
| 315 |
Identifiers (IRIs), non-ASCII characters in the query part MUST be |
| 316 |
encoded as UTF-8, and the resulting octets MUST be percent-encoded |
| 317 |
(see <a href="./rfc3986#section-2.1">[RFC3986], Section 2.1</a>). |
| 318 |
|
| 319 |
Query Parameters: A "tag=value" list of optional query parameters as |
| 320 |
are used with HTTP URLs [<a href="./rfc2616" title=""Hypertext Transfer Protocol -- HTTP/1.1"">RFC2616</a>] with a separator character '&' |
| 321 |
between each. For example, "foo=bar&baz=bat". |
| 322 |
|
| 323 |
It is OPTIONAL for implementations to check the integrity of the URI/ |
| 324 |
resource mapping when sending, receiving, or processing ni URIs. |
| 325 |
|
| 326 |
Escaping of characters follows the rules in <a href="./rfc3986">RFC 3986</a>. This means |
| 327 |
that percent-encoding is used to distinguish between reserved and |
| 328 |
unreserved functions of the same character in the same URI component. |
| 329 |
|
| 330 |
|
| 331 |
|
| 332 |
<span class="grey">Farrell, et al. Standards Track [Page 6]</span></pre> |
| 333 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-7" ></span> |
| 334 |
<span class="grey"><a href="./rfc6920">RFC 6920</a> Naming Things with Hashes April 2013</span> |
| 335 |
|
| 336 |
|
| 337 |
As an example, an ampersand ('&') is used in the query part to |
| 338 |
separate attribute-value pairs; therefore, an ampersand in a value |
| 339 |
has to be escaped as '%26'. Note that the set of reserved characters |
| 340 |
differs for each component. As an example, a slash ('/') does not |
| 341 |
have any reserved function in a query part and therefore does not |
| 342 |
have to be escaped. However, it can still appear escaped as '%2f' or |
| 343 |
'%2F', and implementations have to be able to understand such escaped |
| 344 |
forms. Also note that any characters outside those allowed in the |
| 345 |
respective URI component have to be escaped. |
| 346 |
|
| 347 |
The Named Information URI adapts the URI definition from the URI |
| 348 |
Generic Syntax [<a href="./rfc3986" title=""Uniform Resource Identifier (URI): Generic Syntax"">RFC3986</a>]. We start with the base URI production: |
| 349 |
|
| 350 |
URI = scheme ":" hier-part [ "?" query ] [ "#" fragment ] |
| 351 |
; from <a href="./rfc3986">RFC 3986</a> |
| 352 |
|
| 353 |
Figure 3: URI Syntax |
| 354 |
|
| 355 |
Then, we adapt that for the Named Information URI: |
| 356 |
|
| 357 |
NI-URI = ni-scheme ":" ni-hier-part [ "?" query ] |
| 358 |
; adapted from "URI" in <a href="./rfc3986">RFC 3986</a> |
| 359 |
; query is from <a href="./rfc3986#section-3.4">RFC 3986, Section 3.4</a> |
| 360 |
ni-scheme = "ni" |
| 361 |
ni-hier-part = "//" [ authority ] "/" alg-val |
| 362 |
; authority is from <a href="./rfc3986#section-3.2">RFC 3986, Section 3.2</a> |
| 363 |
alg-val = alg ";" val |
| 364 |
; adapted from "hier-part" in <a href="./rfc3986">RFC 3986</a> |
| 365 |
alg = 1*unreserved |
| 366 |
val = 1*unreserved |
| 367 |
; unreserved is from <a href="./rfc3986#section-2.3">RFC 3986, Section 2.3</a> |
| 368 |
|
| 369 |
Figure 4: ni Name Syntax |
| 370 |
|
| 371 |
The "val" field MUST contain the output of base64url encoding (with |
| 372 |
no "=" padding characters), the result of applying the hash function |
| 373 |
("alg") to its defined input, which defaults to the object bytes that |
| 374 |
are expected to be returned when the URI is dereferenced. |
| 375 |
|
| 376 |
Relative ni URIs can occur. In such cases, the algorithm in <a href="./rfc3986#section-5">Section</a> |
| 377 |
<a href="./rfc3986#section-5">5 of [RFC3986]</a> applies. As an example, in Figure 5, the absolute URI |
| 378 |
for "this third document" is "ni://example.com/sha-256-128;...". |
| 379 |
|
| 380 |
|
| 381 |
|
| 382 |
|
| 383 |
|
| 384 |
|
| 385 |
|
| 386 |
|
| 387 |
|
| 388 |
<span class="grey">Farrell, et al. Standards Track [Page 7]</span></pre> |
| 389 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-8" ></span> |
| 390 |
<span class="grey"><a href="./rfc6920">RFC 6920</a> Naming Things with Hashes April 2013</span> |
| 391 |
|
| 392 |
|
| 393 |
<html> |
| 394 |
<head> |
| 395 |
<title>ni: relative URI test</title> |
| 396 |
<base href="ni://example.com"> |
| 397 |
</head> |
| 398 |
|
| 399 |
<body> |
| 400 |
<p>Please check <a href="sha-256;f4OxZX...">this document</a>. |
| 401 |
and <a href="sha-256;UyaQV...">this other document</a>. |
| 402 |
and <a href="sha-256-128;...">this third document</a>. |
| 403 |
</p> |
| 404 |
</body> |
| 405 |
</html> |
| 406 |
|
| 407 |
Figure 5: Example HTML with Relative ni URI |
| 408 |
|
| 409 |
The authority field in an ni URI is not quite the same as that from |
| 410 |
an HTTP URL, even though the same values (e.g., DNS names) may be |
| 411 |
usefully used in both. For an ni URI, the authority does not control |
| 412 |
nearly as much of the structure of the "right-hand side" of the URI. |
| 413 |
With ni URIs we also define standard query string attributes and, of |
| 414 |
course, have a strictly defined way to include the hash value. |
| 415 |
|
| 416 |
Internationalisation of strings within ni names is handled exactly as |
| 417 |
for http URIs -- see <a href="./rfc2616#section-3.2.3">[RFC2616], Section 3.2.3</a>. |
| 418 |
|
| 419 |
<span class="h3"><a class="selflink" id="section-3.1" href="#section-3.1">3.1</a>. Content Type Query String Attribute</span> |
| 420 |
|
| 421 |
The semantics of a digest being used to establish a secure reference |
| 422 |
from an authenticated source to an external source may be a function |
| 423 |
of associated metadata such as the Content Type. The Content Type |
| 424 |
"ct" parameter specifies the MIME Content Type of the associated data |
| 425 |
as defined in [<a href="./rfc6838" title=""Media Type Specifications and Registration Procedures"">RFC6838</a>]. See <a href="#section-9.5">Section 9.5</a> for the associated IANA |
| 426 |
registry for ni parameter names as shown in Figure 6. |
| 427 |
Implementations of this specification MUST support parsing the "ct=" |
| 428 |
query string attribute name. |
| 429 |
|
| 430 |
ni:///sha-256-32;f4OxZQ?ct=text/plain |
| 431 |
|
| 432 |
Figure 6: Example ni URI with Content Type |
| 433 |
|
| 434 |
Protocols making use of ni URIs will need to specify how to verify |
| 435 |
name-data integrity for the MIME Content Types that they need to |
| 436 |
process and will need to take into account possible Content-Transfer- |
| 437 |
Encodings and other aspects of MIME encoding. |
| 438 |
|
| 439 |
|
| 440 |
|
| 441 |
|
| 442 |
|
| 443 |
|
| 444 |
<span class="grey">Farrell, et al. Standards Track [Page 8]</span></pre> |
| 445 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-9" ></span> |
| 446 |
<span class="grey"><a href="./rfc6920">RFC 6920</a> Naming Things with Hashes April 2013</span> |
| 447 |
|
| 448 |
|
| 449 |
Implementations of this specification SHOULD support name-data |
| 450 |
integrity validation for at least the application/octet-stream |
| 451 |
Content Type, with no explicit Content-Transfer-Encoding (which is |
| 452 |
equivalent to binary). Additional Content Types and Content- |
| 453 |
Transfer-Encodings can of course also be supported, but are OPTIONAL. |
| 454 |
Note that the hash is calculated after the Content-Transfer-Encoding |
| 455 |
is removed so it is applied to the raw data. |
| 456 |
|
| 457 |
If a) the user agent is sensitive to the Content Type and b) the ni |
| 458 |
name used has a "ct=" query string attribute and c) the object is |
| 459 |
retrieved (from a server) using a protocol that specifies a Content |
| 460 |
Type, then, if the two Content Types match, all is well. If, in this |
| 461 |
situation, the Content Types do not match, then the client SHOULD |
| 462 |
handle that situation as a potential security error. Content Type |
| 463 |
matching rules are defined in <a href="./rfc2045#section-5.1">[RFC2045], Section 5.1</a>. |
| 464 |
|
| 465 |
<span class="h2"><a class="selflink" id="section-4" href="#section-4">4</a>. .well-known URI</span> |
| 466 |
|
| 467 |
We define a mapping between URIs following the ni URI scheme and HTTP |
| 468 |
[<a href="./rfc2616" title=""Hypertext Transfer Protocol -- HTTP/1.1"">RFC2616</a>] or HTTPS [<a href="./rfc2818" title=""HTTP Over TLS"">RFC2818</a>] URLs that makes use of the .well-known |
| 469 |
URI [<a href="./rfc5785" title=""Defining Well-Known Uniform Resource Identifiers (URIs)"">RFC5785</a>] by defining an "ni" suffix (see <a href="#section-9">Section 9</a>). |
| 470 |
|
| 471 |
The HTTP(S) mapping MAY be used in any context where clients with |
| 472 |
support for ni URIs are not available. |
| 473 |
|
| 474 |
Since the .well-known name-space is not intended for general |
| 475 |
information retrieval, if an application dereferences a |
| 476 |
.well-known/ni URL via HTTP(S), then it will often receive a 3xx HTTP |
| 477 |
redirection response. A server responding to a request for a |
| 478 |
.well-known/ni URL will often therefore return a 3xx response, and a |
| 479 |
client sending such a request MUST be able to handle that, as should |
| 480 |
any fully compliant HTTP [<a href="./rfc2616" title=""Hypertext Transfer Protocol -- HTTP/1.1"">RFC2616</a>] client. |
| 481 |
|
| 482 |
For an ni name of the form "ni://n-authority/alg;val?query-string" |
| 483 |
the corresponding HTTP(S) URL produced by this mapping is |
| 484 |
"<a href="http://h-authority/.well-known/ni/alg/val?query-string">http://h-authority/.well-known/ni/alg/val?query-string</a>", where |
| 485 |
"h-authority" is derived as follows: If the ni name has a specified |
| 486 |
authority (i.e., the n-authority is non-empty), then the h-authority |
| 487 |
MUST have the same value. If the ni name has no authority specified |
| 488 |
(i.e., the n-authority string is empty), a h-authority value MAY be |
| 489 |
derived from the application context. For example, if the mapping is |
| 490 |
being done in the context of a web page, then the origin [<a href="./rfc6454" title=""The Web Origin Concept"">RFC6454</a>] |
| 491 |
for that web site can be used. Of course, in general there are no |
| 492 |
guarantees that the object named by the ni URI will be available via |
| 493 |
the corresponding HTTP(S) URL. But in the case that any data is |
| 494 |
returned, the retriever can determine whether or not it is content |
| 495 |
that matches the ni URI. |
| 496 |
|
| 497 |
|
| 498 |
|
| 499 |
|
| 500 |
<span class="grey">Farrell, et al. Standards Track [Page 9]</span></pre> |
| 501 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-10" ></span> |
| 502 |
<span class="grey"><a href="./rfc6920">RFC 6920</a> Naming Things with Hashes April 2013</span> |
| 503 |
|
| 504 |
|
| 505 |
If an application is presented with an HTTP(S) URL with |
| 506 |
"/.well-known/ni/" as the start of its pathname component, then the |
| 507 |
reverse mapping to an ni URI either including or excluding the |
| 508 |
authority might produce an ni URI that is meaningful. However, there |
| 509 |
is no guarantee that this will be the case. |
| 510 |
|
| 511 |
When mapping from an ni URI to a .well-known URL, an implementation |
| 512 |
will have to decide between choosing an "http" or "https" URL. If |
| 513 |
the object referenced does in fact match the hash in the URL, then |
| 514 |
there is arguably no need for additional data integrity, if the ni |
| 515 |
URI or .well-known URL was received "securely." However, TLS also |
| 516 |
provides confidentiality, so there can still be reasons to use the |
| 517 |
"https" URL scheme even in this case. Additionally, web server |
| 518 |
policy such as [<a href="./rfc6797" title=""HTTP Strict Transport Security (HSTS)"">RFC6797</a>] may dictate that data only be available over |
| 519 |
"https". In general, however, whether to use "http" or "https" is |
| 520 |
something that needs to be decided by the application. |
| 521 |
|
| 522 |
<span class="h2"><a class="selflink" id="section-5" href="#section-5">5</a>. URL Segment Format</span> |
| 523 |
|
| 524 |
Some applications may benefit from using hashes in existing HTTP URLs |
| 525 |
or other URLs. To do this, one simply uses the "alg-val" production |
| 526 |
from the ni name scheme ABNF, which may be included, for example, in |
| 527 |
the pathname, query string, or even fragment components of HTTP URLs |
| 528 |
[<a href="./rfc2616" title=""Hypertext Transfer Protocol -- HTTP/1.1"">RFC2616</a>]. In such cases, there is nothing present in the URL that |
| 529 |
ensures that a client can depend on compliance with this |
| 530 |
specification, so clients MUST NOT assume that any URL with a |
| 531 |
pathname component that matches the "alg-val" production was in fact |
| 532 |
produced as a result of this specification. That URL might or might |
| 533 |
not be related to this specification, only the context will tell. |
| 534 |
|
| 535 |
<span class="h2"><a class="selflink" id="section-6" href="#section-6">6</a>. Binary Format</span> |
| 536 |
|
| 537 |
If a more space-efficient version of the name is needed, the |
| 538 |
following binary format can be used. The binary format name consists |
| 539 |
of two fields: a header and the hash value. The header field defines |
| 540 |
how the identifier has been created, and the hash value contains a |
| 541 |
(possibly truncated) result of a one-way hash over whatever is being |
| 542 |
identified by the hash value. The binary format of a name is shown |
| 543 |
in Figure 7. |
| 544 |
|
| 545 |
|
| 546 |
|
| 547 |
|
| 548 |
|
| 549 |
|
| 550 |
|
| 551 |
|
| 552 |
|
| 553 |
|
| 554 |
|
| 555 |
|
| 556 |
<span class="grey">Farrell, et al. Standards Track [Page 10]</span></pre> |
| 557 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-11" ></span> |
| 558 |
<span class="grey"><a href="./rfc6920">RFC 6920</a> Naming Things with Hashes April 2013</span> |
| 559 |
|
| 560 |
|
| 561 |
0 1 2 3 |
| 562 |
0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 |
| 563 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 564 |
|Res| Suite ID | Hash Value / |
| 565 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 566 |
/ ... / |
| 567 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |
| 568 |
/ ... | |
| 569 |
+-+-+-+-+-+-+-+-+ |
| 570 |
|
| 571 |
Figure 7: Binary Name Format |
| 572 |
|
| 573 |
The Res field is a reserved 2-bit field for future use and MUST be |
| 574 |
set to zero for this specification and ignored on receipt. |
| 575 |
|
| 576 |
The hash algorithm and truncation length are specified by the Suite |
| 577 |
ID. For maintaining efficient encoding for the binary format, only a |
| 578 |
few hash algorithms and truncation lengths are supported. See |
| 579 |
<a href="#section-9.4">Section 9.4</a> for details. |
| 580 |
|
| 581 |
A hash value that is truncated to 120 bits will result in the overall |
| 582 |
name being a 128-bit value, which may be useful for protocols that |
| 583 |
can easily use 128-bit identifiers. |
| 584 |
|
| 585 |
<span class="h2"><a class="selflink" id="section-7" href="#section-7">7</a>. Human-Speakable (nih) URI Format</span> |
| 586 |
|
| 587 |
Sometimes a resource may need to be referred to via a name in a |
| 588 |
format that is easy for humans to read out and less likely to be |
| 589 |
ambiguous when heard. This is intended to be usable, for example, |
| 590 |
over the phone in order to confirm the (current or future) presence |
| 591 |
or absence of a resource. This "confirmation" use-case described |
| 592 |
further in <a href="#section-8.3">Section 8.3</a> is the main current use-case for Named |
| 593 |
Information for Humans (nih) URIs. ("nih" also means "Not Invented |
| 594 |
Here", which is clearly false, and therefore worth including |
| 595 |
[<a href="./rfc5513" title=""IANA Considerations for Three Letter Acronyms"">RFC5513</a>]. :-) |
| 596 |
|
| 597 |
The ni URI format is not well-suited for this, as, for example, |
| 598 |
base64url uses both uppercase and lowercase, which can easily cause |
| 599 |
confusion. For this particular purpose ("speaking" the value of a |
| 600 |
hash output), the more verbose but less ambiguous (when spoken) nih |
| 601 |
URI scheme is defined. |
| 602 |
|
| 603 |
The justification for nih being a URI scheme is that it can help a |
| 604 |
user agent for the speaker to better display the value or help a |
| 605 |
machine to better speak or recognise the value when spoken. We do |
| 606 |
not include the query string since there is no way to ensure that its |
| 607 |
value might be spoken unambiguously and similarly for the authority, |
| 608 |
where, e.g., some internationalised forms of domain name might not be |
| 609 |
|
| 610 |
|
| 611 |
|
| 612 |
<span class="grey">Farrell, et al. Standards Track [Page 11]</span></pre> |
| 613 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-12" ></span> |
| 614 |
<span class="grey"><a href="./rfc6920">RFC 6920</a> Naming Things with Hashes April 2013</span> |
| 615 |
|
| 616 |
|
| 617 |
easy to speak and comprehend easily. This leaves the hash value as |
| 618 |
the only part of the ni URI that we feel can be usefully included. |
| 619 |
But since speakers or listeners (or speech recognition) may err, we |
| 620 |
also include a checkdigit to catch common errors and allow for the |
| 621 |
inclusion of "-" separators to make nih URIs easier to read out. |
| 622 |
|
| 623 |
Fields in nih URIs are separated by a semicolon (;) character. The |
| 624 |
first field is a hash algorithm string, as in the ni URI format. The |
| 625 |
hash value is represented using lowercase ASCII hex characters; for |
| 626 |
example, an octet with the decimal value 58 (0x3A) is encoded as |
| 627 |
'3a'. This is the same as base16 encoding as defined in <a href="./rfc4648">RFC 4648</a> |
| 628 |
[<a href="./rfc4648" title=""The Base16, Base32, and Base64 Data Encodings"">RFC4648</a>] except using lowercase letters. Separators ("-" |
| 629 |
characters) MAY be interspersed in the hash value in any way to make |
| 630 |
those easier to read, typically grouping four or six characters with |
| 631 |
a separator between. |
| 632 |
|
| 633 |
The hash value MAY be followed by a semicolon ';' then a checkdigit. |
| 634 |
The checkdigit MUST be calculated using Luhn's mod N algorithm (with |
| 635 |
N=16) as defined in [<a href="#ref-ISOIEC7812">ISOIEC7812</a>] (see also [<a href="#ref-Luhn" title=""Luhn mod N algorithm"">Luhn</a>]). The input to the |
| 636 |
calculation is the ASCII hex-encoded hash value (i.e., "sepval" in |
| 637 |
the ABNF production below) but with all "-" separator characters |
| 638 |
first stripped out. This maps the ASCII hex so that '0'=0, ...'9'=9, |
| 639 |
'a'=10, ...'f'=15. None of the other fields, nor any "-" separators, |
| 640 |
are input when calculating the checkdigit. |
| 641 |
|
| 642 |
humanname = "nih:" alg-sepval [ ";" checkdigit ] |
| 643 |
alg-sepval = alg ";" sepval |
| 644 |
sepval = 1*(ahlc / "-") |
| 645 |
ahlc = DIGIT / "a" / "b" / "c" / "d" / "e" / "f" |
| 646 |
; DIGIT is defined in <a href="./rfc5234">RFC 5234</a> and is 0-9 |
| 647 |
checkdigit = ahlc |
| 648 |
|
| 649 |
Figure 8: Human-Speakable Syntax |
| 650 |
|
| 651 |
For algorithms that have a Suite ID reserved (see Figure 11), the alg |
| 652 |
field MAY contain the ID value as an ASCII-encoded decimal number |
| 653 |
instead of the hash name string (for example, "3" instead of |
| 654 |
"sha-256-120"). Implementations MUST be able to match the decimal ID |
| 655 |
values for the algorithms and hash lengths that they support, even if |
| 656 |
they do not support the binary format. |
| 657 |
|
| 658 |
There is no such thing as a relative nih URI. |
| 659 |
|
| 660 |
|
| 661 |
|
| 662 |
|
| 663 |
|
| 664 |
|
| 665 |
|
| 666 |
|
| 667 |
|
| 668 |
<span class="grey">Farrell, et al. Standards Track [Page 12]</span></pre> |
| 669 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-13" ></span> |
| 670 |
<span class="grey"><a href="./rfc6920">RFC 6920</a> Naming Things with Hashes April 2013</span> |
| 671 |
|
| 672 |
|
| 673 |
<span class="h2"><a class="selflink" id="section-8" href="#section-8">8</a>. Examples</span> |
| 674 |
|
| 675 |
<span class="h3"><a class="selflink" id="section-8.1" href="#section-8.1">8.1</a>. Hello World!</span> |
| 676 |
|
| 677 |
The following ni URI is generated from the text "Hello World!" (12 |
| 678 |
characters without the quotes), using the sha-256 algorithm shown |
| 679 |
with and without an authority field: |
| 680 |
|
| 681 |
ni:///sha-256;f4OxZX_x_FO5LcGBSKHWXfwtSx-j1ncoSt3SABJtkGk |
| 682 |
|
| 683 |
ni://example.com/sha-256;f4OxZX_x_FO5LcGBSKHWXfwtSx-j1ncoSt3SABJtkGk |
| 684 |
|
| 685 |
The following HTTP URL represents a mapping from the previous ni name |
| 686 |
based on the algorithm outlined above. |
| 687 |
|
| 688 |
http://example.com/.well-known/ni/sha-256/ |
| 689 |
f4OxZX_x_FO5LcGBSKHWXfwtSx-j1ncoSt3SABJtkGk |
| 690 |
|
| 691 |
<span class="h3"><a class="selflink" id="section-8.2" href="#section-8.2">8.2</a>. Public Key Examples</span> |
| 692 |
|
| 693 |
Given the DER-encoded SubjectPublicKeyInfo in Figure 9, we derive the |
| 694 |
names shown in Figure 10 for this value. |
| 695 |
|
| 696 |
0000000 30 82 01 22 30 0d 06 09 2a 86 48 86 f7 0d 01 01 |
| 697 |
0000020 01 05 00 03 82 01 0f 00 30 82 01 0a 02 82 01 01 |
| 698 |
0000040 00 a2 5f 83 da 9b d9 f1 7a 3a 36 67 ba fd 5a 94 |
| 699 |
0000060 0e cf 16 d5 5a 55 3a 5e d4 03 b1 65 8e 6d cf a3 |
| 700 |
0000100 b7 db a4 e7 cc 0f 52 c6 7d 35 1d c4 68 c2 bd 7b |
| 701 |
0000120 9d db e4 0a d7 10 cd f9 53 20 ee 0d d7 56 6e 5b |
| 702 |
0000140 7a ae 2c 5f 83 0a 19 3c 72 58 96 d6 86 e8 0e e6 |
| 703 |
0000160 94 eb 5c f2 90 3e f3 a8 8a 88 56 b6 cd 36 38 76 |
| 704 |
0000200 22 97 b1 6b 3c 9c 07 f3 4f 97 08 a1 bc 29 38 9b |
| 705 |
0000220 81 06 2b 74 60 38 7a 93 2f 39 be 12 34 09 6e 0b |
| 706 |
0000240 57 10 b7 a3 7b f2 c6 ee d6 c1 e5 ec ae c5 9c 83 |
| 707 |
0000260 14 f4 6b 58 e2 de f2 ff c9 77 07 e3 f3 4c 97 cf |
| 708 |
0000300 1a 28 9e 38 a1 b3 93 41 75 a1 a4 76 3f 4d 78 d7 |
| 709 |
0000320 44 d6 1a e3 ce e2 5d c5 78 4c b5 31 22 2e c7 4b |
| 710 |
0000340 8c 6f 56 78 5c a1 c4 c0 1d ca e5 b9 44 d7 e9 90 |
| 711 |
0000360 9c bc ee b0 a2 b1 dc da 6d a0 0f f6 ad 1e 2c 12 |
| 712 |
0000400 a2 a7 66 60 3e 36 d4 91 41 c2 f2 e7 69 39 2c 9d |
| 713 |
0000420 d2 df b5 a3 44 95 48 7c 87 64 89 dd bf 05 01 ee |
| 714 |
0000440 dd 02 03 01 00 01 |
| 715 |
|
| 716 |
0000000 53 26 90 57 e1 2f e2 b7 4b a0 7c 89 25 60 a2 d7 |
| 717 |
0000020 53 87 7e b6 2f f4 4d 5a 19 00 25 30 ed 97 ff e4 |
| 718 |
|
| 719 |
Figure 9: A SubjectPublicKeyInfo Used in Examples |
| 720 |
and Its sha-256 Hash |
| 721 |
|
| 722 |
|
| 723 |
|
| 724 |
<span class="grey">Farrell, et al. Standards Track [Page 13]</span></pre> |
| 725 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-14" ></span> |
| 726 |
<span class="grey"><a href="./rfc6920">RFC 6920</a> Naming Things with Hashes April 2013</span> |
| 727 |
|
| 728 |
|
| 729 |
+-------------------------------------------------------------------+ |
| 730 |
| URI: | |
| 731 |
| ni:///sha-256;UyaQV-Ev4rdLoHyJJWCi11OHfrYv9E1aGQAlMO2X_-Q | |
| 732 |
+-------------------------------------------------------------------+ |
| 733 |
| .well-known URL (split over 2 lines): | |
| 734 |
| http://example.com/.well-known/ni/sha256/ | |
| 735 |
| UyaQV-Ev4rdLoHyJJWCi11OHfrYv9E1aGQAlMO2X_-Q | |
| 736 |
+-------------------------------------------------------------------+ |
| 737 |
| URL Segment: | |
| 738 |
| sha-256;UyaQV-Ev4rdLoHyJJWCi11OHfrYv9E1aGQAlMO2X_-Q | |
| 739 |
+-------------------------------------------------------------------+ |
| 740 |
| Binary name (ASCII hex encoded) with 120-bit truncated hash value | |
| 741 |
| which is Suite ID 0x03: | |
| 742 |
| 0353 2690 57e1 2fe2 b74b a07c 8925 60a2 | |
| 743 |
+-------------------------------------------------------------------+ |
| 744 |
| Human-speakable form of a name for this key (truncated to 120 bits| |
| 745 |
| in length) with checkdigit: | |
| 746 |
| nih:sha-256-120;5326-9057-e12f-e2b7-4ba0-7c89-2560-a2;f | |
| 747 |
+-------------------------------------------------------------------+ |
| 748 |
| Human-speakable form of a name for this key (truncated to 32 bits | |
| 749 |
| in length) with checkdigit and no "-" separators: | |
| 750 |
| nih:sha-256-32;53269057;b | |
| 751 |
+-------------------------------------------------------------------+ |
| 752 |
| Human-speakable form using decimal presentation of the | |
| 753 |
| algorithm ID (sha-256-120) with checkdigit: | |
| 754 |
| nih:3;532690-57e12f-e2b74b-a07c89-2560a2;f | |
| 755 |
+-------------------------------------------------------------------+ |
| 756 |
|
| 757 |
Figure 10: Example Names |
| 758 |
|
| 759 |
<span class="h3"><a class="selflink" id="section-8.3" href="#section-8.3">8.3</a>. nih Usage Example</span> |
| 760 |
|
| 761 |
Alice has set up a server node with an RSA key pair. She uses an ni |
| 762 |
URI as the name for the public key that corresponds to the private |
| 763 |
key on that box. Alice's node might identify itself using that ni |
| 764 |
URI in some protocol. |
| 765 |
|
| 766 |
Bob would like to believe that it's really Alice's node when his node |
| 767 |
interacts with the network and asks his friend Alice to tell him what |
| 768 |
public key she uses. Alice hits the "tell someone the name of the |
| 769 |
public key" button on her admin user interface and that displays the |
| 770 |
nih URI and says "tell this to your buddy". She phones Bob and reads |
| 771 |
the nih URI to him. |
| 772 |
|
| 773 |
|
| 774 |
|
| 775 |
|
| 776 |
|
| 777 |
|
| 778 |
|
| 779 |
|
| 780 |
<span class="grey">Farrell, et al. Standards Track [Page 14]</span></pre> |
| 781 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-15" ></span> |
| 782 |
<span class="grey"><a href="./rfc6920">RFC 6920</a> Naming Things with Hashes April 2013</span> |
| 783 |
|
| 784 |
|
| 785 |
Bob types that in to his "manage known nodes" admin application (or |
| 786 |
lets that application listen to part of the call), which can |
| 787 |
regenerate the ni URI and store that or some equivalent. Then when |
| 788 |
Bob's node interacts with Alice's node, it can more safely accept a |
| 789 |
signature or encrypt data to Alice's node. |
| 790 |
|
| 791 |
<span class="h2"><a class="selflink" id="section-9" href="#section-9">9</a>. IANA Considerations</span> |
| 792 |
|
| 793 |
<span class="h3"><a class="selflink" id="section-9.1" href="#section-9.1">9.1</a>. Assignment of ni URI Scheme</span> |
| 794 |
|
| 795 |
The procedures for registration of a URI scheme are specified in <a href="./rfc4395">RFC</a> |
| 796 |
<a href="./rfc4395">4395</a> [<a href="./rfc4395" title=""Guidelines and Registration Procedures for New URI Schemes"">RFC4395</a>]. The following assignment has been made. |
| 797 |
|
| 798 |
URI scheme name: ni |
| 799 |
|
| 800 |
Status: Permanent |
| 801 |
|
| 802 |
URI scheme syntax: See <a href="#section-3">Section 3</a>. |
| 803 |
|
| 804 |
URI scheme semantics: See <a href="#section-3">Section 3</a>. |
| 805 |
|
| 806 |
Encoding considerations: See <a href="#section-3">Section 3</a>. |
| 807 |
|
| 808 |
Applications/protocols that use this URI scheme name: |
| 809 |
|
| 810 |
General applicability. |
| 811 |
|
| 812 |
Interoperability considerations: Defined here. |
| 813 |
|
| 814 |
Security considerations: See <a href="#section-10">Section 10</a>. |
| 815 |
|
| 816 |
Contact: Stephen Farrell, [email protected] |
| 817 |
|
| 818 |
Author/Change controller: IETF |
| 819 |
|
| 820 |
References: As specified in this document |
| 821 |
|
| 822 |
<span class="h3"><a class="selflink" id="section-9.2" href="#section-9.2">9.2</a>. Assignment of nih URI Scheme</span> |
| 823 |
|
| 824 |
The procedures for registration of a URI scheme are specified in <a href="./rfc4395">RFC</a> |
| 825 |
<a href="./rfc4395">4395</a> [<a href="./rfc4395" title=""Guidelines and Registration Procedures for New URI Schemes"">RFC4395</a>]. The following assignment has been made. |
| 826 |
|
| 827 |
URI scheme name: nih |
| 828 |
|
| 829 |
Status: Permanent |
| 830 |
|
| 831 |
URI scheme syntax: See <a href="#section-7">Section 7</a>. |
| 832 |
|
| 833 |
|
| 834 |
|
| 835 |
|
| 836 |
<span class="grey">Farrell, et al. Standards Track [Page 15]</span></pre> |
| 837 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-16" ></span> |
| 838 |
<span class="grey"><a href="./rfc6920">RFC 6920</a> Naming Things with Hashes April 2013</span> |
| 839 |
|
| 840 |
|
| 841 |
URI scheme semantics: See <a href="#section-7">Section 7</a>. |
| 842 |
|
| 843 |
Encoding considerations: See <a href="#section-7">Section 7</a>. |
| 844 |
|
| 845 |
Applications/protocols that use this URI scheme name: |
| 846 |
|
| 847 |
General applicability. |
| 848 |
|
| 849 |
Interoperability considerations: Defined here. |
| 850 |
|
| 851 |
Security considerations: See <a href="#section-10">Section 10</a>. |
| 852 |
|
| 853 |
Contact: Stephen Farrell, [email protected] |
| 854 |
|
| 855 |
Author/Change controller: IETF |
| 856 |
|
| 857 |
References: As specified in this document |
| 858 |
|
| 859 |
<span class="h3"><a class="selflink" id="section-9.3" href="#section-9.3">9.3</a>. Assignment of .well-known 'ni' URI</span> |
| 860 |
|
| 861 |
The procedures for registration of a Well-Known URI entry are |
| 862 |
specified in <a href="./rfc5785">RFC 5785</a> [<a href="./rfc5785" title=""Defining Well-Known Uniform Resource Identifiers (URIs)"">RFC5785</a>]. The following assignment has been |
| 863 |
made. |
| 864 |
|
| 865 |
URI suffix: ni |
| 866 |
|
| 867 |
Change controller: IETF |
| 868 |
|
| 869 |
Specification document(s): This document |
| 870 |
|
| 871 |
Related information: None |
| 872 |
|
| 873 |
<span class="h3"><a class="selflink" id="section-9.4" href="#section-9.4">9.4</a>. Creation of Named Information Hash Algorithm Registry</span> |
| 874 |
|
| 875 |
IANA has created a new registry for hash algorithms as used in the |
| 876 |
name formats specified here; it is called the "Named Information Hash |
| 877 |
Algorithm Registry". Future assignments are to be made through |
| 878 |
Expert Review [<a href="./rfc5226" title="">RFC5226</a>]. This registry has five fields: the suite |
| 879 |
ID, the hash algorithm name string, the truncation length, the |
| 880 |
underlying algorithm reference, and a status field that indicates if |
| 881 |
the algorithm is current or deprecated and should no longer be used. |
| 882 |
The status field can have the value "current" or "deprecated". Other |
| 883 |
values are reserved for possible future definition. |
| 884 |
|
| 885 |
If the status is "current", then that does not necessarily mean that |
| 886 |
the algorithm is "good" for any particular purpose, since the |
| 887 |
cryptographic strength requirements will be set by other applications |
| 888 |
or protocols. |
| 889 |
|
| 890 |
|
| 891 |
|
| 892 |
<span class="grey">Farrell, et al. Standards Track [Page 16]</span></pre> |
| 893 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-17" ></span> |
| 894 |
<span class="grey"><a href="./rfc6920">RFC 6920</a> Naming Things with Hashes April 2013</span> |
| 895 |
|
| 896 |
|
| 897 |
A request to mark an entry as "deprecated" can be done by sending a |
| 898 |
mail to the Designated Expert. Before approving the request, the |
| 899 |
community MUST be consulted via a "call for comments" of at least two |
| 900 |
weeks by sending a mail to the IETF discussion list. |
| 901 |
|
| 902 |
Initial values are specified below. The Designated Expert SHOULD |
| 903 |
generally approve additions that reference hash algorithms that are |
| 904 |
widely used in other IETF protocols. In addition, the Designated |
| 905 |
Expert SHOULD NOT accept additions where the underlying hash function |
| 906 |
(with no truncation) is considered weak for collisions. Part of the |
| 907 |
reasoning behind this last point is that inclusion of code for weak |
| 908 |
hash functions, e.g., the MD5 algorithm, can trigger costly false |
| 909 |
positives if code is audited for inclusion of obsolete ciphers. See |
| 910 |
[<a href="./rfc6149" title=""MD2 to Historic Status"">RFC6149</a>], [<a href="./rfc6150" title=""MD4 to Historic Status"">RFC6150</a>], and [<a href="./rfc6151" title=""Updated Security Considerations for the MD5 Message-Digest and the HMAC-MD5 Algorithms"">RFC6151</a>] for examples of some hash |
| 911 |
functions that are considered obsolete in this sense. |
| 912 |
|
| 913 |
The suite ID field ("ID") can be empty or can have values between 0 |
| 914 |
and 63, inclusive. Because there are only 64 possible values, this |
| 915 |
field is OPTIONAL (leaving it empty if omitted). Where the binary |
| 916 |
format is not expected to be used for a given hash algorithm, this |
| 917 |
field SHOULD be omitted. If an entry is registered without a suite |
| 918 |
ID, the Designated Expert MAY allow for later allocation of a suite |
| 919 |
ID, if that appears warranted. The Designated Expert MAY consult the |
| 920 |
community via a "call for comments" by sending a mail to the IETF |
| 921 |
discussion list before allocating a suite ID. |
| 922 |
|
| 923 |
ID Hash Name String Value Length Reference Status |
| 924 |
0 Reserved |
| 925 |
1 sha-256 256 bits [<a href="#ref-SHA-256" title=""Secure Hash Standard"">SHA-256</a>] current |
| 926 |
2 sha-256-128 128 bits [<a href="#ref-SHA-256" title=""Secure Hash Standard"">SHA-256</a>] current |
| 927 |
3 sha-256-120 120 bits [<a href="#ref-SHA-256" title=""Secure Hash Standard"">SHA-256</a>] current |
| 928 |
4 sha-256-96 96 bits [<a href="#ref-SHA-256" title=""Secure Hash Standard"">SHA-256</a>] current |
| 929 |
5 sha-256-64 64 bits [<a href="#ref-SHA-256" title=""Secure Hash Standard"">SHA-256</a>] current |
| 930 |
6 sha-256-32 32 bits [<a href="#ref-SHA-256" title=""Secure Hash Standard"">SHA-256</a>] current |
| 931 |
32 Reserved |
| 932 |
|
| 933 |
Figure 11: Suite Identifiers |
| 934 |
|
| 935 |
The Suite ID value 32 is reserved for compatibility with IPv6 |
| 936 |
addresses from the Special Purpose Address Registry [<a href="./rfc4773" title=""Administration of the IANA Special Purpose IPv6 Address Block"">RFC4773</a>], such |
| 937 |
as Overlay Routable Cryptographic Hash Identifiers (ORCHIDs) |
| 938 |
[<a href="./rfc4843" title=""An IPv6 Prefix for Overlay Routable Cryptographic Hash Identifiers (ORCHID)"">RFC4843</a>]. |
| 939 |
|
| 940 |
The referenced hash algorithm matching the Suite ID, truncated to the |
| 941 |
length indicated, according to the description given in <a href="#section-2">Section 2</a>, is |
| 942 |
used for generating the hash. The Designated Expert is responsible |
| 943 |
for ensuring that the document referenced for the hash algorithm |
| 944 |
meets the "specification required" rule. |
| 945 |
|
| 946 |
|
| 947 |
|
| 948 |
<span class="grey">Farrell, et al. Standards Track [Page 17]</span></pre> |
| 949 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-18" ></span> |
| 950 |
<span class="grey"><a href="./rfc6920">RFC 6920</a> Naming Things with Hashes April 2013</span> |
| 951 |
|
| 952 |
|
| 953 |
<span class="h3"><a class="selflink" id="section-9.5" href="#section-9.5">9.5</a>. Creation of Named Information Parameter Registry</span> |
| 954 |
|
| 955 |
IANA has created a new registry entitled "Named Information URI |
| 956 |
Parameter Definitions". |
| 957 |
|
| 958 |
The policy for future assignments to the registry is Expert Review, |
| 959 |
and as for the ni Hash Algorithm Registry above, the Designated |
| 960 |
Expert is responsible for ensuring that the document referenced for |
| 961 |
the parameter definition meets the "specification required" rule. |
| 962 |
|
| 963 |
The fields in this registry are the parameter name, a description, |
| 964 |
and a reference. The parameter name MUST be such that it is suitable |
| 965 |
for use as a query string parameter name in an ni URI. (See |
| 966 |
<a href="#section-3">Section 3</a>.) |
| 967 |
|
| 968 |
The initial contents of the registry are: |
| 969 |
|
| 970 |
Parameter Meaning Reference |
| 971 |
----------- -------------------------------------------- --------- |
| 972 |
ct Content Type [<a href="./rfc6920">RFC6920</a>] |
| 973 |
|
| 974 |
<span class="h2"><a class="selflink" id="section-10" href="#section-10">10</a>. Security Considerations</span> |
| 975 |
|
| 976 |
No secret information is required to generate or verify a name of the |
| 977 |
form described here. Therefore, a name like this can only provide |
| 978 |
evidence for the integrity of the referenced object, and the proof of |
| 979 |
integrity provided is only as good as the proof of integrity for the |
| 980 |
name from which we started. In other words, the hash value can |
| 981 |
provide a name-data integrity binding between the name and the bytes |
| 982 |
returned when the name is dereferenced using some protocol. |
| 983 |
|
| 984 |
Disclosure of a name value does not necessarily entail disclosure of |
| 985 |
the referenced object but may enable an attacker to determine the |
| 986 |
contents of the referenced object by reference to a search engine or |
| 987 |
other data repository or, for a highly formatted object with little |
| 988 |
variation, by simply guessing the value and checking if the digest |
| 989 |
value matches. So, the fact that these names contain hashes does not |
| 990 |
protect the confidentiality of the object that was input to the hash. |
| 991 |
|
| 992 |
The integrity of the referenced content would be compromised if a |
| 993 |
weak hash function were used. SHA-256 is currently our preferred |
| 994 |
hash algorithm; this is why we've added only SHA-256-based suites to |
| 995 |
the initial IANA registry. |
| 996 |
|
| 997 |
If a truncated hash value is used, certain security properties will |
| 998 |
be affected. In general, a hash algorithm is designed to produce |
| 999 |
sufficient bits to prevent a 'birthday attack' collision occurring. |
| 1000 |
Ensuring that the difficulty of discovering two pieces of content |
| 1001 |
|
| 1002 |
|
| 1003 |
|
| 1004 |
<span class="grey">Farrell, et al. Standards Track [Page 18]</span></pre> |
| 1005 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-19" ></span> |
| 1006 |
<span class="grey"><a href="./rfc6920">RFC 6920</a> Naming Things with Hashes April 2013</span> |
| 1007 |
|
| 1008 |
|
| 1009 |
that result in the same digest with a work factor O(2^x) by brute |
| 1010 |
force requires a digest length of 2x. Many security applications |
| 1011 |
only require protection against a second pre-image attack, which only |
| 1012 |
requires a digest length of x to achieve the same work factor. |
| 1013 |
Basically, the shorter the hash value used, the less security benefit |
| 1014 |
you can possibly get. |
| 1015 |
|
| 1016 |
An important thing to keep in mind is not to make the mistake of |
| 1017 |
thinking two names are the same when they aren't. For example, a |
| 1018 |
name with a 32-bit truncated sha-256 hash is not the same as a name |
| 1019 |
with the full 256 bits of hash output, even if the hash value for one |
| 1020 |
is a prefix of that for the other. |
| 1021 |
|
| 1022 |
The reason for this is that if an application treats these as the |
| 1023 |
same name, then that might open up a number of attacks. For example, |
| 1024 |
if I publish an object with the full hash, then I probably (in |
| 1025 |
general) don't want some other application to treat a name with just |
| 1026 |
the first 32 bits of that as referring to the same thing, since the |
| 1027 |
32-bit name will have lots of colliding objects. If ni or nih URIs |
| 1028 |
become widely used, there will be many cases where names will occur |
| 1029 |
more than once in application protocols, and it'll be unpredictable |
| 1030 |
which instance of the name would be used for name-data integrity |
| 1031 |
checking, thus leading to threats. For this reason, we require that |
| 1032 |
the algorithm, length, and value all match before we consider two |
| 1033 |
names to be the same. |
| 1034 |
|
| 1035 |
The fact that an ni URI includes a domain name in the authority field |
| 1036 |
by itself implies nothing about the relationship between the owner of |
| 1037 |
the domain name and any content referenced by that URI. While a |
| 1038 |
name-data integrity service can be provided using ni URIs, that does |
| 1039 |
not in any sense validate the authority part of the name. For |
| 1040 |
example, there is nothing to stop anyone from creating an ni URI |
| 1041 |
containing a hash of someone else's content. Application developers |
| 1042 |
MUST NOT assume any relationship between the registrant of the domain |
| 1043 |
name that is part of an ni URI and some matching content just because |
| 1044 |
the ni URI matches that content. |
| 1045 |
|
| 1046 |
If name-data integrity is successfully validated, and the hash is |
| 1047 |
strong and long enough, then the "web origin" [<a href="./rfc6454" title=""The Web Origin Concept"">RFC6454</a>] for the bytes |
| 1048 |
of the named object is really going to be the place from which you |
| 1049 |
get the ni name and not the place from which you get the bytes of the |
| 1050 |
object. This appears to offer a potential benefit if using ni names |
| 1051 |
for scripts included from a HTML page accessed via server- |
| 1052 |
authenticated https, for example. If name-data integrity is not |
| 1053 |
validated (and it is optional) or fails, then the web origin is, as |
| 1054 |
usual, the place from which the object bytes were received. |
| 1055 |
Applications making use of ni names SHOULD take this into account in |
| 1056 |
their trust models. |
| 1057 |
|
| 1058 |
|
| 1059 |
|
| 1060 |
<span class="grey">Farrell, et al. Standards Track [Page 19]</span></pre> |
| 1061 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-20" ></span> |
| 1062 |
<span class="grey"><a href="./rfc6920">RFC 6920</a> Naming Things with Hashes April 2013</span> |
| 1063 |
|
| 1064 |
|
| 1065 |
Some implementations might mishandle ni URIs that include non-base64 |
| 1066 |
characters, whitespace, or other non-conforming strings, and that |
| 1067 |
could lead to erroneously considering names to be the same when they |
| 1068 |
are not. An ni URI that is malformed in such ways MUST NOT be |
| 1069 |
treated as matching any other ni URI. Implementers need to check the |
| 1070 |
behaviour of libraries for such parsing problems. |
| 1071 |
|
| 1072 |
<span class="h2"><a class="selflink" id="section-11" href="#section-11">11</a>. Acknowledgments</span> |
| 1073 |
|
| 1074 |
This work has been supported by the EU FP7 project SAIL. The authors |
| 1075 |
would like to thank SAIL participants to our naming discussions, |
| 1076 |
especially Jean-Francois Peltier, for their input. |
| 1077 |
|
| 1078 |
The authors would also like to thank Carsten Bormann, Martin Duerst, |
| 1079 |
Tobias Heer, Bjoern Hoehrmann, Tero Kivinen, Barry Leiba, Larry |
| 1080 |
Masinter, David McGrew, Alexey Melnikov, Bob Moskowitz, Jonathan |
| 1081 |
Rees, Eric Rescorla, Zach Shelby, and Martin Thomas for their |
| 1082 |
comments and input to the document. Thanks, in particular, to James |
| 1083 |
Manger for correcting the examples. |
| 1084 |
|
| 1085 |
<span class="h2"><a class="selflink" id="section-12" href="#section-12">12</a>. References</span> |
| 1086 |
|
| 1087 |
<span class="h3"><a class="selflink" id="section-12.1" href="#section-12.1">12.1</a>. Normative References</span> |
| 1088 |
|
| 1089 |
[<a id="ref-ISOIEC7812">ISOIEC7812</a>] |
| 1090 |
ISO, "Identification cards -- Identification of issuers -- |
| 1091 |
Part 1: Numbering system", ISO/IEC 7812-1:2006, |
| 1092 |
October 2006, <<a href="http://www.iso.org/iso/iso_catalogue/catalogue_tc/catalogue_detail.htm?csnumber=39698">http://www.iso.org/iso/iso_catalogue/</a> |
| 1093 |
<a href="http://www.iso.org/iso/iso_catalogue/catalogue_tc/catalogue_detail.htm?csnumber=39698">catalogue_tc/catalogue_detail.htm?csnumber=39698</a>>. |
| 1094 |
|
| 1095 |
[<a id="ref-RFC2045">RFC2045</a>] Freed, N. and N. Borenstein, "Multipurpose Internet Mail |
| 1096 |
Extensions (MIME) Part One: Format of Internet Message |
| 1097 |
Bodies", <a href="./rfc2045">RFC 2045</a>, November 1996. |
| 1098 |
|
| 1099 |
[<a id="ref-RFC2119">RFC2119</a>] Bradner, S., "Key words for use in RFCs to Indicate |
| 1100 |
Requirement Levels", <a href="https://www.rfc-editor.org/bcp/bcp14">BCP 14</a>, <a href="./rfc2119">RFC 2119</a>, March 1997. |
| 1101 |
|
| 1102 |
[<a id="ref-RFC2616">RFC2616</a>] Fielding, R., Gettys, J., Mogul, J., Frystyk, H., |
| 1103 |
Masinter, L., Leach, P., and T. Berners-Lee, "Hypertext |
| 1104 |
Transfer Protocol -- HTTP/1.1", <a href="./rfc2616">RFC 2616</a>, June 1999. |
| 1105 |
|
| 1106 |
[<a id="ref-RFC2818">RFC2818</a>] Rescorla, E., "HTTP Over TLS", <a href="./rfc2818">RFC 2818</a>, May 2000. |
| 1107 |
|
| 1108 |
[<a id="ref-RFC3986">RFC3986</a>] Berners-Lee, T., Fielding, R., and L. Masinter, "Uniform |
| 1109 |
Resource Identifier (URI): Generic Syntax", STD 66, |
| 1110 |
<a href="./rfc3986">RFC 3986</a>, January 2005. |
| 1111 |
|
| 1112 |
|
| 1113 |
|
| 1114 |
|
| 1115 |
|
| 1116 |
<span class="grey">Farrell, et al. Standards Track [Page 20]</span></pre> |
| 1117 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-21" ></span> |
| 1118 |
<span class="grey"><a href="./rfc6920">RFC 6920</a> Naming Things with Hashes April 2013</span> |
| 1119 |
|
| 1120 |
|
| 1121 |
[<a id="ref-RFC4395">RFC4395</a>] Hansen, T., Hardie, T., and L. Masinter, "Guidelines and |
| 1122 |
Registration Procedures for New URI Schemes", <a href="https://www.rfc-editor.org/bcp/bcp35">BCP 35</a>, |
| 1123 |
<a href="./rfc4395">RFC 4395</a>, February 2006. |
| 1124 |
|
| 1125 |
[<a id="ref-RFC4648">RFC4648</a>] Josefsson, S., "The Base16, Base32, and Base64 Data |
| 1126 |
Encodings", <a href="./rfc4648">RFC 4648</a>, October 2006. |
| 1127 |
|
| 1128 |
[<a id="ref-RFC5234">RFC5234</a>] Crocker, D. and P. Overell, "Augmented BNF for Syntax |
| 1129 |
Specifications: ABNF", STD 68, <a href="./rfc5234">RFC 5234</a>, January 2008. |
| 1130 |
|
| 1131 |
[<a id="ref-RFC5280">RFC5280</a>] Cooper, D., Santesson, S., Farrell, S., Boeyen, S., |
| 1132 |
Housley, R., and W. Polk, "Internet X.509 Public Key |
| 1133 |
Infrastructure Certificate and Certificate Revocation List |
| 1134 |
(CRL) Profile", <a href="./rfc5280">RFC 5280</a>, May 2008. |
| 1135 |
|
| 1136 |
[<a id="ref-RFC5785">RFC5785</a>] Nottingham, M. and E. Hammer-Lahav, "Defining Well-Known |
| 1137 |
Uniform Resource Identifiers (URIs)", <a href="./rfc5785">RFC 5785</a>, |
| 1138 |
April 2010. |
| 1139 |
|
| 1140 |
[<a id="ref-RFC6838">RFC6838</a>] Freed, N., Klensin, J., and T. Hansen, "Media Type |
| 1141 |
Specifications and Registration Procedures", <a href="https://www.rfc-editor.org/bcp/bcp13">BCP 13</a>, |
| 1142 |
<a href="./rfc6838">RFC 6838</a>, January 2013. |
| 1143 |
|
| 1144 |
[<a id="ref-SHA-256">SHA-256</a>] NIST, "Secure Hash Standard", FIPS 180-3, October 2008, |
| 1145 |
<<a href="http://csrc.nist.gov/publications/fips/fips180-3/fips180-3_final.pdf">http://csrc.nist.gov/publications/fips/fips180-3/</a> |
| 1146 |
<a href="http://csrc.nist.gov/publications/fips/fips180-3/fips180-3_final.pdf">fips180-3_final.pdf</a>>. |
| 1147 |
|
| 1148 |
<span class="h3"><a class="selflink" id="section-12.2" href="#section-12.2">12.2</a>. Informative References</span> |
| 1149 |
|
| 1150 |
[<a id="ref-CCN">CCN</a>] Jacobson, V., Smetters, D., Thornton, J., Plass, M., |
| 1151 |
Briggs, N., and R. Braynard, "Networking Named Content", |
| 1152 |
Proceedings of the 5th international conference on |
| 1153 |
Emerging networking experiments and technologies (CoNEXT |
| 1154 |
'09), December 2009. |
| 1155 |
|
| 1156 |
[<a id="ref-DECPARAMS">DECPARAMS</a>] |
| 1157 |
Hallam-Baker, P., Stradling, R., Farrell, S., Kutscher, |
| 1158 |
D., and B. Ohlman, "The Named Information (ni) URI Scheme: |
| 1159 |
Optional Features", Work in Progress, June 2012. |
| 1160 |
|
| 1161 |
[<a id="ref-Luhn">Luhn</a>] Wikipedia, "Luhn mod N algorithm", September 2011, |
| 1162 |
<<a href="http://en.wikipedia.org/w/index.php?title=Luhn_mod_N_algorithm&oldid=449928878">http://en.wikipedia.org/w/</a> |
| 1163 |
<a href="http://en.wikipedia.org/w/index.php?title=Luhn_mod_N_algorithm&oldid=449928878">index.php?title=Luhn_mod_N_algorithm&oldid=449928878</a>>. |
| 1164 |
|
| 1165 |
[<a id="ref-Magnet">Magnet</a>] Wikipedia, "Magnet URI scheme", March 2013, |
| 1166 |
<<a href="http://en.wikipedia.org/w/index.php?title=Magnet_URI_scheme&oldid=546892719">http://en.wikipedia.org/w/</a> |
| 1167 |
<a href="http://en.wikipedia.org/w/index.php?title=Magnet_URI_scheme&oldid=546892719">index.php?title=Magnet_URI_scheme&oldid=546892719</a>>. |
| 1168 |
|
| 1169 |
|
| 1170 |
|
| 1171 |
|
| 1172 |
<span class="grey">Farrell, et al. Standards Track [Page 21]</span></pre> |
| 1173 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-22" ></span> |
| 1174 |
<span class="grey"><a href="./rfc6920">RFC 6920</a> Naming Things with Hashes April 2013</span> |
| 1175 |
|
| 1176 |
|
| 1177 |
[<a id="ref-NETINF-ARCHITECTURE">NETINF-ARCHITECTURE</a>] |
| 1178 |
Dannewitz, C., Kutscher, D., Ohlman, B., Farrell, S., |
| 1179 |
Ahlgren, B., and M. Karl, "Network of Information (NetInf) |
| 1180 |
- An information-centric networking architecture", |
| 1181 |
Computer Communications, Volume 36, Issue 7, pages |
| 1182 |
721-735, ISSN 0140-3664, 1 April 2013, |
| 1183 |
<<a href="http://www.sciencedirect.com/science/article/pii/S0140366413000364">http://www.sciencedirect.com/science/article/pii/</a> |
| 1184 |
<a href="http://www.sciencedirect.com/science/article/pii/S0140366413000364">S0140366413000364</a>>. |
| 1185 |
|
| 1186 |
[<a id="ref-RFC3766">RFC3766</a>] Orman, H. and P. Hoffman, "Determining Strengths For |
| 1187 |
Public Keys Used For Exchanging Symmetric Keys", <a href="https://www.rfc-editor.org/bcp/bcp86">BCP 86</a>, |
| 1188 |
<a href="./rfc3766">RFC 3766</a>, April 2004. |
| 1189 |
|
| 1190 |
[<a id="ref-RFC4773">RFC4773</a>] Huston, G., "Administration of the IANA Special Purpose |
| 1191 |
IPv6 Address Block", <a href="./rfc4773">RFC 4773</a>, December 2006. |
| 1192 |
|
| 1193 |
[<a id="ref-RFC4843">RFC4843</a>] Nikander, P., Laganier, J., and F. Dupont, "An IPv6 Prefix |
| 1194 |
for Overlay Routable Cryptographic Hash Identifiers |
| 1195 |
(ORCHID)", <a href="./rfc4843">RFC 4843</a>, April 2007. |
| 1196 |
|
| 1197 |
[<a id="ref-RFC5226">RFC5226</a>] Narten, T. and H. Alvestrand, "Guidelines for Writing an |
| 1198 |
IANA Considerations Section in RFCs", <a href="https://www.rfc-editor.org/bcp/bcp26">BCP 26</a>, <a href="./rfc5226">RFC 5226</a>, |
| 1199 |
May 2008. |
| 1200 |
|
| 1201 |
[<a id="ref-RFC5513">RFC5513</a>] Farrel, A., "IANA Considerations for Three Letter |
| 1202 |
Acronyms", <a href="./rfc5513">RFC 5513</a>, April 1 2009. |
| 1203 |
|
| 1204 |
[<a id="ref-RFC6149">RFC6149</a>] Turner, S. and L. Chen, "MD2 to Historic Status", |
| 1205 |
<a href="./rfc6149">RFC 6149</a>, March 2011. |
| 1206 |
|
| 1207 |
[<a id="ref-RFC6150">RFC6150</a>] Turner, S. and L. Chen, "MD4 to Historic Status", |
| 1208 |
<a href="./rfc6150">RFC 6150</a>, March 2011. |
| 1209 |
|
| 1210 |
[<a id="ref-RFC6151">RFC6151</a>] Turner, S. and L. Chen, "Updated Security Considerations |
| 1211 |
for the MD5 Message-Digest and the HMAC-MD5 Algorithms", |
| 1212 |
<a href="./rfc6151">RFC 6151</a>, March 2011. |
| 1213 |
|
| 1214 |
[<a id="ref-RFC6454">RFC6454</a>] Barth, A., "The Web Origin Concept", <a href="./rfc6454">RFC 6454</a>, |
| 1215 |
December 2011. |
| 1216 |
|
| 1217 |
[<a id="ref-RFC6698">RFC6698</a>] Hoffman, P. and J. Schlyter, "The DNS-Based Authentication |
| 1218 |
of Named Entities (DANE) Transport Layer Security (TLS) |
| 1219 |
Protocol: TLSA", <a href="./rfc6698">RFC 6698</a>, August 2012. |
| 1220 |
|
| 1221 |
[<a id="ref-RFC6797">RFC6797</a>] Hodges, J., Jackson, C., and A. Barth, "HTTP Strict |
| 1222 |
Transport Security (HSTS)", <a href="./rfc6797">RFC 6797</a>, November 2012. |
| 1223 |
|
| 1224 |
|
| 1225 |
|
| 1226 |
|
| 1227 |
|
| 1228 |
<span class="grey">Farrell, et al. Standards Track [Page 22]</span></pre> |
| 1229 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-23" ></span> |
| 1230 |
<span class="grey"><a href="./rfc6920">RFC 6920</a> Naming Things with Hashes April 2013</span> |
| 1231 |
|
| 1232 |
|
| 1233 |
Authors' Addresses |
| 1234 |
|
| 1235 |
Stephen Farrell |
| 1236 |
Trinity College Dublin |
| 1237 |
Dublin, 2 |
| 1238 |
Ireland |
| 1239 |
Phone: +353-1-896-2354 |
| 1240 |
EMail: [email protected] |
| 1241 |
|
| 1242 |
|
| 1243 |
Dirk Kutscher |
| 1244 |
NEC |
| 1245 |
Kurfuersten-Anlage 36 |
| 1246 |
Heidelberg |
| 1247 |
Germany |
| 1248 |
EMail: [email protected] |
| 1249 |
|
| 1250 |
|
| 1251 |
Christian Dannewitz |
| 1252 |
University of Paderborn |
| 1253 |
Paderborn |
| 1254 |
Germany |
| 1255 |
EMail: [email protected] |
| 1256 |
|
| 1257 |
|
| 1258 |
Borje Ohlman |
| 1259 |
Ericsson |
| 1260 |
Stockholm S-16480 |
| 1261 |
Sweden |
| 1262 |
EMail: [email protected] |
| 1263 |
|
| 1264 |
|
| 1265 |
Ari Keranen |
| 1266 |
Ericsson |
| 1267 |
Jorvas 02420 |
| 1268 |
Finland |
| 1269 |
EMail: [email protected] |
| 1270 |
|
| 1271 |
|
| 1272 |
Phillip Hallam-Baker |
| 1273 |
Comodo Group Inc. |
| 1274 |
EMail: [email protected] |
| 1275 |
|
| 1276 |
|
| 1277 |
|
| 1278 |
|
| 1279 |
|
| 1280 |
|
| 1281 |
|
| 1282 |
|
| 1283 |
|
| 1284 |
Farrell, et al. Standards Track [Page 23] |
| 1285 |
</pre> |