Gang Qu

Gang Qu

Auto-generated profile, based on publicly available information

Gang Qu

Department of Electrical and Computer Engineering & Institute for Systems Research, University of Maryland, College Park, MD, USA

Research Focus & Metrics

Academic Career Length

26Years (2001-Present)

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

Representative Publications

View All Publications
23 April 2018 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
ZLZhaojun Lu
Zhaojun Lu
GQGang Qu
Gang Qu
ZLZhenglin Liu
Zhenglin Liu
Vehicular ad hoc networks (VANETs) are becoming the most promising research topic in intelligent transportation systems, because they provide information to deliver comfort and safety to both drivers and passengers. However, unique characteristics of VANETs make security, privacy, and trust management challenging issues in VANETs' design. This survey article starts with the necessary background of VANETs, followed by a brief treatment of main security services, which have been well studied in other fields. We then focus on an in-depth review of anonymous authentication schemes implemented by five pseudonymity mechanisms. Because of the predictable dynamics of vehicles, anonymity is necessary but not sufficient to thwart tracking an attack that aims at the drivers' location profiles. Thus, several location privacy protection mechanisms based on pseudonymity are elaborated to further protect the vehicles' privacy and guarantee the quality of location-based services simultaneously. We also give a comprehensive analysis on various trust management models in VANETs. Finally, considering that current and near-future applications in VANETs are evaluated by simulation, we give a much-needed update on the latest mobility and network simulators as well as the integrated simulation platforms. In sum, this paper is carefully positioned to avoid overlap with existing surveys by filling the gaps and reporting the latest advances in VANETs while keeping it self-explained.

29 July 2020 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
HHHuimin Hu
Huimin Hu
Ke XiongKe Xiong
Ke Xiong
GQGang Qu
Gang Qu
Qiang NiQiang Ni
Qiang Ni
Pingyi FanPingyi Fan
Pingyi Fan
KLKhaled Ben Letaief
Khaled Ben Letaief
This paper investigates the UAV-assisted wireless powered IoT system, where a UAV takes off from a data center, flies to each of the ground sensor nodes (SNs) in order to transfer energy and collect data form the SNs, and then returns to the data center. For such a system, an optimization problem is formulated to minimize the average age of information (AoI) of the data collected from all ground SNs. Since the average AoI depends on the UAV’s trajectory, the time required for energy harvesting (EH) and data collection for each SN, these factors need to be optimized jointly. Moreover, instead of the traditional linear EH model, we employ a non-linear model because the behavior of the EH circuits are non-linear by nature. To solve this non-convex problem, we propose to decompose it into two sub-problems, i.e., a joint energy transfer and data collection time allocation problem and a UAV’s trajectory planning problem. For the first sub-problem, we prove that it is convex and give an optimal solution by using Karush-Kuhn-Tucker (KKT) conditions. This solution is used as the input for the second sub-problem, and we solve optimally it by designing dynamic programming (DP) and ant colony (AC) heuristic algorithms. Simulation results show that the DP-based algorithm obtains the minimal average AoI of the system, and the AC-based heuristic finds solutions with near-optimal average AoI. The results also reveal that the average AoI increases as the flying altitude of the UAV increases and linearly with the size of the collected data at each ground SN.

1 August 2019 in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Verified
Journal Article
Closed access
ZLZhaojun Lu
Zhaojun Lu
QWQian Wang
Qian Wang
GQGang Qu
Gang Qu
HZHaichun Zhang
Haichun Zhang
ZLZhenglin Liu
Zhenglin Liu
The privacy-preserving authentication is considered as the first line of defense against the attacks in addition to preserving the identity privacy of the vehicles in the vehicular ad hoc networks (VANETs). However, the existing authentication schemes suffer from drawbacks such as nontransparency of the trusted authorities (TAs), heavy workload to revoke certificates, and high computation overhead to authenticate identities and messages. In this paper, we propose a blockchain-based privacy-preserving authentication (BPPA) scheme for VANETs. In BPPA, all the certificates and transactions are recorded permanently and immutably in the blockchain to make the activities of the semi-TAs transparent and verifiable. However, it remains a challenge how to use such blockchain effectively for authentication in real driving scenarios (e.g., high speed or large amount of messages during congestion). With a novel data structure named the Merkle Patricia tree (MPT), we extend the conventional blockchain structure to provide a distributed authentication scheme without the revocation list. To achieve conditional privacy, we allow a vehicle to use multiple certificates. The linkability between the certificates and real identity is encrypted and stored in the blockchain and can only be revealed in case of disputes. We evaluate the validity and performance of BPPA on the Hyperledger Fabric (HLF) platform for each entity. The experimental results show that the distributed authentication can be processed by individual vehicles within 1 ms, which meets the real-time requirement and is much more efficient, in terms of the processing time and storage requirement, than existing approaches.

4 July 2014 in Journal of Computer Science and Technology
Verified
Journal Article
Closed access
PDF file
JZJi-Liang Zhang
Ji-Liang Zhang
GQGang Qu
Gang Qu
YLYong-Qiang Lv
Yong-Qiang Lv
QZQiang Zhou
Qiang Zhou

5 September 2019 in IEEE Transactions on Industrial Electronics
Verified
Journal Article
Closed access
JZJiliang Zhang
Jiliang Zhang
GQGang Qu
Gang Qu
In many Industry Internet of Things (IIoT) applications, resources like CPU, memory, and battery power are limited and cannot afford the classic cryptographic security solutions. Silicon Physical Unclonable Function (PUF) is a lightweight security primitive that exploits manufacturing variations during the chip fabrication process for key generation and/or device authentication. However, traditional weak PUFs such as Ring Oscillator (RO) PUF generate chip-unique key for each device, which restricts their application in security protocols where the same key is required to be shared in resource-constrained devices. In order to address this issue, we propose a PUF-based key sharing method for the first time. The basic idea is to implement one-to-one input-output mapping with Lookup Table (LUT)-based interstage crossing structures in each level of inverters of RO PUF. Individual customization on configuration bits of interstage crossing structure and different RO selections with challenges bring high flexibility. Therefore, with the flexible configuration of interstage crossing structures and challenges, CRO PUF can generate the same shared key for resource-constrained devices, which enables a new application for lightweight key sharing protocols.

6 January 2021 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
JZJiliang Zhang
Jiliang Zhang
CSChaoqun Shen
Chaoqun Shen
HSHaihan Su
Haihan Su
TATanvir Arafin
Tanvir Arafin
GQGang Qu
Gang Qu
It is a challenging task to deploy lightweight security protocols in resource-constrained IoT applications. A hardware-oriented lightweight authentication protocol based on device signature generated during voltage over-scaling (VOS) was recently proposed to address this issue. VOS-based authentication employs the computation unit such as adders to generate the process variation dependent error, which is combined with secret keys to create a two-factor authentication protocol. In this article, machine learning (ML)-based modeling attacks to break such authentication is presented. We also propose a challenge self-obfuscation structure (CSoS) which employs previous challenges combined with keys or random numbers to obfuscate the current challenge for the VOS-based authentication to resist ML attacks. Experimental results show that ANN, RNN, and CMA-ES can clone the challenge-response behavior of VOS-based authentication with up to 99.65 percent prediction accuracy, while the prediction accuracy is less than 51.2 percent after deploying our proposed ML resilient technique. In addition, our proposed CSoS also shows good obfuscation ability for strong PUFs. Experimental results show that the modeling accuracy is below 54 percent when 106 challenge-response pairs (CRPs) are collected to model the CSoS-based Arbiter PUF with ML attacks based on LR, SVM, ANN, RNN, and CMA-ES.