Zhuo Liu
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
Research Subjects
Zhuo Liu has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Yong Wang
Chongqing University of Posts and Telecommunications
4 shared publications - Leo Yu Zhang
School of Information and Communication Technology, Griffith University, Southport, Queensland, Australia
3 shared publications - Jinyuan Liu
College of Computer Science and Technology, Chongqing University of Posts and Telecommunications, Chongqing 400065, China
2 shared publications - Fabio Pareschi
Politecnico di Torino
1 shared publication - Gianluca Setti
Politecnico di Torino
1 shared publication - Guanrong Chen
Department of Electrical Engineering, City University of Hong Kong, Kowloon 999077, Hong Kong SAR, P. R. China
1 shared publication
Latest Publications
- Top Cited PapersOpen Access
- 14 January 2026
- Published by Springer Nature in Cybersecurity
- Vol. 9 (1) , 103
A newly image encryption scheme based on 3-D coupled map lattice and Baker map
Recently, image encryption is becoming increasingly important, many chaotic models have been prevalently used to design kinds of cryptographic schemes in chaos cryptography. Among those models, coupled map lattice (CML), as a classics spatiotemporal chaotic model with good performance, is popularly used for those chaos-based cryptographic schemes. However, there exist no scientific studies in the three dimensional (3D) CML model from the view of theoretical and application perspectives besides our previous research. To further improve the complicated chaotic dynamic behavior and extend the application scenarios of CML into a3D CML one, therefore it is introduced into our paper for constructing chaos-based image encryption scheme with higher security. First of all, properties of 3D CML are comprehensively analyzed to fully verify that it possesses more complicated chaotic behavior than one dimensional and two dimensional CML. Subsequently, the chaotic sequences are produced by means of intercepting 32 bit from each node of the 3D CML model, both NIST and TestU01 testing certificate those chaotic sequences have high randomness, which are pretty suitable for designing the chaos-based cryptographic scheme. Based on those above-mentioned analyses, a new color image encryption scheme is proposed via diffusion and confusion. In our scheme, diffusion is performed based on those above-mentioned chaotic sequences via the 3D CML model, while confusion is carried out according to the Baker map. Specially, before diffusion and confusion operations, red, green and blue channel of a plain color image are combined into one pixel including 24 bit (0 or 1) for improving the efficiency of our scheme. To sum up, all corresponding simulations show our scheme has excellent encryption performance, and it would be popularly applied in the real-life cryptographic domains. Our research contributes to enriching the theoretical research on chaotic cryptography and provides new chaotic image encryption schemes.
- 14 January 2026
- Published by Springer Nature in Cybersecurity
- Vol. 9 (1) , 103
Top Cited PapersOpen AccessA newly image encryption scheme based on 3-D coupled map lattice and Baker map
Recently, image encryption is becoming increasingly important, many chaotic models have been prevalently used to design kinds of cryptographic schemes in chaos cryptography. Among those models, coupled map lattice (CML), as a classics spatiotemporal chaotic model with good performance, is popularly used for those chaos-based cryptographic schemes. However, there exist no scientific studies in the three dimensional (3D) CML model from the view of theoretical and application perspectives besides our previous research. To further improve the complicated chaotic dynamic behavior and extend the application scenarios of CML into a3D CML one, therefore it is introduced into our paper for constructing chaos-based image encryption scheme with higher security. First of all, properties of 3D CML are comprehensively analyzed to fully verify that it possesses more complicated chaotic behavior than one dimensional and two dimensional CML. Subsequently, the chaotic sequences are produced by means of intercepting 32 bit from each node of the 3D CML model, both NIST and TestU01 testing certificate those chaotic sequences have high randomness, which are pretty suitable for designing the chaos-based cryptographic scheme. Based on those above-mentioned analyses, a new color image encryption scheme is proposed via diffusion and confusion. In our scheme, diffusion is performed based on those above-mentioned chaotic sequences via the 3D CML model, while confusion is carried out according to the Baker map. Specially, before diffusion and confusion operations, red, green and blue channel of a plain color image are combined into one pixel including 24 bit (0 or 1) for improving the efficiency of our scheme. To sum up, all corresponding simulations show our scheme has excellent encryption performance, and it would be popularly applied in the real-life cryptographic domains. Our research contributes to enriching the theoretical research on chaotic cryptography and provides new chaotic image encryption schemes.
- Open Access
An Irreversible and Revocable Template Generation Scheme Based on Chaotic System
Face recognition technology has developed rapidly in recent years, and a large number of applications based on face recognition have emerged. Because the template generated by the face recognition system stores the relevant information of facial biometrics, its security is attracting more and more attention. This paper proposes a secure template generation scheme based on a chaotic system. Firstly, the extracted face feature vector is permuted to eliminate the correlation within the vector. Then, the orthogonal matrix is used to transform the vector, and the state value of the vector is changed, while maintaining the original distance between the vectors. Finally, the cosine value of the included angle between the feature vector and different random vectors are calculated and converted into integers to generate the template. The chaotic system is used to drive the template generation process, which not only enhances the diversity of templates, but also has good revocability. In addition, the generated template is irreversible, and even if the template is leaked, it will not disclose the biometric information of users. Experimental results and theoretical analysis on the RaFD and Aberdeen datasets show that the proposed scheme has good verification performance and high security.
Open AccessAn Irreversible and Revocable Template Generation Scheme Based on Chaotic System
Face recognition technology has developed rapidly in recent years, and a large number of applications based on face recognition have emerged. Because the template generated by the face recognition system stores the relevant information of facial biometrics, its security is attracting more and more attention. This paper proposes a secure template generation scheme based on a chaotic system. Firstly, the extracted face feature vector is permuted to eliminate the correlation within the vector. Then, the orthogonal matrix is used to transform the vector, and the state value of the vector is changed, while maintaining the original distance between the vectors. Finally, the cosine value of the included angle between the feature vector and different random vectors are calculated and converted into integers to generate the template. The chaotic system is used to drive the template generation process, which not only enhances the diversity of templates, but also has good revocability. In addition, the generated template is irreversible, and even if the template is leaked, it will not disclose the biometric information of users. Experimental results and theoretical analysis on the RaFD and Aberdeen datasets show that the proposed scheme has good verification performance and high security.
- Open Access
From Chaos to Pseudo-Randomness: A Case Study on the 2D Coupled Map Lattice
Applying chaos theory for secure digital communications is promising and it is well acknowledged that in such applications the underlying chaotic systems should be carefully chosen. However, the requirements imposed on the chaotic systems are usually heuristic, without theoretic guarantee for the resultant communication scheme. Among all the primitives for secure communications, it is well-accepted that (pseudo) random numbers are most essential. Taking the well-studied two-dimensional coupled map lattice (2D CML) as an example, this paper performs a theoretical study towards pseudo-random number generation with the 2D CML. In so doing, an analytical expression of the Lyapunov exponent (LE) spectrum of the 2D CML is first derived. Using the LEs, one can configure system parameters to ensure the 2D CML only exhibits complex dynamic behavior, and then collect pseudo-random numbers from the system orbits. Moreover, based on the observation that least significant bit distributes more evenly in the (pseudo) random distribution, an extraction algorithm E is developed with the property that, when applied to the orbits of the 2D CML, it can squeeze uniform bits. In implementation, if fixed-point arithmetic is used in binary format with a precision of $z$ bits after the radix point, E can ensure that the deviation of the squeezed bits is bounded by $2^{-z}$ . Further simulation results demonstrate that the new method not only guide the 2D CML model to exhibit complex dynamic behavior, but also generate uniformly distributed independent bits. In particular, the squeezed pseudo random bits can pass both NIST 800-22 and TestU01 test suites in various settings. This study thereby provides a theoretical basis for effectively applying the 2D CML to secure communications.Open AccessFrom Chaos to Pseudo-Randomness: A Case Study on the 2D Coupled Map Lattice
Applying chaos theory for secure digital communications is promising and it is well acknowledged that in such applications the underlying chaotic systems should be carefully chosen. However, the requirements imposed on the chaotic systems are usually heuristic, without theoretic guarantee for the resultant communication scheme. Among all the primitives for secure communications, it is well-accepted that (pseudo) random numbers are most essential. Taking the well-studied two-dimensional coupled map lattice (2D CML) as an example, this paper performs a theoretical study towards pseudo-random number generation with the 2D CML. In so doing, an analytical expression of the Lyapunov exponent (LE) spectrum of the 2D CML is first derived. Using the LEs, one can configure system parameters to ensure the 2D CML only exhibits complex dynamic behavior, and then collect pseudo-random numbers from the system orbits. Moreover, based on the observation that least significant bit distributes more evenly in the (pseudo) random distribution, an extraction algorithm E is developed with the property that, when applied to the orbits of the 2D CML, it can squeeze uniform bits. In implementation, if fixed-point arithmetic is used in binary format with a precision of $z$ bits after the radix point, E can ensure that the deviation of the squeezed bits is bounded by $2^{-z}$ . Further simulation results demonstrate that the new method not only guide the 2D CML model to exhibit complex dynamic behavior, but also generate uniformly distributed independent bits. In particular, the squeezed pseudo random bits can pass both NIST 800-22 and TestU01 test suites in various settings. This study thereby provides a theoretical basis for effectively applying the 2D CML to secure communications. - 16 July 2020
- Published by Springer Nature in Nonlinear Dynamics
- Vol. 101 (2) , 1383-1396
A stream cipher algorithm based on 2D coupled map lattice and partitioned cellular automata
- 16 July 2020
- Published by Springer Nature in Nonlinear Dynamics
- Vol. 101 (2) , 1383-1396
A stream cipher algorithm based on 2D coupled map lattice and partitioned cellular automata