Abstract
This paper presents a new group key distribution scheme based on the Rabin public-key cryptosystem, called Rabin tree, which is a binary tree where every parent node can be computed by the Rabin encryption of either of child nodes. The proposed scheme requires the same size of ciphertext with the LKH method [2], a single individual key, which is the optimal size at receiver storage, and computation overhead of O(log n) time to extract the session key. The security of the proposed scheme against malicious receviers is studied. A probability that a given random root key would succeed to have a full Rabin tree with 2n –1 nodes is proven to be exponential to the number of users n. Finally, an application to broadcast encryption which allows excluding faulty receivers is proposed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Asano, T.: A Revocation Scheme with Minimal Storage at Reveivers. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 433–450. Springer, Heidelberg (2002)
Wong, C.K., Gouda, M., Lam, S.S.: Secure Group Communications Using Key Graphs. In: Proc. of ACM SIGCOMM 1998 (1998)
Wallner, D., Harder, E., Agee, R.: Key Management for Multicast: Issues and Architectures, Internet RFC 2627 (1999)
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)
Halevy, D., Shamir, A.: The LSD Broadcast Encryption Scheme. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 47–60. Springer, Heidelberg (2002)
Nojima, R., Kaji, Y.: Tree Based Key Management Using Trapdoor One-Way Functions, (in Japanese). In: Proc. of the 2003 Symposium on Cryptography and Information Security, pp.131–136 (2003)
Rabin, M.O.: Digitalized Signatures and Public-key Functions as Intractable as Factorization, MIT Technical Report, MIT/LCS/TR-212 (1979)
Perring, A., Song, D., Tygar, J.D.: ELK, a New Protocol for Efficient Large-Group Key Distribution
Kim, Y., Perring, A., Tsudik, G.: Simple and Foult-Tolerant Key Agreement for Dynamic Collaborative Groups. In: Proc. of ACM Conference on Computer and Communication Security (2000)
Kogan, N., Shavitt, Y., Wool, A.: A Practical Revocation Scheme for Broadcast Encryption Using Smart Cards. In: Proc. of the 2003 IEEE Symposium on Security and Privacy, IEEE, Los Alamitos (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kikuchi, H. (2004). Rabin Tree and Its Application to Group Key Distribution. In: Wang, F. (eds) Automated Technology for Verification and Analysis. ATVA 2004. Lecture Notes in Computer Science, vol 3299. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30476-0_31
Download citation
DOI: https://doi.org/10.1007/978-3-540-30476-0_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23610-8
Online ISBN: 978-3-540-30476-0
eBook Packages: Springer Book Archive