[Docs] [txt|pdf|xml|html] [Tracker] [WG] [Email] [Diff1] [Diff2] [Nits]

Versions: (draft-barnes-mls-protocol) 00 01 02 03 04 05 06 07

Network Working Group                                          R. Barnes
Internet-Draft                                                     Cisco
Intended status: Informational                               J. Millican
Expires: March 23, 2019                                         Facebook
                                                                E. Omara
                                                                  Google
                                                          K. Cohn-Gordon
                                                    University of Oxford
                                                               R. Robert
                                                                    Wire
                                                      September 19, 2018


              The Messaging Layer Security (MLS) Protocol
                       draft-ietf-mls-protocol-01

Abstract

   Messaging applications are increasingly making use of end-to-end
   security mechanisms to ensure that messages are only accessible to
   the communicating endpoints, and not to any servers involved in
   delivering messages.  Establishing keys to provide such protections
   is challenging for group chat settings, in which more than two
   participants need to agree on a key but may not be online at the same
   time.  In this document, we specify a key establishment protocol that
   provides efficient asynchronous group key establishment with forward
   secrecy and post-compromise security for groups in size ranging from
   two to thousands.

Status of This Memo

   This Internet-Draft is submitted in full conformance with the
   provisions of BCP 78 and BCP 79.

   Internet-Drafts are working documents of the Internet Engineering
   Task Force (IETF).  Note that other groups may also distribute
   working documents as Internet-Drafts.  The list of current Internet-
   Drafts is at https://datatracker.ietf.org/drafts/current/.

   Internet-Drafts are draft documents valid for a maximum of six months
   and may be updated, replaced, or obsoleted by other documents at any
   time.  It is inappropriate to use Internet-Drafts as reference
   material or to cite them other than as "work in progress."

   This Internet-Draft will expire on March 23, 2019.






Barnes, et al.           Expires March 23, 2019                 [Page 1]


Internet-Draft                     MLS                    September 2018


