Abstract
We consider documents with restricted access rights, where some segments of the document are encrypted in order to prevent unauthorized reading. The access rights to such a document are described by an access graph. It is a directed acyclic graph; each node describing a different access rights level. It is assumed that a user having the rights corresponding to a node v has also all rights corresponding to all nodes w such that there is a directed path from v to w in the access graph. Then, to each node v we assign a key K v and use this key to encrypt the segment of the document corresponding to the access level v.
We consider key management schemes and encoding auxiliary information in the document which ensure that a user who gets a single key corresponding to his access level v can derive all keys K w for w = v or w being an ancestor of v in the access graph.
In this paper we show how to minimize the total size of auxiliary keying information stored in the document. We provide an algorithm based on node disjoint paths in the access graph and key derivation based on one-way functions. We show that the algorithm chooses the paths in an optimal way.
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
Qiu, R., Tang, Z., Gao, L., Yu, Y.: A novel XML-based document format with printing quality for web publishing. In: Imaging and Printing in a Web 2.0 World; and Multimedia Content Access: Algorithms and Systems IV. Proc. SPIE, vol. 7540. Society of Photographic Instrumentation Engineers (2010)
Xu, D., Tang, Z., Yu, Y.: An efficient key management scheme for segment-based document protection. In: 2011 IEEE Consumer Communications and Networking Conference (CCNC), pp. 896–900 (2011)
Akl, S.G., Taylor, P.D.: Cryptographic solution to a problem of access control in a hierarchy. ACM Trans. Comput. Syst. 1(3), 239–248 (1983)
Levin, L.A.: The tale of one-way functions (2003), http://arxiv.org/abs/cs.CR/0012023 (retrieved on May 20, 2011)
Hassen, H.R., Bouabdallah, A., Bettahar, H.: A new and efficient key management scheme for content access control within tree hierarchies. In: AINA Workshops, vol. (1), pp. 551–556. IEEE Computer Society (2007)
Wu, J., Wei, R.: An Access Control Scheme for Partially Ordered Set Hierarchy with Provable Security. In: Preneel, B., Tavares, S.E. (eds.) SAC 2005. LNCS, vol. 3897, pp. 221–232. Springer, Heidelberg (2006)
Atallah, M.J., Blanton, M., Fazio, N., Frikken, K.B.: Dynamic and efficient key management for access hierarchies. ACM Trans. Inf. Syst. Secur. 12(3) (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kutyłowski, M., Gębala, M. (2012). Optimizing Segment Based Document Protection. In: Bieliková, M., Friedrich, G., Gottlob, G., Katzenbeisser, S., Turán, G. (eds) SOFSEM 2012: Theory and Practice of Computer Science. SOFSEM 2012. Lecture Notes in Computer Science, vol 7147. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27660-6_46
Download citation
DOI: https://doi.org/10.1007/978-3-642-27660-6_46
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-27659-0
Online ISBN: 978-3-642-27660-6
eBook Packages: Computer ScienceComputer Science (R0)