Proof of Transit
draft-ietf-sfc-proof-of-transit-04

Document Type Active Internet-Draft (sfc WG)
Last updated 2019-11-20
Replaces draft-brockners-proof-of-transit
Stream IETF
Intended RFC status (None)
Formats plain text xml pdf htmlized bibtex
Yang Validation 0 errors, 0 warnings.
Additional URLs
- Yang catalog entry for ietf-pot-profile@2016-06-15.yang
- Yang impact analysis for draft-ietf-sfc-proof-of-transit
- Mailing list discussion
Stream WG state WG Document
Document shepherd No shepherd assigned
IESG IESG state I-D Exists
Consensus Boilerplate Unknown
Telechat date
Responsible AD (None)
Send notices to (None)
Network Working Group                                  F. Brockners, Ed.
Internet-Draft                                          S. Bhandari, Ed.
Intended status: Experimental                                      Cisco
Expires: May 24, 2020                                    T. Mizrahi, Ed.
                                        Huawei Network.IO Innovation Lab
                                                                 S. Dara
                                                                Seconize
                                                               S. Youell
                                                                    JPMC
                                                       November 21, 2019

                            Proof of Transit
                   draft-ietf-sfc-proof-of-transit-04

Abstract

   Several technologies such as Traffic Engineering (TE), Service
   Function Chaining (SFC), and policy based routing are used to steer
   traffic through a specific, user-defined path.  This document defines
   mechanisms to securely prove that traffic transited said defined
   path.  These mechanisms allow to securely verify whether, within a
   given path, all packets traversed all the nodes that they are
   supposed to visit.

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 May 24, 2020.

Copyright Notice

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

Brockners, et al.         Expires May 24, 2020                  [Page 1]
Internet-Draft              Proof of Transit               November 2019

   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
   2.  Conventions . . . . . . . . . . . . . . . . . . . . . . . . .   4
   3.  Proof of Transit  . . . . . . . . . . . . . . . . . . . . . .   5
     3.1.  Basic Idea  . . . . . . . . . . . . . . . . . . . . . . .   5
     3.2.  Solution Approach . . . . . . . . . . . . . . . . . . . .   6
       3.2.1.  Setup . . . . . . . . . . . . . . . . . . . . . . . .   7
       3.2.2.  In Transit  . . . . . . . . . . . . . . . . . . . . .   7
       3.2.3.  Verification  . . . . . . . . . . . . . . . . . . . .   8
     3.3.  Illustrative Example  . . . . . . . . . . . . . . . . . .   8
       3.3.1.  Baseline  . . . . . . . . . . . . . . . . . . . . . .   8
         3.3.1.1.  Secret Shares . . . . . . . . . . . . . . . . . .   8
         3.3.1.2.  Lagrange Polynomials  . . . . . . . . . . . . . .   9
         3.3.1.3.  LPC Computation . . . . . . . . . . . . . . . . .   9
         3.3.1.4.  Reconstruction  . . . . . . . . . . . . . . . . .   9
         3.3.1.5.  Verification  . . . . . . . . . . . . . . . . . .  10
       3.3.2.  Complete Solution . . . . . . . . . . . . . . . . . .  10
         3.3.2.1.  Random Polynomial . . . . . . . . . . . . . . . .  10
         3.3.2.2.  Reconstruction  . . . . . . . . . . . . . . . . .  10
         3.3.2.3.  Verification  . . . . . . . . . . . . . . . . . .  11
       3.3.3.  Solution Deployment Considerations  . . . . . . . . .  11
     3.4.  Operational Aspects . . . . . . . . . . . . . . . . . . .  12
     3.5.  Ordered POT (OPOT)  . . . . . . . . . . . . . . . . . . .  12
   4.  Sizing the Data for Proof of Transit  . . . . . . . . . . . .  13
   5.  Node Configuration  . . . . . . . . . . . . . . . . . . . . .  14
     5.1.  Procedure . . . . . . . . . . . . . . . . . . . . . . . .  15
     5.2.  YANG Model for POT  . . . . . . . . . . . . . . . . . . .  15
       5.2.1.  Main Parameters . . . . . . . . . . . . . . . . . . .  16
       5.2.2.  Tree Diagram  . . . . . . . . . . . . . . . . . . . .  16
       5.2.3.  YANG Model  . . . . . . . . . . . . . . . . . . . . .  17
   6.  IANA Considerations . . . . . . . . . . . . . . . . . . . . .  22
Show full document text