Efficient and adaptively secure broadcast encryption systems

Mingwu Zhang, Bo Yang, Zhenhua Chen, Tsuyoshi Takagi

Research output: Contribution to journalArticle

9 Citations (Scopus)

Abstract

Broadcast encryption is an effective way to broadcast a message securely such that more than one privileged receiver can decrypt it. The well-known constructions of identity-based broadcast encryption only support bounded broadcast users that had to deploy the maximum user number in advance. This is somewhat inefficient and impractical if the broadcast user number is predetermined. In this paper, we propose an adaptively secure identity-based broadcast encryption in the standard model that supports arbitrary number of users in broadcast set, which eliminates the size of public parameters with a constant number of group elements O1 and obtain short ciphertexts, secret keys, and public parameters. We use the techniques of semi-functional ciphertexts and semi-functional keys in orthogonal subgroups to implement the boundless broadcast set and adaptive security by means of dual-system encryption mechanism in a composite-order group, and we prove the scheme to be fully secure without the random oracles in the static assumptions. The proposed scheme captures the properties of confidentiality, adaptive security, constant key, and short ciphertext. We also evaluate the computational costs and communication overheads and give the deployment in secure set-top box broadcast systems.

Original languageEnglish
Pages (from-to)1044-1052
Number of pages9
JournalSecurity and Communication Networks
Volume6
Issue number8
DOIs
Publication statusPublished - Jan 1 2013

Fingerprint

Cryptography
Computer systems
Set-top boxes
Communication
Composite materials
Costs

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Networks and Communications

Cite this

Efficient and adaptively secure broadcast encryption systems. / Zhang, Mingwu; Yang, Bo; Chen, Zhenhua; Takagi, Tsuyoshi.

In: Security and Communication Networks, Vol. 6, No. 8, 01.01.2013, p. 1044-1052.

Research output: Contribution to journalArticle

Zhang, Mingwu ; Yang, Bo ; Chen, Zhenhua ; Takagi, Tsuyoshi. / Efficient and adaptively secure broadcast encryption systems. In: Security and Communication Networks. 2013 ; Vol. 6, No. 8. pp. 1044-1052.
@article{bcecbe7fd5644849aef0bcd31fdc3c28,
title = "Efficient and adaptively secure broadcast encryption systems",
abstract = "Broadcast encryption is an effective way to broadcast a message securely such that more than one privileged receiver can decrypt it. The well-known constructions of identity-based broadcast encryption only support bounded broadcast users that had to deploy the maximum user number in advance. This is somewhat inefficient and impractical if the broadcast user number is predetermined. In this paper, we propose an adaptively secure identity-based broadcast encryption in the standard model that supports arbitrary number of users in broadcast set, which eliminates the size of public parameters with a constant number of group elements O1 and obtain short ciphertexts, secret keys, and public parameters. We use the techniques of semi-functional ciphertexts and semi-functional keys in orthogonal subgroups to implement the boundless broadcast set and adaptive security by means of dual-system encryption mechanism in a composite-order group, and we prove the scheme to be fully secure without the random oracles in the static assumptions. The proposed scheme captures the properties of confidentiality, adaptive security, constant key, and short ciphertext. We also evaluate the computational costs and communication overheads and give the deployment in secure set-top box broadcast systems.",
author = "Mingwu Zhang and Bo Yang and Zhenhua Chen and Tsuyoshi Takagi",
year = "2013",
month = "1",
day = "1",
doi = "10.1002/sec.678",
language = "English",
volume = "6",
pages = "1044--1052",
journal = "Security and Communication Networks",
issn = "1939-0122",
publisher = "John Wiley and Sons Inc.",
number = "8",

}

TY - JOUR

T1 - Efficient and adaptively secure broadcast encryption systems

AU - Zhang, Mingwu

AU - Yang, Bo

AU - Chen, Zhenhua

AU - Takagi, Tsuyoshi

PY - 2013/1/1

Y1 - 2013/1/1

N2 - Broadcast encryption is an effective way to broadcast a message securely such that more than one privileged receiver can decrypt it. The well-known constructions of identity-based broadcast encryption only support bounded broadcast users that had to deploy the maximum user number in advance. This is somewhat inefficient and impractical if the broadcast user number is predetermined. In this paper, we propose an adaptively secure identity-based broadcast encryption in the standard model that supports arbitrary number of users in broadcast set, which eliminates the size of public parameters with a constant number of group elements O1 and obtain short ciphertexts, secret keys, and public parameters. We use the techniques of semi-functional ciphertexts and semi-functional keys in orthogonal subgroups to implement the boundless broadcast set and adaptive security by means of dual-system encryption mechanism in a composite-order group, and we prove the scheme to be fully secure without the random oracles in the static assumptions. The proposed scheme captures the properties of confidentiality, adaptive security, constant key, and short ciphertext. We also evaluate the computational costs and communication overheads and give the deployment in secure set-top box broadcast systems.

AB - Broadcast encryption is an effective way to broadcast a message securely such that more than one privileged receiver can decrypt it. The well-known constructions of identity-based broadcast encryption only support bounded broadcast users that had to deploy the maximum user number in advance. This is somewhat inefficient and impractical if the broadcast user number is predetermined. In this paper, we propose an adaptively secure identity-based broadcast encryption in the standard model that supports arbitrary number of users in broadcast set, which eliminates the size of public parameters with a constant number of group elements O1 and obtain short ciphertexts, secret keys, and public parameters. We use the techniques of semi-functional ciphertexts and semi-functional keys in orthogonal subgroups to implement the boundless broadcast set and adaptive security by means of dual-system encryption mechanism in a composite-order group, and we prove the scheme to be fully secure without the random oracles in the static assumptions. The proposed scheme captures the properties of confidentiality, adaptive security, constant key, and short ciphertext. We also evaluate the computational costs and communication overheads and give the deployment in secure set-top box broadcast systems.

UR - http://www.scopus.com/inward/record.url?scp=84880292433&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84880292433&partnerID=8YFLogxK

U2 - 10.1002/sec.678

DO - 10.1002/sec.678

M3 - Article

AN - SCOPUS:84880292433

VL - 6

SP - 1044

EP - 1052

JO - Security and Communication Networks

JF - Security and Communication Networks

SN - 1939-0122

IS - 8

ER -