Core Concepts
Zero-knowledge Proof of Distinct Identity (zk-PoDI) protocol ensures Sybil-resistance and privacy in Cooperative Intelligent Transport Systems (C-ITS).
Abstract
The content introduces zk-PoDI, a novel protocol for C-ITS privacy. It addresses the challenges of pseudonyms, Sybil attacks, and unlinkability. The paper discusses the importance of pseudonyms in C-ITS, the vulnerability to Sybil attacks, and existing solutions. zk-PoDI leverages Diophantine equations and zk-SNARK to prove distinct identity without revealing actual information. The paper outlines the protocol's design, requirements, mathematical primitives, performance analysis, threat analysis, difficulty analysis, and future work.
I. Introduction
Importance of pseudonyms in C-ITS.
Vulnerability to Sybil attacks.
II. Related Work
Existing works on pseudonyms in ITS.
Countermeasures against Sybil attacks.
III. Problem Statement & Requirements
Formulation of the problem regarding Sybil attacks.
Assumptions about underlying pseudonym system.
IV. Mathematical Primitives
Introduction to Diophantine equations and their solutions.
V. Proposed Method (zk-PoDI)
Design and implementation details of zk-PoDI protocol.
VI. Discussion
Performance analysis of zk-PoDI.
Threat analysis and potential attacks.
VII. Conclusion
Summary of zk-PoDI's contributions and future work.
Stats
"Zk-PoDI satisfies all the requirements for a practical Sybil-resistance pseudonym system."
"The total size of the proof π is 1019 bits."
"The average proof time Tp varies from 8 to 72 ms."
"The verification time Tv is nearly constant at approximately 3 ms."
Quotes
"zk-PoDI satisfies all the requirements for a practical Sybil-resistance pseudonym system."
"The total size of the proof π is 1019 bits."