Re: [OAUTH-WG] New Version Notification for draft-fett-oauth-dpop-03.txt

"Richard Backman, Annabelle" <> Fri, 29 November 2019 22:13 UTC

Return-Path: <>
Received: from localhost (localhost []) by (Postfix) with ESMTP id CB6001200DE for <>; Fri, 29 Nov 2019 14:13:20 -0800 (PST)
X-Virus-Scanned: amavisd-new at
X-Spam-Flag: NO
X-Spam-Score: -11.8
X-Spam-Status: No, score=-11.8 tagged_above=-999 required=5 tests=[BAYES_00=-1.9, DKIMWL_WL_HIGH=-0.001, DKIM_SIGNED=0.1, DKIM_VALID=-0.1, DKIM_VALID_AU=-0.1, HTML_MESSAGE=0.001, RCVD_IN_DNSWL_MED=-2.3, SPF_HELO_NONE=0.001, SPF_PASS=-0.001, USER_IN_DEF_SPF_WL=-7.5] autolearn=ham autolearn_force=no
Authentication-Results: (amavisd-new); dkim=pass (1024-bit key)
Received: from ([]) by localhost ( []) (amavisd-new, port 10024) with ESMTP id kZWxx-QMEkEN for <>; Fri, 29 Nov 2019 14:13:17 -0800 (PST)
Received: from ( []) (using TLSv1.2 with cipher ECDHE-RSA-AES256-GCM-SHA384 (256/256 bits)) (No client certificate requested) by (Postfix) with ESMTPS id CEAE8120052 for <>; Fri, 29 Nov 2019 14:13:17 -0800 (PST)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed;;; q=dns/txt; s=amazon201209; t=1575065598; x=1606601598; h=from:to:cc:subject:date:message-id:references: in-reply-to:mime-version; bh=q8uttDCgMEFpsc+J/faTCQ+fiLV0gUqZCjtlA/QXbgQ=; b=tanoqcjsiUI8BO3pjcN2ZtLJ8Pz5ZaAchRW63JP8rujfh81dxtXxF8e8 b8IVZPzbNQ4MCxcIKeOsY2tImhhg2kNYKL0JGAqHnH08YX6Gac/mL6OlT 5cF5miBk09SxgkGgks3Ambo6ljG9cXR8WjVsr1n3T1IYWx1icoioIGFxe Q=;
IronPort-SDR: K4rc97tP5OahgRA3vgpKPMpbC21nenSSVJcFDaJIjL/xhpwnvQK6WMcqAr2ySWCzylK6smueni MCwor429X2bg==
X-IronPort-AV: E=Sophos; i="5.69,258,1571702400"; d="scan'208,217"; a="12019877"
Received: from (HELO ([]) by with ESMTP; 29 Nov 2019 22:13:06 +0000
Received: from ( []) by (Postfix) with ESMTPS id 55213A2000; Fri, 29 Nov 2019 22:13:04 +0000 (UTC)
Received: from ( by ( with Microsoft SMTP Server (TLS) id 15.0.1367.3; Fri, 29 Nov 2019 22:13:04 +0000
Received: from ( by ( with Microsoft SMTP Server (TLS) id 15.0.1367.3; Fri, 29 Nov 2019 22:13:04 +0000
Received: from ([]) by ([]) with mapi id 15.00.1367.000; Fri, 29 Nov 2019 22:13:04 +0000
From: "Richard Backman, Annabelle" <>
To: Neil Madden <>
CC: Brian Campbell <>, oauth <>
Thread-Topic: [OAUTH-WG] New Version Notification for draft-fett-oauth-dpop-03.txt
Thread-Index: AQHVpb9/NjuSebJ9c06bnJG1CogdFqeiMrqA
Date: Fri, 29 Nov 2019 22:13:04 +0000
Message-ID: <>
References: <>
In-Reply-To: <>
Accept-Language: en-US
Content-Language: en-US
user-agent: Microsoft-MacOutlook/10.1d.0.190908
x-ms-exchange-messagesentrepresentingtype: 1
x-ms-exchange-transport-fromentityheader: Hosted
x-originating-ip: []
Content-Type: multipart/alternative; boundary="_000_863A2C3DFA2A472CB9FED9B3D99A5812amazoncom_"
MIME-Version: 1.0
Archived-At: <>
Subject: Re: [OAUTH-WG] New Version Notification for draft-fett-oauth-dpop-03.txt
X-Mailman-Version: 2.1.29
Precedence: list
List-Id: OAUTH WG <>
List-Unsubscribe: <>, <>
List-Archive: <>
List-Post: <>
List-Help: <>
List-Subscribe: <>, <>
X-List-Received-Date: Fri, 29 Nov 2019 22:13:21 -0000

> That is the easiest way to let the RS verify the macaroon on the assumption that the RS is trusted. I’m not aware of an alternative for asymmetric crypto when the RS is untrusted other than using the signature-based macaroon variant or having per-RS keys.

It occurred to me that my previous example of how to do layering with JWTs was needlessly complicated. You can prevent removal of layered constraints by constraining each inner layer to require a wrapper. Consider a "foobar" claim that specifies a public key and indicates that the token must be presented wrapped within a JWS signed with the corresponding private key. The wrapper JWS may introduce additional constraints, and may or may not permit the recipient to present the access token to others, depending on the value of the "foobar" claim. For example:

The AS generates an access token, with a public key registered by the client as the value of the "foobar" claim. This registration could’ve happened via a dev console, dynamic client reg., or as part of the token request.
<at_0> = JWS(<AS private key>, {
    "iss": "",
    "client_id": "...",
    "user_id": "...",
    "scope": "a b",
    "exp": <now + 1 hour>,
    "foobar": <client public key>

To call, the client wraps the token in a JWS signed with the client’s private key. They further restrict the scope and expiration time, and authorize the RS to use the token with other RSes by setting the value of the "foobar" claim to the RS’s public key.
<at_1> = JWS(<client private key>, {
    "token": <at_0>,
    "aud": "",
    "exp": <now + 5 seconds>,
    "scope": "a b",
    "foobar": <RS1 public key>

To call, wraps the token in a JWS signed with the RS’s private key. The RS prohibits from further use of the token by setting the "foobar" claim to null.
<at_2> = JWS(<RS1 private key>, {
    "token": <at_1>,
    "aud": "",
    "scope": "b",
    "foobar": null

Similarly, the client can call with a token that is restricted from further use.
<at_3> = JWS(<client private key>, {
    "token": <at_0>,
    "aud": "",
    "exp": <now + 5 seconds>,
    "scope": "b",
    "foobar": null

This pattern allows for layered constraints, local introspection, and local validation. The requirements (that I’ve identified) are that:

  1.  The client must register a public key with the AS (this could be done during the token request).
  2.  The AS must know whether or not to give the client a plain bearer token or a token with the "foobar" claim (presentation of a key possession proof in the token request could be enough).
  3.  Any recipient that wishes to validate the token must have the public key for the AS.
  4.  Any recipient that wishes to add a layer must have a public key that is known to its callers.
  5.  Any recipient that performs local validation must understand the meaning of the "foobar" claim.

I haven’t thought too deeply on this so I wouldn’t consider the idea fully baked, but I’m curious to hear your thoughts on it.

Annabelle Richard Backman
AWS Identity

From: Neil Madden <>
Date: Wednesday, November 27, 2019 at 11:43 PM
To: "Richard Backman, Annabelle" <>
Cc: Brian Campbell <>, oauth <>
Subject: Re: [OAUTH-WG] New Version Notification for draft-fett-oauth-dpop-03.txt

On 27 Nov 2019, at 20:30, Richard Backman, Annabelle <> wrote:

> That is true, but is IMO more of a hindrance than an advantage for a PoP scheme. The very fact that the signature is valid at every RS is why you need additional measures to prevent cross-RS token reuse.

The other methods you mention require their own additional measures in the form of key exchanges/handshakes. And you still need to prove possession of that shared key somehow.

This is true. The difference being that the derived key can then be reused for many requests. Because the key derivation is cryptographically tied to this context the RS can’t replay these symmetric tokens anywhere else.

In some cases, “derive a shared key and encrypt this blob” is easier; in some cases “sign this blob declaring your audience” is easier.

The ECDH scheme does challenge-response to ensure freshness. This was designed to match the anti-replay measures in the DPoP draft but without requiring the server store any state. If you don’t need replay protection (if TLS is enough) then you can indeed just sign the audience, or for ECDH you can do completely static ECDH between the client’s private key and the RS’s public key to derive a shared key that is the same for all time (until key rotation). But in that case you may as well just return a symmetric key directly from the AS... attached to a macaroon, say.

> The easiest way to use macaroons with asymmetric crypto is to make the macaroon identifier be an encrypted random HMAC key that the RS can decrypt (or a derived key using diffie-hellman). You can concatenate multiple encrypted keys for multiple RSes. Alternatively in a closed ecosystem you can encrypt the random HMAC with a key stored in a KMS (such as AWS KMS) and grant each RS decrypt permissions for that KMS key.

Is the “random HMAC key that the RS can decrypt” the root key used to generate the macaroon? If so, how would you prevent one targeted RS from using the root key and macaroon identifier to construct an arbitrary macaroon for replay against another targeted RS? If not, how does the targeted RS use the decrypted “random HMAC key” to validate the macaroon? Is there a paper on this approach?

That is the easiest way to let the RS verify the macaroon on the assumption that the RS is trusted. I’m not aware of an alternative for asymmetric crypto when the RS is untrusted other than using the signature-based macaroon variant or having per-RS keys.

I’m not really a fan of purely signature-based JWT access tokens because those tokens often contain PII and so should really be encrypted to avoid leaking details to the client (or anyone else if the token does leak). This came up in the discussion of the JWT-based access tokens draft, which is why I proposed for use in that draft. But if you’re doing encryption then you’re already down the path of having per-RS access tokens (and keys) - the compact encoding of JWE only allows a single recipient.

The KMS approach is just symmetric crypto mediated through a third party (and has the same centralization problem as validation at the AS).

> Clients can then later start adding caveats…, while RSes still don't have to make any changes….
> DPoP only effectively prevents cross-RS replay if all RSes implement it, otherwise the ones that don't are still vulnerable.
This is because macaroons bake the proof into the “bearer” token (which is no longer really a bearer token) in the Authorization header, whereas DPoP puts it in a separate header.

That’s not the only difference. The other is that the AS does the validation. If the client appended the DPoP claims to the access token and signed the whole thing, and then the RS took that and sent it to the AS introspection endpoint to validate it, then that would have the same advantage of not requiring any changes at the RS.

But if you do this then there’s no longer any reason to use public key signatures because the client and AS may as well agree a shared secret. (The AS can always impersonate a client anyway). At which point we’re basically back using macaroons.

draft-ietf-oauth-signed-http-request is another way to do this that doesn’t rely on macaroons.

> Your previous point was that they require "non-trivial work to use ... and require developers to learn a new token format".
By “non-trivial work to use” I was referring to work required from the working group, that I did not feel was being acknowledged.

Do you believe it’s a disproportionate amount of work compared to any other draft the WG works on?

Looking back over the thread, I think my objection stems from you referring to macaroons as an “access token format” when they’re really an applied cryptography pattern. The “format” part would need to be defined by the working group. For what it’s worth, I think it’d be interesting to explore if/how the pattern could be applied to the JWT format, or what tweaks would be necessary to make it work. If we could describe a way to create macaroons that reuse the existing work on JWTs, that would be pretty cool.

There are existing interoperable macaroon libraries right now that define a common format [*]. Unless there was a compelling reason not to, I’d hope we’d just standardize that.

[*] Actually they’ve gone through a couple of iterations. I believe the “libmacaroons V2 binary” format is what most now use.

> That burden is significantly reduced when developers can just add a dependency and call a one-liner to add a caveat.
Libraries can certainly reduce the amount of work required by developers (and here I mean client developers, RS developers, AS developers, and OAuth client and server library developers), but come with their own concerns (e.g., platform availability, licensing, maintenance and reliability, etc.). It becomes one more dependency that developers have to consider.

I’m not really sure what your point is here. *Any* new addition to OAuth has to be implemented. Either that’s done with a library or you write your own.

— Neil