R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications, 1993.
DOI : 10.21236/ADA594171

S. Akl and P. Taylor, Cryptographic solution to a problem of access control in a hierarchy, ACM Transactions on Computer Systems, vol.1, issue.3, pp.239-248, 1983.
DOI : 10.1145/357369.357372

M. J. Atallah, M. Blanton, N. Fazio, and K. B. Frikken, Dynamic and efficient key management for access hierarchies, ACM Trans. Inf. Syst. Secur, vol.12, issue.3, 2009.
DOI : 10.1145/1102120.1102147
URL : http://www.cse.nd.edu/~mblanton/papers/tissec09.pdf

M. J. Atallah, M. Blanton, and K. B. Frikken, Incorporating Temporal Capabilities in Existing Key Management Schemes, ESORICS. Lecture Notes in Computer Science, vol.4734, pp.515-530, 2007.
DOI : 10.1007/978-3-540-74835-9_34
URL : http://www.cerias.purdue.edu/bookshelf/archive/2007-99.pdf

J. Bang-jensen and G. Gutin, Digraphs: Theory, Algorithms and Applications, 2009.

J. Bethencourt, A. Sahai, and B. Waters, Ciphertext-Policy Attribute-Based Encryption, 2007 IEEE Symposium on Security and Privacy (SP '07), pp.20-23, 2007.
DOI : 10.1109/SP.2007.11
URL : http://www.cs.berkeley.edu/~bethenco/oakland07cpabe.ps

V. Ciriani, S. De-capitani-di-vimercati, S. Foresti, S. Jajodia, S. Paraboschi et al., Combining fragmentation and encryption to protect privacy in data storage, ACM Transactions on Information and System Security, vol.13, issue.3, 2010.
DOI : 10.1145/1805974.1805978

J. Crampton, Practical and efficient cryptographic enforcement of interval-based access control policies, ACM Transactions on Information and System Security, vol.14, issue.1, p.14, 2011.
DOI : 10.1145/1952982.1952996

J. Crampton, R. Daud, and K. M. Martin, Constructing Key Assignment Schemes from Chain Partitions, Lecture Notes in Computer Science, vol.6166, pp.130-145, 2010.
DOI : 10.1007/978-3-642-13739-6_9
URL : https://hal.archives-ouvertes.fr/hal-01056664

J. Crampton, N. Farley, G. Gutin, M. Jones, and B. Poettering, Cryptographic Enforcement of Information Flow Policies Without Public Information, Proceedings of ACNS 2015, 1410.
DOI : 10.1007/978-3-319-28166-7_19

J. Crampton, K. M. Martin, and P. R. Wild, On Key Assignment for Hierarchical Access Control, 19th IEEE Computer Security Foundations Workshop (CSFW'06), pp.98-111, 2006.
DOI : 10.1109/CSFW.2006.20
URL : http://www.isg.rhul.ac.uk/~jason/Pubs/csfw06.pdf

D. 'arco, P. De-santis, A. Ferrara, A. L. Masucci, and B. , Security and tradeoffs of the Akl-Taylor scheme and its variants, MFCS. Lecture Notes in Computer Science, vol.5734, pp.247-257, 2009.

R. Dilworth, A Decomposition Theorem for Partially Ordered Sets, The Annals of Mathematics, vol.51, issue.1, pp.161-166, 1950.
DOI : 10.2307/1969503

E. S. Freire and K. G. Paterson, Provably secure key assignment schemes from factoring Information Security and Privacy -16th Australasian Conference, ACISP 2011 Proceedings. Lecture Notes in Computer Science, vol.6812, pp.292-309, 2011.
DOI : 10.1007/978-3-642-22497-3_19
URL : http://www.isg.rhul.ac.uk/esvfreire/publications/ACISP2011.pdf

E. S. Freire, K. G. Paterson, and B. Poettering, Simple, Efficient and Strongly KI-Secure Hierarchical Key Assignment Schemes, Proceedings. Lecture Notes in Computer Science, vol.7779, pp.101-114, 2013.
DOI : 10.1007/978-3-642-36095-4_7
URL : http://eprint.iacr.org/2012/645.pdf

T. Gallai and A. N. Milgram, Verallgemeinerung eines Graphentheoretischen Satzes von Rédei, Acta Sci. Math, vol.21, pp.181-186, 1960.

R. Ostrovsky, A. Sahai, and B. Waters, Attribute-based encryption with nonmonotonic access structures, Proceedings of the 2007 ACM Conference on Computer and Communications Security, pp.195-203, 2007.