A New ID-Based Broadcast Encryption Scheme

Yang, Chen; Cheng, Xiangguo; Ma, Wenping; Wang, Xinmei

doi:10.1007/11839569_47

Cited by 7 publications

(10 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Considering a situation where Boneh and Franklin's IBE scheme [14,15] is used for multiple receivers, when a sender would like to encrypt a message for t receivers, the sender must encrypt the message t times using Boneh and Franklin's IBE scheme. Afterward, many IBBE [25][26][27][28][29][30] and MIBE [31][32][33] have been proposed to improve the performance problem of encryption for multiple receivers. Afterward, many IBBE [25][26][27][28][29][30] and MIBE [31][32][33] have been proposed to improve the performance problem of encryption for multiple receivers.…”

Section: Related Workmentioning

confidence: 99%

Privacy‐preserving multireceiver ID‐based encryption with provable security

Tseng

Huang

Hui-ju

2012

Int J Communication

View full text Add to dashboard Cite

Multireceiver identity (ID) based encryption and ID-based broadcast encryption allow a sender to use the public identities of multiple receivers to encrypt messages so that only the selected receivers or a privileged set of users can decrypt the messages. It can be used for many practical applications such as digital content distribution, pay-per-view and multicast communication. For protecting the privacy of receivers or providing receiver anonymity, several privacy-preserving (or anonymous) multireceiver ID-based encryption and ID-based broadcast encryption schemes were recently proposed, in which receiver anonymity means that nobody (including any selected receiver), except the sender, knows who the other selected receivers are. However, security incompleteness or flaws were found in these schemes. In this paper, we propose a new privacy-preserving multireceiver ID-based encryption scheme with provable security. We formally prove that the proposed scheme is semantically secure for confidentiality and receiver anonymity. Compared with the previously proposed anonymous multireceiver ID-based encryption and ID-based broadcast encryption schemes, the proposed scheme has better performance and robust security.In the following, we redefine the security notions of receiver anonymity including ANON-IND-sID-CPA and ANON-IND-sID-CCA security games in [11] that take into consideration a multireceiver setting.

show abstract

Section: Related Workmentioning

confidence: 99%

Privacy‐preserving multireceiver ID‐based encryption with provable security

Tseng

Huang

Hui-ju

2012

Int J Communication

View full text Add to dashboard Cite

show abstract

“…Furthermore, for DVD technologies, the scheme should be dynamic because there is no possibility to recalculate headers of previously issued discs. Of all the schemes considered, only the private scheme from [3] has this property. Flexible access control (in multicast video on demand sys tems, electronic workflow systems, etc.…”

Section: Discussionmentioning

confidence: 99%

“…Another private scheme based on the inverse bilinear Diffie-Hellman problem is of interest due to the self sufficient protective strategy and the use of users identity data to generate their secret keys [3].…”

Section: Basic Schemesmentioning

confidence: 99%

Analysis of broadcast schemes that implement identity-based encryption algorithms

Kulakov

Aleksandrova

2015

Aut. Control Comp. Sci.

View full text Add to dashboard Cite

In the context of an unsecure transmission channel, identity based cryptography makes it possible to implement broadcast data transfer for a large number of recipients much more effective than classical public key cryptography. A comparative analysis of such schemes is carried out and rec ommendations on selecting a particular scheme based on the system requirements (whether it is a pub lic or private system, how often and how the group of recipients and security level changes, etc.) are provided.

show abstract

“…Here, we assume that the output of H i ( i = 0,1,2,3) is 160 bits and the output of symmetric encryption (i.e., AES) is 128 bits. In Table , we have illustrated the comparative result in terms of communication costs with the proposed scheme and the schemes proposed in . In our scheme, the communication overhead is ( t + 2) × 160 + 128 bits because of the ciphertext 〈 c , ξ , δ , γ 〉, where c = ( c 0 , c 1 ,⋯, c t − 1 ).…”

Section: Performance Analysis Of the Proposed Pairing And Mtp Hash‐fumentioning

confidence: 99%

“…In 2006, Yang et al . proposed another IBBE scheme using elliptic curve bilinear pairing. It is to be noted that the scheme of Yang et al is unsuitable for a dynamic group because member joining and leaving have not been considered in the design process.…”

Section: Introductionmentioning

confidence: 99%

Anonymous and provably secure certificateless multireceiver encryption without bilinear pairing

Islam

Khan

Al-Khouri³

2014

Security Comm. Networks

View full text Add to dashboard Cite

Recently, numerous multireceiver identity-based encryption or identity-based broadcast encryption schemes have been introduced with bilinear pairing and probabilistic map-to-point (MTP) function. As the bilinear pairing and MTP functions are expensive operations, any cryptographic schemes based on these operations experience high computational burden. The certificateless public key cryptography sidesteps the private key escrow problem occurring in identity-based cryptosystem and certificate management troubles of certificate authority-based public key cryptography (CA-PKC). We observed that certificateless multireceiver encryption (CL-MRE) scheme without pairing and MTP hash function has not yet been considered in the literature. In this paper, we proposed a bilinear pairing and MTP hash-function-free CL-MRE scheme with chosen ciphertext attack resilience. The detailed analyses provide evidence that our scheme achieves forward secrecy, backward secrecy, and low computation costs than others. The scheme also provides confidentiality of the message and receiver anonymity in the random oracle model with the hardness of computational Diffie-Hellman problem.

show abstract

A New ID-Based Broadcast Encryption Scheme

Cited by 7 publications

References 8 publications

Privacy‐preserving multireceiver ID‐based encryption with provable security

Privacy‐preserving multireceiver ID‐based encryption with provable security

Analysis of broadcast schemes that implement identity-based encryption algorithms

Anonymous and provably secure certificateless multireceiver encryption without bilinear pairing

Contact Info

Product

Resources

About