Adaptively secure broadcast encryption under standard assumptions with better efficiency

Kwangsu Lee, Dong Hoon Lee

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

In this study, the authors present an efficient public-key broadcast encryption (PKBE) scheme with sub-linear size of public keys, private keys and ciphertexts and prove its adaptive security under standard assumptions. Compared with the currently best scheme of Garg et al. (CCS 2010) that provides adaptive security under standard assumptions and sub-linear size of various parameters, the ciphertext size of the author's scheme is 94% shorter and the encryption algorithm of their scheme is also 2.8 times faster than the scheme of Garg et al. To achieve their scheme, they adapt the dual system encryption technique of Waters. However, there is a challenging problem to use this technique for the construction of PKBE with sub-linear size of ciphertexts such as a tag compression problem. To overcome this problem, they first devise a novel tag update technique for broadcast encryption. Using this technique, they build an efficient PKBE scheme in symmetric bilinear groups, and prove its adaptive security under standard assumptions.

Original languageEnglish
Pages (from-to)149-157
Number of pages9
JournalIET Information Security
Volume9
Issue number3
DOIs
Publication statusPublished - 2015 May 1

Fingerprint

Cryptography
Water

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems
  • Software

Cite this

Adaptively secure broadcast encryption under standard assumptions with better efficiency. / Lee, Kwangsu; Lee, Dong Hoon.

In: IET Information Security, Vol. 9, No. 3, 01.05.2015, p. 149-157.

Research output: Contribution to journalArticle

@article{15c780cd744242f39aed1a1622a02b7a,
title = "Adaptively secure broadcast encryption under standard assumptions with better efficiency",
abstract = "In this study, the authors present an efficient public-key broadcast encryption (PKBE) scheme with sub-linear size of public keys, private keys and ciphertexts and prove its adaptive security under standard assumptions. Compared with the currently best scheme of Garg et al. (CCS 2010) that provides adaptive security under standard assumptions and sub-linear size of various parameters, the ciphertext size of the author's scheme is 94{\%} shorter and the encryption algorithm of their scheme is also 2.8 times faster than the scheme of Garg et al. To achieve their scheme, they adapt the dual system encryption technique of Waters. However, there is a challenging problem to use this technique for the construction of PKBE with sub-linear size of ciphertexts such as a tag compression problem. To overcome this problem, they first devise a novel tag update technique for broadcast encryption. Using this technique, they build an efficient PKBE scheme in symmetric bilinear groups, and prove its adaptive security under standard assumptions.",
author = "Kwangsu Lee and Lee, {Dong Hoon}",
year = "2015",
month = "5",
day = "1",
doi = "10.1049/iet-ifs.2014.0102",
language = "English",
volume = "9",
pages = "149--157",
journal = "IET Information Security",
issn = "1751-8709",
publisher = "Institution of Engineering and Technology",
number = "3",

}

TY - JOUR

T1 - Adaptively secure broadcast encryption under standard assumptions with better efficiency

AU - Lee, Kwangsu

AU - Lee, Dong Hoon

PY - 2015/5/1

Y1 - 2015/5/1

N2 - In this study, the authors present an efficient public-key broadcast encryption (PKBE) scheme with sub-linear size of public keys, private keys and ciphertexts and prove its adaptive security under standard assumptions. Compared with the currently best scheme of Garg et al. (CCS 2010) that provides adaptive security under standard assumptions and sub-linear size of various parameters, the ciphertext size of the author's scheme is 94% shorter and the encryption algorithm of their scheme is also 2.8 times faster than the scheme of Garg et al. To achieve their scheme, they adapt the dual system encryption technique of Waters. However, there is a challenging problem to use this technique for the construction of PKBE with sub-linear size of ciphertexts such as a tag compression problem. To overcome this problem, they first devise a novel tag update technique for broadcast encryption. Using this technique, they build an efficient PKBE scheme in symmetric bilinear groups, and prove its adaptive security under standard assumptions.

AB - In this study, the authors present an efficient public-key broadcast encryption (PKBE) scheme with sub-linear size of public keys, private keys and ciphertexts and prove its adaptive security under standard assumptions. Compared with the currently best scheme of Garg et al. (CCS 2010) that provides adaptive security under standard assumptions and sub-linear size of various parameters, the ciphertext size of the author's scheme is 94% shorter and the encryption algorithm of their scheme is also 2.8 times faster than the scheme of Garg et al. To achieve their scheme, they adapt the dual system encryption technique of Waters. However, there is a challenging problem to use this technique for the construction of PKBE with sub-linear size of ciphertexts such as a tag compression problem. To overcome this problem, they first devise a novel tag update technique for broadcast encryption. Using this technique, they build an efficient PKBE scheme in symmetric bilinear groups, and prove its adaptive security under standard assumptions.

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

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

U2 - 10.1049/iet-ifs.2014.0102

DO - 10.1049/iet-ifs.2014.0102

M3 - Article

VL - 9

SP - 149

EP - 157

JO - IET Information Security

JF - IET Information Security

SN - 1751-8709

IS - 3

ER -