Secret-Public Storage Trade-Off for Broadcast Encryption Key Management

  • Miodrag J. Mihaljević
  • Marc P. C. Fossorier
  • Hideki Imai
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3269)


The problem of minimizing the amount of secret information (secret bits) required for certain key management schemes is addressed. It is important to note that the secret storage minimization originates from the fact that this storage should be both read-proof and tamper-proof. The proposed minimization of the secret storage at the user’s side is based on an appropriate trade-off between the required public storage and the processing complexity. As the main components, two methods are proposed for assigning multiple roles to the same secret key bits, and both of them require only simple operations implying a high implementation efficiency. The first proposed one-way mapping is based on certain sequence comparison issues and the second one follows the model of a communication channel with erasures. Employment of a proposed mapping method in two computationally secure key management schemes for the broadcast encryption SD and LSD is considered and the modified versions of these schemes with minimized secret storage requirements are proposed. The main overheads of the original and the modified SD and LSD based schemes are compared and the advantages of the modified schemes are pointed out. Also, it is shown that the proposed secret to public storage exchange preserves the security of the original SD and LSD schemes.


broadcast encryption key management system overheads trade-off one-way mapping pseudorandom number generators erasure channels 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Asano, T.: A revocation scheme with minimal storage at receivers. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 433–450. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  2. 2.
    Chick, G.C., Tawares, S.E.: Flexible access control with master keys. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 316–322. Springer, Heidelberg (1990)Google Scholar
  3. 3.
    Garay, J.A., Staddon, J., Wool, A.: Long-lived broadcast encryption. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 333–352. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  4. 4.
    Golić, J.D., O’Connor, L.: Embedding and probabilistic correlation attacks on clock-controlled shift registers. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 230–243. Springer, Heidelberg (1995)CrossRefGoogle Scholar
  5. 5.
    Guruswami, V.: List decoding from erasures: Bounds and code constructions. IEEE Transactions on Information Theory 49, 2826–2833 (2003)CrossRefMathSciNetGoogle Scholar
  6. 6.
    Halevy, D., Shamir, A.: The LCD broadcast encryption scheme. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 47–60. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  7. 7.
    Lotspiech, J., Nusser, S., Prestoni, F.: Broadcast encryption’s bright future. IEEE Computer 35, 57–63 (2002)Google Scholar
  8. 8.
    Mihaljević, M.J.: Broadcast encryption schemes based on the sectioned key tree. In: Qing, S., Gollmann, D., Zhou, J. (eds.) ICICS 2003. LNCS, vol. 2836, pp. 158–169. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  9. 9.
    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)CrossRefGoogle Scholar
  10. 10.
    Mihaljević, M.J.: Reconfigurable key management for broadcast encryption. IEEE Communications Letters 8, 440–442 (2004)CrossRefGoogle Scholar
  11. 11.
    Mihaljević, M.J., Fossorier, M.P.C., Imai, H.: The key management with minimized secret storage employing erasure channel approach (August 2004) (submitted)Google Scholar
  12. 12.
    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)CrossRefGoogle Scholar
  13. 13.
    Zheng, Y., Hardjono, T., Pieprzyk, J.: Sibling intractable function families and their applications. In: Matsumoto, T., Imai, H., Rivest, R.L. (eds.) ASIACRYPT 1991. LNCS, vol. 739, pp. 124–138. Springer, Heidelberg (1993)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Miodrag J. Mihaljević
    • 1
  • Marc P. C. Fossorier
    • 2
  • Hideki Imai
    • 3
  1. 1.Mathematical InstituteSerbian Academy of Sciences and ArtsBelgradeSerbia and Montenegro
  2. 2.Department of Electrical EngineeringUniversity of HawaiiHonoluluUSA
  3. 3.Institute of Industrial ScienceUniversity of TokyoTokyoJapan

Personalised recommendations