Skip to content

Commit

Permalink
Script updating gh-pages from d5bddf2. [ci skip]
Browse files Browse the repository at this point in the history
  • Loading branch information
ID Bot committed May 24, 2024
1 parent 1bb28a0 commit 5a5e07c
Show file tree
Hide file tree
Showing 4 changed files with 995 additions and 997 deletions.
16 changes: 8 additions & 8 deletions draft-ietf-rats-eat.html
View file
Original file line number Diff line number Diff line change
Expand Up @@ -1037,7 +1037,7 @@
</tr></thead>
<tfoot><tr>
<td class="left">Lundblade, et al.</td>
<td class="center">Expires 6 November 2024</td>
<td class="center">Expires 25 November 2024</td>
<td class="right">[Page]</td>
</tr></tfoot>
</table>
Expand All @@ -1050,12 +1050,12 @@
<dd class="internet-draft">draft-ietf-rats-eat-latest</dd>
<dt class="label-published">Published:</dt>
<dd class="published">
<time datetime="2024-05-05" class="published">5 May 2024</time>
<time datetime="2024-05-24" class="published">24 May 2024</time>
</dd>
<dt class="label-intended-status">Intended Status:</dt>
<dd class="intended-status">Standards Track</dd>
<dt class="label-expires">Expires:</dt>
<dd class="expires"><time datetime="2024-11-06">6 November 2024</time></dd>
<dd class="expires"><time datetime="2024-11-25">25 November 2024</time></dd>
<dt class="label-authors">Authors:</dt>
<dd class="authors">
<div class="author">
Expand Down Expand Up @@ -1106,7 +1106,7 @@ <h2 id="name-status-of-this-memo">
time. It is inappropriate to use Internet-Drafts as reference
material or to cite them other than as "work in progress."<a href="#section-boilerplate.1-3" class="pilcrow"></a></p>
<p id="section-boilerplate.1-4">
This Internet-Draft will expire on 6 November 2024.<a href="#section-boilerplate.1-4" class="pilcrow"></a></p>
This Internet-Draft will expire on 25 November 2024.<a href="#section-boilerplate.1-4" class="pilcrow"></a></p>
</section>
</div>
<div id="copyright">
Expand Down Expand Up @@ -1812,7 +1812,7 @@ <h2 id="name-terminology">
<dd class="break"></dd>
<dt id="section-2-5.3">Claim:</dt>
<dd style="margin-left: 1.5em" id="section-2-5.4">
<p id="section-2-5.4.1">A piece of information asserted about a subject. A claim is represented as pair with a value and either a name or key to identify it.<a href="#section-2-5.4.1" class="pilcrow"></a></p>
<p id="section-2-5.4.1">A piece of information asserted about a subject. A claim is represented as a value and either a name or key to identify it.<a href="#section-2-5.4.1" class="pilcrow"></a></p>
</dd>
<dd class="break"></dd>
<dt id="section-2-5.5">Claim Name:</dt>
Expand Down Expand Up @@ -3216,8 +3216,8 @@ <h4 id="name-cose-jose-algorithms">
<a href="#section-6.3.7" class="section-number selfRef">6.3.7. </a><a href="#name-cose-jose-algorithms" class="section-name selfRef">COSE/JOSE Algorithms</a>
</h4>
<p id="section-6.3.7-1">See the section on "Application Profiling Considerations" in <span>[<a href="#RFC9052" class="cite xref">RFC9052</a>]</span> for a discussion on selection of cryptographic algorithms and related issues.<a href="#section-6.3.7-1" class="pilcrow"></a></p>
<p id="section-6.3.7-2">The profile <span class="bcp14">MAY</span> require the protocol or system using EAT provide an algorithm negotiation mechanism.<a href="#section-6.3.7-2" class="pilcrow"></a></p>
<p id="section-6.3.7-3">If not, The profile document should list a set of algorithms for each COSE and JOSE message type allowed by the profile per <a href="#message-type" class="auto internal xref">Section 6.3.6</a>.
<p id="section-6.3.7-2">The profile <span class="bcp14">MAY</span> require the protocol or system using EAT to provide an algorithm negotiation mechanism.<a href="#section-6.3.7-2" class="pilcrow"></a></p>
<p id="section-6.3.7-3">If not, the profile document should list a set of algorithms for each COSE and JOSE message type allowed by the profile per <a href="#message-type" class="auto internal xref">Section 6.3.6</a>.
The verifier should implement all of them.
The attester may implement any of them it wishes, possibly just one for each message type.<a href="#section-6.3.7-3" class="pilcrow"></a></p>
<p id="section-6.3.7-4">If detached submodule digests are used the profile should address the determination of the hash algorithm(s) for the digests.<a href="#section-6.3.7-4" class="pilcrow"></a></p>
Expand Down Expand Up @@ -4027,7 +4027,7 @@ <h3 id="name-detached-eat-bundle-digest-">
<a href="#section-9.5" class="section-number selfRef">9.5. </a><a href="#name-detached-eat-bundle-digest-" class="section-name selfRef">Detached EAT Bundle Digest Security Considerations</a>
</h3>
<p id="section-9.5-1">A detached EAT bundle is composed of a nested EAT and
an claims set as per <a href="#DEB" class="auto internal xref">Section 5</a>. Although the attached claims set is vulnerable to
a claims set as per <a href="#DEB" class="auto internal xref">Section 5</a>. Although the attached claims set is vulnerable to
modification in transit, any modification can be detected by the receiver through the associated
digest, which is a claim fully contained within an EAT. Moreover, the digest itself can only be derived using
an appropriate COSE hash algorithm, implying that an attacker cannot induce false detection
Expand Down
19 changes: 9 additions & 10 deletions draft-ietf-rats-eat.txt
View file
Original file line number Diff line number Diff line change
Expand Up @@ -5,12 +5,12 @@
RATS L. Lundblade
Internet-Draft Security Theory LLC
Intended status: Standards Track G. Mandyam
Expires: 6 November 2024 Mediatek USA
Expires: 25 November 2024 Mediatek USA
J. O'Donoghue
Qualcomm Technologies Inc.
C. Wallace
Red Hound Software, Inc.
5 May 2024
24 May 2024


The Entity Attestation Token (EAT)
Expand Down Expand Up @@ -42,7 +42,7 @@ Status of This Memo
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 6 November 2024.
This Internet-Draft will expire on 25 November 2024.

Copyright Notice

Expand Down Expand Up @@ -465,8 +465,7 @@ Table of Contents
any line breaks, whitespace, or other additional characters.

Claim: A piece of information asserted about a subject. A claim is
represented as pair with a value and either a name or key to
identify it.
represented as a value and either a name or key to identify it.

Claim Name: A unique text string that identifies the claim. It is
used as the claim name for JSON encoding.
Expand Down Expand Up @@ -1968,10 +1967,10 @@ Table of Contents
[RFC9052] for a discussion on selection of cryptographic algorithms
and related issues.

The profile MAY require the protocol or system using EAT provide an
algorithm negotiation mechanism.
The profile MAY require the protocol or system using EAT to provide
an algorithm negotiation mechanism.

If not, The profile document should list a set of algorithms for each
If not, the profile document should list a set of algorithms for each
COSE and JOSE message type allowed by the profile per Section 6.3.6.
The verifier should implement all of them. The attester may
implement any of them it wishes, possibly just one for each message
Expand Down Expand Up @@ -2733,8 +2732,8 @@ Table of Contents

9.5. Detached EAT Bundle Digest Security Considerations

A detached EAT bundle is composed of a nested EAT and an claims set
as per Section 5. Although the attached claims set is vulnerable to
A detached EAT bundle is composed of a nested EAT and a claims set as
per Section 5. Although the attached claims set is vulnerable to
modification in transit, any modification can be detected by the
receiver through the associated digest, which is a claim fully
contained within an EAT. Moreover, the digest itself can only be
Expand Down

0 comments on commit 5a5e07c

Please sign in to comment.