Advertisement

A New ID-Based Broadcast Encryption Scheme

  • Chen Yang
  • Xiangguo Cheng
  • Wenping Ma
  • Xinmei Wang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4158)

Abstract

This paper presents a new efficient identity-based broadcast encryption scheme using bilinear mapping. Both private-key storage for one authorized user (only two group elements) and communication transmission bandwidth (three group elements) in our scheme are of constant size regardless of the number of colluders. In terms of efficiency and security, our scheme is very efficient with lower encryption and decryption computational cost and more secure against k number of colluders by introducing self-enforcing protection strategy.

Keywords

Authorized User Digital Content Bilinear Mapping Data Provider Discrete Logarithm Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Berkovits, S.: How to Broadcast a Secret. In: Banâtre, J.-P., Le Métayer, D. (eds.) Research Directions in High-Level Parallel Programming Languages 1991. LNCS, vol. 574, pp. 536–541. Springer, Heidelberg (1992)Google Scholar
  2. 2.
    Fiat, A., Naor, M.: Broadcast Encryption. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 480–491. Springer, Heidelberg (1994)Google Scholar
  3. 3.
    Stinson, D.R., Wei, R.: Key Preassigned Traceability Schemes for Broadcast Encryption. In: Tavares, S., Meijer, H. (eds.) SAC 1998. LNCS, vol. 1556, pp. 144–156. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  4. 4.
    Halevi, D., Shamir, A.: The LSD Broadcast Encryption Scheme. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 47–60. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  5. 5.
    D’Arco, P., Stinson, D.R.: Fault Tolerant and DistributedBroadcast Encryption. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol. 2612, pp. 263–280. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  6. 6.
    Dwork, C., Lotspiech, J., Naor, M.: Digital Signets: Self-Enforcing Protection of Digital Content. In: Proceedings of the 28th Symposium on the Theory of Computation, pp. 489–498 (1996)Google Scholar
  7. 7.
    Du, X., Wang, Y., Ge, J., Wang, Y.M.: An ID-based broadcast encryption for key distribution. IEEE Transactions on broadcasting 51(2), 264–266 (2005)CrossRefGoogle Scholar
  8. 8.
    Mu, Y., Susilo, W., Lin, Y.-X.: Identity-Based Broadcasting. In: Johansson, T., Maitra, S. (eds.) INDOCRYPT 2003. LNCS, vol. 2904, pp. 177–190. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  9. 9.
    Boneh, D., Lynn, B., Shacham, H.: Short Signatures from the Weil Pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 514–532. Springer, Heidelberg (2001)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Chen Yang
    • 1
  • Xiangguo Cheng
    • 1
  • Wenping Ma
    • 1
  • Xinmei Wang
    • 1
  1. 1.Ministry of Education Key Lab. of Computer Networks and Information SecurityXidian UniversityXi’anChina

Personalised recommendations