Proof of Transit

The information below is for an old version of the document
Document Type Expired Internet-Draft (sfc WG)
Authors Frank Brockners  , Shwetha Bhandari  , Tal Mizrahi  , Sashank Dara  , Stephen Youell 
Last updated 2020-05-23 (latest revision 2019-11-20)
Replaces draft-brockners-proof-of-transit
Stream Internet Engineering Task Force (IETF)
Expired & archived
pdf htmlized (tools) htmlized bibtex
Stream WG state WG Document
Document shepherd No shepherd assigned
IESG IESG state Expired
Consensus Boilerplate Unknown
Telechat date
Responsible AD (None)
Send notices to (None)

This Internet-Draft is no longer active. A copy of the expired Internet-Draft can be found at


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.


Frank Brockners (
Shwetha Bhandari (
Tal Mizrahi (
Sashank Dara (
Stephen Youell (

(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)