Proof of Transit
draft-brockners-proof-of-transit-03

Document Type Active Internet-Draft (individual)
Last updated 2017-03-13
Stream (None)
Intended RFC status (None)
Formats plain text xml pdf html bibtex
Stream Stream state (No stream defined)
Consensus Boilerplate Unknown
RFC Editor Note (None)
IESG IESG state I-D Exists
Telechat date
Responsible AD (None)
Send notices to (None)
Network Working Group                                       F. Brockners
Internet-Draft                                               S. Bhandari
Intended status: Experimental                                    S. Dara
Expires: September 14, 2017                                 C. Pignataro
                                                                   Cisco
                                                                J. Leddy
                                                                 Comcast
                                                               S. Youell
                                                                    JMPC
                                                                D. Mozes
                                              Mellanox Technologies Ltd.
                                                              T. Mizrahi
                                                                 Marvell
                                                          March 13, 2017

                            Proof of Transit
                  draft-brockners-proof-of-transit-03

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 http://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 September 14, 2017.

Brockners, et al.      Expires September 14, 2017               [Page 1]
Internet-Draft              Proof of Transit                  March 2017

Copyright Notice

   Copyright (c) 2017 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
   (http://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  . . . . . . . . . . . . . . . . . . . .   7
     3.3.  Illustrative Example  . . . . . . . . . . . . . . . . . .   7
       3.3.1.  Basic Version . . . . . . . . . . . . . . . . . . . .   7
         3.3.1.1.  Secret Shares . . . . . . . . . . . . . . . . . .   8
         3.3.1.2.  Lagrange Polynomials  . . . . . . . . . . . . . .   8
         3.3.1.3.  LPC Computation . . . . . . . . . . . . . . . . .   8
         3.3.1.4.  Reconstruction  . . . . . . . . . . . . . . . . .   9
         3.3.1.5.  Verification  . . . . . . . . . . . . . . . . . .   9
       3.3.2.  Enhanced Version  . . . . . . . . . . . . . . . . . .   9
         3.3.2.1.  Random Polynomial . . . . . . . . . . . . . . . .   9
         3.3.2.2.  Reconstruction  . . . . . . . . . . . . . . . . .  10
         3.3.2.3.  Verification  . . . . . . . . . . . . . . . . . .  10
       3.3.3.  Final Version . . . . . . . . . . . . . . . . . . . .  11
     3.4.  Operational Aspects . . . . . . . . . . . . . . . . . . .  11
     3.5.  Alternative Approach  . . . . . . . . . . . . . . . . . .  12
       3.5.1.  Basic Idea  . . . . . . . . . . . . . . . . . . . . .  12
       3.5.2.  Pros  . . . . . . . . . . . . . . . . . . . . . . . .  12
Show full document text