An Optimal Algorithm for Assigning Cryptographic Keys to Control Access in a Hierarchy

IEEE Transactions on Computers

Volumn C-34, Issue 9, 1985, Pages 797-802

  Mackinnon, Stephen J ^a   Taylor, Peter D ^b   Meijer, Henk ^b   Akl, Selim G ^b  

^a Thousand Island Secondary School ^*  (Canada)

^b QUEEN S UNIVERSITY   (Canada)

Author keywords

Access control canonical; assignment; cooperative attack; cryptographic key; hierarchy; key generation algorithm; partially ordered set

Indexed keywords

CRYPTOGRAPHY; DATA PROCESSING - SECURITY OF DATA;

ACCESS CONTROL; CRYPTOGRAPHIC KEYS;

COMPUTER PROGRAMMING;

EID: 0022115074     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.1985.1676635     Document Type: Article

References (6)

1. S. G. Akl and P. D. Taylor, “Cryptographic solution to a problem of access control in a hierarchy,” ACM Trans. Comput. Syst., vol. 1, no. 3, Aug. 1983.
2. G. B. Dantzig and A. J. Hoffman, “Dilworth’s theorem on partially ordered sets,” in Linear Inequalities and Related Systems (Annals of Mathematics Study 38). Princeton, NJ: Princeton Univ. Press, 1956, pp. 207–214.
3. R. P. Dilworth, “A decomposition theorem for partially ordered sets,” Ann. Math., vol. 51, pp. 161–166, 1950.
4. J. Edmonds and R. M. Karp, “Theoretical improvements in algorithmic efficiency for network flow problems,” J. ACM, vol. 19, pp. 248–264, 1972.
5. L. R. Ford and D. R. Fulkerson, Flows in Networks. Princeton, NJ: Princeton Univ. Press, 1962. NJ:
6. L. Khachiyan, “A polynomial algorithm in linear programming,” Dokl. Akad. Nauk SSSR, vol. 224, pp. 1093–1096, 1979. (Transl.: Soviet Math. Dokl., vol. 20, pp. 191-194.)