Haiping Huang

Prof. Haiping Huang

orcid

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

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

Representative Publications

View All Publications
3 December 2019 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
XLXingchen Liu
Xingchen Liu
Haiping HuangHaiping Huang
Haiping Huang
FXFu Xiao
Fu Xiao
ZMZiyang Ma
Ziyang Ma
As the infrastructure of intelligent transportation system, vehicular ad hoc networks (VANETs) have greatly improved traffic efficiency. However, due to the openness characteristics of VANETs, trust and privacy are still two challenging issues in building a more secure network environment: it is difficult to protect the privacy of vehicles and meanwhile to determine whether the message sent by the vehicle is credible. In this paper, a blockchain-based trust management model, combined with conditional privacy-preserving announcement scheme (BTCPS), is proposed for VANETs. Firstly, an anonymous aggregate vehicular announcement protocol is designed to allow vehicles to send messages anonymously in the non-fully trusted environment to guarantee the privacy of the vehicle. Secondly, a blockchain-based trust management model is present to realize the message synchronization and credibility. Roadside Units (RSUs) are able to calculate message reliability based on vehicles’ reputation values which are safely stored in the blockchain. In addition, BTCPS also achieves conditional privacy since Trusted Authority can trace malicious vehicles’ identities in anonymous announcements with the related public addresses. Finally, a mixed consensus algorithm based on Proof-of-work and Practical Byzantine Fault Tolerates algorithm is suggested for better efficiency. Security analysis and performance evaluation demonstrate that the proposed scheme is secure and effective in VANETs.

1 September 2021 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
QLQi Li
Qi Li
BXBin Xia
Bin Xia
Haiping HuangHaiping Huang
Haiping Huang
Yinghui ZhangYinghui Zhang
Yinghui Zhang
TZTao Zhang
Tao Zhang
Mobile healthcare (mHealth) enables people to collect and share their personal health records (PHRs) and gain rapid medical treatment via mobile 5G-enabled Industrial Internet of Things (IIoT) devices, which also brings the challenge of keeping the PHRs confidentiality and preventing unauthorized access. By the emerging ciphertext-policy attribute-based encryption (CP-ABE), the PHR owner can encrypt his/her PHR data under self-defined access policies. However, existing CP-ABE schemes are suffering from either heavy computation cost and storage overhead or traitor tracing and direct revocation. In this article, we propose an efficient, traceable, and revocable access control scheme named TRAC for mHealth in 5G-enabled IIoT. In TRAC, the ciphertext is composed of the attribute-relevant ciphertext encrypted under an and -gate access structure and the identity-relevant ciphertext associated with some potential receivers. The malicious user who leaks his/her privilege to unauthorized entities will be precisely tracked and added in the revocation list, by which the cloud server can update the identity-relevant ciphertext by itself. The length of final ciphertext and the time of bilinear pairing operations used in decryption are constant. The security analysis and performance evaluation indicate the security, efficiency, and practicality of TRAC.

24 January 2020 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
PWPengfei Wu
Pengfei Wu
FXFu Xiao
Fu Xiao
CSChao Sha
Chao Sha
Haiping HuangHaiping Huang
Haiping Huang
LSLijuan Sun
Lijuan Sun

19 October 2021 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
Haiping HuangHaiping Huang
Haiping Huang
CHChengxi Hu
Chengxi Hu
JZJie Zhu
Jie Zhu
MWMin Wu
Min Wu
RMReza Malekian
Reza Malekian
In this paper, we investigate the dynamic task scheduling problem with stochastic task arrival times and due dates in the UAV-based intelligent on-demand meal delivery system (UIOMDS) to improve the efficiency. The objective is to minimize the total tardiness. The new constraints and characteristics introduced by UAVs in the problem model are fully studied. An iterated heuristic framework SES (Stochastic Event Scheduling) is proposed to periodically schedule tasks, which consists of a task collection and a dynamic task scheduling phases. Two task collection strategies are introduced and three Roulette-based flight dispatching approaches are employed. A simulated annealing based local search method is integrated to optimize the solutions. The experimental results show that the proposed algorithm is robust and more effective compared with other two existing algorithms.

28 January 2022 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
LXLingyan Xue
Lingyan Xue
Haiping HuangHaiping Huang
Haiping Huang
FXFu Xiao
Fu Xiao
WWWenming Wang
Wenming Wang
Regional medical consortium systems facilitates medical information sharing. However, many security issues exposed by the dominant centralized architectures, such as single points of failure, unauthorized operations and illegal access, are increasingly apparent constraints on the security and efficiency of data sharing across domains. Even more, any malicious operation detected, effective measures should be executed promptly for identity tracing. In this paper, we propose a secure and efficient cross-domain authentication scheme based on two cooperative blockchains (BCs) for medical consortium systems. Specifically, an intra-domain BC records any legal users’ registration and authentication information while an inter-domain BC is responsible for writing users’ cross-domain authentication information. In each domain, the general hospital acts as a trusted third service provider to achieve cross-chain interactions. For the entire cross-domain authentication procedure, anonymity mechanism is utilized to enhance security, and to trace malicious users, the improved chameleon hash is used in the intra-domain BC to redact the state of the user, and blacklist merkle tree is extended in the inter-domain BC to protect different domains’ services from illegal accessing. In addition, security analysis and performance evaluation are completely given to prove the superior security features and performance compared with other schemes.

23 March 2020 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
Haiping HuangHaiping Huang
Haiping Huang
DZDong Jun Zhang
Dong Jun Zhang
FXFu Xiao
Fu Xiao
KWKai Wang
Kai Wang
JGJiateng Gu
Jiateng Gu
RWRuchuan Wang
Ruchuan Wang
Currently, lots of real social relations in social networks force users to face the potential risk of privacy leakage. Consequently, data holders would like to disturb or anonymize their individual data before publishing them, for the purpose of privacy protection. Due to the characteristics of high sensitivity and large volume data of social network graph structure, it is difficult for privacy protection schemes to enable a reasonable allocation of noises while keeping desirable data availability and execution efficiency. On the basis of differential privacy model, combining with clustering and randomization algorithms, a privacy protection approach PBCN (Privacy Preserving Approach Based on Clustering and Noise) is proposed. This proposal is composed of five algorithms including random disturbance based on clustering, graph reconstruction after disturbing degree sequence and noise nodes generation, etc. Furthermore, a privacy measure algorithm based on adjacency degree is put forward in order to objectively evaluate the privacy-preserving strength of various schemes against graph structure and degree attacks. Simulation experiments are conducted to achieve performance comparisons between PBCN, Spctr Add/Del, Spctr Switch, DER and HPDP. The experimental results show that PBCN realizes more satisfactory data availability and execution efficiency. Finally, parameters utility analysis demonstrates PBCN can achieve a “trade-off” between data availability and privacy protection level.