Reference Hub16
Efficient Anonymous Identity-Based Broadcast Encryption without Random Oracles

Efficient Anonymous Identity-Based Broadcast Encryption without Random Oracles

Xie Li, Ren Yanli
Copyright: © 2014 |Volume: 6 |Issue: 2 |Pages: 12
ISSN: 1941-6210|EISSN: 1941-6229|EISBN13: 9781466653481|DOI: 10.4018/ijdcf.2014040103
Cite Article Cite Article

MLA

Li, Xie, and Ren Yanli. "Efficient Anonymous Identity-Based Broadcast Encryption without Random Oracles." IJDCF vol.6, no.2 2014: pp.40-51. http://doi.org/10.4018/ijdcf.2014040103

APA

Li, X. & Yanli, R. (2014). Efficient Anonymous Identity-Based Broadcast Encryption without Random Oracles. International Journal of Digital Crime and Forensics (IJDCF), 6(2), 40-51. http://doi.org/10.4018/ijdcf.2014040103

Chicago

Li, Xie, and Ren Yanli. "Efficient Anonymous Identity-Based Broadcast Encryption without Random Oracles," International Journal of Digital Crime and Forensics (IJDCF) 6, no.2: 40-51. http://doi.org/10.4018/ijdcf.2014040103

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Broadcast encryption provides a method of secure multi-receiver communications, where a broadcaster can encrypt a message for a set S of users who are listening to a broadcast channel. Most identity-based broadcast encryption (IBBE) schemes are not anonymous, which means the attacker can obtain the identities of all receivers from the ciphertext. In this paper, the authors propose an efficient anonymous IBBE scheme in bilinear groups of prime order, where any attacker cannot get the identities of the receivers from the ciphertext. The scheme has constant size ciphertext and achieves adaptive security based on the asymmetric decisional bilinear Diffie-Hellman Exponent (DBDHE) assumption without random oracles. The proposed scheme improves efficiency and security of anonymous IBBE schemes simultaneously.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.