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

Adaptively Chosen Ciphertext Secure Lattice IBE Based Programmable Hash Function in the Standard Model

Yongli Tang, Ming‐Ming Wang, Zongqu Zhao, Qing Ye

Published Jan 1, 2018• 0 citations
Publisher
DOI
10.1007/978-3-030-00012-7_43

Related papers

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

Lattice-Based Public Key Cryptosystem Provably Secure against Adaptive Chosen Ciphertext Attack.

Huiyan Chen, Zichen Li

•Jan 1, 2010•0 citations

IBE with tight security against selective opening and chosen-ciphertext attacks

Dingding Jia, Yamin Liu, Bao Li

Designs Codes and Cryptography•Apr 16, 2020•4 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•22 citations

Adaptive Trapdoor Functions and Chosen-Ciphertext Security

Eike Kiltz, Payman Mohassel, Adam O’Neill

Lecture notes in computer science•Jan 1, 2010•91 citations

Efficient Generic Construction of CCA-Secure Identity-Based Encryption from Randomness Extraction

Joonsang Baek, Duncan S. Wong, Jin Li +1 more

We propose a generic construction that yields efficient identity-based encryption (IBE) schemes secure against chosen ciphertext attack (CCA) in the standard model. Our construction extends Kiltz et al.'s (Eurocrypt '09) method of constructing CCA-secure public-key encryption schemes via randomness extraction to the identity-based setting. The main idea of our construction is to transform ‘|$\epsilon _1$|-almost |$\kappa $|-entropic’ and valid/invalid ciphertext indistinguishable (VI-IND) identity-based hash proof system to the one that satisfies the stronger ‘|$\epsilon _2$|-universal’ and VI-IND property. This transformation is realized by a randomness extractor based on the 4-wise hash function. We demonstrate that our generic construction can produce CCA-secure IBE schemes whose efficiency is comparable with the most efficient but non-generic CCA-secure IBE schemes without random oracles in the literature.

The Computer Journal•Sep 3, 2015•4 citations
We propose a generic construction that yields efficient identity-based encryption (IBE) schemes secure against chosen ciphertext attack (CCA) in the standard model. Our construction extends Kiltz et al.'s (Eurocrypt '09) method of constructing CCA-secure public-key encryption schemes via randomness extraction to the identity-based setting. The main idea of our construction is to transform ‘|ϵ1\epsilon _1ϵ1​|-almost |$\kappa ∣−entropic’andvalid/invalidciphertextindistinguishable(VI−IND)identity−basedhashproofsystemtotheonethatsatisfiesthestronger‘∣|-entropic’ and valid/invalid ciphertext indistinguishable (VI-IND) identity-based hash proof system to the one that satisfies the stronger ‘|∣−entropic’andvalid/invalidciphertextindistinguishable(VI−IND)identity−basedhashproofsystemtotheonethatsatisfiesthestronger‘∣\epsilon _2$|-universal’ and VI-IND property. This transformation is realized by a randomness extractor based on the 4-wise hash function. We demonstrate that our generic construction can produce CCA-secure IBE schemes whose efficiency is comparable with the most efficient but non-generic CCA-secure IBE schemes without random oracles in the literature.