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

Asymptotically Compact Adaptively Secure Lattice IBEs and Verifiable Random Functions via Generalized Partitioning Techniques

Shota Yamada

Published Jan 1, 2017• 76 citations
Publisher
DOI
10.1007/978-3-319-63697-9_6

Related papers

Adaptively Secure IBE from Lattices with Asymptotically Better Efficiency

Weidan Ji, Zhedong Wang, Lin Lyu +1 more

Lecture notes in computer science•Jan 1, 2025•1 citation

Adaptively secure lattice-based revocable IBE in the QROM: compact parameters, tight security, and anonymity

Atsushi Takayasu

Designs Codes and Cryptography•Jun 5, 2021•11 citations

Revisiting Adaptively Secure IBE from Lattices with Smaller Modulus: A Conceptually Simple Framework with Low Overhead

Weidan Ji, Zhedong Wang, Lin Lyu +1 more

Lecture notes in computer science•Dec 7, 2025•0 citations

More Efficient Adaptively Secure Lattice-Based IBE with Equality Test in the Standard Model

Kyoichi Asano, Keita Emura, Atsushi Takayasu

Lecture notes in computer science•Jan 1, 2022•7 citations

Adaptively Secure Efficient Lattice (H)IBE in Standard Model with Short Public Parameters

Kunwar Singh, C. Pandurangan, A. K. Banerjee

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

Adaptively Secure Lattice-based Revocable IBE in the QROM: Compact Parameters, Tight Security, and Anonymity.

Atsushi Takayasu

Revocable identity-based encryption (RIBE) is an extension of IBE that satisfies a key revocation mechanism to manage a number of users dynamically and efficiently. To resist quantum attacks, two adaptively secure lattice-based RIBE schemes are known in the (quantum) random oracle model ((Q)ROM). Wang et al.’s scheme that is secure in the ROM has large secret keys depending on the depth of a binary tree and its security reduction is not tight. Ma and Lin’s scheme that is secure in the QROM has large ciphertexts depending on the length of identities and is not anonymous. In this paper, we propose an adaptively secure lattice-based RIBE scheme that is secure in the QROM. Our scheme has compact parameters, where the ciphertext-size is smaller than Wang et al.’s scheme and the secret key size is the same as Ma and Lin’s scheme. Moreover, our scheme is anonymous and its security reduction is completely tight. We design the proposed scheme by modifying Ma–Lin’s scheme instantiated by the Gentry–Peikert–Vaikuntanathan (GPV) IBE. We can obtain the advantages of our scheme by making use of Katsumata et al.’s proof technique of the GPV IBE in the QROM.

•Jan 1, 2021•0 citations
Revocable identity-based encryption (RIBE) is an extension of IBE that satisfies a key revocation mechanism to manage a number of users dynamically and efficiently. To resist quantum attacks, two adaptively secure lattice-based RIBE schemes are known in the (quantum) random oracle model ((Q)ROM). Wang et al.’s scheme that is secure in the ROM has large secret keys depending on the depth of a binary tree and its security reduction is not tight. Ma and Lin’s scheme that is secure in the QROM has large ciphertexts depending on the length of identities and is not anonymous. In this paper, we propose an adaptively secure lattice-based RIBE scheme that is secure in the QROM. Our scheme has compact parameters, where the ciphertext-size is smaller than Wang et al.’s scheme and the secret key size is the same as Ma and Lin’s scheme. Moreover, our scheme is anonymous and its security reduction is completely tight. We design the proposed scheme by modifying Ma–Lin’s scheme instantiated by the Gentry–Peikert–Vaikuntanathan (GPV) IBE. We can obtain the advantages of our scheme by making use of Katsumata et al.’s proof technique of the GPV IBE in the QROM.