ID-based Encryption for Directed Acyclic Graph Hierarchies and Applications to Key-evolving Encryption Primitives

概要

論文の詳細を見る
PrimitivesWe propose a new cryptographic primitive called directed acyclic graph encryption (DAGE). It generalizes hierarchical identity-based encryption (HIBE) schemes, which dealt only with tree hierarchies of identities, to more complex ones namely directed acyclic graph (DAG) hierarchies. We provide a unified security notion for arbitrary DAGs. It turns out that we can cast any key-evolving encryption primitives as DAGE (varied by the underlying DAGs), thus the security notion unifies the notions of these primitives. This helps us relating and understanding more about them. As examples, two new applications are then described, namely public-key broadcast encryption (PK-BE) for general structure and forward-secure DAGE which also includes forward-secure HIBE and PK-BE as special cases. Finally, a secure concrete construction of DAGE for arbitrary DAG is then realized. This automatically gives implementations of any primitives casted as DAGE.
社団法人電子情報通信学会の論文
2004-09-10