Cryptology ePrint Archive: Report 2013/488

Adaptively Secure Broadcast Encryption under Standard Assumptions with Better Efficiency

Kwangsu Lee and Dong Hoon Lee

Abstract: In this paper, we 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 {\it et al.} (CCS 2010) that provides adaptive security under standard assumptions and sub-linear size of various parameters, the ciphertext size of our scheme is $94\%$ shorter and the encryption algorithm of our scheme is also $2.8$ times faster than the scheme of Garg {\it et al.}

To achieve our scheme, we 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, we first devise a novel tag update technique for broadcast encryption. Using this technique, we build an efficient PKBE scheme in symmetric bilinear groups, and prove its adaptive security under standard assumptions. After that, we build another PKBE scheme in asymmetric bilinear groups and also prove its adaptive security under simple assumptions.

Category / Keywords: public-key cryptography / Public-key encryption, Broadcast encryption, Adaptive security, Standard assumption, Bilinear maps

Date: received 12 Aug 2013, last revised 20 Jul 2014

Contact author: guspin at korea ac kr

Available format(s): PDF | BibTeX Citation

Version: 20140721:022517 (All versions of this report)

Short URL: ia.cr/2013/488

Discussion forum: Show discussion | Start new discussion