8 December 2023 in IEEE Transactions on Vehicular Technology
Vehicular networks have huge potential to improve road safety and traffic efficiency, especially in the context of large models. Cloud computing can significantly improve the performance of vehicular networks, and the concept of cloud-assisted vehicular networks comes into being. Reputation management plays a crucial role in vehicular networks, since it can help each vehicle evaluate the trustworthiness of the other vehicles and the received messages. Reputation updating is essential in reputation management and it is usually done by the Trusted Authority (TA) regularly after collecting, decrypting, and verifying a large number of reputation feedbacks, which leads to great computation and communication overheads on the TA side and even makes the TA become the bottleneck of reputation management system. In this paper, we propose a novel Privacy-Preserving Reputation Updating (PPRU) scheme for cloud-assisted vehicular networks based on the Elliptic Curve Cryptography (ECC) and Paillier algorithms, in which the reputation feedbacks are collected and preprocessed by the honest-but-curious Cloud Service Provider (CSP) in a privacy-preserving manner, and the computation and communication overheads on the TA side can be dramatically reduced by about 88.36% and 83.88% as a result, respectively. Meanwhile, the proposed scheme can provide strong privacy preservation, strong security, and robust reputation management with acceptable computation and communication overheads. Furthermore, the comprehensive theoretical analysis and simulation evaluation are conducted, and the results demonstrate that the proposed scheme is significantly superior to the existing schemes in several aspects.
1 March 2017 in Finite Fields and Their Applications
27 March 2019 in IEEE Access
Given Y ∈ Rm×l and A ∈ Rm×n, the multiple measurement vector (MMV) problem aims to recover the support of K-row sparse matrix X from Y = AX+ E. In this paper, we present a sufficient condition for exact support recovery of K-row sparse matrices via the orthogonal matching pursuit for MMV (OMPMMV) algorithm in the noisy case. Furthermore, in the noiseless case, our proposed condition is optimal.
23 December 2024 in IEEE Internet of Things Journal
While the collection of users’ live or periodic electricity consumption data brings significant advantages for the operation of smart grids, it also heightens the risk of user privacy leakage. Numerous data aggregation schemes have been proposed to address this issue. However, most of these schemes either fail to accommodate the need for multifunctional data analysis or rely on a trusted third party (TTP). Given the efficient data processing capabilities offered by fog computing, we propose a blockchain-based privacy-preserving data aggregation (BPRM) scheme supporting multifunctionality for fog-assisted smart grid without TTP. This scheme ensures data confidentiality and data integrity while providing various statistical functions. In addition, we implement a consensus mechanism between smart meters, further enhancing the security and robustness of the smart grid system. Moreover, not only does the proposed the batch verification reduce the authentication costs but also support error detection in signatures. With BPRM, data center can calculate multiple statistical functions, achieving a win-win strategy. Extensive security and performance analyses demonstrate that BPRM can withstand various security threats and effectively protect user privacy while maintaining efficiency in both computational and communication overhead.
29 January 2022 in Security and Communication Networks
In the process of handling criminal cases, it is crucial to avoid evidence tampering and ensure the integrity, consistency, and nonrepudiation of evidence transfer records, which is highly related to the fairness and credibility of the judiciary. To address this problem, we propose a consortium blockchain network to record evidence transfer events among different departments of China's judicial system. We design the format of a transaction and a block. In addition, the smart contracts for three types of transactions are also proposed. The Raft consensus algorithm is adopted to accomplish the consensus process. A security analysis shows that the proposed scheme can achieve the design goal (the integrity, consistency, and nonrepudiation of evidence transfer records stored in blockchain). Furthermore, a set of experiments were conducted to analyse the performance of the proposed scheme. The experiments results show that the throughput of the system is proportional to the send rate within a certain threshold. The latency decreases with increasing send rate if the send rate is within a certain threshold. Peer nodes in the system consume the most storage and communication cost. The values of block size and block generation interval time have a slight influence on the performance of the system.
16 January 2019 in IEEE Access
This paper investigates the performance of the block multiple measurement vectors (BMMV) algorithm in reconstructing block joint sparse matrices. We prove that if Ф obeys block restricted isometry property with δ K+1 < 1/√K+1, then BMMV perfectly reconstructs any block K-joint sparse matrix X from observations Y = ФX in K iterations.We also show that BMMV may not reconstruct block K-joint sparse matrices in K iterations under the condition δ K+1 ≥ 1/√K+1. That is to say, the condition δ K+1 < 1/√K+1 is optimal for the BMMV algorithm.