[go: up one dir, main page]

What a lovely hat

Is it made out of tin foil?

Paper 2007/217

Identity-Based Broadcast Encryption

Ryuichi Sakai and Jun Furukawa

Abstract

Broadcast encryption schemes enable senders to efficiently broadcast ciphertexts to a large set of receivers in a way that only non-revoked receivers can decrypt them. Identity-based encryption schemes are public key encryption schemes that can use arbitrary strings as public keys. We propose the first public key broadcast encryption scheme that can use any string as a public key of each receiver. That is, identity-based broadcast encryption scheme. Our scheme has many desirable properties. The scheme is fully collusion resistant, and the size of ciphertexts and that of private key are small constants. The size of public key is proportional to only the maximum number of receiver sets to each of which the ciphertext is sent. Note that its size remains to be so although the number of potential receivers is super-polynomial size. Besides these properties, the achieving the first practical identity-based broadcast encryption scheme itself is the most interesting point of this paper. The security of our scheme is proved in the generic bilinear group model.

Metadata
Available format(s)
PDF PS
Category
Public-key cryptography
Publication info
Published elsewhere. Unknown where it was published
Keywords
broadcast encryptionID based encryptionbilinear maprevocation
Contact author(s)
sakai @ isc osakac ac jp
History
2007-06-13: revised
2007-06-08: received
See all versions
Short URL
https://ia.cr/2007/217
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2007/217,
      author = {Ryuichi Sakai and Jun Furukawa},
      title = {Identity-Based Broadcast Encryption},
      howpublished = {Cryptology {ePrint} Archive, Paper 2007/217},
      year = {2007},
      url = {https://eprint.iacr.org/2007/217}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.