Abstract
Access structure is a flexible mechanism for representing complex access control and authorization policies [1]. Numerous efforts have been devoted to the research of efficient schemes for implementing access structures in a scalable manner. Threshold closure was invented as an efficient way to implement access structures that represent complex authorization policies [4]. In essence, threshold closure is an efficient and scalable implementation of access structure using a reduced collection of threshold schemes [5]. A practical application of threshold closure was presented in [6] where the use of threshold closure for addressing the complex security needs of Grid Computing Systems was explained. One major deficiency of threshold closure is that a threshold closure generated from the corresponding access structure is not minimal in size, thus the collection of threshold schemes is not optimized for efficiency. In this connection, an operation called minimal covering was proposed to minimize the size of a threshold closure once it is formed from its corresponding access structure [4]. Unfortunately, the minimal covering of a threshold closure is no longer a threshold closure, thus is not scalable in terms of addition/deletion of access control rules. This paper presents a way for constructing minimal threshold closure. It defines a new structure called enhanced threshold closure. The paper proves that the enhanced threshold closure of an access structure is a threshold closure and is minimal, hence it is also called a minimal threshold closure. The paper also presents a mechanism for constructing minimal threshold closure from a basis access structure.
Chapter PDF
Similar content being viewed by others
References
Ito, M., Saito, A., Nishizeki, T.: Secret sharing scheme realizing general access structure. In: Globecom 1987, Tokyo, Japan, pp. 99–102 (1987)
Tochikubo, K.: Efficient Secret Sharing Schemes Realizing General Access Structures. IEICE Trans. on Fundamentals E87-A(7), 1788–1797
Iwamoto, M., Yamamoto, H., Ogawa, H.: Optimal Multiple Assignments Based on Integer Programming in Secret Sharing Schemes. In: IEEE-ISIT2004, Chicago, p. 16 (June-July 2004)
Zhang, C.R., Lam, K.Y., Jajodia, S.: Scalable threshold closure. Theoretical Computer Science 226, 185–206 (1999)
Shamir, A.: How to share a secret. Communications of the ACM 22(11), 612–613 (1979)
Zhao, X.-B., Lam, K.-Y., Chung, S.-L., Gu, M., Sun, J.-G.: Authorization Mechanisms for Virtual Organizations in Distributed Computing Systems. In: Wang, H., Pieprzyk, J., Varadharajan, V. (eds.) ACISP 2004. LNCS, vol. 3108, pp. 414–426. Springer, Heidelberg (2004)
Benaloh, J.C., Leichter, J.: Generalized secret sharing and monotone functions. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 27–35. Springer, Heidelberg (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhao, XB., Lam, KY., Luo, G., Chung, SL., Gu, M. (2006). Minimal Threshold Closure. In: Gollmann, D., Meier, J., Sabelfeld, A. (eds) Computer Security – ESORICS 2006. ESORICS 2006. Lecture Notes in Computer Science, vol 4189. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11863908_10
Download citation
DOI: https://doi.org/10.1007/11863908_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44601-9
Online ISBN: 978-3-540-44605-7
eBook Packages: Computer ScienceComputer Science (R0)