Copyright Notice

   Copyright (c) 2018 IETF Trust and the persons identified as the
   document authors.  All rights reserved.

   This document is subject to BCP 78 and the IETF Trust's Legal
   Provisions Relating to IETF Documents
   (https://trustee.ietf.org/license-info) in effect on the date of
   publication of this document.  Please review these documents
   carefully, as they describe your rights and restrictions with respect
   to this document.  Code Components extracted from this document must
   include Simplified BSD License text as described in Section 4.e of
   the Trust Legal Provisions and are provided without warranty as
   described in the Simplified BSD License.

Table of Contents

   1.  Introduction  . . . . . . . . . . . . . . . . . . . . . . . .   3
     1.1.  Change Log  . . . . . . . . . . . . . . . . . . . . . . .   4
   2.  Terminology . . . . . . . . . . . . . . . . . . . . . . . . .   5
   3.  Basic Assumptions . . . . . . . . . . . . . . . . . . . . . .   6
   4.  Protocol Overview . . . . . . . . . . . . . . . . . . . . . .   6
   5.  Ratchet Trees . . . . . . . . . . . . . . . . . . . . . . . .   9
     5.1.  Terminology . . . . . . . . . . . . . . . . . . . . . . .   9
     5.2.  Ratchet Tree Nodes  . . . . . . . . . . . . . . . . . . .  12
       5.2.1.  Ratchet Trees for ART . . . . . . . . . . . . . . . .  12
       5.2.2.  Ratchet Trees for TreeKEM . . . . . . . . . . . . . .  13
       5.2.3.  Ratchet Tree Updates  . . . . . . . . . . . . . . . .  13
     5.3.  Cryptographic Objects . . . . . . . . . . . . . . . . . .  15
       5.3.1.  ART with Curve25519 and SHA-256 . . . . . . . . . . .  15
       5.3.2.  ART with P-256 and SHA-256  . . . . . . . . . . . . .  16
       5.3.3.  TreeKEM with Curve25519, SHA-256, and AES-128-GCM . .  17
       5.3.4.  TreeKEM with P-256, SHA-256, and AES-128-GCM  . . . .  17
     5.4.  Credentials . . . . . . . . . . . . . . . . . . . . . . .  17
     5.5.  Group State . . . . . . . . . . . . . . . . . . . . . . .  18
     5.6.  Direct Paths  . . . . . . . . . . . . . . . . . . . . . .  19
     5.7.  Key Schedule  . . . . . . . . . . . . . . . . . . . . . .  21
   6.  Initialization Keys . . . . . . . . . . . . . . . . . . . . .  22
   7.  Handshake Messages  . . . . . . . . . . . . . . . . . . . . .  23
     7.1.  Init  . . . . . . . . . . . . . . . . . . . . . . . . . .  25
     7.2.  Add . . . . . . . . . . . . . . . . . . . . . . . . . . .  25
     7.3.  Update  . . . . . . . . . . . . . . . . . . . . . . . . .  27
     7.4.  Remove  . . . . . . . . . . . . . . . . . . . . . . . . .  27
   8.  Sequencing of State Changes . . . . . . . . . . . . . . . . .  28
     8.1.  Server-Enforced Ordering  . . . . . . . . . . . . . . . .  29
     8.2.  Client-Enforced Ordering  . . . . . . . . . . . . . . . .  30
     8.3.  Merging Updates . . . . . . . . . . . . . . . . . . . . .  30
   9.  Message Protection  . . . . . . . . . . . . . . . . . . . . .  31



Barnes, et al.           Expires March 23, 2019                 [Page 2]


Internet-Draft                     MLS                    September 2018


     9.1.  Application Key Schedule  . . . . . . . . . . . . . . . .  32
       9.1.1.  Updating the Application Secret . . . . . . . . . . .  33
       9.1.2.  Application AEAD Key Calculation  . . . . . . . . . .  33
     9.2.  Message Encryption and Decryption . . . . . . . . . . . .  34
       9.2.1.  Delayed and Reordered Application messages  . . . . .  35
   10. Security Considerations . . . . . . . . . . . . . . . . . . .  36
     10.1.  Confidentiality of the Group Secrets . . . . . . . . . .  36
     10.2.  Authentication . . . . . . . . . . . . . . . . . . . . .  36
     10.3.  Forward and post-compromise security . . . . . . . . . .  37
     10.4.  Init Key Reuse . . . . . . . . . . . . . . . . . . . . .  37
   11. IANA Considerations . . . . . . . . . . . . . . . . . . . . .  37
   12. Contributors  . . . . . . . . . . . . . . . . . . . . . . . .  37
   13. References  . . . . . . . . . . . . . . . . . . . . . . . . .  38
     13.1.  Normative References . . . . . . . . . . . . . . . . . .  38
     13.2.  Informative References . . . . . . . . . . . . . . . . .  38
   Appendix A.  Tree Math  . . . . . . . . . . . . . . . . . . . . .  40
   Authors' Addresses  . . . . . . . . . . . . . . . . . . . . . . .  43

1.  Introduction

   DISCLAIMER: This is a work-in-progress draft of MLS and has not yet
   seen significant security analysis.  It should not be used as a basis
   for building production systems.

   RFC EDITOR: PLEASE REMOVE THE FOLLOWING PARAGRAPH The source for this
   draft is maintained in GitHub.  Suggested changes should be submitted
   as pull requests at https://github.com/mlswg/mls-protocol.
   Instructions are on that page as well.  Editorial changes can be
   managed in GitHub, but any substantive change should be discussed on
   the MLS mailing list.

   A group of agents who want to send each other encrypted messages
   needs a way to derive shared symmetric encryption keys.  For two
   parties, this problem has been studied thoroughly, with the Double
   Ratchet emerging as a common solution [doubleratchet] [signal].
   Channels implementing the Double Ratchet enjoy fine-grained forward
   secrecy as well as post-compromise security, but are nonetheless
   efficient enough for heavy use over low-bandwidth networks.

   For a group of size greater than two, a common strategy is to
   unilaterally broadcast symmetric "sender" keys over existing shared
   symmetric channels, and then for each agent to send messages to the
   group encrypted with their own sender key.  Unfortunately, while this
   improves efficiency over pairwise broadcast of individual messages
   and (with the addition of a hash ratchet) provides forward secrecy,
   it is difficult to achieve post-compromise security with sender keys.
   An adversary who learns a sender key can often indefinitely and
   passively eavesdrop on that sender's messages.  Generating and



Barnes, et al.           Expires March 23, 2019                 [Page 3]


Internet-Draft                     MLS                    September 2018


   distributing a new sender key provides a form of post-compromise
   security with regard to that sender.  However, it requires
   computation and communications resources that scale linearly as the
   size of the group.

   In this document, we describe a protocol based on tree structures
   that enable asynchronous group keying with forward secrecy and post-
   compromise security.  This document describes two candidate
   approaches, one using "asynchronous ratcheting trees" [art], the
   other using an asynchronous key-encapsulation mechanism for tree
   structures called TreeKEM.  Both mechanisms allow the members of the
   group to derive and update shared keys with costs that scale as the
   log of the group size.  The use of Merkle trees to store identity
   information allows strong authentication of group membership, again
   with logarithmic cost.

1.1.  Change Log

   RFC EDITOR PLEASE DELETE THIS SECTION.

   draft-01

   o  Initial description of the Message Protection mechanism. (*)

   o  Initial specification proposal for the Application Key Schedule
      using the per-participant chaining of the Application Secret
      design. (*)

   o  Initial specification proposal for an encryption mechanism to
      protect Application Messages using an AEAD scheme. (*)

   o  Initial specification proposal for an authentication mechanism of
      Application Messages using signatures. (*)

   o  Initial specification proposal for a padding mechanism to
      improving protection of Application Messages against traffic
      analysis. (*)

   o  Inversion of the Group Init Add and Application Secret derivations
      in the Handshake Key Schedule to be ease chaining in case we
      switch design. (*)

   o  Removal of the UserAdd construct and split of GroupAdd into Add
      and Welcome messages (*)

   o  Initial proposal for authenticating Handshake messages by signing
      over group state and including group state in the key schedule (*)




Barnes, et al.           Expires March 23, 2019                 [Page 4]


Internet-Draft                     MLS                    September 2018


   o  Added an appendix with example code for tree math

   o  Changed the ECIES mechanism used by TreeKEM so that it uses nonces
      generated from the shared secret

   draft-00

   o  Initial adoption of draft-barnes-mls-protocol-01 as a WG item.

2.  Terminology

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

   [TODO: The architecture document uses "Client" instead of
   "Participant".  Harmonize terminology.]

   Participant:  An agent that uses this protocol to establish shared
      cryptographic state with other participants.  A participant is
      defined by the cryptographic keys it holds.  An application may
      use one participant per device (keeping keys local to each device)
      or sync keys among a user's devices so that each user appears as a
      single participant.

   Group:  A collection of participants with shared cryptographic state.

   Member:  A participant that is included in the shared state of a
      group, and has access to the group's secrets.

   Initialization Key:  A short-lived Diffie-Hellman key pair used to
      introduce a new member to a group.  Initialization keys are
      published for individual participants (UserInitKey).

   Leaf Key:  A short-lived Diffie-Hellman key pair that represents a
      group member's contribution to the group secret, so called because
      the participants leaf keys are the leaves in the group's ratchet
      tree.

   Identity Key:  A long-lived signing key pair used to authenticate the
      sender of a message.

   Terminology specific to tree computations is described in Section 5.

   We use the TLS presentation language [RFC8446] to describe the
   structure of protocol messages.





Barnes, et al.           Expires March 23, 2019                 [Page 5]


Internet-Draft                     MLS                    September 2018


3.  Basic Assumptions

   This protocol is designed to execute in the context of a Messaging
   Service (MS) as described in [I-D.ietf-mls-architecture].  In
   particular, we assume the MS provides the following services:

   o  A long-term identity key provider which allows participants to
      authenticate protocol messages in a group.  These keys MUST be
      kept for the lifetime of the group as there is no mechanism in the
      protocol for changing a participant's identity key.

   o  A broadcast channel, for each group, which will relay a message to
      all members of a group.  For the most part, we assume that this
      channel delivers messages in the same order to all participants.
      (See Section 8 for further considerations.)

   o  A directory to which participants can publish initialization keys,
      and from which participant can download initialization keys for
      other participants.

4.  Protocol Overview

   The goal of this protocol is to allow a group of participants to
   exchange confidential and authenticated messages.  It does so by
   deriving a sequence of secrets and keys known only to group members.
   Those should be secret against an active network adversary and should
   have both forward and post-compromise secrecy with respect to
   compromise of a participant.

   We describe the information stored by each participant as a _state_,
   which includes both public and private data.  An initial state,
   including an initial set of participants, is set up by a group
   creator using the _Init_ algorithm and based on information pre-
   published by the initial members.  The creator sends the _GroupInit_
   message to the participants, who can then set up their own group
   state and derive the same shared secret.  Participants then exchange
   messages to produce new shared states which are causally linked to
   their predecessors, forming a logical Directed Acyclic Graph (DAG) of
   states.  Participants can send _Update_ messages for post-compromise
   secrecy and new participants can be added or existing participants
   removed from the group.

   The protocol algorithms we specify here follow.  Each algorithm
   specifies both (i) how a participant performs the operation and (ii)
   how other participants update their state based on it.

   There are four major operations in the lifecycle of a group:




Barnes, et al.           Expires March 23, 2019                 [Page 6]


Internet-Draft                     MLS                    September 2018


   o  Adding a member, initiated by a current member;

   o  Adding a member, initiated by the new member;

   o  Updating the leaf secret of a member;

   o  Removing a member.

   Before the initialization of a group, participants publish
   UserInitKey objects to a directory provided to the Messaging Service.

                                                             Group
   A              B              C          Directory       Channel
   |              |              |              |              |
   | UserInitKeyA |              |              |              |
   |------------------------------------------->|              |
   |              |              |              |              |
   |              | UserInitKeyB |              |              |
   |              |---------------------------->|              |
   |              |              |              |              |
   |              |              | UserInitKeyC |              |
   |              |              |------------->|              |
   |              |              |              |              |

   When a participant A wants to establish a group with B and C, it
   first downloads InitKeys for B and C.  It then initializes a group
   state containing only itself and uses the InitKeys to compute Add
   messages to add B and C, in a sequence chosen by A.  These messages
   are broadcasted to the Group, and processed in sequence by B and C.
   Messages received before a participant has joined the group are
   ignored.  Only after A has received its Add messages back from the
   server does it update its state to reflect their addition.



















Barnes, et al.           Expires March 23, 2019                 [Page 7]


Internet-Draft                     MLS                    September 2018


                                                                  Group
   A              B              C          Directory            Channel
   |              |              |              |                   |
   |         UserInitKeyB, UserInitKeyC         |                   |
   |<-------------------------------------------|                   |
   |              |              |              |                   |
   |              |              |              | Add(A->AB)        |
   |--------------------------------------------------------------->|
   |              |              |              |                   |
   |              |              |              | Add(AB->ABC)      |
   |--------------------------------------------------------------->|
   |              |              |              |                   |
   |              |              |              | Add(A->AB)        |
   |<---------------------------------------------------------------|
   |state.add(B)  |<------------------------------------------------|
   |              |state.init()  |x---------------------------------|
   |              |              |              |                   |
   |              |              |              | Add(AB->ABC)      |
   |<---------------------------------------------------------------|
   |state.add(C)  |<------------------------------------------------|
   |              |state.add(C)  |<---------------------------------|
   |              |              |state.init()  |                   |
   |              |              |              |                   |

   Subsequent additions of group members proceed in the same way.  Any
   member of the group can download an InitKey for a new participant and
   broadcast an Add message that the current group can use to update
   their state and the new participant can use to initialize its state.

   To enforce forward secrecy and post-compromise security of messages,
   each participant periodically updates its leaf secret which
   represents its contribution to the group secret.  Any member of the
   group can send an Update at any time by generating fresh leaf secret
   and keys and send an Update message that describes how to update the
   group secret with that new information.  Once all participants have
   processed this message, the group's secrets will be unknown to an
   attacker that had compromised the sender's prior leaf secret.

   It is left to the application to determine the interval of time
   between Update messages.  This policy could require a change for each
   message, or it could require sending an update every week or more.










Barnes, et al.           Expires March 23, 2019                 [Page 8]


Internet-Draft                     MLS                    September 2018


                                                             Group
   A              B     ...      Z          Directory        Channel
   |              |              |              |              |
   | Update(A)    |              |              |              |
   |---------------------------------------------------------->|
   |              |              |              |              |
   |              |              |              | Update(A)    |
   |<----------------------------------------------------------|
   |state.upd(A)  |<-------------------------------------------|
   |              |state.upd(A)  |<----------------------------|
   |              |              |state.upd(A)  |              |
   |              |              |              |              |

   Users are removed from the group in a similar way, as an update is
   effectively removing the old leaf from the group.  Any member of the
   group can generate a Remove message that adds new entropy to the
   group state that is known to all members except the removed member.
   After other participants have processed this message, the group's
   secrets will be unknown to the removed participant.  Note that this
   does not necessarily imply that any member is actually allowed to
   evict other members; groups can layer authentication-based access
   control policies on top of these basic mechanism.

                                                             Group
   A              B     ...      Z          Directory       Channel
   |              |              |              |              |
   |              |              | Remove(B)    |              |
   |              |              |---------------------------->|
   |              |              |              |              |
   |              |              |              | Remove(B)    |
   |<----------------------------------------------------------|
   |state.del(B)  |              |<----------------------------|
   |              |              |state.del(B)  |              |
   |              |              |              |              |
   |              |              |              |              |

5.  Ratchet Trees

   The protocol uses "ratchet trees" for deriving shared secrets among a
   group of participants.

5.1.  Terminology

   Trees consist of _nodes_. A node is a _leaf_ if it has no children,
   and a _parent_ otherwise; note that all parents in our Merkle or
   ratchet trees have precisely two children, a _left_ child and a
   _right_ child.  A node is the _root_ of a tree if it has no parents,
   and _intermediate_ if it has both children and parents.  The



Barnes, et al.           Expires March 23, 2019                 [Page 9]


Internet-Draft                     MLS                    September 2018


   _descendants_ of a node are that node, its children, and the
   descendants of its children, and we say a tree _contains_ a node if
   that node is a descendant of the root of the tree.  Nodes are
   _siblings_ if they share the same parent.

   A _subtree_ of a tree is the tree given by the descendants of any
   node, the _head_ of the subtree The _size_ of a tree or subtree is
   the number of leaf nodes it contains.  For a given parent node, its
   _left subtree_ is the subtree with its left child as head
   (respectively _right subtree_).

   All trees used in this protocol are left-balanced binary trees.  A
   binary tree is _full_ (and _balanced_) if it its size is a power of
   two and for any parent node in the tree, its left and right subtrees
   have the same size.  If a subtree is full and it is not a subset of
   any other full subtree, then it is _maximal_.

   A binary tree is _left-balanced_ if for every parent, either the
   parent is balanced, or the left subtree of that parent is the largest
   full subtree that could be constructed from the leaves present in the
   parent's own subtree.  Note that given a list of "n" items, there is
   a unique left-balanced binary tree structure with these elements as
   leaves.  In such a left-balanced tree, the "k-th" leaf node refers to
   the "k-th" leaf node in the tree when counting from the left,
   starting from 0.

   The _direct path_ of a root is the empty list, and of any other node
   is the concatenation of that node with the direct path of its parent.
   The _copath_ of a node is the list of siblings of nodes in its direct
   path, excluding the root, which has no sibling.  The _frontier_ of a
   tree is the list of heads of the maximal full subtrees of the tree,
   ordered from left to right.

   For example, in the below tree:

   o  The direct path of C is (C, CD, ABCD)

   o  The copath of C is (D, AB, EFG)

   o  The frontier of the tree is (ABCD, EF, G)











Barnes, et al.           Expires March 23, 2019                [Page 10]


Internet-Draft                     MLS                    September 2018


               ABCDEFG
              /      \
             /        \
            /          \
        ABCD            EFG
       /    \          /  \
      /      \        /    \
     AB      CD      EF    |
    / \     / \     / \    |
   A   B   C   D   E   F   G

                       1 1 1
   0 1 2 3 4 5 6 7 8 9 0 1 2

   Each node in the tree is assigned an _index_, starting at zero and
   running from left to right.  A node is a leaf node if and only if it
   has an even index.  The indices for the nodes in the above tree are
   as follows:

   o  0 = A

   o  1 = AB

   o  2 = B

   o  3 = ABCD

   o  4 = C

   o  5 = CD

   o  6 = D

   o  7 = ABCDEFG

   o  8 = E

   o  9 = EF

   o  10 = F

   o  11 = EFG

   o  12 = G

   (Note that left-balanced binary trees are the same structure that is
   used for the Merkle trees in the Certificate Transparency protocol
   [I-D.ietf-trans-rfc6962-bis].)



Barnes, et al.           Expires March 23, 2019                [Page 11]


Internet-Draft                     MLS                    September 2018


5.2.  Ratchet Tree Nodes

   Ratchet trees are used for generating shared group secrets.  In this
   section, we describe the structure of a ratchet tree, along with two
   ways to manage a ratchet tree, called ART and TreeKEM.

   To construct these trees, we require:

   o  A Diffie-Hellman finite-field group or elliptic curve

   o  A Derive-Key-Pair function that produces a key pair from an octet
      string

   o  A hash function (TreeKEM only)

   A ratchet tree is a left-balanced binary tree, in which each node
   contains up to three values:

   o  A secret octet string (optional)

   o  An asymmetric private key (optional)

   o  An asymmetric public key

   The private key and public key for a node are derived from its secret
   value using the Derive-Key-Pair operation.

   The relationships between nodes are different for ART and TreeKEM.
   In either case, the ratchet tree structure ensures the following
   property: A party can compute the secret value for the root of the
   tree if and only if that party holds the secret value for another
   node lower in the tree (together with public information).  Each
   participant holds one leaf secret; each participant can update the
   root secret by changing their leaf secret.

5.2.1.  Ratchet Trees for ART

   In ART the contents of a parent node are computed from its children
   as follows:

   o  parent_secret = DH(left_child, right_child)

   o  parent_private, parent_public = Derive-Key-Pair(parent_secret)

   Ratchet trees are constructed as left-balanced trees, defined such
   that each parent node's key pair is derived from the Diffie-Hellman
   shared secret of its two child nodes.  To compute the root secret and




Barnes, et al.           Expires March 23, 2019                [Page 12]


Internet-Draft                     MLS                    September 2018


   private key, a participant must know the public keys of nodes in its
   copath, as well as its own leaf private key.

   For example, the ratchet tree consisting of the private keys (A, B,
   C, D) is constructed as follows:

   DH(DH(AB), DH(CD))
       /      \
    DH(AB)    DH(CD)
    /  \      /  \
   A    B    C    D

5.2.2.  Ratchet Trees for TreeKEM

   In TreeKEM, the contents of a parent node are computed from one of
   its children as follows:

   o  parent_secret = Hash(child_secret)

   o  parent_private, parent_public = Derive-Key-Pair(parent_secret)

   The contents of the parent are based on the latest-updated child.
   For example, if participants with leaf secrets A, B, C, and D join a
   group in that order, then the resulting tree will have the following
   structure:

        H(H(D))
       /       \
    H(B)       H(D)
    /  \       /  \
   A    B     C    D

   If the first participant subsequently changes its leaf secret to be
   X, then the tree will have the following structure.

        H(H(X))
       /       \
    H(X)       H(D)
    /  \       /  \
   X    B     C    D

5.2.3.  Ratchet Tree Updates

   In order to update the state of the group such as adding and removing
   participants, MLS messages are used to make changes to the group's
   ratchet tree.  While the details of update processing differ between
   ART and TreeKEM (as described below), in both cases the participant
   proposing an update to the tree transmits a representation of a set



Barnes, et al.           Expires March 23, 2019                [Page 13]


Internet-Draft                     MLS                    September 2018


   of tree nodes along the direct path from a leaf to the root.  Other
   participants in the group can use these nodes to update their view of
   the tree, aligning their copy of the tree to the sender's.

   In ART, the transmitted nodes are represented by their public keys.
   Receivers process an update with the following steps:

   1.  Replace the public keys in the cached tree with the received
       values

   2.  Whenever a public key is updated for a node whose sibling has a
       private key populated:

       *  Perform a DH operation and update the node's parent

       *  Repeat the prior step until reaching the root

   In TreeKEM, the sender transmits a node by sending the public key for
   the node and an encrypted version of the secret value for the node.
   The secret value is encrypted in such a way that it can be decrypted
   only by holders of the private key for one of its children, namely
   the child that is not in the direct path being transmitted.  (That
   is, each node in the direct path is encrypted for holders of the
   private key for a node in the corresponding copath.)  For leaf nodes,
   no encrypted secret is transmitted.

   A TreeKEM update is processed with the following steps:

   1.  Compute the updated secret values * Identify a node in the direct
       path for which the local participant has the private key *
       Decrypt the secret value for that node * Compute secret values
       for ancestors of that node by hashing the decrypted secret

   2.  Merge the updated secrets into the tree * Replace the public keys
       for nodes on the direct path with the received public keys * For
       nodes where an updated secret was computed in step 1, replace the
       secret value for the node with the updated value

   For example, suppose we had the following tree:

         G
       /   \
      /     \
     E       F
    / \     / \
   A   B   C   D





Barnes, et al.           Expires March 23, 2019                [Page 14]


Internet-Draft                     MLS                    September 2018


   If an update is made along the direct path B-E-G, then the following
   values will be transmitted (using pk(X) to represent the public key
   corresponding to the secret value X and E(K, S) to represent public-
   key encryption to the public key K of the secret value S):

                       +------------+-------------+
                       | Public Key | Ciphertext  |
                       +------------+-------------+
                       | pk(G)      | E(pk(F), G) |
                       |            |             |
                       | pk(E)      | E(pk(A), E) |
                       |            |             |
                       | pk(B)      |             |
                       +------------+-------------+

5.3.  Cryptographic Objects

   Each MLS session uses a single ciphersuite that specifies the
   following primitives to be used in group key computations:

   o  A hash function

   o  A Diffie-Hellman finite-field group or elliptic curve

   o  An AEAD encryption algorithm (TreeKEM only) [RFC5116]

   The ciphersuite must also specify an algorithm "Derive-Key-Pair" that
   maps octet strings with the same length as the output of the hash
   function to key pairs for the asymmetric encryption scheme.

   Public keys used in the protocol are opaque values in a format
   defined by the ciphersuite, using the following types:

   uint16 CipherSuite;
   opaque DHPublicKey<1..2^16-1>;
   opaque SignaturePublicKey<1..2^16-1>;

5.3.1.  ART with Curve25519 and SHA-256

   This ciphersuite uses the following primitives:

   o  Hash function: SHA-256

   o  Diffie-Hellman group: Curve25519 [RFC7748]

   o  AEAD: N/A





Barnes, et al.           Expires March 23, 2019                [Page 15]


Internet-Draft                     MLS                    September 2018


   Given an octet string X, the private key produced by the Derive-Key-
   Pair operation is SHA-256(X).  (Recall that any 32-octet string is a
   valid Curve25519 private key.)  The corresponding public key is
   X25519(SHA-256(X), 9).

   Implementations SHOULD use the approach specified in [RFC7748] to
   calculate the Diffie-Hellman shared secret.  Implementations MUST
   check whether the computed Diffie-Hellman shared secret is the all-
   zero value and abort if so, as described in Section 6 of [RFC7748].
   If implementers use an alternative implementation of these elliptic
   curves, they SHOULD perform the additional checks specified in
   Section 7 of [RFC7748]

5.3.2.  ART with P-256 and SHA-256

   This ciphersuite uses the following primitives:

   o  Hash function: SHA-256

   o  Diffie-Hellman group: secp256r1 (NIST P-256)

   o  AEAD: N/A

   Given an octet string X, the private key produced by the Derive-Key-
   Pair operation is SHA-256(X), interpreted as a big-endian integer.
   The corresponding public key is the result of multiplying the
   standard P-256 base point by this integer.

   P-256 ECDH calculations (including parameter and key generation as
   well as the shared secret calculation) are performed according to
   [IEEE1363] using the ECKAS-DH1 scheme with the identity map as key
   derivation function (KDF), so that the shared secret is the
   x-coordinate of the ECDH shared secret elliptic curve point
   represented as an octet string.  Note that this octet string (Z in
   IEEE 1363 terminology) as output by FE2OSP, the Field Element to
   Octet String Conversion Primitive, has constant length for any given
   field; leading zeros found in this octet string MUST NOT be
   truncated.

   (Note that this use of the identity KDF is a technicality.  The
   complete picture is that ECDH is employed with a non-trivial KDF
   because MLS does not directly use this secret for anything other than
   for computing other secrets.)

   Clients MUST validate remote public values by ensuring that the point
   is a valid point on the elliptic curve.  The appropriate validation
   procedures are defined in Section 4.3.7 of [X962] and alternatively
   in Section 5.6.2.3 of [keyagreement].  This process consists of three



Barnes, et al.           Expires March 23, 2019                [Page 16]


Internet-Draft                     MLS                    September 2018


   steps: (1) verify that the value is not the point at infinity (O),
   (2) verify that for Y = (x, y) both integers are in the correct
   interval, (3) ensure that (x, y) is a correct solution to the
   elliptic curve equation.  For these curves, implementers do not need
   to verify membership in the correct subgroup.

5.3.3.  TreeKEM with Curve25519, SHA-256, and AES-128-GCM

   This ciphersuite uses the following primities:

   o  Hash function: SHA-256

   o  Diffie-Hellman group: Curve25519 [RFC7748]

   o  AEAD: AES-128-GCM

   DH and Derive-Key-Pair operations are performed in the same way as
   the corresponding ART ciphersuite.

   Encryption keys are derived from shared secrets by taking the first
   16 bytes of H(Z), where Z is the shared secret and H is SHA-256.

5.3.4.  TreeKEM with P-256, SHA-256, and AES-128-GCM

   This ciphersuite uses the following primities:

   o  Hash function: P-256

   o  Diffie-Hellman group: secp256r1 (NIST P-256)

   o  AEAD: AES-128-GCM

   DH and Derive-Key-Pair operations are performed in the same way as
   the corresponding ART ciphersuite.

   Encryption keys are derived from shared secrets by taking the first
   16 bytes of H(Z), where Z is the shared secret and H is SHA-256.

5.4.  Credentials

   A member of a group authenticates the identities of other
   participants by means of credentials issued by some authentication
   system, e.g., a PKI.  Each type of credential MUST express the
   holder's identity as well as the public key of a signature key pair
   that the holder of the credential will use to sign MLS messages.
   Credentials MAY also include information that allows a relying party
   to verify the identity / signing key binding.




Barnes, et al.           Expires March 23, 2019                [Page 17]


Internet-Draft                     MLS                    September 2018


   enum {
       basic(0),
       x509(1),
       (255)
   } CredentialType;

   struct {
       opaque identity<0..2^16-1>;
       SignaturePublicKey public_key;
   } BasicCredential;

   struct {
       CredentialType credential_type;
       select (credential_type) {
           case basic:
               BasicCredential;

           case x509:
               opaque cert_data<1..2^24-1>;
       };
   } Credential;

5.5.  Group State

   Each participant in the group maintains a representation of the state
   of the group:

   struct {
     opaque group_id<0..255>;
     uint32 epoch;
     Credential roster<1..2^32-1>;
     PublicKey tree<1..2^32-1>;
     GroupOperation transcript<0..2^32-1>;
   } GroupState;

   The fields in this state have the following semantics:

   o  The "group_id" field is an application-defined identifier for the
      group.

   o  The "epoch" field represents the current version of the group key.

   o  The "roster" field contains credentials for the occupied slots in
      the tree, including the identity and signature public key for the
      holder of the slot.

   o  The "tree" field contains the public keys corresponding to the
      nodes of the ratchet tree for this group.  The length of this



Barnes, et al.           Expires March 23, 2019                [Page 18]


Internet-Draft                     MLS                    September 2018


      vector MUST be "2*size + 1", where "size" is the length of the
      roster, since this is the number of nodes in a tree with "size"
      leaves, according to the structure described in Section 5.

   o  The "transcript" field contains the list of "GroupOperation"
      messages that led to this state.

   When a new member is added to the group, an existing member of the
   group provides the new member with a Welcome message.  The Welcome
   message provides the information the new member needs to initialize
   its GroupState.

   Different group operations will have different effects on the group
   state.  These effects are described in their respective subsections
   of Section 7.  The following rules apply to all operations:

   o  The "group_id" field is constant

   o  The "epoch" field increments by one for each GroupOperation that
      is processed

   o  The "transcript" is updated by a GroupOperation message
      "operation" by appending "operation" to "transcript"

5.6.  Direct Paths

   As described in Section 5.2.3, each MLS message needs to transmit
   node values along the direct path from a leaf to the root.  In ART,
   this simply entails sending the public key for each node.  In
   TreeKEM, the path contains a public key for the leaf node, and a
   public key and encrypted secret value for intermediate nodes in the
   path.  In both cases, the path is ordered from the leaf to the root;
   each node MUST be the parent of its predecessor.


















Barnes, et al.           Expires March 23, 2019                [Page 19]


Internet-Draft                     MLS                    September 2018


   DHPublicKey ARTPath<0..2^16-1>;

   struct {
       DHPublicKey ephemeral_key;
       opaque ciphertext<0..255>;
   } ECIESCiphertext;

   struct {
     DHPublicKey nodes<0..2^16-1>;
     ECIESCiphertext node\_secrets<0..2^16-1>;
   } TreeKEMPath;

   struct {
       select (mode) {
           case ART: ARTPath;
           case TreeKEM: TreeKEMPath;
       };
   } DirectPath;

   Note that in TreeKEM, the length of the "node\_secrets" vector MUST
   be exactly one less than the length of the "nodes" vector, since the
   secret value for the leaf node is not encrypted.  For "i > 0",
   "node_secrets[i-1]" has the encrypted node secret corresponding to
   the public key in "nodes[i]".

   When using TreeKEM, the ECIESCiphertext values encoding the encrypted
   secret values are computed as follows:

   o  Generate an ephemeral DH key pair (x, x*G) in the DH group
      specified by the ciphersuite in use

   o  Compute the shared secret Z with the node's other child

   o  Derive a key and nonce as described below

   o  Encrypt the node's secret value using the AEAD algorithm specified
      by the ciphersuite in use, with the following inputs:

      *  Key: The key derived from Z

      *  Nonce: The nonce derived from Z

      *  Additional Authenticated Data: The empty octet string

      *  Plaintext: The secret value, without any further formatting

   o  Encode the ECIESCiphertext with the following values:




Barnes, et al.           Expires March 23, 2019                [Page 20]


Internet-Draft                     MLS                    September 2018


      *  ephemeral_key: The ephemeral public key x*G

      *  ciphertext: The AEAD output

   key = HKDF-Expand(Secret, ECIESLabel("key"), Length)
   nonce = HKDF-Expand(Secret, ECIESLabel("nonce"), Length)

   Where ECIESLabel is specified as:

   struct {
     uint16 length = Length;
     opaque label<12..255> = "mls10 ecies " + Label;
   } ECIESLabel;

   Decryption is performed in the corresponding way, using the private
   key of the non-updated child and the ephemeral public key transmitted
   in the message.

5.7.  Key Schedule

   Group keys are derived using the HKDF-Extract and HKDF-Expand
   functions as defined in [RFC5869], as well as the functions defined
   below:

   Derive-Secret(Secret, Label, State, Length) =
        HKDF-Expand(Secret, HkdfLabel, Length)

   Where HkdfLabel is specified as:

   struct {
       uint16 length = Length;
       opaque label<6..255> = "mls10 " + Label;
       GroupState state = State;
   } HkdfLabel;

   The Hash function used by HKDF is the ciphersuite hash algorithm.
   Hash.length is its output length in bytes.  In the below diagram:

   o  HKDF-Extract takes its Salt argument from the top and its IKM
      argument from the left

   o  Derive-Secret takes its Secret argument from the incoming arrow

   When processing a handshake message, a participant combines the
   following information to derive new epoch secrets:

   o  The init secret from the previous epoch




Barnes, et al.           Expires March 23, 2019                [Page 21]


Internet-Draft                     MLS                    September 2018


   o  The update secret for the current epoch

   o  The GroupState object for current epoch

   Given these inputs, the derivation of secrets for an epoch proceeds
   as shown in the following diagram:

                  init_secret_[n-1] (or 0)
                        |
                        V
   update_secret -> HKDF-Extract = epoch_secret
                        |
                        +--> Derive-Secret(., "app", GroupState_[n])
                        |    = application_secret
                        |
                        V
                  Derive-Secret(., "init", GroupState_[n])
                        |
                        V
                  init_secret_[n]

6.  Initialization Keys

   In order to facilitate asynchronous addition of participants to a
   group, it is possible to pre-publish initialization keys that provide
   some public information about a user.  UserInitKey messages provide
   information about a potential group member, that a group member can
   use to add this user to a group asynchronously.

   A UserInitKey object specifies what ciphersuites a client supports,
   as well as providing public keys that the client can use for key
   derivation and signing.  The client's identity key is intended to be
   stable throughout the lifetime of the group; there is no mechanism to
   change it.  Init keys are intended to be used a very limited number
   of times, potentially once. (see Section 10.4).

   The init_keys array MUST have the same length as the cipher_suites
   array, and each entry in the init_keys array MUST be a public key for
   the DH group or KEM defined by the corresponding entry in the
   cipher_suites array.

   The whole structure is signed using the client's identity key.  A
   UserInitKey object with an invalid signature field MUST be considered
   malformed.  The input to the signature computation comprises all of
   the fields except for the signature field.






Barnes, et al.           Expires March 23, 2019                [Page 22]


Internet-Draft                     MLS                    September 2018


   struct {
       CipherSuite cipher_suites<0..255>;
       DHPublicKey init_keys<1..2^16-1>;
       SignaturePublicKey identity_key;
       SignatureScheme algorithm;
       opaque signature<0..2^16-1>;
   } UserInitKey;

7.  Handshake Messages

   Over the lifetime of a group, its state will change for:

   o  Group initialization

   o  A current member adding a new participant

   o  A current participant updating its leaf key

   o  A current member deleting another current member

   In MLS, these changes are accomplished by broadcasting "handshake"
   messages to the group.  Note that unlike TLS and DTLS, there is not a
   consolidated handshake phase to the protocol.  Rather, handshake
   messages are exchanged throughout the lifetime of a group, whenever a
   change is made to the group state.  This means an unbounded number of
   interleaved application and handshake messages.

   An MLS handshake message encapsulates a specific "key exchange"
   message that accomplishes a change to the group state.  It also
   includes a signature by the sender of the message over the GroupState
   object representing the state of the group after the change has been
   made.



















Barnes, et al.           Expires March 23, 2019                [Page 23]


Internet-Draft                     MLS                    September 2018


   enum {
       init(0),
       add(1),
       update(2),
       remove(3),
       (255)
   } GroupOperationType;

   struct {
       GroupOperationType msg_type;
       select (GroupOperation.msg_type) {
           case init:      Init;
           case add:       Add;
           case update:    Update;
           case remove:    Remove;
       };
   } GroupOperation;

   struct {
       uint32 prior_epoch;
       GroupOperation operation;

       uint32 signer_index;
       SignatureScheme algorithm;
       opaque signature<1..2^16-1>;
   } Handshake;

   The high-level flow for processing a Handshake message is as follows:

   1.  Verify that the "prior_epoch" field of the Handshake message is
       equal the "epoch" field of the current GroupState object.

   2.  Use the "operation" message to produce an updated GroupState
       object incorporating the proposed changes.

   3.  Look up the public key for slot index "signer_index" from the
       roster in the current GroupState object (before the update).

   4.  Use that public key to verify the "signature" field in the
       Handshake message, with the updated GroupState object as input.

   5.  If the signature fails to verify, discard the updated GroupState
       object and consider the Handshake message invalid.

   6.  If the signature verifies successfully, consider the updated
       GroupState object as the current state of the group.





Barnes, et al.           Expires March 23, 2019                [Page 24]


Internet-Draft                     MLS                    September 2018


   [[ OPEN ISSUE: The Add and Remove operations create a "double-join"
   situation, where a participants leaf key is also known to another
   participant.  When a participant A is double-joined to another B,
   deleting A will not remove them from the conversation, since they
   will still hold the leaf key for B.  These situations are resolved by
   updates, but since operations are asynchronous and participants may
   be offline for a long time, the group will need to be able to
   maintain security in the presence of double-joins. ]]

   [[ OPEN ISSUE: It is not possible for the recipient of a handshake
   message to verify that ratchet tree information in the message is
   accurate, because each node can only compute the secret and private
   key for nodes in its direct path.  This creates the possibility that
   a malicious participant could cause a denial of service by sending a
   handshake message with invalid values for public keys in the ratchet
   tree. ]]

7.1.  Init

   [[ OPEN ISSUE: Direct initialization is currently undefined.  A
   participant can create a group by initializing its own state to
   reflect a group including only itself, then adding the initial
   participants.  This has computation and communication complexity O(N
   log N) instead of the O(N) complexity of direct initialization. ]]

7.2.  Add

   In order to add a new member to the group, an existing member of the
   group must take two actions:

   1.  Send a Welcome message to the new member

   2.  Send an Add message to the group (including the new member)

   The Welcome message contains the information that the new member
   needs to initialize a GroupState object that can be updated to the
   current state using the Add message:

   struct {
     opaque group_id<0..255>;
     uint32 epoch;
     Credential roster<1..2^32-1>;
     PublicKey tree<1..2^32-1>;
     GroupOperation transcript<0..2^32-1>;
     opaque init_secret<0..255>;
     opaque leaf_secret<0..255>;
   } Welcome;




Barnes, et al.           Expires March 23, 2019                [Page 25]


Internet-Draft                     MLS                    September 2018


   Since the new member is expected to process the Add message for
   itself, the Welcome message should reflect the state of the group
   before the new user is added.  The sender of the Welcome message can
   simply copy all fields except the "leaf_secret" from its GroupState
   object.

   [[ OPEN ISSUE: The Welcome message needs to be sent encrypted for the
   new member.  This should be done using the public key in the
   UserInitKey, either with ECIES or X3DH. ]]

   [[ OPEN ISSUE: The Welcome message needs to be synchronized in the
   same way as the Add.  That is, the Welcome should be sent only if the
   Add succeeds, and is not in conflict with another, simultaneous Add.
   ]]

   An Add message provides existing group members with the information
   they need to update their GroupState with information about the new
   member:

   struct {
       DirectPath path<1..2^16-1>;
       UserInitKey init_key;
   } Add;

   A group member generates this message using the following steps:

   o  Requesting from the directory a UserInitKey for the user to be
      added

   o  Generate a fresh leaf secret and derive a leaf key pair

   o  Use the ratchet tree and the new leaf secret to compute the direct
      path between the new leaf and the new root

   The generated leaf secret is placed in the "leaf_secret" field of the
   Welcome message.  The direct path and the UserInitKey are placed
   their respective fields in the Add message.

   The new participant processes Welcome and Add messages together as
   follows:

   o  Prepare a new GroupState object based on the Welcome message

   o  Process the Add message as an existing participant would

   An existing participant receiving a Add message first verifies the
   signature on the message, then updates its state as follows:




Barnes, et al.           Expires March 23, 2019                [Page 26]


Internet-Draft                     MLS                    September 2018


   o  Increment the size of the group

   o  Verify the signature on the included UserInitKey; if the signature
      verification fails, abort

   o  Append an entry to the roster containing the credential in the
      included UserInitKey

   o  Update the ratchet tree with the included direct path

   The update secret resulting from this change is the secret for the
   root node of the ratchet tree.

7.3.  Update

   An Update message is sent by a group participant to update its leaf
   key pair.  This operation provides post-compromise security with
   regard to the participant's prior leaf private key.

   struct {
       DirectPath path;
   } Update;

   The sender of an Update message creates it in the following way:

   o  Generate a fresh leaf key pair

   o  Compute its direct path in the current ratchet tree

   An existing participant receiving a Update message first verifies the
   signature on the message, then updates its state as follows:

   o  Update the cached ratchet tree by replacing nodes in the direct
      path from the updated leaf using the information contained in the
      Update message

   The update secret resulting from this change is the secret for the
   root node of the ratchet tree.

7.4.  Remove

   A Remove message is sent by a group member to remove one or more
   participants from the group.

   struct {
       uint32 removed;
       DirectPath path;
   } Remove;



Barnes, et al.           Expires March 23, 2019                [Page 27]


Internet-Draft                     MLS                    September 2018


   The sender of a Remove message generates it as as follows:

   o  Generate a fresh leaf key pair

   o  Compute its direct path in the current ratchet tree, starting from
      the removed leaf

   An existing participant receiving a Remove message first verifies the
   signature on the message, then verifies its identity proof against
   the identity tree held by the participant.  The participant then
   updates its state as follows:

   o  Update the roster by replacing the credential in the removed slot
      with the credential from the sender's slot (i.e., the sender of
      the Remove takes over the removed slot)

   o  Update the cached ratchet tree by replacing nodes in the direct
      path from the removed leaf using the information in the Remove
      message

   The update secret resulting from this change is the secret for the
   root node of the ratchet tree after both updates.

