EconPapers    
Economics at your fingertips  
 

Efficient Anonymous Identity-Based Broadcast Encryption without Random Oracles

Xie Li and Ren Yanli
Additional contact information
Xie Li: School of Communication and Information Engineering, Shanghai University, Shanghai, China
Ren Yanli: School of Communication and Information Engineering, Shanghai University, Shanghai, China

International Journal of Digital Crime and Forensics (IJDCF), 2014, vol. 6, issue 2, 40-51

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.

Date: 2014
References: Add references at CitEc
Citations: Track citations by RSS feed

Downloads: (external link)
http://services.igi-global.com/resolvedoi/resolve. ... 018/ijdcf.2014040103 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:igg:jdcf00:v:6:y:2014:i:2:p:40-51

Access Statistics for this article

More articles in International Journal of Digital Crime and Forensics (IJDCF) from IGI Global
Bibliographic data for series maintained by Journal Editor ().

 
Page updated 2019-11-24
Handle: RePEc:igg:jdcf00:v:6:y:2014:i:2:p:40-51