Skip to main content
SpringerLink
Log in

Provable Secure Constructions for Broadcast Encryption with Personalized Messages

  • Conference paper
  • First Online:
Provable Security (ProvSec 2017)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 10592))

Included in the following conference series:

Abstract

Broadcast encryption is an efficient way to send the broadcast messages, but, it does not yield a productive way to send the personalized messages to individuals. A broadcast encryption with personalized messages (BEPM) skillfully sends the broadcast message to a group of users together with the personalized messages to individual users. This article identifies constructional flaws in the BEPM scheme of Xu et al. and designs three BEPM constructions, namely, BEPM-I, BEPM-II and BEPM-III. BEPM-I, BEPM-III are selectively secure. Unlike the existing similar works, these schemes eliminate the need of storing public key and secret key for transmitting personalized messages. We emphasize that BEPM-III employs multilinear maps and achieves logarithmic size public parameter with increasing computation cost. More positively, BEPM-II achieves adaptive security with the parameter size and computation cost as in the existing BEPM. All our constructions have constant communication cost and proven to be secure in the standard security model under reasonable assumptions in generic group model. Furthermore, our schemes are fully collision resistant and flexible for adding and removing of users from the broadcast system.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Acharya, K., Dutta, R.: Secure and efficient construction of broadcast encryption with dealership. In: Chen, L., Han, J. (eds.) ProvSec 2016. LNCS, vol. 10005, pp. 277–295. Springer, Cham (2016). doi:10.1007/978-3-319-47422-9_16

    Google Scholar 

  2. Acharya, K., Dutta, R.: Adaptively secure broadcast encryption with dealership. In: Hong, S., Park, J.H. (eds.) ICISC 2016. LNCS, vol. 10157, pp. 161–177. Springer, Cham (2017). doi:10.1007/978-3-319-53177-9_8

    Chapter  Google Scholar 

  3. Acharya, K., Dutta, R.: Adaptively secure recipient revocable broadcast encryption with constant size ciphertext. IACR Cryptology ePrint Archive, 2017:59 (2017)

    Google Scholar 

  4. Boneh, D., Gentry, C., Waters, B.: Collusion resistant broadcast encryption with short ciphertexts and private keys. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 258–275. Springer, Heidelberg (2005). doi:10.1007/11535218_16

    Chapter  Google Scholar 

  5. Boneh, D., Waters, B., Zhandry, M.: Low overhead broadcast encryption from multilinear maps. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8616, pp. 206–223. Springer, Heidelberg (2014). doi:10.1007/978-3-662-44371-2_12

    Chapter  Google Scholar 

  6. Fiat, A., Naor, M.: Broadcast encryption. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 480–491. Springer, Heidelberg (1994). doi:10.1007/3-540-48329-2_40

    Google Scholar 

  7. Gentry, C., Waters, B.: Adaptive security in broadcast encryption systems (with short ciphertexts). In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol. 5479, pp. 171–188. Springer, Heidelberg (2009). doi:10.1007/978-3-642-01001-9_10

    Chapter  Google Scholar 

  8. Hiwatari, H., Tanaka, K., Asano, T., Sakumoto, K.: Multi-recipient public-key encryption from simulators in security proofs. In: Boyd, C., González Nieto, J. (eds.) ACISP 2009. LNCS, vol. 5594, pp. 293–308. Springer, Heidelberg (2009). doi:10.1007/978-3-642-02620-1_21

    Chapter  Google Scholar 

  9. Kurosawa, K.: Multi-recipient public-key encryption with shortened ciphertext. In: Naccache, D., Paillier, P. (eds.) PKC 2002. LNCS, vol. 2274, pp. 48–63. Springer, Heidelberg (2002). doi:10.1007/3-540-45664-3_4

    Chapter  Google Scholar 

  10. Lewko, A., Sahai, A., Waters, B.: Revocation systems with very small private keys. In: IEEE Symposium on Security and Privacy (SP), pp. 273–285 (2010)

    Google Scholar 

  11. Ohtake, G., Hanaoka, G., Ogawa, K.: Efficient broadcast encryption with personalized messages. In: Heng, S.-H., Kurosawa, K. (eds.) ProvSec 2010. LNCS, vol. 6402, pp. 214–228. Springer, Heidelberg (2010). doi:10.1007/978-3-642-16280-0_15

    Chapter  Google Scholar 

  12. Phan, D.H., Pointcheval, D., Shahandashti, S., Strefler, M.: Adaptive CCA broadcast encryption with constant-size secret keys and ciphertexts. Int. J. Inf. Secur. 12(4), 251–265 (2013)

    Article  MATH  Google Scholar 

  13. Xu, K., Liao, Y., Qiao, L., Liu, Z., Yang, X.: An identity-based (IDB) broadcast encryption scheme with personalized messages (BEPM). PloS One 10(12), e0143975 (2015)

    Article  Google Scholar 

  14. Yang, Z.: On constructing practical multi-recipient keyencapsulation with short ciphertext and public key. Secur. Commun. Netw. 8(18), 4191–4202 (2015)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Indian Institute of Technology Kharagpur, Kharagpur, 721302, India

    Kamalesh Acharya & Ratna Dutta

Authors
  1. Kamalesh Acharya
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ratna Dutta
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kamalesh Acharya .

Editor information

Editors and Affiliations

  1. NTT Laboratories, Tokyo, Japan

    Tatsuaki Okamoto

  2. Shaanxi Normal University, Xi’an, China

    Yong Yu

  3. Hong Kong Polytechnic University, Hong Kong, China

    Man Ho Au

  4. University of Wollongong, Wollongong, New South Wales, Australia

    Yannan Li

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Acharya, K., Dutta, R. (2017). Provable Secure Constructions for Broadcast Encryption with Personalized Messages. In: Okamoto, T., Yu, Y., Au, M., Li, Y. (eds) Provable Security. ProvSec 2017. Lecture Notes in Computer Science(), vol 10592. Springer, Cham. https://doi.org/10.1007/978-3-319-68637-0_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-68637-0_20

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-68636-3

  • Online ISBN: 978-3-319-68637-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation