Efficient identity-based broadcast encryption without random oracles.

Hu, Liang, Liu, Zheli and Cheng, Xiaochun ORCID logoORCID: https://orcid.org/0000-0003-0371-9646 (2010) Efficient identity-based broadcast encryption without random oracles. Journal of Computers, 5 (3) . pp. 331-336. ISSN 1796-203X [Article]

[img]
Preview
PDF
Download (610kB) | Preview

Abstract

We propose a new efficient identity-based broadcast encryption scheme without random oracles and prove that it achieves selective identity, chosen plaintext security. Our scheme is constructed based on bilinear Diffie-Hellman inversion assumption and it is a good efficient hybrid encryption scheme, which achieves O(1)-size ciphertexts, public parameters and constant size private keys. In our scheme, either ciphertexts or public parameters has no relation with the number of receivers, moreover, both the encryption and decryption only require one pairing computation. Compared with other identity-based broadcast encryption schemes, our scheme has comparable properties, but with a better efficiency.

Item Type: Article
Research Areas: A. > School of Science and Technology > Computer and Communications Engineering
A. > School of Science and Technology > Computer Science > Artificial Intelligence group
Item ID: 7774
Notes on copyright: With thanks to Academy for permitting the archival of the published version.
Useful Links:
Depositing User: Xiaochun Cheng
Date Deposited: 26 Apr 2011 16:26
Last Modified: 30 Nov 2022 01:03
URI: https://eprints.mdx.ac.uk/id/eprint/7774

Actions (login required)

View Item View Item

Statistics

Activity Overview
6 month trend
629Downloads
6 month trend
557Hits

Additional statistics are available via IRStats2.