Yandong Zheng

Yandong Zheng

Auto-generated profile, based on publicly available information

Yandong Zheng

Xidian University

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
28 February 2020 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
HMHassan Mahdikhani
Hassan Mahdikhani
RLRongxing Lu
Rongxing Lu
YZYandong Zheng
Yandong Zheng
JSJun Shao
Jun Shao
AGAli Ghorbani
Ali Ghorbani
The advance of Internet of Things (IoT) techniques has promoted an increasing number of organizations to explore more mission-critical solutions. However, the response latency, bandwidth usage, and reliability are still challenging issues in traditional IoT. To tackle these challenges, fog-based IoT has become popular and range query is one of the most frequently used operations in fog-based IoT, where, given a range query, a fog node will return the aggregated data from IoT devices to the query user. Because the fog nodes are not fully trusted, there is a desire to design a privacy-preserving range query scheme in fog-based IoT. However, most of existing privacy-preserving range query schemes are not efficient in terms of communication overhead, especially for a large-size range. Therefore, it is still a challenging issue to design a communication-efficient range query in fog-based IoT. Aiming at this challenge, in this paper, we propose a new privacy-preserving range query scheme in fog-based IoT. Specifically, we first devise an efficient homomorphic encryption scheme for maintaining the data privacy and security in a range query. Then, we present a novel range decomposition technique to compile the range query, which can transform a given range query L,U, where 0≤L≤U≤n-1, into a semi-triangular structure, and enable our proposed scheme to achieve O(log3n) communication efficiency. Detailed security analysis shows that our proposed scheme is really privacy-preserving, and the extensive performance evaluation demonstrates that our proposed scheme is efficient in terms of low communication overhead and computational cost.

23 February 2021 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
YZYandong Zheng
Yandong Zheng
RLRongxing Lu
Rongxing Lu
YGYunguo Guan
Yunguo Guan
JSJun Shao
Jun Shao
HZHui Zhu
Hui Zhu
Similarity query over time series data plays a significant role in various applications, such as signal processing, speech recognition, and disease diagnosis. Meanwhile, driven by the reliable and flexible cloud services, encrypted time series data are often outsourced to the cloud, and as a result, the similarity query over encrypted time series data has recently attracted considerable attention. Nevertheless, existing solutions still have issues in supporting similarity queries over time series data with different lengths, query accuracy and query efficiency. To address these issues, in this article, we propose a new efficient and privacy-preserving similarity range query scheme, where the time warp edit distance (TWED) is used as the similarity metric. Specifically, we first organize time series data into a $k$ d-tree by leveraging TWED’s triangle inequality, and design an efficient similarity range query algorithm for the $k$ d-tree. Second, based on a symmetric homomorphic encryption technique, we carefully devise a suite of privacy-preserving protocols to provide a security guarantee for $k$ d-tree based similarity range queries. After that, by using the similarity range query algorithm and these protocols, we propose our privacy-preserving similarity range query scheme, in which we elaborate on two strategies to make our scheme resist against the cloud inference attack. Finally, we analyze the security of our scheme and conduct extensive experiments to evaluate its performance, and the results indicate that our proposed scheme is indeed privacy-preserving and efficient.

6 December 2022 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
SZSongnian Zhang
Songnian Zhang
SRSuprio Ray
Suprio Ray
RLRongxing Lu
Rongxing Lu
YGYunguo Guan
Yunguo Guan
YZYandong Zheng
Yandong Zheng
JSJun Shao
Jun Shao
As a popular and practical query type in location-based services, the spatial keyword query has been extensively studied in both academia and industry. Meanwhile, with the growing demand for data privacy, many privacy-preserving spatial keyword query schemes have been proposed to deal with queries over encrypted data. However, none of the existing schemes preserve access pattern privacy, and the recent research illustrates that leaking such privacy may incur inference attacks and thus disclose sensitive information. In addition, most existing schemes only consider the boolean keyword search, which is not quite practical and flexible in real-world applications. To address the above issues, in this paper, we propose two privacy-preserving spatial keyword similarity query schemes that can preserve full and partial access pattern privacy, respectively. First, we present a basic privacy-preserving spatial keyword similarity query scheme (PPSKS) by integrating a secure set membership test (SSMT) technique with secure circuits. After that, to improve performance, we propose a tree-based scheme (PPSKS+) by employing a new index called FR-tree together with a predicate encryption technique that can encrypt FR-tree. Formal security analysis shows that: i) our proposed schemes can protect outsourced data, query requests, and query results; ii) our PPSKS scheme can hide full access patterns, while the PPSKS+ scheme preserves $m$ -access pattern privacy. Extensive experiments are also conducted, and the results indicate that our tree-based PPSKS+ scheme is much more efficient, almost two orders of magnitude better than our linear search PPSKS scheme in performing queries.

