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

Lecture notes in computer science

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

Markus Rückert

Published Jan 1, 2010• 101 citations
Publisher
DOI
10.1007/978-3-642-12929-2_14

Related papers

Tightly Secure Lattice Identity-Based Signature in the Quantum Random Oracle Model

Ernest Foo, Qinyi Li

Lecture notes in computer science•Jan 1, 2023•2 citations

Leveled Strongly-Unforgeable Identity-Based Fully Homomorphic Signatures

Fuqun Wang, Kunpeng Wang, Bao Li +1 more

Lecture notes in computer science•Jan 1, 2015•18 citations

Lattice-based strongly-unforgeable forward-secure identity-based signature scheme with flexible key update

Xiangsong Zhang, Zhenhua Liu

KSII Transactions on Internet and Information Systems•May 31, 2017•4 citations

Secure Hierarchical Identity-Based Identification without Random Oracles

Atsushi Fujioka, Taiichi Saito, Keita Xagawa

Lecture notes in computer science•Jan 1, 2012•3 citations

ID-Based Signatures from Lattices in the Random Oracle Model

Chunxiang Gu, Li Chen, Yonghui Zheng

Lecture notes in computer science•Jan 1, 2012•3 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
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.