8.  Sequencing of State Changes

   [[ OPEN ISSUE: This section has an initial set of considerations
   regarding sequencing.  It would be good to have some more detailed
   discussion, and hopefully have a mechanism to deal with this issue.
   ]]

   Each handshake message is premised on a given starting state,
   indicated in its "prior_epoch" field.  If the changes implied by a
   handshake messages are made starting from a different state, the
   results will be incorrect.

   This need for sequencing is not a problem as long as each time a
   group member sends a handshake message, it is based on the most
   current state of the group.  In practice, however, there is a risk
   that two members will generate handshake messages simultaneously,
   based on the same state.

   When this happens, there is a need for the members of the group to
   deconflict the simultaneous handshake messages.  There are two
   general approaches:

   o  Have the delivery service enforce a total order

   o  Have a signal in the message that clients can use to break ties



Barnes, et al.           Expires March 23, 2019                [Page 28]


Internet-Draft                     MLS                    September 2018


   In ART, in either case, there is a risk of starvation.  In a
   sufficiently busy group, a given member may never be able to send a
   handshake message, because he always loses to other members.  The
   degree to which this is a practical problem will depend on the
   dynamics of the application.

   In TreeKEM, because of the non-contributivity of intermediate nodes
   update messages can be applied one after the other without the
   Delivery Service having to reject any handshake message which makes
   TreeKEM more resilient regarding the concurrency of handshake
   messages.  The Messaging system can decide to choose the order for
   applying the state changes.  Note that there are certain cases (if no
   total ordering is applied by the Delivery Service) where the ordering
   is important for security, ie. all updates must be executed before
   removes.

   Regardless of how messages are kept in sequence, implementations MUST
   only update their cryptographic state when valid handshake messages
   are received.  Generation of handshake messages MUST be stateless,
   since the endpoint cannot know at that time whether the change
   implied by the handshake message will succeed or not.

