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

Optical and Quantum Electronics

Identity-based quantum signature scheme with strong security

Xiangjun Xin, Zhuo Wang, Qinglan Yang

Published Nov 15, 2019• 7 citations
Publisher
DOI
10.1007/s11082-019-2072-9

Related papers

An improved efficient identity-based quantum signature scheme

Yongfei Huang, Guangxia Xu, Xiaoling Song

Quantum Information Processing•Dec 23, 2022•10 citations

Strongly Unforgeable Signatures and Hierarchical Identity-based Signatures from Lattices without Random Oracles.

Markus Rückert

Abstract. We propose a variant of the “bonsai tree ” signature scheme, a lattice-based existentially unforgeable signature scheme in the standard model. Our construction offers the same efficiency as the “bonsai tree” scheme but supports the stronger notion of strong unforgeability. Strong unforgeability demands that the adversary is unable to produce a new message-signature pair (m, s), even if he or she is allowed to see a different signature s ′ for m. In particular, we provide the first treeless signature scheme that supports strong unforgeability for the post-quantum era in the standard model. Moreover, we show how to directly implement identity-based, and even hierarchical identity-based, signatures (IBS) in the same strong security model without random oracles. An additional advantage of this direct approach over the usual generic conversion of hierarchical identity-based encryption to IBS is that we can exploit the efficiency of ideal lattices without significantly harming security. We equip all constructions with strong security proofs based on mild worst-case assumptions on lattices and we also propose concrete security parameters.

•Jan 1, 2010•0 citations

Adaptive Secure Revocable Identity-based Signature Scheme over Lattices

Xiang Xin-yi

The security of traditional identity-based signatures wholly depends on the security of secret keys.Exposure of secret keys requires reissuing all previously assigned signatures.Based on this,to revoke private key leaks or malicious users in the signature scheme,an adaptive secure revocable identity-based signature over lattices is proposed,which provides an efficient revocation mechanism to revoke misbehaving or compromised users from the systems.The scheme is proved to be strongly Unforgeable against adaptive Chosen-message Attacks(sUFCMA)under Small Integer Solution(SIS)assumption.Security analysis results show that the proposed scheme not only can meet the security of revocable identity-based signature,but also can resist the quantum attack.

Jisuanji gongcheng•Jan 1, 2015•8 citations

Quantum Signature and Identity Authentication Scheme Based on Quantum Public Key

Yun‐Long Wu, jinqing Li, Xiaoqiang Di +2 more

•Jan 1, 2024•1 citation

A New Secure Quantum Signature Masked Authentication Scheme

Vandani Verma, Kajal Malhotra

Wireless Personal Communications•May 6, 2021•5 citations

Efficient hierarchical identity-based signatures from lattices

Miaomiao Tian, Liusheng Huang, Wei Yang

Lattice-based hierarchical identity-based signature (HIBS) schemes are receiving significant attention due to provable security reductions and potential security for quantum computers. However, most of the existing HIBS schemes based on lattices are less efficient for practical applications. To make lattice-based HIBS schemes become more practical, this paper presents an efficient HIBS scheme from lattices. Both the secret key size and the signature length of our proposal are much shorter than those of other lattice-based HIBS proposals. Our scheme is proven to be strongly unforgeable against adaptive identity attacks in the random oracle model. The security of the construction relies on the standard short integer solution (SIS) assumption.

International Journal of Electronic Security and Digital Forensics•Jan 1, 2013•19 citations
Abstract. We propose a variant of the “bonsai tree ” signature scheme, a lattice-based existentially unforgeable signature scheme in the standard model. Our construction offers the same efficiency as the “bonsai tree” scheme but supports the stronger notion of strong unforgeability. Strong unforgeability demands that the adversary is unable to produce a new message-signature pair (m, s), even if he or she is allowed to see a different signature s ′ for m. In particular, we provide the first treeless signature scheme that supports strong unforgeability for the post-quantum era in the standard model. Moreover, we show how to directly implement identity-based, and even hierarchical identity-based, signatures (IBS) in the same strong security model without random oracles. An additional advantage of this direct approach over the usual generic conversion of hierarchical identity-based encryption to IBS is that we can exploit the efficiency of ideal lattices without significantly harming security. We equip all constructions with strong security proofs based on mild worst-case assumptions on lattices and we also propose concrete security parameters.
The security of traditional identity-based signatures wholly depends on the security of secret keys.Exposure of secret keys requires reissuing all previously assigned signatures.Based on this,to revoke private key leaks or malicious users in the signature scheme,an adaptive secure revocable identity-based signature over lattices is proposed,which provides an efficient revocation mechanism to revoke misbehaving or compromised users from the systems.The scheme is proved to be strongly Unforgeable against adaptive Chosen-message Attacks(sUFCMA)under Small Integer Solution(SIS)assumption.Security analysis results show that the proposed scheme not only can meet the security of revocable identity-based signature,but also can resist the quantum attack.
Lattice-based hierarchical identity-based signature (HIBS) schemes are receiving significant attention due to provable security reductions and potential security for quantum computers. However, most of the existing HIBS schemes based on lattices are less efficient for practical applications. To make lattice-based HIBS schemes become more practical, this paper presents an efficient HIBS scheme from lattices. Both the secret key size and the signature length of our proposal are much shorter than those of other lattice-based HIBS proposals. Our scheme is proven to be strongly unforgeable against adaptive identity attacks in the random oracle model. The security of the construction relies on the standard short integer solution (SIS) assumption.