10 August 2023 in IEEE Internet of Things Journal
In large-scale Internet of Things, centralized authentication imposes several critical challenges in terms of vast identity management, authentication overhead, and single point of failure. Distributed identity management has been envisioned as a promising approach for mitigating above all, but the security and performance of the overall solution have not been extensively evaluated. In this paper, we proposed a decentralized identity management scheme based on blockchain for tackling large-scale Internet of Things such as VANET. We implement smart contracts to support large-scale user access control, together with design trust management methods for reputation evaluation and credit penalty mechanisms, which can prevent various types of attacks in distributed identification contexts. The experiment results and analysis justified that our scheme is scalable with good performance. Specifically, the system response is on a millisecond scale and all the functions consume within 250ms. Also, the time consumption of the query maintains a manageable delay within 0.5ms no matter the remarkable growth of users. Finally, we observe that the throughput of the current blockchain platform could meet the requirement of our scheme with the increasing number of users’ upload request in real-world simulation.
4 December 2024 in Future Generation Computer Systems
29 February 2024 in Journal of Electrical and Computer Engineering
Negative information selection is an approach to protect the privacy by using negative information to replace original information. In this paper, we prove some bounds for negative information selection. Those bounds reveal the privacy protection strength of quantitative probability analysis. We also analyzed the reconstruction probability of original information from available negative information. The formal analysis can specify the bound on the strength of security and utility for negative information selection. Besides, we simulate brute force attacks under different data leakage ratios. Specifically, we calculate the attacker’s guess times before and after the data leakage. Experimental results indicate that the data leakage of over 30% can put the original information in a dangerous situation. Furthermore, we found that the leakage possibility has little relevance to the number of elements in the full set, but it is influenced by the ratio of the leaked information.
1 January 2026 in IEEE Transactions on Instrumentation and Measurement