Abstract
This paper presents a novel framework for generic construction of hybrid encryption schemes secure against chosen ciphertext attack. Our new framework yields new and more efficient CCA-secure schemes, and provides insightful explanations about existing schemes that do not fit into the previous frameworks. This could result in finding future improvements. Moreover, it allows immediate conversion from a class of threshold public-key encryption to a hybrid one without considerable overhead, which is not possible in the previous approaches. Finally we present an improved security proof of the Kurosawa-Desmedt scheme, which removes the original need for information-theoretic key derivation and message authentication functions. We show that the scheme can be instantiated with any computationally secure such functions, thus extending the applicability of their paradigm, and improving its efficiency.
Original language | English (US) |
---|---|
Pages (from-to) | 128-146 |
Number of pages | 19 |
Journal | Lecture Notes in Computer Science |
Volume | 3494 |
DOIs | |
State | Published - 2005 |
Event | 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology - EUROCRYPT 2005 - Aarhus, Denmark Duration: May 22 2005 → May 26 2005 |
ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science