8.1.  Server-Enforced Ordering

   With this approach, the delivery service ensures that incoming
   messages are added to an ordered queue and outgoing messages are
   dispatched in the same order.  The server is trusted to resolve
   conflicts during race-conditions (when two members send a message at
   the same time), as the server doesn't have any additional knowledge
   thanks to the confidentiality of the messages.

   Messages should have a counter field sent in clear-text that can be
   checked by the server and used for tie-breaking.  The counter starts
   at 0 and is incremented for every new incoming message.  In ART, if
   two group members send a message with the same counter, the first
   message to arrive will be accepted by the server and the second one
   will be rejected.  The rejected message needs to be sent again with
   the correct counter number.  In TreeKEM, the message does not
   necessarily need to be resent.

   To prevent counter manipulation by the server, the counter's
   integrity can be ensured by including the counter in a signed message
   envelope.

   This applies to all messages, not only state changing messages.






Barnes, et al.           Expires March 23, 2019                [Page 29]


Internet-Draft                     MLS                    September 2018


8.2.  Client-Enforced Ordering

   Order enforcement can be implemented on the client as well, one way
   to achieve it is to use a two step update protocol: the first client
   sends a proposal to update and the proposal is accepted when it gets
   50%+ approval from the rest of the group, then it sends the approved
   update.  Clients which didn't get their proposal accepted, will wait
   for the winner to send their update before retrying new proposals.

   While this seems safer as it doesn't rely on the server, it is more
   complex and harder to implement.  It also could cause starvation for
   some clients if they keep failing to get their proposal accepted.

