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

Document Type Active Internet-Draft (sfc WG)
Authors Frank Brockners  , Shwetha Bhandari  , Tal Mizrahi  , Sashank Dara  , Stephen Youell 
Last updated 2020-11-01
Replaces draft-brockners-proof-of-transit
Stream IETF
Intended RFC status Experimental
Formats plain text xml pdf htmlized (tools) htmlized bibtex
Yang Validation 0 errors, 1 warnings.
Additional Resources
- Yang catalog entry for ietf-pot-profile@2020-09-08.yang
- Yang impact analysis for draft-ietf-sfc-proof-of-transit
- Mailing list discussion
Stream WG state In WG Last Call
Document shepherd Nagendra Nainar
Shepherd write-up Show (last changed 2020-08-02)
IESG IESG state I-D Exists
Consensus Boilerplate Unknown
Telechat date
Responsible AD (None)
Send notices to Nagendra Nainar <naikumar@cisco.com>
Network Working Group                                  F. Brockners, Ed.
Internet-Draft                                                     Cisco
Intended status: Experimental                           S. Bhandari, Ed.
Expires: 4 May 2021                                          Thoughtspot
                                                         T. Mizrahi, Ed.
                                        Huawei Network.IO Innovation Lab
                                                                 S. Dara
                                                                Seconize
                                                               S. Youell
                                                                    JPMC
                                                         31 October 2020

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

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 a 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.  This document specifies a data model to enable these
   mechanisms using YANG.

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 4 May 2021.

Copyright Notice

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

Brockners, et al.          Expires 4 May 2021                   [Page 1]
Internet-Draft              Proof of Transit                October 2020

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