[hackathon] [New project added to Hackathon 118]-- Vector Commitment based Proof of Transit

liuchunchi <liuchunchi@huawei.com> Wed, 18 October 2023 15:12 UTC

From: liuchunchi <liuchunchi@huawei.com>
To: "hackathon@ietf.org" <hackathon@ietf.org>
Thread-Topic: [New project added to Hackathon 118]-- Vector Commitment based Proof of Transit
Thread-Index: AdoB09onzZs5Gw/TQkOQtHtKSnuSJQ==
Date: Wed, 18 Oct 2023 15:12:20 +0000
Message-ID: <29247c61d783446598c75dc7b1d0b07c@huawei.com>
Accept-Language: zh-CN, en-US
Content-Language: zh-CN
Content-Type: multipart/alternative; boundary="_000_29247c61d783446598c75dc7b1d0b07chuaweicom_"
MIME-Version: 1.0
Archived-At: <https://mailarchive.ietf.org/arch/msg/hackathon/za8jb-AK9KVacTipCIxeKfimXwM>
Subject: [hackathon] [New project added to Hackathon 118]-- Vector Commitment based Proof of Transit
Precedence: list

Hello Hackathon!

Recently we developed a new solution to the Proof-of-Transit (POT) problem using a cryptographic primitive called Vector Commitment. We are planning to demo it on the upcoming IETF 118 Hackathon as a new project.

This POC will demonstrate the basic abilities to commit a path and compute a reference value, compute transit proof, verify the correctness of transit proofs, assess performance such as computation latency and communicational cost etc.

We sincerely invite you to come and hear from us, give comments and/or be part of the team to keep this ball rolling if you are interested.

Code at Github: https://github.com/liuchunchi/vcpot-demo
Draft: draft-liu-on-network-path-validation-00<https://datatracker.ietf.org/doc/draft-liu-on-network-path-validation/> (spec details to be updated before meeting)

Best,
Chunchi

[hackathon] [New project added to Hackathon 118]-… liuchunchi