8.3.  Merging Updates

   When TreeKEM is in use, it is possible to partly address the problem
   of concurrent changes by having the recipients of the changes merge
   them, rather than having the senders retry.  Because the value of
   intermediate node is determined by its last updated child (as opposed
   to both its children in ART), TreeKEM updates can be merged by
   recipients as long as the recipients agree on an order - the only
   question is which node was last updated.

   Recall that the processing of a TreeKEM update proceeds in two steps:

   1.  Compute updated secret values by hashing up the tree

   2.  Update the tree with the new secret and public values

   To merge an ordered list of updates, a recipient simply performs
   these updates in the specified order.

   For example, suppose we have a tree in the following configuration:

         H(H(D))
        /       \
     H(B)      H(D)
     /  \      /  \
    A    B    C    D

   Now suppose B and C simultaneously decide to update to X and Y,
   respectively.  They will send out updates of the following form:









Barnes, et al.           Expires March 23, 2019                [Page 30]


Internet-Draft                     MLS                    September 2018


     Update from B      Update from C
     =============      =============
         H(H(X))            H(H(Y))
        /                         \
     H(X)                         H(Y)
        \                         /
         X                       Y

   Assuming that the ordering agreed by the group says that B's update
   should be processed before C's, the other participants in the group
   will overwrite the root value for B with the root value from C, and
   all arrive at the following state:

         H(H(Y))
        /       \
     H(X)      H(Y)
     /  \      /  \
    A    X    Y    D

