Zhiqiang Lin
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
Research Interests
Zhiqiang Lin has a total of 26 co-authors. Here are the top co-authors by number of shared publications:
- Chunming Tang
School of Information Science and Technology, Southwest Jiaotong University, Chengdu, China
2 shared publications - Qi Chen
Guangdong Provincial Key Laboratory of Blockchain Security, Guangzhou University, Guangzhou, China
2 shared publications Shimin Lina
Jacobs School of Engineering, University of California San Diego, La Jolla, CA 92037, USA
2 shared publicationsZhongwei Liang
School of Mechanical and Electrical Engineering, Guangzhou University, Guangzhou 510006, China
2 shared publications- Dingyi Pei
School of Mathematics and Information Science Guangzhou University 510006 Guangzhou China
1 shared publication - Dongdai Lin
State Key Laboratory of Cyberspace Security Defense, Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China
1 shared publication
Latest Publications
- Open Access
- 7 February 2022
- Published by Wiley in Security and Communication Networks
- Vol. 2022, 1-9
A Hybrid Design of Linkable Ring Signature Scheme with Stealth Addresses
Blockchain is a transformational technology which affects finance, Internet, and politics. However, many privacy protection problems for blockchain are waiting to be solved. In this study, we propose a novel linkable ring signature scheme with stealth addresses, which enables the payer and payee of the transaction to be anonymous and unlinkable in the cryptocurrency. The scheme is combined with an elliptic curve discrete logarithm (ECD logarithm)-based key encapsulation mechanism (KEM) stage and a lattice-based signature stage. The master public key and master secret key are much smaller compared with the previous scheme. Complete secure proof of the scheme is also presented in this study.
- 7 February 2022
- Published by Wiley in Security and Communication Networks
- Vol. 2022, 1-9
Open AccessA Hybrid Design of Linkable Ring Signature Scheme with Stealth Addresses
Blockchain is a transformational technology which affects finance, Internet, and politics. However, many privacy protection problems for blockchain are waiting to be solved. In this study, we propose a novel linkable ring signature scheme with stealth addresses, which enables the payer and payee of the transaction to be anonymous and unlinkable in the cryptocurrency. The scheme is combined with an elliptic curve discrete logarithm (ECD logarithm)-based key encapsulation mechanism (KEM) stage and a lattice-based signature stage. The master public key and master secret key are much smaller compared with the previous scheme. Complete secure proof of the scheme is also presented in this study.
- 26 October 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 68 (1) , 601-631
Efficient Explicit Constructions of Multipartite Secret Sharing Schemes
Multipartite secret sharing schemes are those having a multipartite access structure, in which the set of participants is divided into several parts and all participants in the same part play an equivalent role. Secret sharing schemes for multipartite access structures have received considerable attention due to the fact that multipartite secret sharing can be seen as a natural and useful generalization of threshold secret sharing. This work deals with efficient and explicit constructions of ideal multipartite secret sharing schemes. Most ideal multipartite secret sharing schemes in the literature can be classified as either hierarchical or compartmented. The main results are the constructions for ideal hierarchical access structures, a family that contains every ideal hierarchical access structure as a particular case such as the disjunctive hierarchical threshold access structure and the conjunctive hierarchical threshold access structure, the constructions for three families of compartmented access structures, and the constructions for two families compartmented access structures with compartments. We present an efficient method to construct ideal linear schemes realizing these access structures by linear algebraic techniques on the basis of the relationship between multipartite secret sharing schemes, polymatroids and matroids.
- 26 October 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 68 (1) , 601-631
Efficient Explicit Constructions of Multipartite Secret Sharing Schemes
Multipartite secret sharing schemes are those having a multipartite access structure, in which the set of participants is divided into several parts and all participants in the same part play an equivalent role. Secret sharing schemes for multipartite access structures have received considerable attention due to the fact that multipartite secret sharing can be seen as a natural and useful generalization of threshold secret sharing. This work deals with efficient and explicit constructions of ideal multipartite secret sharing schemes. Most ideal multipartite secret sharing schemes in the literature can be classified as either hierarchical or compartmented. The main results are the constructions for ideal hierarchical access structures, a family that contains every ideal hierarchical access structure as a particular case such as the disjunctive hierarchical threshold access structure and the conjunctive hierarchical threshold access structure, the constructions for three families of compartmented access structures, and the constructions for two families compartmented access structures with compartments. We present an efficient method to construct ideal linear schemes realizing these access structures by linear algebraic techniques on the basis of the relationship between multipartite secret sharing schemes, polymatroids and matroids.
- Open Access
- 22 October 2021
- Published by Association for Computing Machinery (ACM)
- p. 1263-1268
Data flow sensitive driver vulnerability mining method
In 2017, the "Eternal Blue" vulnerability broke out, and people began to pay more attention to the vulnerabilities in the operating system itself. However, the complexity of the operating system determines that its vulnerability mining is difficult and inefficient. Driver vulnerabilities are as seriously harmful as system vulnerabilities. Currently, fuzzing is the most effective method of exploiting vulnerabilities for drivers without source code. Due to the hierarchical design of the system and the protection of the kernel of operating system, it is difficult to improve the efficiency of driver fuzzing. Based on the input and variable dependencies of the driver when passing parameters, the relationship model of seed and branch matching is established, and the seeds with different weights are sorted through the characteristics of the data flow. While guiding the direction of seed mutation, certain deep-seated vulnerabilities have also been touched. Experiments have proved that this method can greatly improve the module coverage of fuzz testing, thereby improving the efficiency of vulnerability discovery.
- 22 October 2021
- Published by Association for Computing Machinery (ACM)
- p. 1263-1268
Open AccessData flow sensitive driver vulnerability mining method
In 2017, the "Eternal Blue" vulnerability broke out, and people began to pay more attention to the vulnerabilities in the operating system itself. However, the complexity of the operating system determines that its vulnerability mining is difficult and inefficient. Driver vulnerabilities are as seriously harmful as system vulnerabilities. Currently, fuzzing is the most effective method of exploiting vulnerabilities for drivers without source code. Due to the hierarchical design of the system and the protection of the kernel of operating system, it is difficult to improve the efficiency of driver fuzzing. Based on the input and variable dependencies of the driver when passing parameters, the relationship model of seed and branch matching is established, and the seeds with different weights are sorted through the characteristics of the data flow. While guiding the direction of seed mutation, certain deep-seated vulnerabilities have also been touched. Experiments have proved that this method can greatly improve the module coverage of fuzz testing, thereby improving the efficiency of vulnerability discovery.
- Open Access
- 16 October 2021
- Published by Association for Computing Machinery (ACM)
- Vol. 99, 124-131
A Survey on Knowledge Enhanced EHR Data Mining
EHR contains detailed information about a large number of patients. In the past ten years, EHR-related research has involved various fields, and research in various fields is inseparable from the acquisition of knowledge in EHR. The rapid development of various fields in recent years has brought new challenges to the acquisition of knowledge in EHR. At the same time, the knowledge enhancement technology that has emerged in recent years has effectively improved this problem. Therefore, more and more researches personnel applied knowledge enhancement technology to EHR. In this article, we summarized the literature in this area. We first summarized the knowledge types of EHR, and then made a sub-statement on knowledge extraction and modeling. Next, the correct representation method of knowledge is given, and finally, the specific application in each field is summarized. We hope this article can continue to promote the development of knowledge enhancement technology in EHR.
- 16 October 2021
- Published by Association for Computing Machinery (ACM)
- Vol. 99, 124-131
Open AccessA Survey on Knowledge Enhanced EHR Data Mining
EHR contains detailed information about a large number of patients. In the past ten years, EHR-related research has involved various fields, and research in various fields is inseparable from the acquisition of knowledge in EHR. The rapid development of various fields in recent years has brought new challenges to the acquisition of knowledge in EHR. At the same time, the knowledge enhancement technology that has emerged in recent years has effectively improved this problem. Therefore, more and more researches personnel applied knowledge enhancement technology to EHR. In this article, we summarized the literature in this area. We first summarized the knowledge types of EHR, and then made a sub-statement on knowledge extraction and modeling. Next, the correct representation method of knowledge is given, and finally, the specific application in each field is summarized. We hope this article can continue to promote the development of knowledge enhancement technology in EHR.
- 29 June 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 68 (10) , 5976-5987
Compartmented Secret Sharing Schemes and Locally Repairable Codes
- 29 June 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 68 (10) , 5976-5987
Compartmented Secret Sharing Schemes and Locally Repairable Codes
- Open Access
- 20 January 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 17854-17862
On Design of Single-Layer and Multilayer Code-Based Linkable Ring Signatures
In this paper, we present an effective code-based linkable ring signature scheme based on Borromean ring signature. The security of the scheme is based on the hardness of Syndrome Decoding problem, General Syndrome Decoding problem and Codeword Finding problem. We prove that our scheme has all the properties that a linkable ring signature scheme should have: unforgeability, anonymity, linkability and non-slanderability. Efficiency analysis shows that our scheme has a smaller signature size than the existing scheme under the same security conditions. Furthermore, this signature scheme can be easily extended to multiple layers. That is, code-based multilayer linkable ring signature scheme can be obtained and used for transactions with multiple inputs.
- 20 January 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 17854-17862
Open AccessOn Design of Single-Layer and Multilayer Code-Based Linkable Ring Signatures
In this paper, we present an effective code-based linkable ring signature scheme based on Borromean ring signature. The security of the scheme is based on the hardness of Syndrome Decoding problem, General Syndrome Decoding problem and Codeword Finding problem. We prove that our scheme has all the properties that a linkable ring signature scheme should have: unforgeability, anonymity, linkability and non-slanderability. Efficiency analysis shows that our scheme has a smaller signature size than the existing scheme under the same security conditions. Furthermore, this signature scheme can be easily extended to multiple layers. That is, code-based multilayer linkable ring signature scheme can be obtained and used for transactions with multiple inputs.
- Open Access
- 26 December 2019
- Published by Wiley in Security and Communication Networks
- Vol. 2019, 1-10
polarRLCE: A New Code-Based Cryptosystem Using Polar Codes
Security challenges brought about by the upcoming 5G era should be taken seriously. Code-based cryptography leverages difficult problems in coding theory and is one of the main techniques enabling cryptographic primitives in the postquantum scenario. In this work, we propose the first efficient secure scheme based on polar codes (i.e., polarRLCE) which is inspired by the RLCE scheme, a candidate for the NIST postquantum cryptography standardization in the first round. In addition to avoiding some weaknesses of the RLCE scheme, we show that, with the proper choice of parameters, using polar codes, it is possible to design an encryption scheme to achieve the intended security level while retaining a reasonably small public key size. In addition, we also present a KEM version of the polarRLCE scheme that can attain a negligible decryption failure rate within the corresponding security parameters. It is shown that our proposal enjoys an apparent advantage to decrease the public key size, especially on the high-security level.
- 26 December 2019
- Published by Wiley in Security and Communication Networks
- Vol. 2019, 1-10
Open AccesspolarRLCE: A New Code-Based Cryptosystem Using Polar Codes
Security challenges brought about by the upcoming 5G era should be taken seriously. Code-based cryptography leverages difficult problems in coding theory and is one of the main techniques enabling cryptographic primitives in the postquantum scenario. In this work, we propose the first efficient secure scheme based on polar codes (i.e., polarRLCE) which is inspired by the RLCE scheme, a candidate for the NIST postquantum cryptography standardization in the first round. In addition to avoiding some weaknesses of the RLCE scheme, we show that, with the proper choice of parameters, using polar codes, it is possible to design an encryption scheme to achieve the intended security level while retaining a reasonably small public key size. In addition, we also present a KEM version of the polarRLCE scheme that can attain a negligible decryption failure rate within the corresponding security parameters. It is shown that our proposal enjoys an apparent advantage to decrease the public key size, especially on the high-security level.
- Open Access
- 8 August 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 120734-120743
Vibration Control for Two Kinds of Flexible Mechanical Systems With Full State Output Constraints
This paper concentrates on the vibration control problem of a flexible string system and a flexible Euler-Bernoulli beam system for considering full state output constraints, i.e., deflection and speed constraints. For either system, a boundary control law is developed based on a barrier Lyapunov function. By employing the control scheme, the deflection and speed are limited into desirable regions. With the help of a rigorous unique solution proof for the time derivative of the barrier Lyapunov function, the asymptotic stability of the considered system is achieved via LaSalle’s Invariance Principle. Finally, numerical simulations are provided to verify the control performances of the proposed controls.
- 8 August 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 120734-120743
Open AccessVibration Control for Two Kinds of Flexible Mechanical Systems With Full State Output Constraints
This paper concentrates on the vibration control problem of a flexible string system and a flexible Euler-Bernoulli beam system for considering full state output constraints, i.e., deflection and speed constraints. For either system, a boundary control law is developed based on a barrier Lyapunov function. By employing the control scheme, the deflection and speed are limited into desirable regions. With the help of a rigorous unique solution proof for the time derivative of the barrier Lyapunov function, the asymptotic stability of the considered system is achieved via LaSalle’s Invariance Principle. Finally, numerical simulations are provided to verify the control performances of the proposed controls.
- Open Access
- 3 July 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 87017-87026
Vibration Control of a Flexible Spacecraft System With Input Backlash
In this paper, we deal with the vibration control problem of a flexible spacecraft system with unknown external disturbance and uncertain input backlash non-linearity. The considered system is described by two partial differential equations and an ordinary differential equation as governing equations, and by ordinary differential equations as boundary conditions. The backlash non-linearity is reformulated into a desired control input associated with an extra input non-linear error. This input error and the external disturbance are combined into an unknown ‘disturbance-like’ item. Two boundary control inputs are designed at the center body of the spacecraft, compensating for the unknown upper-bound of such items by applying proper online updating laws. As a result, the vibration of both solar panels of the flexible spacecraft are suppressed and their angle positions are regulated in the desired region. Numerical simulations are provided to verify the control performance of the proposed controls by the choice of proper parameters.
- 3 July 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 87017-87026
Open AccessVibration Control of a Flexible Spacecraft System With Input Backlash
In this paper, we deal with the vibration control problem of a flexible spacecraft system with unknown external disturbance and uncertain input backlash non-linearity. The considered system is described by two partial differential equations and an ordinary differential equation as governing equations, and by ordinary differential equations as boundary conditions. The backlash non-linearity is reformulated into a desired control input associated with an extra input non-linear error. This input error and the external disturbance are combined into an unknown ‘disturbance-like’ item. Two boundary control inputs are designed at the center body of the spacecraft, compensating for the unknown upper-bound of such items by applying proper online updating laws. As a result, the vibration of both solar panels of the flexible spacecraft are suppressed and their angle positions are regulated in the desired region. Numerical simulations are provided to verify the control performance of the proposed controls by the choice of proper parameters.
- 25 May 2017
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 86 (4) , 939-953
Fast construction of binary ring FCSRs for hardware stream ciphers
- 25 May 2017
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 86 (4) , 939-953
Fast construction of binary ring FCSRs for hardware stream ciphers