Jingwei Jiang

Jingwei Jiang

Auto-generated profile, based on publicly available information

Jingwei Jiang

College of Computer Science and Technology, Harbin Engineering University, Harbin, 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
4 March 2024 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
JJJingwei Jiang
Jingwei Jiang
DWDing Wang
Ding Wang
Searchable encryption is a powerful tool that enables secure and private searches of encrypted data. It allows users to outsource their data to cloud servers while maintaining the confidentiality and privacy of their data. Password-authenticated symmetric searchable encryption (PASE) can help users avoid the complexity and security risks associated with key management while maintaining the advantages of searchable encryption. To the best of our knowledge, none of the existing PASE schemes can resist security threats in the post-quantum era, and there is an urgent need to design quantum-resistant solutions. However, post-quantum cryptography (e.g., lattice-based cryptography) varies significantly from traditional cryptography, and it is challenging to design a quantum-resistant PASE for cloud storage. In this work, we take the first step towards this challenge by proposing QPASE, a quantum-resistant password-authenticated symmetric searchable encryption for cloud storage. We employ lattice-based threshold oblivious pseudorandom function (TOPRF) to achieve password re-randomization and formally prove that QPASE is authentication secure and indistinguishability against chosen keyword attacks (IND-CKA) secure under quantum computers. QPASE can be extended to multi-keyword search and allows servers to update keys without affecting the users. The comparison results show that QPASE outperforms its foremost counterparts in security and computation overhead.

8 November 2023 in IEEE Transactions on Services Computing
Verified
Journal Article
Closed access
JJJingwei Jiang
Jingwei Jiang
DWDing Wang
Ding Wang
GZGuoyin Zhang
Guoyin Zhang
Cloud storage provides an efficient and convenient way to manage data, but it also poses significant challenges to data security. The central issue with cloud storage is to ensure the ability of the data owner to control and manage the outsourced data. The password-protected secret sharing (PPSS) integrates password authentication and secret sharing to offer a fresh approach to secure private data. Users can share the risk of device corruption with a well-designed PPSS scheme and manage outsourced data with only human-memorizable passwords. To the best of our knowledge, none of the existing PPSS schemes can resist security threats in the post-quantum era, and there is an urgent need to design quantum-resistant solutions. However, post-quantum cryptography varies significantly from traditional cryptography, and it is challenging to design a quantum-resistant password-protected secret-sharing scheme for cloud storage. In this work, we take the first substantial step towards this challenge by proposing QPause, a quantum-resistant password-protected data outsourcing scheme for cloud storage. We first design a basic quantum-resistant PPSS scheme based on the lattice secure against semi-honest adversaries with a secure channel. On this foundation, we propose a quantum-resistant round-optimal password-protected data outsourcing scheme against strong adversaries. In addition, we formally prove that our scheme is secure and robust under various attacks against adversaries with quantum computing capabilities. The comparison results show that our new scheme outperforms its foremost counterparts.

6 December 2025 in ACM Computing Surveys
Verified
Journal Article
Open access
DWDing Wang
Ding Wang
GLGuanling Li
Guanling Li
JJJingwei Jiang
Jingwei Jiang
Password-authenticated key exchange (PAKE) protocols tackle the important problem of how to enable two parties, who share a low-entropy password, to establish a cryptographically strong session key for secure data communication. Although considerable research efforts have been devoted to designing hundreds of PAKE protocols, to the best of our knowledge, there have been few systematic reviews. In this work, we provide a comprehensive overview of PAKE research. We first propose a list of 13 desirable properties of PAKE protocols in terms of security and usability, enabling PAKE protocols to be systematically rated across a common spectrum. We then provide a taxonomy for PAKE protocols, and classify them into seven types according to their underlying design strategies. For each type, we investigate the inner working mechanisms of various representative protocols, and identify their pros, and cons. We further classify existing PAKE protocols from five other key perspectives (i.e., symmetry, number of participants, hardness assumptions, security goals, and round complexity) and review their development history under each classification, aiming at providing an in-depth and thorough understanding of the status quo of PAKE research. Based on 13 properties and six perspectives, we conduct a large-scale comparative evaluation of 71 representative PAKE protocols in a systematic manner. Finally, we highlight a few potential directions for the future design of PAKE protocols.

9 December 2025 in Cybersecurity
Verified
Journal Article
Open access
PDF file
ZCZhiYuan Chen
ZhiYuan Chen
MJMeiYing Jin
MeiYing Jin
JJJingWei Jiang
JingWei Jiang
HZHongPeng Zhang
HongPeng Zhang
The Internet of Things (IoT), serving as a principal technology enabling device interconnection, data amalgamation, and automation, boasts unrivaled ubiquity and convenience. Due to limited computing resources, small storage space, and restricted security features of IoT terminals, they are exposed to security risks such as information leakage, tampering, unauthorized access, and malicious control. To assure the security of data communication within the IoT framework necessitates the deployment of a Group Key Agreement (GKA), and the categorization of devices into specific groups. However, due to the dynamic structure of the IoT, which demands frequent device node addition and removal, might engender the constant need for group key updates. Traditional GKA lacks sufficient flexibility and response speed, resulting in additional computing and communication costs. Subsequently, group key updates could also pose a challenge to the forward and backward security provided by the GKA. In this work, we take a feasible step towards this challenge by proposing FADIC, a fine-grained attribute-based dynamic group key agreement scheme for IoT. We employ a server-assisted approach for the generation and administration of access trees, and achieve an efficient attribute-based dynamic group key agreement scheme devised by integrating Lagrange interpolation and attribute-based access tree structure. Our FADIC scheme ensures fine-grained access control and privacy protection for group members. Moreover, the server-assisted approach is utilized to compute the updated keys, resulting in a substantial reduction in communication and computational overheads associated with attribute-based group key agreement schemes. We formally prove that our FADIC is indistinguishable under chosen ciphertext attacks secure, supporting the desired forward and backward security. The comparison results unequivocally demonstrate that our FADIC outperforms its foremost counterparts.

25 December 2024
Verified
Book Chapter
Closed access
PDF file
CZChensheng Zhang
Chensheng Zhang
TFTingwei Fan
Tingwei Fan
JJJingwei Jiang
Jingwei Jiang