9.  Message Protection

   The primary purpose of the handshake protocol is to provide an
   authenticated group key exchange to participants.  In order to
   protect Application messages sent among those participants, the
   Application secret provided by the Handshake key schedule is used to
   derive encryption keys for the Message Protection Layer.

   Application messages MUST be protected with the Authenticated-
   Encryption with Associated-Data (AEAD) encryption scheme associated
   with the MLS ciphersuite.  Note that "Authenticated" in this context
   does not mean messages are known to be sent by a specific participant
   but only from a legitimate member of the group.  To authenticate a
   message from a particular member, signatures are required.  Handshake
   messages MUST use asymmetric signatures to strongly authenticate the
   sender of a message.

   Each participant maintains their own chain of Application secrets,
   where the first one is derived based on a secret chained from the
   Epoch secret.  As shown in Section 5.7, the initial Application
   secret is bound to the identity of each participant to avoid
   collisions and allow support for decryption of reordered messages.

   Subsequent Application secrets MUST be rotated for each message sent
   in order to provide stronger cryptographic security guarantees.  The
   Application Key Schedule use this rotation to generate fresh AEAD
   encryption keys and nonces used to encrypt and decrypt future
   Application messages.  In all cases, a participant MUST NOT encrypt
   more than expected by the security bounds of the AEAD scheme used.



Barnes, et al.           Expires March 23, 2019                [Page 31]


Internet-Draft                     MLS                    September 2018


   Note that each change to the Group through a Handshake message will
   cause a change of the Group Secret.  Hence this change MUST be
   applied before encrypting any new Application message.  This is
   required for confidentiality reasons in order for Members to avoid
   receiving messages from the group after leaving, being added to, or
   excluded from the Group.

9.1.  Application Key Schedule

   After computing the initial Application Secret shared by the group,
   each Participant creates an initial Participant Application Secret to
   be used for its own sending chain:

              application_secret
                        |
                        V
              Derive-Secret(., "app sender", [sender])
                        |
                        V
              application_secret_[sender]_[0]

   Note that [sender] represent the uint32 value encoding the index of
   the participant in the ratchet tree.

   Updating the Application secret and deriving the associated AEAD key
   and nonce can be summarized as the following Application key schedule
   where each participant's Application secret chain looks as follows
   after the initial derivation:

           application_secret_[sender]_[N-1]
                     |
                     +--> HKDF-Expand-Label(.,"nonce", "", nonce_length)
                     |    = write_nonce_[sender]_[N-1]
                     |
                     +--> HKDF-Expand-Label(.,"key", "", key_length)
                     |    = write_key_[sender]_[N-1]
                     V
           Derive-Secret(., "app upd","")
                     |
                     V
           application_secret_[sender]_[N]

   The Application context provided together with the previous
   Application secret is used to bind the Application messages with the
   next key and add some freshness.






Barnes, et al.           Expires March 23, 2019                [Page 32]


Internet-Draft                     MLS                    September 2018


   [[OPEN ISSUE: The HKDF context field is left empty for now.  A proper
   security study is needed to make sure that we do not need more
   information in the context to achieve the security goals.]]

   [[ OPEN ISSUE: At the moment there is no contributivity of
   Application secrets chained from the initial one to the next
   generation of Epoch secret.  While this seems safe because
   cryptographic operations using the application secrets can't affect
   the group init_secret, it remains to be proven correct. ]]

