Haopeng Zhu

Haopeng Zhu

Auto-generated profile, based on publicly available information

Haopeng Zhu

School of Information and Control Engineering, China University of Mining and Technology, Xuzhou, China

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
22 November 2023 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
Minghui MinMinghui Min
Minghui Min
HZHaopeng Zhu
Haopeng Zhu
JDJiahao Ding
Jiahao Ding
SLShiyin Li
Shiyin Li
LXLiang Xiao
Liang Xiao
ZHZhu Han
Zhu Han
The rapid development of indoor location-based services (LBS) has raised concerns about location privacy protection in the 3-dimensional (3D) space. The existing 2-dimensional (2D) location privacy protection mechanisms (LPPMs) cannot effectively resist attacks in 3D environments. Furthermore, users may have various sensitive attributes at different locations and times. In this paper, we first formally study the relationship between two complementary notions of geo-indistinguishability and distortion privacy (i.e., expected inference error) in the 3D space and develop a two-phase personalized 3D LPPM (P3DLPPM). In Phase I, we search for neighboring locations to formulate a protection location set (PLS) for hiding the actual location based on the above-mentioned relationship. To realize this, we develop a 3D Hilbert curve-based minimum distance searching algorithm to find the PLS with minimum diameter for each location while guaranteeing differential privacy. In Phase II, we put forth a novel Permute-and-Flip mechanism for location perturbation, which maps its initial application in data publishing privacy protection to a location perturbation mechanism. It generates fake locations with smaller perturbation distances while improving the balance between privacy and quality of service (QoS). Simulation results show that the proposed P3DLPPM can significantly improve personalized privacy protection while meeting the user's QoS needs.

12 March 2024 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
Minghui MinMinghui Min
Minghui Min
HZHaopeng Zhu
Haopeng Zhu
SLShiyin Li
Shiyin Li
HZHongliang Zhang
Hongliang Zhang
LXLiang Xiao
Liang Xiao
ZHZhu Han
Zhu Han
Location semantics can expose mobile users' preferences and lifestyles, posing a significant privacy risk when utilizing location-based services. Users with different semantic locations typically have varying sensitivities and different privacy requirements. However, current research has not quantitatively studied how sensitivity affects location privacy protection. This paper proposes a semantic adaptive geo-indistinguishability mechanism (SAGEO) to quantify personalized location privacy. Then, we present a novel semantic curved distance-based mechanism to ensure the above SAGEO achieve differential privacy by adding random noise to users' locations. Simulation results show that the proposed mechanism provides a better balance between privacy protection and quality of service compared to existing benchmarks.

17 July 2023 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
Minghui MinMinghui Min
Minghui Min
HZHaopeng Zhu
Haopeng Zhu
SYShuang Yang
Shuang Yang
JXJunhuai Xu
Junhuai Xu
JTJingwen Tong
Jingwen Tong
Jiangang ShuJiangang Shu
Jiangang Shu
Location privacy protection (LPP) has become a key concern during mobile crowdsourcing (MCS) task allocation. Existing LPP mechanisms for MCS applications mainly focus on 2-D plane scenarios or directly apply 2-D techniques into 3-D space scenarios, leaving the height dimension of 3-D geolocation vulnerable to privacy breaches. To facilitate the LPP in 3-D MCS, we propose a learning-based geo-perturbation mechanism using 3-D geo-indistinguishability (3D-GI). In this mechanism, we first define an optimization objective to balance location privacy and MCS server profit, making it adaptable to different types of MCS applications. Then, we adopt the asynchronous advantage Actor–Critic (A3C) algorithm to design a reinforcement learning (RL)-based approach without knowing the accurate system and attack models. This approach enables us to derive the optimal perturbation policy in continuous policy space and accelerates the learning speed using asynchronous multithread training. Simulation results demonstrate that the proposed mechanism can better balance location privacy and server profit in 3-D MCS applications compared to existing benchmarks.