Efficient identity-based multicast scheme from bilinear pairing

Wang, L.; Wu, Chuan

doi:10.1049/ip-com:20045308

Cited by 22 publications

(15 citation statements)

References 5 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

“…1. As is shown, the proposed scheme requires the least communication overhead in contrast to the other pairing-based schemes [6,8] which require the communication cost in proportion to the number of group members or multicast data size; or the other subset-cover-based schemes CS, SD [3] which require the communication cost in proportion to the number of revoked group members.…”

Section: Performance Analysismentioning

confidence: 91%

“…As the ciphertext is a MAC of the message, any group members can forge the messages sent from a group controller pretending they are from the group controller. Lin et al [7] also found that [6] is not secure against the insider forgery attack.…”

Section: Related Workmentioning

confidence: 95%

“…An authenticated identity-based multicast scheme from bilinear pairing was proposed by Wang and Wu [6], where security is also provided. However, this scheme cannot guarantee the sender authentication as opposed to the authors' claim.…”

Section: Related Workmentioning

confidence: 99%

“…[6] n φ + n 1 + m 2(C 2 + Cê + D) C 1 + C 2 + Cê + 2E n φ + n 1 2n 1 Mu's [8] (N + 2)n 1 + n id (N + 1) -R: the number of revoked members.…”

Section: Performance Analysismentioning

confidence: 99%

See 2 more Smart Citations

Chosen ciphertext secure authenticated group communication using identity-based signcryption

Hur

Park

Yoon

2010

Computers & Mathematics with Applications

View full text Add to dashboard Cite

a b s t r a c tEfficient access control with scalable rekeying is one of the most important requirements for secure group communications, especially in a dynamic and large group. In a many-tomany group communication environment, sender authentication is also another important security requirement as each participant can potentially be both a sender and a receiver. In this study, we propose an authenticated group communication scheme which is secure against an adaptive chosen ciphertext attack using identity-based signcryption. The proposed scheme allows multiple senders to dynamically multicast messages into an arbitrary group of receivers determined by the senders. In the proposed scheme, the group member can be a stateless receiver. Data confidentiality of the group communication is guaranteed as well as the sender authentication.

show abstract

Grand Jury

Toprani¹

2013

The Encyclopedia of Criminology and Criminal Justice

View full text Add to dashboard Cite

The grand jury is a body of not less than 12 and not more than 23 persons (in US federal courts) selected, organized, sworn to oath, and charged by the court to inquire into criminal offenses and matters of social importance in its jurisdiction, that operates in secrecy and is supervised by a judge. Grand juries are also empowered to indict or otherwise approve indictments charging individuals with criminal offenses.

show abstract

Efficient identity-based multicast scheme from bilinear pairing

Cited by 22 publications

References 5 publications

Privacy‐preserving multireceiver ID‐based encryption with provable security

Privacy‐preserving multireceiver ID‐based encryption with provable security

Chosen ciphertext secure authenticated group communication using identity-based signcryption

Grand Jury

Contact Info

Product

Resources

About