ZJZhuliang Jia

Zhuliang Jia

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Zhuliang Jia has a total of 12 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • PLOSQ3D: Privacy-Preserving Location-Based Skyline Query over Encrypted 3D Spatial Data

    by Zhuliang Jia, Suprio Ray, Rongxing Lu, Pulei Xiong

    Privacy-preserving location-based skyline queries (LBSQ) enable location-based services (LBS) over outsourced spatial data while preserving data privacy. Prior studies primar ily consider Euclidean distance as the spatial-attribute metric. However, this does not capture reachability in three-dimensional (3D) obstacle environments, where obstacles invalidate direct Euclidean distances and necessitate obstacle-aware path computations. In this work, we present PLOSQ3D, a privacy-preserving location-based skyline query framework in 3D obstacle space. We first formalize the problem, specify its privacy requirements, and identify the challenges introduced by obstacle-aware distances. Subsequently, we introduce a novel index, Secure Augmented R-Tree (SAR-Tree) that jointly encodes spatial and non-spatial at tributes, enabling effective pruning under 3D spatial constraints. To enforce privacy, we leverage Function Secret Sharing (FSS) to design three protocols: SLDC for secure dominance computation, SSPC for secure shortest-path computation, and OLDU for oblivious skyline-set update. Building on them, we carefully design the PLOSQ3D scheme. Our security analysis demonstrates strong privacy guarantees against honest-but-curious adversaries. We further conduct extensive experiments on both synthetic and real 3D datasets. Experimental results show that our framework achieves high efficiency in both computation and communication overhead, confirming its practicality for 3D spatial applications that demand spatial-awareness and privacy protection.

  • Privacy-Preserving Any-Hop Cover Shortest Distance Queries on Encrypted Graphs

    by Xueling Zhao, Minghui Wang, Zhuliang Jia, Shundong Li

    Graphs are an essential data representation method and are widely used in many scenarios. Shortest distance query is one of the most fundamental operations on a graph and has thus attracted much research attention. While various graph encryption schemes supporting shortest distance query have been proposed, there remain considerable challenges, such as information leakage, approximate query results, and large computational errors. Furthermore, existing schemes can only address 2-hop cover shortest distance queries on encrypted graphs and do not allow shortest distance queries by others. Therefore, only the graph owner (GO) can query the shortest distance based on encrypted data. To overcome these limitations, we propose a privacy-preserving any-hop cover shortest distance query scheme on encrypted graphs, called AHCSDQ. Matrices are used to compute any-hop cover shortest distance (AHCSD) between any two vertices. Our scheme preprocesses graph data and store the preprocessed results in a server, and query users can retrieve the corresponding encoding value from the appropriate matrix. This scheme enable accurate AHCSD queries while protecting graph data privacy. In addition, the GO only needs to preprocess graph data once, and the preprocessing result can be provided to multiple users for multiple queries. Furthermore, a single shortest distance query only needs the query user one encryption operation, also significantly reduces the computational cost for query users. In this article, we establish the security of our proposed scheme using a widely accepted simulation paradigm and present experimental results to demonstrate the high efficiency of scheme.


  • FPMRQ: Fully Privacy-Preserving Multidimensional Range Queries on Encrypted Data

    by Wenli Wang, Zhuliang Jia, Mengfan Xu, Shundong Li

    Multidimensional range queries are typical database operations used to retrieve data. With the development of cloud computing, outsourcing data storage and queries to a cloud server is an attractive choice for data owners; however, this choice involves well-known privacy issues. To preserve data privacy, data should be encrypted before they are outsourced to the cloud. Therefore, exploring multidimensional range queries on encrypted data has important theoretical and practical significance. Certain privacy-preserving schemes have been proposed to support multidimensional range queries on encrypted data. However, these schemes exhibit either poor privacy performance or poor computational or communication performance. This makes such schemes impractical for resource-constrained scenarios such as Internet of Things (IoT) environments. To improve security and efficiency in making them applicable to IoT environments, we propose lightweight secure vector comparison and secure double-blind protocols as building blocks to construct an efficient scheme, named the Fully Privacy-preserving Multidimensional Range Queries scheme (FPMRQ), and prove that FPMRQ can resist database reconstruction and query-recovery attacks. To improve communication efficiency, we adopt methods to pack multidimensional data into single-dimensional data and aggregate multiple data records into a single record of data. Finally, we conducted numerous experiments on real-world datasets to examine the efficiency of FPMRQ, and the experimental results show that FPMRQ significantly improves the computational efficiency (almost three orders of magnitude faster) and communication efficiency (at least 7.15× faster) in comparison with existing schemes with the same security level. These results demonstrate the practicality of the FPMRQ for resource-restrained environments, such as IoT.


  • SPCS: Strong Privacy-Preserving-Constrained Shortest Distance Queries on Encrypted Graphs

    by Wenli Wang, Zhuliang Jia, Mengfan Xu, Shundong Li

    A constrained shortest distance (CSD) query calculates the shortest distance between two vertices of a graph and places constraints on certain factors so as not to exceed corresponding thresholds. With the development of cloud computing, outsourcing graph data storage and the computation of CSD queries to a cloud platform (CP) are an attractive choice for graph owners; however, this choice is accompanied by well-known privacy issues. Certain privacy-preserving schemes have been proposed to support CSD queries on encrypted graphs, but all such schemes consider only single-CSD queries, even though, in practical applications, users may need to set two or more constraints when executing the shortest distance query. Additionally, existing schemes disclose too much private information to the CP. To address these considerable problems, we propose a strong privacy-preserving CSD query scheme called SPCS, which realizes accurate double-CSD queries without disclosing any critical private information. We prove that SPCS does not reveal any private information to the CP except for the number of vertices and conduct numerous experiments on real-world data sets to test this scheme’s efficiency. The experimental results show that SPCS is practical, especially in its computational efficiency in the graph-encryption phase, which is higher than that of available, state-of-the-art schemes.