@inproceedings{4fafa7a968bd4acbbec2b977e05d0500,
title = "How to design space efficient revocable IBE from non-monotonic ABE",
abstract = "Since there always exists a possibility that some users' private keys are stolen or expired in practice, it is important for identity based encryption (IBE) system to provide a solution to revocation. The current most efficient revocable IBE system has a private key of size O(log n) and update information of size O(r log( n/r )) where r is the number of revoked users. In this paper, we present a new revocable IBE system in which the private key only contains two group elements and the update information size is O(r). We show that the proposed constructions for the revocation mechanism are more efficient in terms of space cost and provide a generic methodology to transform a non-monotonic attribute based encryption into a revocable IBE. We also demonstrate how the proposed method can be employed to develop an efficient hierarchical revocable IBE system.",
keywords = "Attribute based encryption (ABE), Non-monotonic, Revocable IBE",
author = "Huang Lin and Zhenfu Cao and Yuguang Fang and Muxin Zhou and Haojin Zhu",
year = "2011",
doi = "10.1145/1966913.1966963",
language = "英语",
isbn = "9781450305648",
series = "Proceedings of the 6th International Symposium on Information, Computer and Communications Security, ASIACCS 2011",
publisher = "Association for Computing Machinery",
pages = "381--385",
booktitle = "Proceedings of the 6th International Symposium on Information, Computer and Communications Security, ASIACCS 2011",
address = "美国",
note = "6th International Symposium on Information, Computer and Communications Security, ASIACCS 2011 ; Conference date: 22-03-2011 Through 24-03-2011",
}