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

Information Security and Cryptology

Identity-Based Transitive Signature Scheme from Lattices

Geontae Noh, Ji Young Chun

Published Jan 1, 2021• 3 citations
Publisher
DOI
10.13089/jkiisc.2021.31.3.509

Related papers

A novel identity-based multi-signature scheme over NTRU lattices

Xinjian Chen, Qiong Huang, Hongbo Li +2 more

Theoretical Computer Science•Sep 5, 2022•11 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

Scalable Hierarchical Identity-based Signature Scheme from Lattices

Geontae Noh, Ik Rae Jeong

In the paper, we propose a novel adaptively secure hierarchical identity-based signature scheme from lattices.The size of signatures in our scheme is shortest among the existing hierarchical identity-based signature schemes from lattices.Our scheme is motivated by Gentry et al.'s signature scheme and Agrawal et al.'s hierarchical identity-based encryption scheme.

KSII Transactions on Internet and Information Systems•Dec 29, 2013•9 citations

Efficient Identity-Based Signature from Lattices

Miaomiao Tian, Liusheng Huang

IFIP advances in information and communication technology•Jan 1, 2014•30 citations

Lattice-based undeniable signature scheme

Swati Rawal, Sahadeo Padhye, Debiao He

Annals of Telecommunications•Jan 10, 2022•6 citations

Identity-based Signatures from Lattices: Simpler, Faster, Shorter

Miaomiao Tian, Liusheng Huang

Identity-based signature is an important technique for light-weight authentication. Recently, many efforts have been made to construct identity-based signatures over lattice assumptions since they would remain secure in future quantum age. In this paper we present a new identity-based signature scheme from lattice problems. This scheme is more efficient than other lattice-based identity-based signature schemes in terms of both computation and communication complexities. We prove its security in the random oracle model under short integer solution assumption that is as hard as approximating several worst-case lattice problems. We also extend the scheme to an identity-based message recovery signature scheme that has better performance.

Fundamenta Informaticae•Jun 13, 2016•15 citations
Identity-based signature is an important technique for light-weight authentication. Recently, many efforts have been made to construct identity-based signatures over lattice assumptions since they would remain secure in future quantum age. In this paper we present a new identity-based signature scheme from lattice problems. This scheme is more efficient than other lattice-based identity-based signature schemes in terms of both computation and communication complexities. We prove its security in the random oracle model under short integer solution assumption that is as hard as approximating several worst-case lattice problems. We also extend the scheme to an identity-based message recovery signature scheme that has better performance.