Abstract
Broadcast encryption schemes are applied to transmit digital information of multimedia, software, Pay-TV etc. in public network. Important thing is that only user who is permitted before only must be able to get digital information in broadcast encryption schemes. If broadcast message transfers, users who authority is get digital information to use private key given in the advance by oneself. Thus, user acquires message or session key to use key that broadcaster transmits, broadcaster need process that generation and distribution key in these process. Also, user secession new when join efficient key renewal need. In this paper, introduce about efficient key generation and distribution, key renewal method. Take advantage of two technique of proposal system. One is method that server creates key forecasting user without user’s agreement, and another is method that server and user agree each other and create key. Advantage of two proposal system because uses a secret key broadcast message decryption do can and renewal is available effectively using one information whatever key renewal later.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Fiat, A., Naor, M.: Broadcast encryption. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 480–491. Springer, Heidelberg (1994)
Blundo, C., Mattos, L.A.F., Stinson, D.R.: Generalized Beimel-Chor schemes for Broadcast Enryption and Interactive Key Distribution. In: CRYPTO 1996. LNCS, vol. 1109, Springer, Heidelberg (1996)
Blundo, C., Mattos, L.A.F., Stinson, D.R.: Trade-offs Between Communication and Storage in Unconditionally Secure Schemes for Broadcast Encryption and Interactive Key Distribution. In: CRYPTO 1996 (1998)
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)
Gracia, I., Martin, S., Padro, C.: Improving the Trade-off Between Storage and Communication in Broadcast Encryption Schemes (2001)
Halevy, D., Shamir, A.: The LSD broadcast encryption scheme. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 47–60. Springer, Heidelberg (2002)
Dodis, Y., Fazio, N.: Public key broadcast encryption for stateless receivers. In: Feigenbaum, J. (ed.) DRM 2002. LNCS, vol. 2696, pp. 61–80. Springer, Heidelberg (2003)
Beaver, D., So, N.: Global, Unpredictable Bit Generation Without Broadcast (1993)
Abdalla, M., Shavitt, Y., Wool, A.: Towards making broadcast encryption practical. In: Franklin, M.K. (ed.) FC 1999. LNCS, vol. 1648, p. 140. Springer, Heidelberg (1999)
Lee, D.H., Kim, H.J., Lim, J.I.: Efficient Public-Key Traitor Tracing in Provably Secure Broadcast Encryption with Unlimited Revocation
Narayanan, A.: Practical Pay TV schemes. To appear in the Proceedings of ACISP 2003 (July 2003)
Bobba, R.B., Eschenauer, L., Gligor, V., Arbaugh, W.A.: Bootstrapping Security Associations for Routing in Mobile Ad-Hoc Networks. Technical Report, Institute for Systems Research, UMd, TR 2002-44 (2002)
Boldyreva, A.: Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme. In: International Workshop on Practice and Theory in Public Key Cryptography (January 2003)
Boneh, D., Franklin, M.: Identity-based encryption from the weil pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213–229. Springer, Heidelberg (2001)
Boneh, D., Lynn, B., Shacham, H.: Short signatures from the weil pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 512–532. Springer, Heidelberg (2001)
Cha, J.C., Cheon, J.H.: An Identity-Based Signature from Gap Diffie-Hellman Groups. In: International Workshop on Practice and Theory in Public Key Cryptography (January 2003)
Dahill, B., Levine, B., Royer, E., Shields, C.: A Secure Routing Protocol for Ad Hoc Networks. Technical Report UM-CS-2001-037, University of Massachusetts (August 2001)
Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Secure distributed key generation for discrete-log based cryptosystems. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, p. 295. Springer, Heidelberg (1999)
Hu, Y.-C., Johnson, D., Perrig, A.: SEAD: Secure Efficient Distance Vector Routing for Mobile Wireless Ad Hoc Networks. In: Workshop on Mobile Computing Systems and Applications, June 2002. IEEE, Los Alamitos (2002)
Hu, Y.-C., Johnson, D.B., Perrig, A.: Secure On-Demand Routing Protocols in Ad Hoc Networks. Unpublished (2001)
Khalili, A., Arbaugh, W.A.: Security of wireless ad-hoc networks. Work in progress (2002), http://www.cs.umd.edu/~aram/wireless/survey.pdf
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lee, DG., Park, JS., Lee, IY., Park, YS., Ahn, JC. (2006). An Efficient Key Distribution for Ubiquitous Environment in Ad-Hoc Network Using Broadcast Encryption. In: Gavrilova, M.L., et al. Computational Science and Its Applications - ICCSA 2006. ICCSA 2006. Lecture Notes in Computer Science, vol 3983. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11751632_40
Download citation
DOI: https://doi.org/10.1007/11751632_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34077-5
Online ISBN: 978-3-540-34078-2
eBook Packages: Computer ScienceComputer Science (R0)