Skip to main content

Scalable Key Transport Protocol Using Chinese Remainder Theorem

  • Conference paper
Security in Computing and Communications (SSCC 2013)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 377))

Included in the following conference series:

Abstract

In any conditional access system, the broadcast content is encrypted with the secret key to protect it from unauthorized users. The secret key is shared by server and a authorized user and a key transport protocol is used to transfer the secret key securely to these users. In this paper we introduce a scalable key transport protocol based on Chinese remainder theorem for single as well as multiple access control. In this protocol, user or user device has to carry only two keys. To decode the broadcast message, only one modular division and one decryption is sufficient. The main advantage of our scheme is that, a server can update the scrambling key or group key in one message, without changing user’s key. The proposed protocol is scalable and it can be used for multiple access control, which is useful in Pay TV, without increasing communication and computation overhead on user as well as the server.

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

Access this chapter

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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 

  2. Chiou, G.H., Chen, W.T.: Secure broadcast using secure lock. IEEE Trans. Software Engineering 15(8), 929–934 (1989)

    Article  Google Scholar 

  3. Shamir: How to share a secret. Communications of the ACM 22(11), 612–613 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  4. Eskicioglu, A.M., Delp, E.J.: A Key Transport Protocol based on secret sharing, Application to information security. IEEE Transactions on Consumer Electronics 48(4), 816–824 (2002)

    Article  Google Scholar 

  5. Wang, S.-Y., Laih, C.-S.: Efficient Key Distribution for Access Control in Pay-TV Systems. IEEE Transactions on Multimedia 10(3), 480–491 (2008)

    Article  Google Scholar 

  6. Liu, B., Zhang, W., Jiang, T.: A scalable key distribution scheme for conditional access system in digital pay-TV system. IEEE Trans. Consumer Electron. 50(2), 632–637 (2004)

    Article  Google Scholar 

  7. Wallner, D., Harder, E., Agee, R.: Key management for multicast: issues and architecture. National Security Agency, RFC 2627 (June 1999)

    Google Scholar 

  8. Rescorla, E.: SSL and TLS: Designing and Building Secure Systems. Addison- Wesley, Reading (2001)

    Google Scholar 

  9. Schneier, B.: Applied Cryptography. Wiley, New York (1996)

    Google Scholar 

  10. Daemen, J., Rijmen, V.: Rijndael: The Advanced Encryption Standard. Dr. Dobb’s Journal (March 2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Joshi, M.Y., Bichkar, R.S. (2013). Scalable Key Transport Protocol Using Chinese Remainder Theorem. In: Thampi, S.M., Atrey, P.K., Fan, CI., Perez, G.M. (eds) Security in Computing and Communications. SSCC 2013. Communications in Computer and Information Science, vol 377. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40576-1_39

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40576-1_39

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40575-4

  • Online ISBN: 978-3-642-40576-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics