The full text of this article


Anonymous multi-receiver broadcast encryption scheme with strong security
by Jianhong Zhang; Jian Mao
International Journal of Embedded Systems (IJES), Vol. 9, No. 2, 2017


Abstract: Anonymity is an important way to achieve the privacy protection of identity. Recently, to protect the identities of the receivers, many anonymous multi-receiver ID-based broadcast encryption schemes have been proposed. However, most of existing schemes are shown to not be able to protect the privacy of the receivers, and their schemes are only proven to have IND-sMID-CCA security and ANON-sID-CCA security. To achieve anonymity of the receivers' identities and stronger security proof, in this paper, we first redefine the security notion of the receiver anonymity and make that the definition is stronger than the definition of previous receiver anonymity. Then we propose a novel anonymous multi-receiver ID-based broadcast encryption scheme, and show that our scheme is proven to be secure against the IND-MID-CCA attacks and ANON-ID-CCA attacks in the random oracle model, our security model is stronger than the selective identity attack model on which most of existing schemes are based. Finally, we analyse the performance of our scheme by comparing with four other schemes, the result shows that our scheme is the most efficient one.

Online publication date: Fri, 07-Apr-2017


is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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:


    Username:        Password:         

Forgotten your 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