Abstract
One of the means to implement information flow policies is by using a cryptographic approach commonly referred to as key assignment schemes. In this approach, information is made publicly available to users but in an encrypted form. Then, keys are assigned to users such that each key reveals a specified part of the information. Usually the distribution of keys follows a predefined scheme that specifies the ability of users to reveal information.
In this paper, we present an algebraic approach based on idempotent commutative semirings to define, specify, and analyse key assignment schemes. Then, we illustrate its usage on two key assignment schemes selected from the literature. Also, we propose amendments to the studied schemes to extend their scopes. The proposed generic algebraic approach enables the verification of security properties at an abstract level in systems that use key assignment schemes. The verification takes into consideration the algebraic properties of schemes, and the considered relationships among the assigned keys. Then, it enables the verification of the secrecy properties of the system through algebraic calculations. All the calculations can be automated using a theorem prover such as Prover9.
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
Akl, S., Taylor, P.: Cryptographic solution to a problem of access control in a hierarchy. ACM Transaction on Computer Systems 1(3), 239–248 (1983)
Atallah, M.J., Blanton, M., Fazio, N., Frikken, K.B.: Dynamic and efficient key management for access hierarchies. ACM Transactions on Information and System Security 12(3), 1–43 (2009)
Boyd, C.: Some Applications of Multiple Key Ciphers. In: Günther, C.G. (ed.) EUROCRYPT 1988. LNCS, vol. 330, pp. 455–467. Springer, Heidelberg (1988)
Chien, H.-Y., Jan, J.-K.: New hierarchical assignment without public key cryptography. Computers & Security 22(6), 523–526 (2003)
Chen, T.-S., Chung, Y.-F.: Hierarchical access control based on Chinese remainder theorem and symmetric algorithm. Computers & Security 21(6), 565–570 (2002)
Crampton, J., Martin, K., Wild, P.: On key assignment for hierarchical access control. In: Proceedings of the 19th IEEE workshop on Computer Security Foundations (CSFW 2006), Venice, Italy, pp. 98–111. IEEE Computer Society (2006)
Harn, L., Lin, H.-Y.: A cryptographic key generation scheme for multilevel data security. Computer Security 9(6), 539–546 (1990)
Höfner, P., Khedri, R., Möller, B.: Feature Algebra. In: Misra, J., Nipkow, T., Sekerinski, E. (eds.) FM 2006. LNCS, vol. 4085, pp. 300–315. Springer, Heidelberg (2006)
Kuo, F.H., Shen, V.R.L., Chen, T.S., Lai, F.: Cryptographic key assignment scheme for dynamic access control in a user hierarchy. IEEE Proceedings Computers and Digital Techniques 146(5), 235–240 (1999)
Liaw, H.T., Wang, S.J., Lei, C.L.: A dynamic cryptographic key assignment scheme in a tree structure. Computers & Mathematics with Applications 25(6), 109–114 (1993)
MacKinnon, S.J., Taylor, P.D., Meijer, H., Akl, S.G.: An optimal algorithm for assigning cryptographic keys to control access in a hierarchy. IEEE Transactions on Computers 34(9), 797–802 (1985)
McCune, W.: Prover9 and Mace4, http://www.cs.unm.edu/~mccune/prover9/
Rabin, M.: Digitalized signatures and public-key functions as intractable as factorization. Technical Report MIT/LCS/TR-212, MIT Laboratory for Computer Science (1979)
Sabri, K.E.: Algebraic Framework for the Verification of Confidentiality Properties. PhD thesis, McMaster University (2010)
Sabri, K.E., Khedri, R.: Algebraic framework for the specification and analysis of cryptographic-key distribution. Fundamenta Informaticae 112(4), 305–335 (2011)
Sandhu, R.S.: On some cryptographic solutions for access control in a tree hierarchy. In: ACM 1987: Proceedings of the 1987 Fall Joint Computer Conference on Exploring Technology: Today and Tomorrow, pp. 405–410. IEEE Computer Society Press, Los Alamitos (1987)
Yan, S.Y.: Number theory for computing. Springer (2002)
Zhong, S., Lin, T.: A comment on the chen-chung scheme for hierarchical access control. Computers & Security 22(5), 450–452 (2003)
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
Sabri, K.E., Khedri, R. (2013). A Generic Algebraic Model for the Analysis of Cryptographic-Key Assignment Schemes. In: Garcia-Alfaro, J., Cuppens, F., Cuppens-Boulahia, N., Miri, A., Tawbi, N. (eds) Foundations and Practice of Security. FPS 2012. Lecture Notes in Computer Science, vol 7743. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37119-6_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-37119-6_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-37118-9
Online ISBN: 978-3-642-37119-6
eBook Packages: Computer ScienceComputer Science (R0)