9.1.1.  Updating the Application Secret

   The following rules apply to an Application Secret:

   o  Senders MUST only use the Application Secret once and
      monotonically increment the generation of their secret.  This is
      important to provide Forward Secrecy at the level of Application
      messages.  An attacker getting hold of a Participant's Application
      Secret at generation [N+1] will not be able to derive the
      Participant's Application Secret [N] nor the associated AEAD key
      and nonce.

   o  Receivers MUST delete an Application Secret once it has been used
      to derive the corresponding AEAD key and nonce as well as the next
      Application Secret.  Receivers MAY keep the AEAD key and nonce
      around for some reasonable period.

   o  Receivers MUST delete AEAD keys and nonces once they have been
      used to successfully decrypt a message.

9.1.2.  Application AEAD Key Calculation

   The Application AEAD keying material is generated from the following
   input values:

   o  The Application Secret value;

   o  A purpose value indicating the specific value being generated;

   o  The length of the key being generated.

   Note, that because the identity of the participant using the keys to
   send data is included in the initial Application Secret, all
   successive updates to the Application secret will implicitly inherit
   this ownership.

   All the traffic keying material is recomputed whenever the underlying
   Application Secret changes.



Barnes, et al.           Expires March 23, 2019                [Page 33]


Internet-Draft                     MLS                    September 2018


