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

Identity-Based Encryption with (Almost) Tight Security in the Multi-instance, Multi-ciphertext Setting

Dennis Hofheinz, Jessica Koch, Christoph Striecks

Published Jan 1, 2015• 63 citations
Publisher
DOI
10.1007/978-3-662-46447-2_36

Related papers

Almost Tight Multi-Instance Multi-Ciphertext Identity-Based Encryption on Lattices

Xavier Boyen, Qinyi Li

Lecture notes in computer science•Jan 1, 2018•4 citations

Identity-Based Encryption Tightly Secure Under Chosen-Ciphertext Attacks

Dennis Hofheinz, Dingding Jia, Jiaxin Pan

Lecture notes in computer science•Jan 1, 2018•35 citations

New chosen-ciphertext secure identity-based encryption with tight security reduction to the bilinear Diffie–Hellman problem

Jong Hwan Park, Kwangsu Lee, Dong Hoon Lee

Information Sciences•Jul 13, 2015•8 citations

Chosen Ciphertext Security for Blind Identity-Based Encryption with Certified Identities

Sohto Chiku, Keisuke Hara, Junji Shikata

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

Identity-Based Encryption with (Almost) Tight Security in the Multi-instance, Multi-ciphertext Setting

Dennis Hofheinz, Jessica Koch, Christoph Striecks

Abstract We construct an identity-based encryption (IBE) scheme that is tightly secure in a very strong sense. Specifically, we consider a setting with many instances of the scheme and many encryptions per instance. In this setting, we reduce the security of our scheme to a variant of a simple assumption used for a similar purpose by Chen and Wee (CRYPTO 2013, Springer, 2013). The security loss of our reduction is $$\textbf{O} (k)$$ O(k) (where $$k $$ k is the security parameter). Our scheme is the first IBE scheme to achieve this strong flavor of tightness under a simple assumption. Technically, our scheme is a variation of the IBE scheme by Chen and Wee. However, in order to “lift” their results to the multi-instance, multi-ciphertext case, we need to develop new ideas. In particular, while we build on (and extend) their high-level proof strategy, we deviate significantly in the low-level proof steps.

Journal of Cryptology•Feb 29, 2024•4 citations

A Framework for Identity-Based Encryption with Almost Tight Security

Nuttapong Attrapadung, Goichiro Hanaoka, Shota Yamada

Lecture notes in computer science•Jan 1, 2015•59 citations
Abstract We construct an identity-based encryption (IBE) scheme that is tightly secure in a very strong sense. Specifically, we consider a setting with many instances of the scheme and many encryptions per instance. In this setting, we reduce the security of our scheme to a variant of a simple assumption used for a similar purpose by Chen and Wee (CRYPTO 2013, Springer, 2013). The security loss of our reduction is O(k)\textbf{O} (k)O(k) O(k) (where kk k k is the security parameter). Our scheme is the first IBE scheme to achieve this strong flavor of tightness under a simple assumption. Technically, our scheme is a variation of the IBE scheme by Chen and Wee. However, in order to “lift” their results to the multi-instance, multi-ciphertext case, we need to develop new ideas. In particular, while we build on (and extend) their high-level proof strategy, we deviate significantly in the low-level proof steps.