JSJiaoli Shi

Jiaoli Shi

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Jiaoli Shi has a total of 55 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    A Survey of Encryption-based Access Control Schemes in Named Data Networking

    by Jiaoli Shi, Xiaoping Liu, Anyuan Deng, Xiangyu Liu, Zhuolin Mei, Shunli Zhang, Shimao Yao, Xiancheng Wang, Liya Xu, Kai He

    Named Data Networking (NDN) completely abandons the traditional idea of IP addressing and uses the method of content matching to exchange data. This new network architecture is suitable for the emerging decentralized network. However, data access con...

  • Open Access

    Private, efficient, and flexible: protecting names based on message-derived encryption in named data networking

    by Kai He, Shengyuan Shi, Chunxiao Yin, Hongyan Wan, Jiaoli Shi

    Named data networking (NDN) is considered a novel architecture of the next-generation Internet that delivers content by names. However, the human-readable name may potentially leak users’ privacy. Existing solutions have focused on encrypting to protect privacy, but they are neither efficient in the case of one publisher and multiple subscribers nor successful in supporting prefix matching. To address the above challenges, we propose an efficient and flexible name scheme with privacy preservation, which combines message-driven encryption with Bloom Filter. Firstly, message-driven encryption is utilized to protect name privacy, thus supporting efficient and secure encrypted name matching. Secondly, each name is divided into multiple components, and then each component is encrypted separately to support flexible prefix matching. Lastly, the technology of Bloom Filter with random numbers is explored to improve the efficiency and accuracy of name matching. Security and performance analysis shows that the proposed scheme effectively enhances the efficiency and accuracy of data matching while protecting name privacy.

  • Open Access

    A Protecting‐Privacy Path Query Supporting Semantic‐Based Multikeyword Search Over Ciphertext Graph Data in Cloud Computing

    by Bin Wu, Zhuolin Mei, Jiaoli Shi, Zongmin Cui, Zhiqiang Zhao, Jinzhou Huang

    With the rapid development of information technology and intelligence, there are more and more usage scenarios of graph data. Path queries have always been a hot topic of research for scholars. There are already many mature methods and ideas in the study of the path query on the plaintext graph. For the path query on graph data in the case of cloud outsourcing, it is necessary to consider both the construction of query algorithms and the protection of privacy information. The processing of graph privacy information through encryption, and then outsourcing to the cloud platform, is a common measure. The semantic‐based path query supporting multikeyword search is an extended path query method, which can improve the query function. For users, it is very troublesome to access and process the encrypted graph data. In this article, we propose a protecting‐privacy semantic‐based multikeyword path query scheme on the ciphertext graph (PSMP). Firstly, based on the principle of searchable encryption and vector operation, a secure index is constructed, and then the cloud server uses the secure index to implement path queries. This article demonstrates its security through formal analysis and verifies its effectiveness through experimental comparison and analysis. The work of this article has a certain promoting effect on the query processing and analysis of ciphertext graph data.

  • Open Access

    An Efficient and Expressive Fully Policy-Hidden Ciphertext-Policy Attribute-Based Encryption Scheme for Satellite Service Systems

    by Jiaoli Shi, Chao Hu, Shunli Zhang, Qing Zhou, Zhuolin Mei, Shimao Yao, Anyuan Deng

    Satellite service systems transfer data from satellite providers to the big data industry, which includes data traders and data analytics companies. This system needs to provide access to numerous users whose specific identities are unknown. Ciphertext-Policy Attribute-Based Encryption (CP-ABE) allows unidentified users with the proper attributes to decrypt data, providing fine-grained access control of data. However, traditional CP-ABE does not protect access policies. Access policies are uploaded to the cloud, stored, and downloaded in plain text, making them vulnerable to privacy breaches. When the access policy is completely hidden, users need to use their own attributes to try matching one by one, which is an inefficient process. In order to efficiently hide the access policy fully, this paper introduces a new efficient and expressive Fully Policy-Hidden Ciphertext-Policy Attribute-Based Encryption scheme (CP-ABE-FPH), which integrates the 2-way handshake O-PSI method with the ROBDD method. The integration offers advantages: (1) High efficiency and high expressiveness. The access policy using ROBDD is highly expressive but computationally intensive due to its recursive nature. This shortcoming is overcome in CP-ABE-FPH using the proposed O-PSI method, and the access policy is matched quickly and secretly. (2) High flexibility. The decryption process does not require the owner or the Key Generation Center (KGC) to be online, and system attributes can be added at any time. Security analysis shows that the access policy is fully hidden. Efficiency analysis and simulation results show that the proposed scheme is highly efficient in decryption compared with existing schemes.


  • Open Access

    Efficient and Verifiable Range Query Scheme for Encrypted Geographical Information in Untrusted Cloud Environments

    by Zhuolin Mei, Jing Zeng, Caicai Zhang, Shimao Yao, Shunli Zhang, Haibin Wang, Hongbo Li, Jiaoli Shi

    With the rapid development of geo-positioning technologies, location-based services have become increasingly widespread. In the field of location-based services, range queries on geographical data have emerged as an important research topic, attracting significant attention from academia and industry. In many applications, data owners choose to outsource their geographical data and range query tasks to cloud servers to alleviate the burden of local data storage and computation. However, this outsourcing presents many security challenges. These challenges include adversaries analyzing outsourced geographical data and query requests to obtain privacy information, untrusted cloud servers selectively querying a portion of the outsourced data to conserve computational resources, returning incorrect search results to data users, and even illegally modifying the outsourced geographical data, etc. To address these security concerns and provide reliable services to data owners and data users, this paper proposes an efficient and verifiable range query scheme (EVRQ) for encrypted geographical information in untrusted cloud environments. EVRQ is constructed based on a map region tree, 0–1 encoding, hash function, Bloom filter, and cryptographic multiset accumulator. Extensive experimental evaluations demonstrate the efficiency of EVRQ, and a comprehensive analysis confirms the security of EVRQ.


  • A Lightweight Access Control Scheme Supporting Policy Hidden Based on Path Bloom Filter

    by Chao Luo, Jiaoli Shi, Minchen Xie, Chao Hu, Lihua Wang, Zhuolin Mei, Shimao Yao, Hui Li


  • An Identity-Based Proxy Re-Encryption Scheme With Single-Hop Conditional Delegation and Multi-Hop Ciphertext Evolution for Secure Cloud Data Sharing

    by Shimao Yao, Ralph Voltaire J. Dayot, In-Ho Ra, Liya Xu, Zhuolin Mei, Jiaoli Shi

    Proxy re-encryption (PRE) provides a promising solution for applications requiring efficient and secure ciphertext conversion, such as secure cloud data sharing. While the one with the function of ciphertext evolution is more desirable for some long-term schemes involving key update. Recently, Yao et al. constructed an identity-based conditional proxy re-encryption scheme simultaneously supporting authorization and ciphertext evolution. However, its delegated ciphertext can be re-authorized, which may cause the authorization to exceed the original delegator’s expectation. In contrast, the single-hop PRE authorization scheme may be more appropriate for systems requiring better control over authorization. In this paper, an identity-based proxy re-encryption scheme with single-hop conditional delegation and multi-hop ciphertext evolution (IBPRE-SHCD-MHCE) is proposed. Also, its description, construction, and security analysis are given. The analysis and experimental comparison results show that the proposed scheme has improved the computational efficiency and storage consumption compared with the two underlying schemes.


  • Open Access

    Enabling Decentralized and Dynamic Data Integrity Verification for Secure Cloud Storage via T-Merkle Hash Tree Based Blockchain

    by Kai He, Chunxiao Huang, Jiaoli Shi, Xinrong Hu, Xiying Fan

    Cloud storage provides elastic storage services for enterprises and individuals remotely. However, security problems such as data integrity are becoming a major obstacle. Recently, blockchain-based verification approaches have been extensively studied to get rid of a centralized third-party auditor. Most of these schemes suffer from poor scalability and low search efficiency and even fail to support data dynamic update operations on blockchain, which limits their large-scale and practical applications. In this work, we propose a blockchain-based dynamic data integrity verification scheme for cloud storage with T-Merkle hash tree. A decentralized scheme is proposed to eliminate the restrictions of previous centralized schemes. The data tags are generated by the technique of ZSS short signature and stored on blockchain. An improved verification method is designed to check the integrity of cloud data by transferring computation from a verifier to cloud server and blockchain. Furthermore, a storage structure called T-Merkle hash tree which is built based on T-tree and Merkle hash tree is designed to improve storage utilization of blockchain and support binary search on chain. Moreover, we achieve efficient and secure dynamic update operations on blockchain by an append-only manner. Besides, we extend our scheme to support batch verification to handle massive tasks simultaneously; thus, the efficiency is improved and communication cost is reduced. Finally, we implemented a prototype system based on Hyperledger Fabric to validate our scheme. Security analysis and performance studies show that the proposed scheme is secure and efficient.