Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Shuxue de shijian yu renshi

Efficient Lattice-based Identity-based Ring Sigature and Analysis of Security

Zhang Li-l

Published Jan 1, 2015• 0 citations
OpenAlex

Abstract

Ring signature is a special digital signature,and it can be widely applied to many fields,such ase-election,mobile communication,mobile agent,e-commerce activities and so on.a lattice-based identity-based ring signature scheme is proposed in this paper.Based on the difficulties of SIS and ISIS on lattice,the proposed scheme is existentially unforgeable;Based on delegation technique,the scheme is more efficient.

Related papers

An Efficient Identity-based Forward Secure Signature Scheme from Lattices

Guang Hui Wu, Ruwei Huang

With the use of a large number of mobile devices, the problem of key leakage becomes more and more serious. In view of the excellent characteristics of lattice cipher and forward-secure digital signature scheme, the construction of identity-based forward-secure digital signature based on lattice technology has become a research hotspot. However, the identity-based forward secure digital signature scheme on the existing grid has the disadvantage of excessive signature length. This paper uses the technique (without trapdoors) of Lyubashevsky and extended Samplepre, an efficient identity-based forward secure signature scheme from lattice is proposed. Its security is based on the Small Integer Solution (SIS) difficulty assumption, and the strong non-forgery of the signature scheme is achieved. Low computing overhead; The analysis results show that, compared with the existing schemes, the key and signature are smaller in size, more efficient in computing, able to resist quantum attacks, and more practical.

International Wireless Communications and Mobile Computing Conference (IWCMC)•Jun 28, 2021•4 citations

Efficient Ring Signature Scheme Without Random Oracle from Lattices

Wen Gao, Yupu Hu, Baocang Wang +2 more

Among post-quantum alternatives, latticebased cryptography is the most promising one, due to its simple operations, reduction from aver-age-case to worstcase hardness, and supporting of rich functionalities. Ring signature enables a user to sign anonymously on behalf of an adaptively chosen group, and has multiple applications in anonymous e-voting, anonymous authentication, whistle blowing etc. However, most lattice-based ring signature schemes were constructed in the random oracle model from lattice basis delegation and they suffer large verification key sizes as a common disadvantage. This work proposes an efficient ring signature scheme from lattice basis delegation without random oracle based on the extended split-SIS problem, whose security is approximately as hard as the worst-case SIVP problem. Our scheme is proved to be anonymous and existentially unforgeable under latticebased assumptions. Finally, the verification key size is significantly reduced to a small constant, instead of increasing linearly with the number of ring members.

Chinese Journal of Electronics•Mar 1, 2019•6 citations

An Efficient Identity-based Signcryption from Lattice

Xiufeng Zhao, Xiang Wang

Signcryption is a cryptographic primitive that can provide valid solution for authentication and confidentiality.In this paper, an efficient identity-based signcryption scheme from lattice was proposed.Our scheme based on Macciancio and Piekert's trapdoor generation method and delegate algorithm for lattice.Our main idea is that establish the identity-based system master key via trapdoor generation method for lattice, and extract user's key by trapdoor delegate algorithm.With the aid of random oracle, we prove that the proposed scheme has CCA security under the learning with errors (LWE) assumption and unforgeability against adaptive chosen messages attacks under the small integer solution (SIS) assumption.Comparison with signature-then-encryption approach shows that our scheme is efficient.

International Journal of Security and Its Applications•Mar 31, 2014•2 citations

An Identity-based Ring Signature Scheme from Lattices

Liusheng Huang

Identity-based ring signature is the combination of the identity-based cryptography and ring signature.It can be used in many practical applications.Most of the existing identity-based ring signatures are based the bilinear pairing assumption.How ever,bilinear pairing problem is no longer hard in the quantum era.To construct an identity-based ring signature securing in the quantum era,in this paper,we presented an identity-based ring signature scheme based on lattices.The scheme is secure in the standard model.The security of scheme is based on the standard small integer solution(SIS) assumption.Compared with other identity-based ring signature schemes from lattices in the standard model,our scheme enjoys higher efficiency.

Journal of Chinese Computer Systems•Jan 1, 2013•0 citations

Identity-Based Linkable Ring Signature on NTRU Lattice

Yongli Tang, Feifei Xia, Qing Ye +3 more

Although most existing linkable ring signature schemes on lattice can effectively resist quantum attacks, they still have the disadvantages of excessive time and storage overhead. This paper constructs an identity-based linkable ring signature (LRS) scheme over NTRU lattice by employing the technologies of trapdoor generation and rejection sampling. The security of this scheme relies on the small integer solution (SIS) problem on NTRU lattice. We prove that this scheme has unconditional anonymity, unforgeability, and linkability under the random oracle model (ROM). Through the performance analysis, this scheme has a shorter size of public/private keys, and when the number of ring members is small (such as N ≤ 8 ), this scheme has a shorter signature size compared with other existing latest lattice-based LRS schemes. The computational efficiency of signature has also been further improved since it only involves multiplication in the polynomial ring and modular operations of small integers. Finally, we implemented our scheme and other similar schemes, and it is shown that the time for the signature generation and verification of this scheme decreases roughly by 44.951% and 33.503%, respectively.

Security and Communication Networks•Sep 16, 2021•28 citations