12 July 2021 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
YGYunguo Guan
Yunguo Guan
RLRongxing Lu
Rongxing Lu
YZYandong Zheng
Yandong Zheng
SZSongnian Zhang
Songnian Zhang
JSJun Shao
Jun Shao
GWGuiyi Wei
Guiyi Wei
The sixth-generation (6G) communication technology has been attracting great interests from both industry and academia, as it is regarded as a promising approach to achieve more stable and low-latency communication. These promising features of 6G make it an enabler for cybertwin, a technique to create digital representations for physical objects to implement various functionalities. In this article, we consider a cybertwin-based spatiotemporal keyword query service over a dynamic message data set in intelligent transportation system (ITS) scenarios. Particularly, in the considered service, publishers upload messages to the cloud, and each cybertwin predictively launches queries to retrieve messages on behalf of the corresponding vehicle, such that each vehicle can timely receive messages that are of its interest whenever it arrives at a location. Nevertheless, as the cloud is not fully trustable, there exist privacy concerns related to the messages and queries. Up to now, although many schemes have been proposed to handle privacy-preserving spatial, temporal, or keyword queries, none of them can simultaneously support queries containing both spatial, temporal, and keyword criteria on dynamic data sets. Aiming at the issue, we design a layered index based on segment trees to dynamically organize messages containing both spatial, temporal, and keyword information. Moreover, based on a symmetric homomorphic encryption scheme, we encrypt the messages and queries and present a two-server privacy-preserving spatiotemporal keyword query scheme. We analyze the security of the proposed scheme and also conduct extensive experiments to evaluate its performance. The results show that our proposed scheme is indeed privacy preserving and computationally efficient.

30 July 2021 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
YZYandong Zheng
Yandong Zheng
RLRongxing Lu
Rongxing Lu
YGYunguo Guan
Yunguo Guan
JSJun Shao
Jun Shao
HZHui Zhu
Hui Zhu
It is undeniable that Internet of Things (IoT) in big data era can provide us with huge volumes of multi-dimensional data, transforming our society into a much more intelligent one. In order to fit for the multi-dimensional data processing in big data era, multi-dimensional range queries, especially over cloud platform, have received considerable attention in recent years. However, as the cloud server is not fully trustable, designing multi-dimensional range queries over encrypted data becomes a research trend, and many solutions have been proposed in the literature. Nevertheless, most existing solutions suffer from the leakage of the single-dimensional privacy, and such leakage would severely put the data at risk. Although a few existing works have addressed the problem of single-dimensional privacy, they are impractical in some real scenarios due to the issues of inefficiency, inaccuracy, and two-cloud-server requirement. Aiming at solving these issues, in this article, we propose a practical and privacy-preserving multi-dimensional range query (PRQ) scheme. Specifically, in our proposed PRQ scheme, we first index the multi-dimensional dataset with an R-tree and reduce R-tree based range queries to the problem of point intersection and range intersection. Then, by employing the lightweight matrix encryption technique, we design two novel algorithms for PRQ, i.e., multi-dimensional point intersection predicate encryption (PIPE) and multi-dimensional range intersection predicate encryption (RIPE), which can preserve the privacy of the proposed point intersection algorithm and range intersection algorithm, and further preserve the single-dimensional privacy of the proposed PRQ scheme. Detailed security analysis shows that our proposed PRQ scheme is indeed privacy-preserving. In addition, extensive simulations are conducted, and the results also demonstrate its efficiency.

25 March 2021 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
YGYunguo Guan
Yunguo Guan
RLRongxing Lu
Rongxing Lu
YZYandong Zheng
Yandong Zheng
JSJun Shao
Jun Shao
GWGuiyi Wei
Guiyi Wei
Enabled by the flourishing Internet of Things technology, smart cities can offer a variety of smart services to our daily lives and have received considerable attention in recent years. As a pivotal component of smart cities, location-based services (LBS) have been deeply exploited by both academia and industry. Meanwhile, since cloud computing can provide reliable and flexible IT resources, many LBS services have been outsourced to the cloud for offering better services. Nevertheless, as the cloud is not fully trusted, privacy preservation becomes an essential requirement for these services. Over the past years, many privacy-preserving location-based k-Nearest Neighbor (kNN) query schemes over the cloud have been proposed. However, most of them are subjected to an inevitable design defect, i.e., whenever a user queries twice at the same location, the cloud can identify and return the same query result to the query user, and such information together with third-party data breaches could be exploited by the cloud for some location disclosures. Although some existing schemes can cope with the issue, they are not quite practical, as they will bring heavy overheads on the query user side. In this paper, aiming to address the above challenge, we propose a novel oblivious location-based kNN query scheme, in which the cloud cannot link two queries even if they are initiated by query users at the same location. Specifically, based on the modified Paillier Cryptosystem, we first present three privacy-preserving protocols, namely oblivious absolute value calculation, sorting, and top-k extraction. Then, by integrating these three protocols, we propose our novel oblivious location-based kNN query scheme. Detailed security analysis shows that our proposed scheme really enhances the privacy preservation in LBS queries. In addition, extensive performance analysis and experiments are conducted, and the results indicate that our proposed scheme is also efficient for the query user.