2000 character limit reached
Zero-Knowledge Proof of Distinct Identity: a Standard-compatible Sybil-resistant Pseudonym Extension for C-ITS
Published 20 Mar 2024 in cs.CR and cs.NI | (2403.14020v3)
Abstract: Pseudonyms are widely used in Cooperative Intelligent Transport Systems (C-ITS) to protect the location privacy of vehicles. However, the unlinkability nature of pseudonyms also enables Sybil attacks, where a malicious vehicle can pretend to be multiple vehicles at the same time. In this paper, we propose a novel protocol called zero-knowledge Proof of Distinct Identity (zk-PoDI,) which allows a vehicle to prove that it is not the owner of another pseudonym in the local area, without revealing its actual identity. Zk-PoDI is based on the Diophantine equation and zk-SNARK, and does not rely on any specific pseudonym design or infrastructure assistance. We show that zk-PoDI satisfies all the requirements for a practical Sybil-resistance pseudonym system, and it has low latency, adjustable difficulty, moderate computation overhead, and negligible communication cost. We also discuss the future work of implementing and evaluating zk-PoDI in a realistic city-scale simulation environment.
- Iso. Information security, cybersecurity and privacy protection – evaluation criteria for IT security – part 2: Security functional components. Technical Report 15408-2, International Organization for Standardization, Geneva, Switzerland, 2022.
- ETSI. Intelligent transport systems (ITS); security; trust and privacy management; release 2. Technical Report TS 102-941, 2022.
- A terminology for talking about privacy by data minimization: Anonymity, unlinkability, undetectability, unobservability, pseudonymity, and identity management, 2010.
- John R Douceur. The sybil attack. In Peer-to-Peer Systems, pages 251–260. Springer Berlin Heidelberg, 2002.
- Zero-knowledge proof of traffic: A deterministic and privacy-preserving cross verification mechanism for cooperative perception data. IEEE Access, 11:142846–142861, December 2023.
- CanDID: Can-do decentralized identity with legacy compatibility, sybil-resistance, and accountability. In 2021 IEEE Symposium on Security and Privacy (SP). IEEE, May 2021.
- Decentralized and sybil-resistant pseudonym registration using social graphs. 2016 14th Annual Conference, 2016.
- Sybil-resistant pseudonymization and pseudonym change without trusted third parties. Proceedings of the 14th ACM Workshop, 2015.
- Trajectory as an identity: Privacy-preserving and sybil-resistant authentication for internet of vehicles. Security and Communication, 2021.
- Non-Interactive Privacy-Preserving Sybil-Free authentication scheme in VANETs. In Symposium on Vehicles Security and Privacy (VehicleSec) 2023. 27 February, 2023, San Diego, CA, USA. Internet Society, 2023.
- Ring signature-based conditional privacy-preserving authentication in VANETs. Wirel. Pers. Commun., 114(1):853–881, September 2020.
- An efficient conditional privacy-preserving authentication scheme for Vehicle-To-Infrastructure communication in VANETs. Vehicular Communications, 22:100228, April 2020.
- Detecting sybil attacks using proofs of work and location in VANETs. IEEE Trans. Dependable Secure Comput., 19(1):39–53, January 2022.
- Deterministic sybil attack exclusion in Cooperative-Intelligent transportation systems. https://d-nb.info/1199614092/34. Accessed: 2023-11-14.
- The knowledge complexity of interactive proof systems. SIAM J. Comput., 18(1):186–208, February 1989.
- Scaling up trustless dnn inference with zero-knowledge proofs, 2022.
- Zama: A zkp-based anonymous mutual authentication scheme for the iov. IEEE Internet of Things Journal, 9(22):22903–22913, 2022.
- Maximizing privacy and security of collaborative indoor positioning using zero-knowledge proofs. Internet of Things, 22:100801, 2023.
- Is it really easy to detect sybil attacks in C-ITS environments: A position paper. IEEE Trans. Intell. Transp. Syst., 23(10):18273–18287, October 2022.
- An introduction to Diophantine equations: A problem-based approach. Springer, 2010.
- Hilbert’s 10th problem. Scientific American, 229(5):84–91, 1973.
- Succinct {{\{{Non-Interactive}}\}} zero knowledge for a von neumann architecture. In 23rd USENIX Security Symposium (USENIX Security 14), pages 781–796, 2014.
- Noninteractive zero-knowledge. SIAM Journal on Computing, 20(6):1084–1118, 1991.
- Jens Groth. On the size of Pairing-Based non-interactive arguments. In Advances in Cryptology – EUROCRYPT 2016, pages 305–326. Springer Berlin Heidelberg, 2016.
- Quadratic span programs and succinct nizks without pcps. In Advances in Cryptology–EUROCRYPT 2013: 32nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Athens, Greece, May 26-30, 2013. Proceedings 32, pages 626–645. Springer, 2013.
- Peter L Montgomery. Modular multiplication without trial division. Math. Comput., 44(170):519–521, 1985.
- Yuri Matiyasevich. Hilbert’s tenth problem. MIT press, 1993.
- Finding numerical solutions of diophantine equations using ant colony optimization. Applied Mathematics and Computation, 219(24):11376–11387, 2013.
- SK Jeswal and S Chakraverty. Connectionist based models for solving diophantine equation. Journal of Interdisciplinary Mathematics, 23(4):825–841, 2020.
- Flowsim: A modular simulation platform for microscopic behavior analysis of City-Scale connected autonomous vehicles. In The 26th edition of the IEEE International Conference on Intelligent Transportation Systems (ITSC 2023), pages 1–8, Bilbao, Bizkaia, Spain, 2023.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.