Skip to main content

A Novel Broadcast Encryption Based on Time-Bound Cryptographic Keys

  • Conference paper
Digital Rights Management. Technologies, Issues, Challenges and Systems (DRMTICS 2005)

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

Included in the following conference series:

Abstract

This paper proposes a novel broadcast encryption (BE) approach which combines the traditional one and time-bound cryptographic keys. The developed BE provides heavy reduced cumulative communication overhead and yields increased security. The reduction of the communication overhead is achieved via employment of time-bound session encrypting keys (TB-SEKs). The increased security against ciphertext only attack appears as a consequence of the reduced communication overhead and the increased security against the chosen-plaintext attack is obtained via employment of the time-bound key-encrypting keys (TB-KEKs). Appropriate methods for management of TB-SEKs and TB-KEKs are given. The proposed scheme is compared with traditional BE schemes and the advantages as well as the related trade-offs are pointed out.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Berkovits, S.: How to broadcast a secret. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 536–541. Springer, Heidelberg (1991)

    Google Scholar 

  2. Chien, H.-Y.: Efficient Time-Bound Hierarchical Key Assignment Scheme. IEEE Trans. Knowledge and Data Eng. 16, 1301–1304 (2004)

    Article  Google Scholar 

  3. Fiat, A., Naor, M.: Broadcast encryption. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 480–491. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  4. Halevy, D., Shamir, A.: The LCD broadcast encryption scheme. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 47–60. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  5. Jho, N., Hwang, J.Y., Cheon, J.H., Kim, M.-H., Lee, D.H., Yoo, E.S.: One-way chain based broadcast encryption scheme. In: Cramer, R.J.F. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 559–574. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  6. Kaji, Y., Nojima, R.: A Management Scheme for Time-Limited Cryptographic Keys. In: Ioannidis, J., Keromytis, A.D., Yung, M. (eds.) ACNS 2005. LNCS, vol. 3531, pp. 106–117. Springer, Heidelberg (2005)

    Google Scholar 

  7. Lotspiech, J., Nusser, S., Prestoni, F.: Broadcast encryption’s bright future. IEEE Computer 35, 57–63 (2002)

    Article  Google Scholar 

  8. Lotspiech, J., Nusser, S., Prestoni, F.: Anonymous trust: Digital rights management using broadcast encryption. Proc. IEEE 92, 898–909 (2004)

    Article  Google Scholar 

  9. Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press, Boca Roton (1997)

    MATH  Google Scholar 

  10. Mihaljević, M.J.: Key management schemes for stateless receivers based on time varying heterogeneous logical key hierarchy. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol. 2894, pp. 137–154. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  11. Mihaljević, M.J.: Reconfigurable key management for broadcast encryption. IEEE Communications Letters 8, 440–442 (2004)

    Article  Google Scholar 

  12. Mihaljević, M.J., Fossorier, M.P.C., Imai, H.: Secret-public storage trade-off for broadcast encryption key management. In: López, J., Qing, S., Okamoto, E. (eds.) ICICS 2004. LNCS, vol. 3269, pp. 375–387. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  13. Mihaljević, M.J., Fossorier, M.P.C., Imai, H.: Key management with minimized secret storage employing an erasure channel approach. IEEE Communications Letters 9(8), 741–743 (2005)

    Article  Google Scholar 

  14. Mihaljević, M.J., Fossorier, M.P.C., Imai, H.: Security weaknesses of certain broadcast encryption schemes. In: Safavi-Naini, R., Yung, M. (eds.) DRMTICS 2005. LNCS, vol. 3919, 18 pages. Springer, Heidelberg (2006)

    Google Scholar 

  15. Naor, D., Naor, M., Lotspiech, J.: Revocation and tracing schemes for stateless receivers. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 41–62. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  16. Naor, D., Naor, M.: Protecting cryptographic keys: The trace-and-revoke approach. IEEE Computer 36, 47–53 (2003)

    Article  Google Scholar 

  17. Tzeng, W.G.: A Time-Bound Cryptographic Key Assignment Scheme for Access Control in a Hierarchy. IEEE Trans. Knowledge and Data Eng. 14, 182–188 (2002)

    Article  Google Scholar 

  18. Yi, X., Ye, Y.: Security of Tzeng’s Time-Bound Key Assignment Scheme for Access Control in a Hierarchy. IEEE Trans. Knowledge and Data Eng. 15, 1054–1055 (2003)

    Article  Google Scholar 

  19. Yoshida, M., Kaji, Y., Fujiwara, T.: A Time-Limited Key Management Scheme Based on One-Way Permutation Tree. In: Proceedings HISC 2005 - 2005 Hawaii, IEICE and SITA Joint Conference on Information Theory, Hawaii, USA, May 2005, pp. 165–170 (2005) (ISBN 4-902087-13-8)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mihaljević, M.J., Fossorier, M.P.C., Imai, H. (2006). A Novel Broadcast Encryption Based on Time-Bound Cryptographic Keys. In: Safavi-Naini, R., Yung, M. (eds) Digital Rights Management. Technologies, Issues, Challenges and Systems. DRMTICS 2005. Lecture Notes in Computer Science, vol 3919. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11787952_20

Download citation

  • DOI: https://doi.org/10.1007/11787952_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-35998-2

  • Online ISBN: 978-3-540-35999-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics