Abstract
We propose a simple and efficient hash-based time-bound hierarchical key assignment scheme that requires a single key per user per subscription. It is more efficient than existing schemes in terms of public storage.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Akl, S.G., Taylor, P.D.: Cryptographic solution to a problem of access control in a hierarchy. ACM Trans. on Computer Systems 1(3), 239–248 (1983)
Tzeng, W.G.: A time-bound cryptographic key assignment scheme for access control in the hierarchy. IEEE Trans. on Know. and Data Eng. 14, 182–188 (2002)
Rivest, R.L., Shamir, A., Adleman, L.M.: A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM 21(2), 120–126 (1978)
Yi, X., Ye, Y.: Security of Tzeng time-bound key assignment scheme for access control in hierarchy. IEEE Trans. on Know. and Data Eng. 15(4), 1054–1055 (2003)
Zhu, W.T., Deng, R.H., Zhou, J., Bao, F.: Time-bound hierarchical key assignment: An overview. IEICE Trans. 93-D(5), 1044–1052 (2010)
Ateniese, G., De Santis, A., Ferrara, A.L., Masucci, B.: Provably-secure time-bound hierarchical key assignment schemes. In: ACM Conference on Computer and Communications Security, pp. 288–297 (2006)
Ateniese, G., De Santis, A., Ferrara, A.L., Masucci, B.: Provably-secure time-bound hierarchical key assignment schemes. Journal of Cryptology 25(2), 243–270 (2012)
Atallah, M.J., Blanton, M., Frikken, K.B.: Incorporating temporal capabilities in existing key mgmt. schemes. In: Biskup, J., López, J. (eds.) ESORICS 2007. LNCS, vol. 4734, pp. 515–530. Springer, Heidelberg (2007)
Crampton, J.: Trade-offs in cryptographic implementations of temporal access control. In: Jøsang, A., Maseng, T., Knapskog, S.J. (eds.) NordSec 2009. LNCS, vol. 5838, pp. 72–87. Springer, Heidelberg (2009)
Crampton, J.: Time-storage trade-offs for cryptographically-enforced access control. In: Atluri, V., Diaz, C. (eds.) ESORICS 2011. LNCS, vol. 6879, pp. 245–261. Springer, Heidelberg (2011)
Crampton, J.: Practical and efficient cryptographic enforcement of interval-based access control policies. ACM Trans. on Inf. Syst. Secur. 14(1), 14 (2011)
Atallah, M.J., Frikken, K.B., Blanton, M.: Dynamic and efficient key management for access hierarchies. In: ACM Conference on Computer and Communications Security, pp. 190–202 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kumar, N., Mathuria, A., Das, M.L. (2013). Simple and Efficient Time-Bound Hierarchical Key Assignment Scheme. In: Bagchi, A., Ray, I. (eds) Information Systems Security. ICISS 2013. Lecture Notes in Computer Science, vol 8303. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45204-8_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-45204-8_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-45203-1
Online ISBN: 978-3-642-45204-8
eBook Packages: Computer ScienceComputer Science (R0)