A Tree Based One-Key Broadcast Encryption Scheme with Low Computational Overhead
In this paper, we propose a new broadcast encryption method which is a modification of the Complete Subtree method and it reduces the number of keys a receiver stores to one. There have been proposed some methods which minimize the number of keys for a receiver to one. The most efficient one among them uses RSA cryptosystem in order to reduce the number of keys, while the proposed method is based on Rabin cryptosystem. The computational overhead at receivers in our method is around 1 / log2 e compared with the most efficient method proposed previously, where e is a public exponent of RSA. We examine this result by experiments. Therefore, the proposed method is the most efficient among tree based one-key methods with respect to the computational overhead at receivers. This reduction in the computational overhead is achieved in exchange for an increase in the size of nonsecret memory by [ log N * few (e. g. eight)] bits, where N is the total number of receivers. The security of the proposed method is equivalent to Rabin cryptosystem in the sense of key-intractability in the random oracle model.
KeywordsHash Function Computational Overhead Secret Information Digital Right Management Random Oracle Model
Unable to display preview. Download preview PDF.
- 4.Berkovits, S.: How to Broadcast a Secret. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 535–541. Springer, Heidelberg (1991)Google Scholar
- 5.Chick, G.C., Tavares, 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
- 6.Fiat, A., Naor, M.: Broadcast Encryption. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 480–491. Springer, Heidelberg (1994)Google Scholar
- 8.Goodrich, M.T., Sun, J.Z., Tamassia, R.: Efficient Tree-Based Revocation in Groups of Low-State Devices. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 511–527. Springer, Heidelberg (2004)Google Scholar
- 10.Kikuchi, H.: Rabin Tree and its Application to Broadcast Encryption IEICE Technical Report ISEC 2003-13, pp. 9–12 (2003) (in Japanese)Google Scholar
- 13.Nojima, R., Kaji, Y.: Efficient Tree-based Key Management Using One-way Functions. In: Proceedings of the 2004 Symposium on Cryptography and Information Security, pp. 189–194 (2004) (in Japanese)Google Scholar
- 15.Ogata, W., Hiza, T., Quang, D.V.: Efficient Tree Based Key management based on RSA function. In: Proceedings of the 2004 Symposium on Cryptography and Information Security, pp. 195–199 (2004) (in Japanese)Google Scholar
- 16.Rabin, M.O.: Digitalized Signatures and Public-Key Functions as Intractable as Factorization. MIT Technical Report, MIT/LCS/TR-212 (1979)Google Scholar
- 17.Wallner, D., Harder, E., Agee, R.: Key Management for Multicast: Issues and Architectures. IETF NetworkWorking Group, Request for Comments: 2627 (1999), available from ftp://ftp.ietf.org/rfc/rfc2627.txt
- 19.Wong, C.K., Gouda, M., Lam, S.S.: Secure Group Communications Using Key Graphs. In: Proceedings of ACM SIGCOMM 1998 (1998)Google Scholar