Qiuhua Wang

Prof. Qiuhua Wang

Hangzhou Dianzi University, Hangzhou, Zhejiang, China
orcid

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

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

Representative Publications

View All Publications
11 September 2020 in Sensors
Verified
Journal Article
Open access
PDF file
Yingpei ZengYingpei Zeng
Yingpei Zeng
MLMingmin Lin
Mingmin Lin
SGShanqing Guo
Shanqing Guo
YSYanzhao Shen
Yanzhao Shen
TCTingting Cui
Tingting Cui
QWQiuhua Wang
Qiuhua Wang
The publish/subscribe model has gained prominence in the Internet of things (IoT) network, and both Message Queue Telemetry Transport (MQTT) and Constrained Application Protocol (CoAP) support it. However, existing coverage-based fuzzers may miss some paths when fuzzing such publish/subscribe protocols, because they implicitly assume that there are only two parties in a protocol, which is not true now since there are three parties, i.e., the publisher, the subscriber and the broker. In this paper, we propose MultiFuzz, a new coverage-based multiparty-protocol fuzzer. First, it embeds multiple-connection information in a single input. Second, it uses a message mutation algorithm to stimulate protocol state transitions, without the need of protocol specifications. Third, it uses a new desockmulti module to feed the network messages into the program under test. desockmulti is similar to desock (Preeny), a tool widely used by the community, but it is specially designed for fuzzing and is 10x faster. We implement MultiFuzz based on AFL, and use it to fuzz two popular projects Eclipse Mosquitto and libCoAP. We reported discovered problems to the projects. In addition, we compare MultiFuzz with AFL and two state-of-the-art fuzzers, MOPT and AFLNET, and find it discovering more paths and crashes.

4 February 2017 in Sensors
Verified
Journal Article
Open access
PDF file
QWQiuhua Wang
Qiuhua Wang
Physical-layer authentication can address physical layer vulnerabilities and security threats in wireless sensor networks, and has been considered as an effective complementary enhancement to existing upper-layer authentication mechanisms. In this paper, to advance the existing research and improve the authentication performance, we propose a novel physical layer assisted authentication scheme for mobile wireless sensor networks. In our proposed scheme, we explore the reciprocity and spatial uncorrelation of the wireless channel to verify the identities of involved transmitting users and decide whether all data frames are from the same sender. In our proposed scheme, a new method is developed for the legitimate users to compare their received signal strength (RSS) records, which avoids the information from being disclosed to the adversary. Our proposed scheme can detect the spoofing attack even in a high dynamic environment. We evaluate our scheme through experiments under indoor and outdoor environments. Experiment results show that our proposed scheme is more efficient and achieves a higher detection rate as well as keeping a lower false alarm rate.

20 October 2023 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
QWQiuhua Wang
Qiuhua Wang
CLChengyu Li
Chengyu Li
TXTianyu Xia
Tianyu Xia
YRYizhi Ren
Yizhi Ren
DWDong Wang
Dong Wang
KCKim-Kwang Raymond Choo
Kim-Kwang Raymond Choo
In recent years, Bitcoin has become one of the most popular cryptocurrencies. The most significant mechanism of Bitcoin is PoW (Proof-of-Work), but it also brings opportunities for mining attacks. In our last study, we proposed a Selfish Mining-based Denial-of-Service Attack (SDoS), which can cause serious threats to the Bitcoin system. On this basis, we further put forward three greedier SDoS attack strategies: a competitive greedy SDoS attack strategy ESDoS, a trail greedy SDoS attack strategy TSDoS, a hybrid greedy SDoS attack strategy ETSDoS, and a more public SDoS attack strategy PSDoS. Besides, we also study the adversary’s optimal strategies under different conditions. The experimental results show that if the adversary adopts the SDoS optimal strategy, his revenue increase rate will be further improved and significantly higher than the other existing mining attacks. If the adversary masters 14% of the total mining power, he has a chance to improve his revenue (25% in Selfish Mining, 19.6% in SDoS), and if the adversary masters 15% of the total mining power, he is capable of launching a 51% attack.

