You are looking at a specific version 20080307:050936 of this paper. See the latest version.

Paper 2006/362

Construction of a Hybrid (Hierarchical) Identity-Based Encryption Protocol Secure Against Adaptive Attacks

Palash Sarkar and Sanjit Chatterjee

Abstract

The current work considers the problem of obtaining a hierarchical identity-based encryption (HIBE) protocol which is secure against adaptive key extraction and decryption queries. Such a protocol is obtained by modifying an earlier protocol by Chatterjee and Sarkar (which, in turn, is based on a protocol due to Waters) which is secure only against adaptive key extraction queries. The setting is quite general in the sense that random oracles are not used and security is based on the hardness of the decisional bilinear Diffie-Hellman (DBDH) problem. In this setting, the new construction provides the most efficient (H)IBE protocol known till date. The technique for answering decryption queries in the proof is based on earlier work by Boyen, Mei and Waters. Ciphertext validity testing is done indirectly through a symmetric authentication algorithm in a manner similar to the Kurosawa-Desmedt public key encryption protocol. Additionally, we perform symmetric encryption and authentication by a single authenticated encryption algorithm.

Note: Corrects a few errors in the previous version and discusses the relation of the construction to some work appearing after the last posting.

Metadata
Available format(s)
PDF PS
Publication info
Published elsewhere. An abridged version of this paper has appeared in the proceedings of ProvSec 2007
Keywords
Hierarchical Identity based encryptionCCA-securitypairing
Contact author(s)
palash @ isical ac in
History
2008-03-07: last of 4 revisions
2006-10-25: received
See all versions
Short URL
https://ia.cr/2006/362
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.