An Identity-Based Proxy Signature Scheme from Lattices in the Standard Model

Wang Li

Currently, most of the identity-based proxy signature schemes are based on large integer factorization and discrete logarithm which are insecure in quantum setting. To this problem, we propose a provably-secure identity-based proxy signature scheme over lattice, which uses preimage sampling technology and lattice basis delegation algorithm in fixed dimension. The proposed scheme was proved to satisfy strong unforgeability against selective identity attacks based on the hardness of the small integer solution (SIS) problem in the standard model. And compared with the existing identity-based proxy signature scheme from lattices, our scheme is more secure under the same efficiency.

International Conference on Intelligent Networking and Collaborative Systems (INCoS)•Sep 1, 2016•8 citations
Ring signature is a special digital signature,and it can be widely applied to many fields,such ase-election,mobile communication,mobile agent,e-commerce activities and so on.a lattice-based identity-based ring signature scheme is proposed in this paper.Based on the difficulties of SIS and ISIS on lattice,the proposed scheme is existentially unforgeable;Based on delegation technique,the scheme is more efficient.
With the use of a large number of mobile devices, the problem of key leakage becomes more and more serious. In view of the excellent characteristics of lattice cipher and forward-secure digital signature scheme, the construction of identity-based forward-secure digital signature based on lattice technology has become a research hotspot. However, the identity-based forward secure digital signature scheme on the existing grid has the disadvantage of excessive signature length. This paper uses the technique (without trapdoors) of Lyubashevsky and extended Samplepre, an efficient identity-based forward secure signature scheme from lattice is proposed. Its security is based on the Small Integer Solution (SIS) difficulty assumption, and the strong non-forgery of the signature scheme is achieved. Low computing overhead; The analysis results show that, compared with the existing schemes, the key and signature are smaller in size, more efficient in computing, able to resist quantum attacks, and more practical.
Among post-quantum alternatives, latticebased cryptography is the most promising one, due to its simple operations, reduction from aver-age-case to worstcase hardness, and supporting of rich functionalities. Ring signature enables a user to sign anonymously on behalf of an adaptively chosen group, and has multiple applications in anonymous e-voting, anonymous authentication, whistle blowing etc. However, most lattice-based ring signature schemes were constructed in the random oracle model from lattice basis delegation and they suffer large verification key sizes as a common disadvantage. This work proposes an efficient ring signature scheme from lattice basis delegation without random oracle based on the extended split-SIS problem, whose security is approximately as hard as the worst-case SIVP problem. Our scheme is proved to be anonymous and existentially unforgeable under latticebased assumptions. Finally, the verification key size is significantly reduced to a small constant, instead of increasing linearly with the number of ring members.
Signcryption is a cryptographic primitive that can provide valid solution for authentication and confidentiality.In this paper, an efficient identity-based signcryption scheme from lattice was proposed.Our scheme based on Macciancio and Piekert's trapdoor generation method and delegate algorithm for lattice.Our main idea is that establish the identity-based system master key via trapdoor generation method for lattice, and extract user's key by trapdoor delegate algorithm.With the aid of random oracle, we prove that the proposed scheme has CCA security under the learning with errors (LWE) assumption and unforgeability against adaptive chosen messages attacks under the small integer solution (SIS) assumption.Comparison with signature-then-encryption approach shows that our scheme is efficient.
Identity-based ring signature is the combination of the identity-based cryptography and ring signature.It can be used in many practical applications.Most of the existing identity-based ring signatures are based the bilinear pairing assumption.How ever,bilinear pairing problem is no longer hard in the quantum era.To construct an identity-based ring signature securing in the quantum era,in this paper,we presented an identity-based ring signature scheme based on lattices.The scheme is secure in the standard model.The security of scheme is based on the standard small integer solution(SIS) assumption.Compared with other identity-based ring signature schemes from lattices in the standard model,our scheme enjoys higher efficiency.
Although most existing linkable ring signature schemes on lattice can effectively resist quantum attacks, they still have the disadvantages of excessive time and storage overhead. This paper constructs an identity-based linkable ring signature (LRS) scheme over NTRU lattice by employing the technologies of trapdoor generation and rejection sampling. The security of this scheme relies on the small integer solution (SIS) problem on NTRU lattice. We prove that this scheme has unconditional anonymity, unforgeability, and linkability under the random oracle model (ROM). Through the performance analysis, this scheme has a shorter size of public/private keys, and when the number of ring members is small (such as N ≤ 8 ), this scheme has a shorter signature size compared with other existing latest lattice-based LRS schemes. The computational efficiency of signature has also been further improved since it only involves multiplication in the polynomial ring and modular operations of small integers. Finally, we implemented our scheme and other similar schemes, and it is shown that the time for the signature generation and verification of this scheme decreases roughly by 44.951% and 33.503%, respectively.
Currently, most of the identity-based proxy signature schemes are based on large integer factorization and discrete logarithm which are insecure in quantum setting. To this problem, we propose a provably-secure identity-based proxy signature scheme over lattice, which uses preimage sampling technology and lattice basis delegation algorithm in fixed dimension. The proposed scheme was proved to satisfy strong unforgeability against selective identity attacks based on the hardness of the small integer solution (SIS) problem in the standard model. And compared with the existing identity-based proxy signature scheme from lattices, our scheme is more secure under the same efficiency.