A new ID-based broadcast encryption scheme

Authors:
Chen Yang;Xiangguo Cheng;Wenping Ma;Xinmei Wang
Affiliations:
Ministry of Education Key Lab. of Computer Networks and Information Security, Xidian University, Xi’an, China;Ministry of Education Key Lab. of Computer Networks and Information Security, Xidian University, Xi’an, China;Ministry of Education Key Lab. of Computer Networks and Information Security, Xidian University, Xi’an, China;Ministry of Education Key Lab. of Computer Networks and Information Security, Xidian University, Xi’an, China
Venue:
ATC'06 Proceedings of the Third international conference on Autonomic and Trusted Computing
Year:
2006

Citing 7
Cited 0

Broadcast encryption

CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Digital signets: self-enforcing protection of digital information (preliminary version)

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Key Preassigned Traceability Schemes for Broadcast Encryption

SAC '98 Proceedings of the Selected Areas in Cryptography
The LSD Broadcast Encryption Scheme

CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Short Signatures from the Weil Pairing

ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
How to broadcast a secret

EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Fault tolerant and distributed broadcast encryption

CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a new efficient identity-based broadcast encryption scheme using bilinear mapping. Both private-key storage for one authorized user (only two group elements) and communication transmission bandwidth (three group elements) in our scheme are of constant size regardless of the number of colluders. In terms of efficiency and security, our scheme is very efficient with lower encryption and decryption computational cost and more secure against k number of colluders by introducing self-enforcing protection strategy.