Efficient identity-based broadcast encryption without random oracles.
Official URL: http://ojs.academypublisher.com/index.php/jcp/arti...
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.
|Research Areas:||A. > School of Science and Technology > Computer and Communications Engineering|
A. > School of Science and Technology > Computer Science > Artificial Intelligence group
|Notes on copyright:||With thanks to Academy for permitting the archival of the published version.|
|Deposited On:||26 Apr 2011 16:26|
|Last Modified:||03 May 2015 11:42|
Repository staff only: item control page
Full text downloads (NB count will be zero if no full text documents are attached to the record)
Downloads per month over the past year