Detailed Information

Cited 0 time in webofscience Cited 0 time in scopus
Metadata Downloads

Public key broadcast encryption schemes with shorter transmissions

Authors
Park, Jong HwanKim, Hee JeanSung, Maeng HeeLee, Dong Hoon
Issue Date
9월-2008
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Keywords
bilinear pairings; broadcast encryption; copyright protection; key distribution; strong Diffie-Hellman tuples
Citation
IEEE TRANSACTIONS ON BROADCASTING, v.54, no.3, pp.401 - 411
Indexed
SCIE
SCOPUS
Journal Title
IEEE TRANSACTIONS ON BROADCASTING
Volume
54
Number
3
Start Page
401
End Page
411
URI
https://scholar.korea.ac.kr/handle/2021.sw.korea/122821
DOI
10.1109/TBC.2008.919940
ISSN
0018-9316
Abstract
Broadcast encryption allows a sender to securely distribute messages to a dynamically changing set of users over an insecure channel. In a public key broadcast encryption (PKBE) scheme, this encryption is performed in the public key setting, where the public key is stored in a user's device, or directly transmitted to the receivers along with ciphertexts. In this paper, we propose two PKBE schemes for stateless receivers which are transmission-efficient. A distinctive feature in our first construction is that, different than existing schemes in the literature, only a fraction of the public key related to the set of intended receivers is required in the decryption process. This feature results in the first PKBE scheme with O(r) transmission cost and O(1) user storage cost for r revoked users. Our second construction is a generalized version of the first one providing a tradeoff between ciphertext size and public key size. With appropriate parametrization, we obtain a PKBE scheme with O(root n) transmission cost and O(1) user storage cost for any large set of n users. The transmission cost of our second scheme is at least 30\% less than that of the recent result of Boneh et al.'s PKBE scheme, which is considered as being the current state-of-the-art. By combining the two proposed schemes, we suggest a PKBE scheme that achieves further shortened transmissions, while still maintaining O(1) user storage cost. The proposed schemes are secure against any number of colluders and do not require costly re-keying procedures followed by revocation of users.
Files in This Item
There are no files associated with this item.
Appears in
Collections
School of Cyber Security > Department of Information Security > 1. Journal Articles

qrcode

Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.

Related Researcher

Researcher Lee, Dong Hoon photo

Lee, Dong Hoon
정보보호학과
Read more

Altmetrics

Total Views & Downloads

BROWSE