Kai Ding

Kai Ding

Auto-generated profile, based on publicly available information

Kai Ding

School of Cyberspace Science and Technology, Beijing Institute of Technology, Beijing, China

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
24 December 2019 in IEEE Transactions on Services Computing
Verified
Journal Article
Closed access
Chuan ZhangChuan Zhang
Chuan Zhang
Liehuang ZhuLiehuang Zhu
Liehuang Zhu
CXChang Xu
Chang Xu
Kashif KashifKashif Kashif
Kashif Kashif
KDKai Ding
Kai Ding
Mohsen GuizaniMohsen Guizani
Mohsen Guizani
Vehicle platoon, a novel vehicle driving paradigm that organizes a group of vehicles in the nose-to-tail structure, has been considered as a potential solution to reduce traffic congestion and increase travel comfort. In such a platoon system, head vehicles’ performances are usually evaluated by user vehicles’ feedbacks. Selection of an appropriate and reliable head vehicle while not disclosing user vehicles’ privacy has become an interesting problem. In this article, we present a trust-based and privacy-preserving platoon recommendation scheme, called TPPR, to enable potential user vehicles to avoid selecting the malicious head vehicles. The basic concept of TPPR is that each user vehicle holds a trust value, and the reputation score of the head vehicle is calculated via a truth discovery process. To preserve vehicles’ privacy, pseudonyms and Paillier cryptosystem are applied. In addition, novel authentication protocols are designed to ensure that only the valid vehicles (i.e., the vehicles holding the truthful trust values and joining the vehicle platoon) can pass the authentication. A comprehensive security analysis is conducted to prove that the proposed TPPR scheme is secure against several sophisticated attacks in vehicular ad hoc networks. Moreover, extensive simulations are conducted to demonstrate the correctness and effectiveness of the proposed scheme.

10 April 2026 in IEEE Transactions on Computational Social Systems
Verified
Journal Article
Closed access
KDKai Ding
Kai Ding
TXTianxiu Xie
Tianxiu Xie
Keke GaiKeke Gai
Keke Gai
JYJing Yu
Jing Yu
SWShuo Wang
Shuo Wang
Weizhi MengWeizhi Meng
Weizhi Meng
Blockchain-based decentralized identity (DID) technology provides a more secure and efficient paradigm for identity verification. However, along with the promotion of applications, data storage of DID has gradually become one of the restrictions for the implementation due to the dramatically increasing size of the distributed ledger, and the issue becomes more complicated when considering the diversity of practical conditions and interoperability. In this article, we propose a scalable on-chain-off-chain storage for decentralized identity (SCOOP) scheme to minimize the total storage cost of blockchain-based DID while guaranteeing the efficiency of the implementation. The proposed scheme consists of a two-phase decision-making process, and a method that integrates the on-chain storage with off-chain storage in a scalable manner, so that an optimal storage task scheduling can be generated. In addition, to reduce on-chain storage overhead, we propose a multilinear tree-based commitment scheme that supports sublinear proof aggregation and updates. Our experiment evaluations have demonstrated that the proposed scheme can successfully achieve a superior performance in storage saving for DID while considering the time constraint.