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

Communications in computer and information science

A Lattice Based IBE Scheme for Automatic Key Update

Zixuan Yan, Shanqiang Feng, Fengyin Li

Published Aug 2, 2026• 0 citations
Publisher
DOI
10.1007/978-981-95-9514-3_6

Related papers

An Efficient Lattice-Based IBE Scheme Using Combined Public Key

Yanfeng Shi, Shuo Qiu, Jiqiang Liu

Communications in computer and information science•Jan 1, 2020•2 citations

A continuous leakage-amplified IBE scheme with perfect key update

Zirui Qiao, Yong Tao Yu, Yanwei Zhou +1 more

Theoretical Computer Science•Sep 7, 2025•1 citation

Lattice-Based Revocable (Hierarchical) IBE with Decryption Key Exposure Resistance

Shuichi Katsumata, Takahiro Matsuda, Atsushi Takayasu

Lecture notes in computer science•Jan 1, 2019•49 citations

Lattice-based revocable (hierarchical) IBE with decryption key exposure resistance

Shuichi Katsumata, Takahiro Matsuda, Atsushi Takayasu

Theoretical Computer Science•Dec 6, 2019•27 citations

Revocable Identity-Based Encryption from Lattices.

Jie Chen, Hoon Wei Lim, San Ling +2 more

Abstract. In this paper, we present an identity-based encryption (IBE) scheme from lattices with efficient key revocation. We adopt multiple trapdoors from the Agrawal-Boneh-Boyen and Gentry-Peikerty-Vaikuntanathan lattice IBE schemes to realize key revocation, which in turn, makes use of binary-tree data structure. Using our scheme, key update requires logarithmic complexity in the maximal number of users and linear in the number of revoked users for the relevant key authority. We prove that our scheme is selective secure in the standard model and under the LWE assumption, which is as hard as the worst-case approximating short vectors on arbitrary lattices. Moreover, our key revocation techniques from lattices can be applied to obtain revocable functional encryption schemes in the similar setting.

•Jan 1, 2011•0 citations

Lattice-based key exchange on small integer solution problem

Shanbiao Wang, Yan Zhu, Di Ma +1 more

Science China Information Sciences•Sep 17, 2014•56 citations
Abstract. In this paper, we present an identity-based encryption (IBE) scheme from lattices with efficient key revocation. We adopt multiple trapdoors from the Agrawal-Boneh-Boyen and Gentry-Peikerty-Vaikuntanathan lattice IBE schemes to realize key revocation, which in turn, makes use of binary-tree data structure. Using our scheme, key update requires logarithmic complexity in the maximal number of users and linear in the number of revoked users for the relevant key authority. We prove that our scheme is selective secure in the standard model and under the LWE assumption, which is as hard as the worst-case approximating short vectors on arbitrary lattices. Moreover, our key revocation techniques from lattices can be applied to obtain revocable functional encryption schemes in the similar setting.