Abstract
We show how to create a master key scheme for controlling access to a set of services. Each master key is a concise representation for a list of service keys, such that only service keys in this list can be computed easily from the master key. Our scheme is more flexible than others, permitting hierarchical organization and expansion of the set of services.
Chapter PDF
Similar content being viewed by others
Keywords
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.
References
S. G. Akl and P. D. Taylor, Cryptographic solution to a multilevel security problem, in Advances in Cryptology-Proceedings of Crypto’ 82, Springer-Verlag, 1983, pp. 237–249.
—, Cryptographic solution to a problem of access control in a hierarchy, ACM Trans. Comput. Syst., 1 (1983), pp. 239–248.
B. L. Chan and H. Meijer, A multiple trusted nodes security system, in 13th Biennial Symposium on Communications, Kingston, Canada, 1986, Queen’s University.
D. E. Denning, H. Meijer, and F. B. Schneider, More on master keys for group sharing, Inf. Process. Lett., 13 (1981), pp. 125–126.
D. E. Denning and F. B. Schneider, Master keys for group sharing, Inf. Process. Lett., 12 (1981), pp. 23–25.
W. Diffie, The first ten years of public key cryptography, Proceedings of the IEEE, 76 (1988), p. 565.
I. Ingemarsson, D. T. Tang, and C. K. Wong, A conference key distribution system, IEEE Trans. Information Theory, IT-28 (1982), pp. 714–720.
E. D. Kamin, J. W. Greene, and M. E. Hellman, On secret sharing systems, IEEE Trans. Information Theory, IT-29 (1983), pp. 35–41.
S. J. MacKinnon and S. G. Akl, New key generation algorithms for multilevel security, in IEEE Symposium on Security and Privacy, 1983, pp. 72–78.
S. J. MacKinnon, P. D. Taylor, H. Meijer, and S. G. Akl, An optimal algorithm for assigning cryptographic keys to control access in a hierarchy, IEEE Trans. Comput., C-34 (1985), pp. 797–802.
H. Meijer, Cryptology: Complexity and Applications, PhD thesis, Department of Mathematics and Statistics, Queen’s University, Kingston, Canada, 1983.
J. H. Moore, Protocol failures in cryptosystems, Proceedings of the IEEE, 76 (1988), pp. 594–602.
R. L. Rivest, A. Shamir, and L. Adelman, A method for obtaining digital signatures and public-key cryptosystems, Comm. ACM, 21 (1978), pp. 120–126.
R. S. Sandhu, Cryptographic implementation of a tree hierarchy for access control, Inf. Process. Lett., 27 (1988), pp. 95–98.
A. Shamir, How to share a secret, Comm. ACM, 22 (1979), pp. 612–613.
G. J. Simmons, A ‘weak’ privacy protocol using the RSA cryptoalgorithm, Cryptologia, 7 (1983), pp. 180–182.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chick, G.C., Tavares, S.E. (1990). Flexible Access Control with Master Keys. In: Brassard, G. (eds) Advances in Cryptology — CRYPTO’ 89 Proceedings. CRYPTO 1989. Lecture Notes in Computer Science, vol 435. Springer, New York, NY. https://doi.org/10.1007/0-387-34805-0_29
Download citation
DOI: https://doi.org/10.1007/0-387-34805-0_29
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-97317-3
Online ISBN: 978-0-387-34805-6
eBook Packages: Springer Book Archive