Book chapter
Complete robustness in Identity-Based encryption
Provable Security, Vol.8782, pp.342-349
Springer
2014
Abstract
Complete robustness (CROB) was proposed to guarantee that for a public key encryption scheme, decryption attempts will fail with high probability if the wrong decryption key is used to decrypt a ciphertext, even if the keys are maliciously generated by the adversary. In this paper, we extend the notion of complete robustness to the identity-based setting. We firstly formalize the CROB for identity-based encryption, and present a generic construction achieving CROB from an arbitrary identity-based encryption scheme. After that, we investigate whether there exist some kind of relations between CROB and related-key attack (RKA) security for the case of identity-based encryption. We conclude that these two notions (CROB and RKA security) are separable for identity-based encryption, but with a slight modification to our generic construction, an identity-based encryption scheme offering complete robustness with security against related-key attacks can be constructed from any identity-based encryption scheme.
Details
- Title
- Complete robustness in Identity-Based encryption
- Authors/Creators
- H. Cui (Author/Creator)Y. Mu (Author/Creator)M.H. Au (Author/Creator)
- Contributors
- S.S.M. Chow (Editor)J.K. Lui (Editor)L.C.K. Hui (Editor)S.M. Yiu (Editor)
- Publication Details
- Provable Security, Vol.8782, pp.342-349
- Publisher
- Springer
- Identifiers
- 991005541159007891
- Copyright
- © 2014 International Publishing Switzerland
- Murdoch Affiliation
- Murdoch University
- Language
- English
- Resource Type
- Book chapter
- Additional Information
- Series title: Lecture Notes in Computer Science; Vol. 8782
Metrics
30 Record Views