4 May 2019 in Sensors
Verified
Journal Article
Open access
PDF file
QWQiuhua Wang
Qiuhua Wang
ZJZhan Jiacheng
Zhan Jiacheng
XOXiaoqin Ouyang
Xiaoqin Ouyang
YRYizhi Ren
Yizhi Ren
Wireless Sensor Networks (WSNs) have been widely deployed to monitor valuable objects. In these applications, the sensor node senses the existence of objects and transmitting data packets to the sink node (SN) in a multi hop fashion. The SN is a powerful node with high performance and is used to collect all the information sensed by the sensor nodes. Due to the open nature of the wireless medium, it is easy for an adversary to trace back along the routing path of the packets and get the location of the source node. Once adversaries have got the source node location, they can capture the monitored targets. Thus, it is important to protect the source node location privacy in WSNs. Many methods have been proposed to deal with this source location privacy protection problem, and most of them provide routing path diversity by using phantom node (PN) which is a fake source node used to entice the adversaries away from the actual source node. But in the existing schemes, the PN is determined by the source node via flooding, which not only consumes a lot of communication overhead, but also shortens the safety period of the source node. In view of the above problems, we propose two new grid-based source location privacy protection schemes in WSNs called grid-based single phantom node source location privacy protection scheme (SPS) and grid-based dual phantom node source location privacy protection scheme (DPS) in this paper. Different from the idea of determining the phantom node by the source node in the existing schemes, we propose to use powerful sink node to help the source node to determine the phantom node candidate set (PNCS), from which the source node randomly selects a phantom node acting as a fake source node. We evaluate our schemes through theoretical analysis and experiments. Experimental results show that compared with other schemes, our proposed schemes are more efficient and achieves higher security, as well as keeping lower total energy consumption. Our proposed schemes can protect the location privacy of the source node even in resource-constrained wireless network environments.

21 May 2021 in Symmetry
Verified
Journal Article
Open access
PDF file
RWRui Wang
Rui Wang
GWGuohua Wu
Guohua Wu
QWQiuhua Wang
Qiuhua Wang
Yuan LifengYuan Lifeng
Yuan Lifeng
ZZZhen Zhang
Zhen Zhang
GMGongxun Miao
Gongxun Miao
With the rapid development of cloud storage, an increasing number of users store their images in the cloud. These images contain many business secrets or personal information, such as engineering design drawings and commercial contracts. Thus, users encrypt images before they are uploaded. However, cloud servers have to hide secret data in encrypted images to enable the retrieval and verification of massive encrypted images. To ensure that both the secret data and the original images can be extracted and recovered losslessly, researchers have proposed a method that is known as reversible data hiding in encrypted images (RDHEI). In this paper, a new RDHEI method using median edge detector (MED) and two’s complement is proposed. The MED prediction method is used to generate the predicted values of the original pixels and calculate the prediction errors. The adaptive-length two’s complement is used to encode the most prediction errors. To reserve room, the two’s complement is labeled in the pixels. To record the unlabeled pixels, a label map is generated and embedded into the image. After the image has been encrypted, it can be embedded with the data. The experimental results indicate that the proposed method can reach an average embedding rate of 2.58 bpp, 3.04 bpp, and 2.94 bpp on the three datasets, i.e., UCID, BOSSbase, BOWS-2, which outperforms the previous work.

24 May 2023 in Applied Sciences
Verified
Journal Article
Open access
PDF file
ZZZhen Zhang
Zhen Zhang
THTao He
Tao He
KCKai Chen
Kai Chen
BZBoshen Zhang
Boshen Zhang
QWQiuhua Wang
Qiuhua Wang
Yuan LifengYuan Lifeng
Yuan Lifeng
As the use of digital currencies, such as cryptocurrencies, increases in popularity, phishing scams and other cybercriminal activities on blockchain platforms (e.g., Ethereum) have also risen. Current methods of detecting phishing in Ethereum focus mainly on the transaction features and local network structure. However, these methods fail to account for the complexity of interactions between edges and the handling of large graphs. Additionally, these methods face significant issues due to the limited number of positive labels available. Given this, we propose a scheme that we refer to as the Bagging Multiedge Graph Convolutional Network to detect phishing scams on Ethereum. First, we extract the features from transactions and transform the complex Ethereum transaction network into three simple inter-node graphs. Then, we use graph convolution to generate node embeddings that leverage the global structural information of the inter-node graphs. Further, we apply the bagging strategy to overcome the issues of data imbalance and the Positive Unlabeled (PU) problem in transaction data. Finally, to evaluate our approach’s effectiveness, we conduct experiments using actual transaction data. The results demonstrate that our Bagging Multiedge Graph Convolutional Network (0.877 AUC) outperforms all of the baseline classification methods in detecting phishing scams on Ethereum.