24 September 2021 in IEEE Transactions on Services Computing
Electronic Health Record (EHR) and its privacy have attracted widespread attention with the development of the healthcare industry in recent years. As locking medical data in a single healthcare center causes information isolation, healthcare centers are motivated to build medical data sharing systems. However, existing systems highly rely on the trusted centralized servers, which are vulnerable to distributed denial of service (DDoS) attacks and the single point of failure. Moreover, it is a non-trivial matter to authorize multiple users to search and access EHR in a privacy-preserving manner. In this paper, we propose MedShare, a decentralized framework for secure EHR sharing. Our design utilizes the smart contract technique of blockchain to establish a trusted platform for healthcare centers to share their encrypted EHR. Considering that fine-grained access control is essential in practical EHR sharing service, we devise a constant-size attribute-based encryption (ABE) scheme, where the access policy is embedded in search result on the blockchain. Besides, we propose an efficient scheme that enables authorized MedShare users to perform multi-keyword boolean search operations over encrypted EHR. We formally analyze the security strengths and implement the system prototype on Ethereum. Evaluation results demonstrate that MedShare is efficient for EHR sharing.
1 January 2019 in IEEE Access
Image encryption is an efficient visual technology to protect private images. This paper develops an image encryption algorithm utilizing the principles of the Josephus problem and the filtering technology. The encryption algorithm follows the classical diffusion and confusion structure. The principle of Josephus problem is used to shuffle the image pixels to different positions to achieve the confusion property. Using a randomly generated filter, the filtering technology can spread slight changes of the original image to all pixels of the cipher image to obtain diffusion property. The simulation results show that the developed image encryption algorithm is able to encrypt different kinds of images into cipher images with uniform distribution. The security analysis demonstrates that it has an extremely sensitive secret key, can resist various security attacks, and has a better performance than several advanced image encryption algorithms.
16 February 2023 in IEEE Transactions on Intelligent Transportation Systems
The rapid growth of the Internet of Vehicles (IoV) paradigm sparks the generation of large volumes of distributed data at vehicles, which can be harnessed to build models for intelligent applications. Federated learning has recently received wide attentions, which allows model training over distributed datasets without requiring raw datasets to be shared out. However, federated learning is known to be vulnerable to poisoning attacks, where malicious clients may manipulate the local datasets or model updates to corrupt the global model. Such attacks have to be countered when federated learning is adopted in IoV systems, given that the training process is distributed among a large number of vehicles in an open environment. In addition, IoV systems present a hierarchical architecture in practice where other types of nodes sit between the cloud server and vehicles, allowing intermediate aggregation for reducing overall training latency. Yet the intermediate aggregation nodes may also pose threats. In this paper, we propose a robust hierarchical federated learning framework named RoHFL, which allows hierarchical federated learning to be suitably applied in the IoV with robustness against poisoning attacks. We develop a robust model aggregation scheme that contains a logarithm-based normalization mechanism to cope with scaled gradients from malicious vehicles. We integrate the notion of reputation into the aggregation process and develop a scheme for reputation updating. We provide a formal analysis of RoHFL’s convergence guarantees. Experiment results over several popular datasets demonstrate the promising performance of RoHFL, which is superior to prior work in the robustness against poisoning attacks.
18 October 2021 in IEEE Transactions on Circuits and Systems I: Regular Papers
Designing high-dimensional chaotic maps with expected dynamic properties is an attractive but challenging task. The dynamic properties of a chaotic system can be reflected by the Lyapunov exponents (LEs). Using the inherent relationship between the parameters of a chaotic map and its LEs, this paper proposes an $n$ -dimensional polynomial chaotic system ( $n\text{D}$ -PCS) that can generate $n\text{D}$ chaotic maps with any desired LEs. The $n\text{D}$ -PCS is constructed from $n$ parametric polynomials with arbitrary orders, and its parameter matrix is configured using the preliminaries in linear algebra. Theoretical analysis proves that the $n\text{D}$ -PCS can produce high-dimensional chaotic maps with any desired LEs. To show the effects of the $n\text{D}$ -PCS, two high-dimensional chaotic maps with hyperchaotic behaviors were generated. A microcontroller-based hardware platform was developed to implement the two chaotic maps, and the test results demonstrated the randomness properties of their chaotic signals. Performance evaluations indicate that the high-dimensional chaotic maps generated from $n\text{D}$ -PCS have the desired LEs and more complicated dynamic behaviors compared with other high-dimensional chaotic maps. In addition, to demonstrate the applications of $n\text{D}$ -PCS, we developed a chaos-based secure communication scheme. Simulation results show that $n\text{D}$ -PCS has a stronger ability to resist channel noise than other high-dimensional chaotic maps.
18 January 2023 in IEEE Transactions on Dependable and Secure Computing
Cloud computing promises great advantages in handling the exponential data growth. Secure deduplication can greatly improve cloud storage efficiency while protecting data confidentiality. In the meantime, when data are outsourced to the remote cloud, there is an imperative need to audit the integrity. Most existing works only consider the support for either secure deduplication or integrity auditing. Recently, there have been some research efforts aiming to integrate secure deduplication with integrity auditing. However, prior works are unsatisfactory in that they suffer from the leakage of ownership privacy and forgeability of auditing results for low-entropy data. In this paper, we propose a new scheme that delicately bridges secure deduplication and integrity auditing in encrypted cloud storage. In contrast with prior works, our scheme protects the ownership privacy and prevents the cloud service provider from forging the auditing results for low-entropy data. Furthermore, we propose a blockchain-based mechanism that helps to ensure key recoverability and reduce local storage cost of keys. Formal analysis is provided to justify the security guarantees. Experiment results demonstrate the modest performance overhead of our scheme.
20 September 2022 in IEEE Transactions on Industrial Electronics
Recently, designing hyperchaotic maps with complex dynamics has attracted increasing attention from various research fields. In this article, we propose a 2-D exponential chaotic system (2D-ECS). The 2D-ECS can generate a large number of hyperchaotic maps by cascading exponential nonlinearity with bounded functions. To show the effectiveness of the 2D-ECS, we provide three hyperchaotic maps by cascading the exponential nonlinearity with trigonometric functions. We first build state-mapping networks with different fixed-point arithmetic precisions to analyze the dynamic properties of the hyperchaotic maps in digital domain, and then study their dynamic properties using several numerical measurements. Experimental results show that the generated hyperchaotic maps show better performance indicators than existing chaotic maps. Moreover, a hardware platform is constructed to implement the three hyperchaotic maps generated by the 2D-ECS, and two-channel hyperchaotic sequences are experimentally captured. A pseudorandom number generator is designed to study the potential applications of our proposed hyperchaotic maps. Finally, we apply the generated hyperchaotic maps to secure communication, and experimental results show that these maps exhibit better performance in contrast to existing chaotic maps.