Revocable hierarchical identity-based encryption over lattice for pay-TV systems Online publication date: Sun, 27-Aug-2017
by Leyou Zhang; Zongchen Sun; Yi Mu; Yupu Hu
International Journal of Embedded Systems (IJES), Vol. 9, No. 4, 2017
Abstract: In case the subscriber's certificate may be expired or revealed, a revocable mechanism is needed in a dynamic pay-TV system. Considering the hierarchical structure in this system, a revocable hierarchical identity-based encryption (RHIBE) scheme is a better choice than other schemes. But the well-known RHIBE schemes are constructed on the bilinear pairings. In this paper, two efficient and practical schemes are issued on lattice. Our first scheme is secure against adaptive identity-time attacks in the random oracle (RO) model and the second is against selective identity-time attacks in standard model. The security of both schemes is reduced to the learning with errors (LWE) assumption. In particular, the proposed scheme's basis delegation algorithms are run in the fixed dimension and the ciphertexts are shorter than existing schemes. Both schemes are much more efficient than the known works in terms of computation cost and storage cost.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Embedded Systems (IJES):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook