Jianqiang Ni
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Jianqiang Ni has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Gaoli Wang
East China Normal University
6 shared publications - Yingxin Li
Shanghai Key Laboratory of Trustworthy Computing, Software Engineering Institute, East China Normal University, Shanghai, China
4 shared publications - Guoyan Zhang
Shandong University
2 shared publications - Jianhui Zhang
R&D Center, Shandong Luruan Digital Technology Co., Ltd., Jinan 250101, China
2 shared publications - Rui Li
Inspur Academy of Science and Technology, Jinan, Shandong, China
2 shared publications - Yanzhao Shen
Shandong Institute of Blockchain
2 shared publications
Latest Publications
- 20 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 71 (12) , 9732-9752
Practical Key Collision on AES and Kiasu-BC
The key collision attack was proposed as an open problem in key-committing security in Authenticated Encryption (AE) schemes like AES-GCM and ChaCha20Poly1305. In ASIACRYPT 2024, Taiyama et al. introduce a novel type of key collision—target-plaintext key collision (TPKC) for AES. Depending on whether the plaintext is fixed, TPKC can be divided into fixed-TPKC and free-TPKC, which can be directly converted into collision attacks and semi-free-start collision attacks on the Davies-Meyer (DM) hashing mode. In this paper, we propose a new rebound attack framework leveraging a time-memory tradeoff strategy, enabling practical key collision attacks with optimized complexity. We also present an improved automatic method for finding rebound-friendly differential characteristics by controlling the probabilities in the inbound and outbound phases, allowing the identified characteristics to be directly used in rebound-based key collision attacks. Our analysis reveals that the 2-round AES-128 fixed-TPKC attack proposed by Taiyama et al. is, in fact, a free-TPKC attack. This distinction is significant, as fixed-TPKC attacks are substantially more difficult than their free-TPKC counterparts. By integrating our improved automatic method with a new rebound attack framework, we successfully identify a new differential characteristic for the 2-round AES-128 fixed-TPKC attack and develope the first practical fixed-TPKC attack against 2-round AES-128. Additionally, we present practical fixed-TPKC attacks against 5-round AES-192 and 3-round Kiasu-BC, along with a practical free-TPKC attack against 6-round Kiasu-BC. Furthermore, we reduce time complexities for free-TPKC and fixed-TPKC attacks on other AES variants.
- 20 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 71 (12) , 9732-9752
Practical Key Collision on AES and Kiasu-BC
The key collision attack was proposed as an open problem in key-committing security in Authenticated Encryption (AE) schemes like AES-GCM and ChaCha20Poly1305. In ASIACRYPT 2024, Taiyama et al. introduce a novel type of key collision—target-plaintext key collision (TPKC) for AES. Depending on whether the plaintext is fixed, TPKC can be divided into fixed-TPKC and free-TPKC, which can be directly converted into collision attacks and semi-free-start collision attacks on the Davies-Meyer (DM) hashing mode. In this paper, we propose a new rebound attack framework leveraging a time-memory tradeoff strategy, enabling practical key collision attacks with optimized complexity. We also present an improved automatic method for finding rebound-friendly differential characteristics by controlling the probabilities in the inbound and outbound phases, allowing the identified characteristics to be directly used in rebound-based key collision attacks. Our analysis reveals that the 2-round AES-128 fixed-TPKC attack proposed by Taiyama et al. is, in fact, a free-TPKC attack. This distinction is significant, as fixed-TPKC attacks are substantially more difficult than their free-TPKC counterparts. By integrating our improved automatic method with a new rebound attack framework, we successfully identify a new differential characteristic for the 2-round AES-128 fixed-TPKC attack and develope the first practical fixed-TPKC attack against 2-round AES-128. Additionally, we present practical fixed-TPKC attacks against 5-round AES-192 and 3-round Kiasu-BC, along with a practical free-TPKC attack against 6-round Kiasu-BC. Furthermore, we reduce time complexities for free-TPKC and fixed-TPKC attacks on other AES variants.
- 2 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (18) , 38249-38261
Security Analysis of the Lightweight Cryptographic Algorithm Sycon for IoT Devices
With the rapid proliferation of the Internet of Things (IoT), the security of IoT devices has become an increasingly critical concern, particularly in the context of lightweight cryptographic algorithms designed for resource-constrained environments. Lightweight cryptography is indispensable for ensuring the confidentiality and integrity of communications across IoT networks. This article presents a thorough security evaluation of the Sycon algorithm, focusing on its susceptibility to a range of cryptographic attacks. We begin by introducing Meet-in-the-Middle (MitM) preimage and collision attacks on 3-round and 4-round Sycon-Hash. These attacks are the first published analysis results on reduced-round Sycon-Hash. By employing a satisfiability modulo theory-based modeling approach in conjunction with the STP solver, we successfully construct and validate MitM attack paths, thereby providing novel insights into the resilience of Sycon against such threats. In addition, we propose and implement a committing attack on the 2-round Sycon-AEAD-64 using the CMT-3 framework, which uncovers potential vulnerabilities within its authenticated encryption mechanism. Our analysis not only advances the understanding of Sycon’s cryptographic robustness but also offers valuable methodologies for the future assessment of lightweight cryptographic solutions in resource-constrained contexts.
- 2 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (18) , 38249-38261
Security Analysis of the Lightweight Cryptographic Algorithm Sycon for IoT Devices
With the rapid proliferation of the Internet of Things (IoT), the security of IoT devices has become an increasingly critical concern, particularly in the context of lightweight cryptographic algorithms designed for resource-constrained environments. Lightweight cryptography is indispensable for ensuring the confidentiality and integrity of communications across IoT networks. This article presents a thorough security evaluation of the Sycon algorithm, focusing on its susceptibility to a range of cryptographic attacks. We begin by introducing Meet-in-the-Middle (MitM) preimage and collision attacks on 3-round and 4-round Sycon-Hash. These attacks are the first published analysis results on reduced-round Sycon-Hash. By employing a satisfiability modulo theory-based modeling approach in conjunction with the STP solver, we successfully construct and validate MitM attack paths, thereby providing novel insights into the resilience of Sycon against such threats. In addition, we propose and implement a committing attack on the 2-round Sycon-AEAD-64 using the CMT-3 framework, which uncovers potential vulnerabilities within its authenticated encryption mechanism. Our analysis not only advances the understanding of Sycon’s cryptographic robustness but also offers valuable methodologies for the future assessment of lightweight cryptographic solutions in resource-constrained contexts.
- Open Access
Algebraic Attacks against Grendel: An Arithmetization-Oriented Primitive with the Legendre Symbol
The rise of modern cryptographic protocols such as Zero-Knowledge proofs and secure Multi-party Computation has led to an increased demand for a new class of symmetric primitives. Unlike traditional platforms such as servers, microcontrollers, and desktop computers, these primitives are designed to be implemented in arithmetical circuits. In terms of security evaluation, arithmetization-oriented primitives are more complex compared to traditional symmetric cryptographic primitives. The arithmetization-oriented permutation Grendel employs the Legendre Symbol to increase the growth of algebraic degrees in its nonlinear layer. To analyze the security of Grendel thoroughly, it is crucial to investigate its resilience against algebraic attacks. This paper presents a preimage attack on the sponge hash function instantiated with the complete rounds of the Grendel permutation, employing algebraic methods. A technique is introduced that enables the elimination of two complete rounds of substitution permutation networks (SPN) in the sponge hash function without significant additional cost. This method can be combined with univariate root-finding techniques and Gröbner basis attacks to break the number of rounds claimed by the designers. By employing this strategy, our attack achieves a gain of two additional rounds compared to the previous state-of-the-art attack. With no compromise to its security margin, this approach deepens our understanding of the design and analysis of such cryptographic primitives.
Open AccessAlgebraic Attacks against Grendel: An Arithmetization-Oriented Primitive with the Legendre Symbol
The rise of modern cryptographic protocols such as Zero-Knowledge proofs and secure Multi-party Computation has led to an increased demand for a new class of symmetric primitives. Unlike traditional platforms such as servers, microcontrollers, and desktop computers, these primitives are designed to be implemented in arithmetical circuits. In terms of security evaluation, arithmetization-oriented primitives are more complex compared to traditional symmetric cryptographic primitives. The arithmetization-oriented permutation Grendel employs the Legendre Symbol to increase the growth of algebraic degrees in its nonlinear layer. To analyze the security of Grendel thoroughly, it is crucial to investigate its resilience against algebraic attacks. This paper presents a preimage attack on the sponge hash function instantiated with the complete rounds of the Grendel permutation, employing algebraic methods. A technique is introduced that enables the elimination of two complete rounds of substitution permutation networks (SPN) in the sponge hash function without significant additional cost. This method can be combined with univariate root-finding techniques and Gröbner basis attacks to break the number of rounds claimed by the designers. By employing this strategy, our attack achieves a gain of two additional rounds compared to the previous state-of-the-art attack. With no compromise to its security margin, this approach deepens our understanding of the design and analysis of such cryptographic primitives.
- Open Access
- 21 June 2023
- Published by MDPI AG in Preprints.org
Algebraic Attacks against Grendel: An Arithmetization-Oriented Primitives with the Legendre Symbol
Modern cryptographic protocols such as zero-knowledge proofs and secure multi-party computation have increased the demand for a novel category of symmetric primitives. These primitives are not optimized for traditional platforms such as servers, microcontrollers, and desktop computers but rather for their ability to be implemented in arithmetic circuits. To enable efficient arithmetic operations, they define operations over larger finite fields and use low-degree invertible functions to construct their non-linear layers. Grendel is an arithmetization-oriented permutation that leverages the Legendre Symbol to enhance the growth of algebraic degrees in its non-linear layer. In this paper, we present a preimage attack on the sponge hash function instantiated with the full rounds of the Grendel permutation using algebraic methods. We introduce a technique that allows us to eliminate two full rounds of substitution permutation networks (SPN) in the sponge hash function with minimal or no additional cost. This method can be combined with univariate root-finding techniques and Gröbner basis attacks to break the number of rounds claimed by the designers. By utilizing this strategy, our attack achieves an improvement of two additional rounds compared to the previous state-of-the-art attack. While not breaking its security margin, it allows us to further understand the design and analysis of such cryptographic primitives.
- 21 June 2023
- Published by MDPI AG in Preprints.org
Open AccessAlgebraic Attacks against Grendel: An Arithmetization-Oriented Primitives with the Legendre Symbol
Modern cryptographic protocols such as zero-knowledge proofs and secure multi-party computation have increased the demand for a novel category of symmetric primitives. These primitives are not optimized for traditional platforms such as servers, microcontrollers, and desktop computers but rather for their ability to be implemented in arithmetic circuits. To enable efficient arithmetic operations, they define operations over larger finite fields and use low-degree invertible functions to construct their non-linear layers. Grendel is an arithmetization-oriented permutation that leverages the Legendre Symbol to enhance the growth of algebraic degrees in its non-linear layer. In this paper, we present a preimage attack on the sponge hash function instantiated with the full rounds of the Grendel permutation using algebraic methods. We introduce a technique that allows us to eliminate two full rounds of substitution permutation networks (SPN) in the sponge hash function with minimal or no additional cost. This method can be combined with univariate root-finding techniques and Gröbner basis attacks to break the number of rounds claimed by the designers. By utilizing this strategy, our attack achieves an improvement of two additional rounds compared to the previous state-of-the-art attack. While not breaking its security margin, it allows us to further understand the design and analysis of such cryptographic primitives.
- 5 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 10 (22) , 20049-20064
A Multifactor Combined Data Sharing Scheme for Vehicular Fog Computing Using Blockchain
Vehicular fog computing (VFC), as an extended model of fog computing, combines fog computing with traditional in-vehicle networks to provide real-time response services for users. However, in such a dynamic system architecture, achieving secure and efficient data sharing is an enormous challenge. Ciphertext-policy attribute-based encryption (CP-ABE) is widely regarded as an excellent way of achieving one-to-many data sharing. Nevertheless, several practical challenges hinder its widespread application in VFC, such as inefficient attribute revocation, single-factor access control, and centralized data storage. For this purpose, we design a multifactor combined data sharing scheme for VFC with CP-ABE and blockchain (MC-DS-VFC, in short). We first propose an efficient attribute revocation mechanism that does not require complex key update operations. We then embed time, user attributes, and access interests into data sharing for more fine-grain access control, which enables users with sufficient attributes to efficiently access real-time shared data according to their access interests. Finally, we combine the interplanetary file system (IPFS) and the blockchain maintained by roadside units (RSUs) to achieve distributed collaborative storage. Furthermore, our mechanism also supports user traceability, attribute joining, online/offline encryption, and verifiable outsourced decryption. Our proposal is shown to satisfy the indistinguishability under chosen plaintext attack (IND-CPA) in the standard model. Theoretical analysis and simulation experiments indicate that the MC-DS-VFC scheme is efficient and practical for VFC.
- 5 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 10 (22) , 20049-20064
A Multifactor Combined Data Sharing Scheme for Vehicular Fog Computing Using Blockchain
Vehicular fog computing (VFC), as an extended model of fog computing, combines fog computing with traditional in-vehicle networks to provide real-time response services for users. However, in such a dynamic system architecture, achieving secure and efficient data sharing is an enormous challenge. Ciphertext-policy attribute-based encryption (CP-ABE) is widely regarded as an excellent way of achieving one-to-many data sharing. Nevertheless, several practical challenges hinder its widespread application in VFC, such as inefficient attribute revocation, single-factor access control, and centralized data storage. For this purpose, we design a multifactor combined data sharing scheme for VFC with CP-ABE and blockchain (MC-DS-VFC, in short). We first propose an efficient attribute revocation mechanism that does not require complex key update operations. We then embed time, user attributes, and access interests into data sharing for more fine-grain access control, which enables users with sufficient attributes to efficiently access real-time shared data according to their access interests. Finally, we combine the interplanetary file system (IPFS) and the blockchain maintained by roadside units (RSUs) to achieve distributed collaborative storage. Furthermore, our mechanism also supports user traceability, attribute joining, online/offline encryption, and verifiable outsourced decryption. Our proposal is shown to satisfy the indistinguishability under chosen plaintext attack (IND-CPA) in the standard model. Theoretical analysis and simulation experiments indicate that the MC-DS-VFC scheme is efficient and practical for VFC.
- 5 May 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 23 (4) , 3343-3360
Attribute-Based Data Sharing Scheme Using Blockchain for 6G-Enabled VANETs
The advent of 6 G communications technology will bring about a transition from the “Internet of Everything” to the “Intelligent Connection of Everything”. 6G-enabled vehicular ad hoc networks (VANETs) will enjoy lower latency, higher speed, and greater capacity network services. Nevertheless, achieving secure data sharing will be an even tougher challenge. Given this, we propose an attribute-based data sharing scheme with blockchain for 6G-enabled VANETs. First, we propose an efficient multi-tree-based user revocation mechanism. With the Chinese remainder theorem, our mechanism supports user batch revocation and batch joining. Second, we achieve distributed data storage by utilizing the blockchain and smart contracts. To solve the problem of insufficient storage capacity on the blockchain, we adopt a combination of on-chain and off-chain storage. Third, to reduce the computation burden on users, our proposal supports online/offline encryption and verifiable outsourced decryption. Meanwhile, our mechanism supports policy hiding, data revocation, and cross-domain data sharing. The proposed scheme is proven to satisfy the indistinguishability under chosen plaintext attack (IND-CPA) in the standard model. Theoretical analysis shows that our mechanism outperforms existing schemes in functionality and security. Simulation experiments show that our proposal is efficient and suitable for 6G-enabled VANETs.
- 5 May 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 23 (4) , 3343-3360
Attribute-Based Data Sharing Scheme Using Blockchain for 6G-Enabled VANETs
The advent of 6 G communications technology will bring about a transition from the “Internet of Everything” to the “Intelligent Connection of Everything”. 6G-enabled vehicular ad hoc networks (VANETs) will enjoy lower latency, higher speed, and greater capacity network services. Nevertheless, achieving secure data sharing will be an even tougher challenge. Given this, we propose an attribute-based data sharing scheme with blockchain for 6G-enabled VANETs. First, we propose an efficient multi-tree-based user revocation mechanism. With the Chinese remainder theorem, our mechanism supports user batch revocation and batch joining. Second, we achieve distributed data storage by utilizing the blockchain and smart contracts. To solve the problem of insufficient storage capacity on the blockchain, we adopt a combination of on-chain and off-chain storage. Third, to reduce the computation burden on users, our proposal supports online/offline encryption and verifiable outsourced decryption. Meanwhile, our mechanism supports policy hiding, data revocation, and cross-domain data sharing. The proposed scheme is proven to satisfy the indistinguishability under chosen plaintext attack (IND-CPA) in the standard model. Theoretical analysis shows that our mechanism outperforms existing schemes in functionality and security. Simulation experiments show that our proposal is efficient and suitable for 6G-enabled VANETs.