9.2.  Message Encryption and Decryption

   The Group participants MUST use the AEAD algorithm associated with
   the negotiated MLS ciphersuite to AEAD encrypt and decrypt their
   Application messages and sign them as follows:

       struct {
           opaque content<0..2^32-1>;
           opaque signature<0..2^16-1>;
           uint8 zeros[length_of_padding];
       } ApplicationPlaintext;

       struct {
           uint8  group[32];
           uint32 epoch;
           uint32 generation;
           uint32 sender;
           opaque encrypted_content<0..2^32-1>;
       } Application;

   The Group identifier and epoch allow a device to know which Group
   secrets should be used and from which Epoch secret to start computing
   other secrets and keys.  The participant identifier is used to derive
   the participant Application secret chain from the initial shared
   Application secret.  The application generation field is used to
   determine which Application secret should be used from the chain to
   compute the correct AEAD keys before performing decryption.

   The signature field allows strong authentication of messages:

       struct {
           uint8  group[32];
           uint32 epoch;
           uint32 generation;
           uint32 sender;
           opaque content<0..2^32-1>;
       } MLSSignatureContent;

   The signature used in the MLSPlaintext is computed over the
   MLSSignatureContent which covers the metadata information about the
   current state of the group (group identifier, epoch, generation and
   sender's Leaf index) to prevent Group participants from impersonating
   other participants.  It is also necessary in order to prevent cross-
   group attacks.

   [[ TODO: A preliminary formal security analysis has yet to be
   performed on this authentication scheme.]]




Barnes, et al.           Expires March 23, 2019                [Page 34]


Internet-Draft                     MLS                    September 2018


   [[ OPEN ISSUE: Currently, the group identifier, epoch and generation
   are contained as meta-data of the Signature.  A different solution
   could be to include the GroupState instead, if more information is
   required to achieve the security goals regarding cross-group attacks.
   ]]

   [[ OPEN ISSUE: Should the padding be required for Handshake messages
   ? Can an adversary get more than the position of a participant in the
   tree without padding ? Should the base ciphertext block length be
   negotiated or is is reasonable to allow to leak a range for the
   length of the plaintext by allowing to send a variable number of
   ciphertext blocks ? ]]

   Application messages SHOULD be padded to provide some resistance
   against traffic analysis techniques over encrypted traffic.  [CLINIC]
   [HCJ16] While MLS might deliver the same payload less frequently
   across a lot of ciphertexts than traditional web servers, it might
   still provide the attacker enough information to mount an attack.  If
   Alice asks Bob: "When are we going to the movie ?" the answer
   "Wednesday" might be leaked to an adversary by the ciphertext length.
   An attacker expecting Alice to answer Bob with a day of the week
   might find out the plaintext by correlation between the question and
   the length.

   Similarly to TLS 1.3, if padding is used, the MLS messages MUST be
   padded with zero-valued bytes before AEAD encryption.  Upon AEAD
   decryption, the length field of the plaintext is used to compute the
   number of bytes to be removed from the plaintext to get the correct
   data.  As the padding mechanism is used to improve protection against
   traffic analysis, removal of the padding SHOULD be implemented in a
   "constant-time" manner at the MLS layer and above layers to prevent
   timing side-channels that would provide attackers with information on
   the size of the plaintext.

9.2.1.  Delayed and Reordered Application messages

   Since each Application message contains the Group identifier, the
   epoch and a message counter, a participant can receive messages out
   of order.  If they are able to retrieve or recompute the correct AEAD
   decryption key from currently stored cryptographic material
   participants can decrypt these messages.

   For usability, MLS Participants might be required to keep the AEAD
   key and nonce for a certain amount of time to retain the ability to
   decrypt delayed or out of order messages, possibly still in transit
   while a decryption is being done.





Barnes, et al.           Expires March 23, 2019                [Page 35]


Internet-Draft                     MLS                    September 2018


   [[TODO: Describe here or in the Architecture spec the details.
   Depending on which Secret or key is kept alive, the security
   guarantees will vary.]]

10.  Security Considerations

   The security goals of MLS are described in [I-D.ietf-mls-
   architecture].  We describe here how the protocol achieves its goals
   at a high level, though a complete security analysis is outside of
   the scope of this document.

10.1.  Confidentiality of the Group Secrets

   Group secrets are derived from (i) previous group secrets, and (ii)
   the root key of a ratcheting tree.  Only group members know their
   leaf private key in the group, therefore, the root key of the group's
   ratcheting tree is secret and thus so are all values derived from it.

   Initial leaf keys are known only by their owner and the group
   creator, because they are derived from an authenticated key exchange
   protocol.  Subsequent leaf keys are known only by their owner.
   [[TODO: or by someone who replaced them.]]

   Note that the long-term identity keys used by the protocol MUST be
   distributed by an "honest" authentication service for parties to
   authenticate their legitimate peers.

10.2.  Authentication

   There are two forms of authentication we consider.  The first form
   considers authentication with respect to the group.  That is, the
   group members can verify that a message originated from one of the
   members of the group.  This is implicitly guaranteed by the secrecy
   of the shared key derived from the ratcheting trees: if all members
   of the group are honest, then the shared group key is only known to
   the group members.  By using AEAD or appropriate MAC with this shared
   key, we can guarantee that a participant in the group (who knows the
   shared secret key) has sent a message.

   The second form considers authentication with respect to the sender,
   meaning the group members can verify that a message originated from a
   particular member of the group.  This property is provided by digital
   signatures on the messages under identity keys.

   [[ OPEN ISSUE: Signatures under the identity keys, while simple, have
   the side-effect of preclude deniability.  We may wish to allow other
   options, such as (ii) a key chained off of the identity key, or (iii)
   some other key obtained through a different manner, such as a



Barnes, et al.           Expires March 23, 2019                [Page 36]


Internet-Draft                     MLS                    September 2018


   pairwise channel that provides deniability for the message
   contents.]]

10.3.  Forward and post-compromise security

   Message encryption keys are derived via a hash ratchet, which
   provides a form of forward secrecy: learning a message key does not
   reveal previous message or root keys.  Post-compromise security is
   provided by Update operations, in which a new root key is generated
   from the latest ratcheting tree.  If the adversary cannot derive the
   updated root key after an Update operation, it cannot compute any
   derived secrets.

10.4.  Init Key Reuse

   Initialization keys are intended to be used only once and then
   deleted.  Reuse of init keys is not believed to be inherently
   insecure [dhreuse], although it can complicate protocol analyses.

11.  IANA Considerations

   TODO: Registries for protocol parameters, e.g., ciphersuites

12.  Contributors

   o  Benjamin Beurdouche
      INRIA
      benjamin.beurdouche@ens.fr

   o  Karthikeyan Bhargavan
      INRIA
      karthikeyan.bhargavan@inria.fr

   o  Cas Cremers
      University of Oxford
      cas.cremers@cs.ox.ac.uk

   o  Alan Duric
      Wire
      alan@wire.com

   o  Srinivas Inguva
      Twitter
      singuva@twitter.com

   o  Albert Kwon
      MIT
      kwonal@mit.edu



Barnes, et al.           Expires March 23, 2019                [Page 37]


Internet-Draft                     MLS                    September 2018


   o  Eric Rescorla
      Mozilla
      ekr@rtfm.com

   o  Thyla van der Merwe
      Royal Holloway, University of London
      thyla.van.der@merwe.tech

13.  References

13.1.  Normative References

   [IEEE1363]
              "IEEE Standard Specifications for Password-Based Public-
              Key Cryptographic Techniques", IEEE standard,
              DOI 10.1109/ieeestd.2009.4773330, n.d..

   [RFC2119]  Bradner, S., "Key words for use in RFCs to Indicate
              Requirement Levels", BCP 14, RFC 2119,
              DOI 10.17487/RFC2119, March 1997,
              <https://www.rfc-editor.org/info/rfc2119>.

   [RFC5116]  McGrew, D., "An Interface and Algorithms for Authenticated
              Encryption", RFC 5116, DOI 10.17487/RFC5116, January 2008,
              <https://www.rfc-editor.org/info/rfc5116>.

   [RFC5869]  Krawczyk, H. and P. Eronen, "HMAC-based Extract-and-Expand
              Key Derivation Function (HKDF)", RFC 5869,
              DOI 10.17487/RFC5869, May 2010,
              <https://www.rfc-editor.org/info/rfc5869>.

   [RFC7748]  Langley, A., Hamburg, M., and S. Turner, "Elliptic Curves
              for Security", RFC 7748, DOI 10.17487/RFC7748, January
              2016, <https://www.rfc-editor.org/info/rfc7748>.

   [RFC8446]  Rescorla, E., "The Transport Layer Security (TLS) Protocol
              Version 1.3", RFC 8446, DOI 10.17487/RFC8446, August 2018,
              <https://www.rfc-editor.org/info/rfc8446>.

   [X962]     ANSI, "Public Key Cryptography For The Financial Services
              Industry: The Elliptic Curve Digital Signature Algorithm
              (ECDSA)", ANSI X9.62, 1998.

13.2.  Informative References







Barnes, et al.           Expires March 23, 2019                [Page 38]


Internet-Draft                     MLS                    September 2018


   [art]      Cohn-Gordon, K., Cremers, C., Garratt, L., Millican, J.,
              and K. Milner, "On Ends-to-Ends Encryption: Asynchronous
              Group Messaging with Strong Security Guarantees", January
              2018, <https://eprint.iacr.org/2017/666.pdf>.

   [CLINIC]   Miller, B., Huang, L., Joseph, A., and J. Tygar, "I Know
              Why You Went to the Clinic: Risks and Realization of HTTPS
              Traffic Analysis", Privacy Enhancing Technologies pp.
              143-163, DOI 10.1007/978-3-319-08506-7_8, 2014.

   [dhreuse]  Menezes, A. and B. Ustaoglu, "On reusing ephemeral keys in
              Diffie-Hellman key agreement protocols", International
              Journal of Applied Cryptography Vol. 2, pp. 154,
              DOI 10.1504/ijact.2010.038308, 2010.

   [doubleratchet]
              Cohn-Gordon, K., Cremers, C., Dowling, B., Garratt, L.,
              and D. Stebila, "A Formal Security Analysis of the Signal
              Messaging Protocol", 2017 IEEE European Symposium on
              Security and Privacy (EuroS&P),
              DOI 10.1109/eurosp.2017.27, April 2017.

   [HCJ16]    Husak, M., &#268;ermak, M., Jirsik, T., and P.
              &#268;eleda, "HTTPS traffic analysis and client
              identification using passive SSL/TLS fingerprinting",
              EURASIP Journal on Information Security Vol. 2016,
              DOI 10.1186/s13635-016-0030-7, February 2016.

   [I-D.ietf-trans-rfc6962-bis]
              Laurie, B., Langley, A., Kasper, E., Messeri, E., and R.
              Stradling, "Certificate Transparency Version 2.0", draft-
              ietf-trans-rfc6962-bis-28 (work in progress), March 2018.

   [keyagreement]
              Barker, E., Chen, L., Roginsky, A., and M. Smid,
              "Recommendation for Pair-Wise Key Establishment Schemes
              Using Discrete Logarithm Cryptography", National Institute
              of Standards and Technology report,
              DOI 10.6028/nist.sp.800-56ar2, May 2013.

   [signal]   Perrin(ed), T. and M. Marlinspike, "The Double Ratchet
              Algorithm", n.d.,
              <https://www.signal.org/docs/specifications/
              doubleratchet/>.







Barnes, et al.           Expires March 23, 2019                [Page 39]


Internet-Draft                     MLS                    September 2018


Appendix A.  Tree Math

   One benefit of using left-balanced trees is that they admit a simple
   flat array representation.  In this representation, leaf nodes are
   even-numbered nodes, with the n-th leaf at 2*n.  Intermediate nodes
   are held in odd-numbered nodes.  For example, a 11-element tree has
   the following structure:

                                                X
                        X
            X                       X                       X
      X           X           X           X           X
   X     X     X     X     X     X     X     X     X     X     X
   0  1  2  3  4  5  6  7  8  9 10 11 12 13 14 15 16 17 18 19 20

   This allows us to compute relationships between tree nodes simply by
   manipulating indices, rather than having to maintain complicated
   structures in memory, even for partial trees.  The basic rule is that
   the high-order bits of parent and child nodes have the following
   relation (where "x" is an arbitrary bit string):

   parent=01x => left=00x, right=10x

   The following python code demonstrates the tree computations
   necessary for MLS.  Test vectors can be derived from the diagram
   above.

   # The largest power of 2 less than n.  Equivalent to:
   #   int(math.floor(math.log(x, 2)))
   def log2(x):
       if x == 0:
           return 0

       k = 0
       while (x >> k) > 0:
           k += 1
       return k-1

   # The level of a node in the tree.  Leaves are level 0, their
   # parents are level 1, etc.  If a node's children are at different
   # level, then its level is the max level of its children plus one.
   def level(x):
       if x & 0x01 == 0:
           return 0

       k = 0
       while ((x >> k) & 0x01) == 1:
           k += 1



Barnes, et al.           Expires March 23, 2019                [Page 40]


Internet-Draft                     MLS                    September 2018


       return k

   # The number of nodes needed to represent a tree with n leaves
   def node_width(n):
       return 2*(n - 1) + 1

   # The index of the root node of a tree with n leaves
   def root(n):
       w = node_width(n)
       return (1 << log2(w)) - 1

   # The left child of an intermediate node.  Note that because the
   # tree is left-balanced, there is no dependency on the size of the
   # tree.  The child of a leaf node is itself.
   def left(x):
       k = level(x)
       if k == 0:
           return x

       return x ^ (0x01 << (k - 1))

   # The right child of an intermediate node.  Depends on the size of
   # the tree because the straightforward calculation can take you
   # beyond the edge of the tree.  The child of a leaf node is itself.
   def right(x, n):
       k = level(x)
       if k == 0:
           return x

       r = x ^ (0x03 << (k - 1))
       while r >= node_width(n):
           r = left(r)
       return r

   # The immediate parent of a node.  May be beyond the right edge of
   # the tree.
   def parent_step(x):
       k = level(x)
       b = (x >> (k + 1)) & 0x01
       return (x | (1 << k)) ^ (b << (k + 1))

   # The parent of a node.  As with the right child calculation, have
   # to walk back until the parent is within the range of the tree.
   def parent(x, n):
       if x == root(n):
           return x

       p = parent_step(x)



Barnes, et al.           Expires March 23, 2019                [Page 41]


Internet-Draft                     MLS                    September 2018


       while p >= node_width(n):
           p = parent_step(p)
       return p

   # The other child of the node's parent.  Root's sibling is itself.
   def sibling(x, n):
       p = parent(x, n)
       if x < p:
           return right(p, n)
       elif x > p:
           return left(p)

       return p

   # The direct path from a node to the root, ordered from the root
   # down, not including the root or the terminal node
   def direct_path(x, n):
       d = []
       p = parent(x, n)
       r = root(n)
       while p != r:
           d.append(p)
           p = parent(p, n)
       return d

   # The copath of the node is the siblings of the nodes on its direct
   # path (including the node itself)
   def copath(x, n):
       d = dirpath(x, n)
       if x != sibling(x, n):
           d.append(x)

       return [sibling(y, n) for y in d]

   # Frontier is is the list of full subtrees, from left to right.  A
   # balance binary tree with n leaves has a full subtree for every
   # power of two where n has a bit set, with the largest subtrees
   # furthest to the left.  For example, a tree with 11 leaves has full
   # subtrees of size 8, 2, and 1.
   def frontier(n):
       st = [1 << k for k in range(log2(n) + 1) if n & (1 << k) != 0]
       st = reversed(st)

       base = 0
       f = []
       for size in st:
           f.append(root(size) + base)
           base += 2*size



Barnes, et al.           Expires March 23, 2019                [Page 42]


Internet-Draft                     MLS                    September 2018


       return f

   # Leaves are in even-numbered nodes
   def leaves(n):
       return [2*i for i in range(n)]


Authors' Addresses

   Richard Barnes
   Cisco

   Email: rlb@ipv.sx


   Jon Millican
   Facebook

   Email: jmillican@fb.com


   Emad Omara
   Google

   Email: emadomara@google.com


   Katriel Cohn-Gordon
   University of Oxford

   Email: me@katriel.co.uk


   Raphael Robert
   Wire

   Email: raphael@wire.com














Barnes, et al.           Expires March 23, 2019                [Page 43]


Html markup produced by rfcmarkup 1.129c, available from https://tools.ietf.org/tools/rfcmarkup/