An Authorization Model for a Public Key Management Service

ACM Transactions on Information and System Security

Volumn 4, Issue 4, 2001, Pages 453-482

  Samarati, Pierangela ^a   Reiter, Michael K ^b   Jajodia, Sushil ^c  

^a UNIVERSITY OF MILAN   (Italy)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c George Mason University   (United States)

Author keywords

Access control; Authorizations specification and enforcement; Public key infrastructure; Security

Indexed keywords

EID: 2342606346     PISSN: 10949224     EISSN: 15577406     Source Type: Journal    
DOI: 10.1145/503339.503343     Document Type: Article

References (20)

1. Ahuja, R. K., Magnanti, T. L., and Orlin, J. B. 1993. Network Flows: Theory, Algorithms and Applications. Prentice-Hall, Englewood Cliffs, N. J.
2. Carvalho, M. H., Lucchesi, C. L., and Murty, U. S. R. 2003. The Matching Lattice, in Recent Advances in Algorithms and Combinatorics, B. Reed and C. L. Sales, Eds. Cms Books in Mathematics. Springer, Berlin, Germany, 1-26.
3. Cheriyan, J. 1997. Randomized O(M(|V|)) Algorithms For Problems in Matching Theory. Siam J. Comput. 26, 1635-1655.
4. Edmonds, J. 1965. Paths, Trees and Flowers. Can. J. Math. 17, 449-467.
5. Gabow, H. N., and Tarjan, R. E. 1985. A Linear Time Algorithm For A Special Case of Disjoint Set Union. J. Comput. Syst. Sci. 30, 209-221.
6. Goldberg, A. V., and Karzanov, A. V. 2004. Maximum Skew-Symmetric Flows and Matchings. Math. Progr., Ser. A, 100, 537-568.
7. Hetyei, G. 1964. Rectangular Configurations Which Can Be Covered By 2 × 1 Rectangles. Pasci Tan. Foisk. Kozl. 8, 351-367.
8. Kotzig, A. 1959/1960. Ein Beitrag Zur Theorie Der Endlichen Graphen I-Ii-Iii. Mat. Fyz. Casopis 9, 73-91, 136-159; 10, 205-215.
9. Little, C. H. C., and Rendl, F. 1989. An Algorithm For the Ear Decomposition of A 1-Factor Covered Graph. J. Austral. Math. Soc. (Series A) 46, 296-301.
10. Lovasz, L. 1983. Ear Decompositions of Matching-Covered Graphs. Combinatorica 3, 105-117.
11. Lovasz, L. 1987. Matching Structure and the Matching Lattice. J. Combin. Theor. B 43, 187-222.
12. Lovasz, L., and Plummer, M. D. 1975. On Bicritical Graphs. Colloq. Math. Soc. Jainos Bolyai 10, 1051-1079.
13. Lovasz, L., and Plummer, M. D. 1986. Matching Theory. Akademiai Kiado, Budapest, Hungary.
14. Murty, U. S. R. 1994. The Matching Lattice and Related Topics. Preliminary Report. Dept. of Combinatorics & Optimization, University Waterloo, Waterloo, Ont., Canada.
15. Naddef, D., and Pulleyblank, W. R. 1982. Ear Decompositions of Elementary Graphs and Gf(2)-Rank of Perfect Matchings. In Proceedings of the Bonn Workshop on Combinatorial Optimization, A. Bachem, M. Grotschel, and B. Korte, Eds. Ann. Discrete Math., 16, 241-260.
16. 1989. Maximum Matchings in General Graphs Through Randomization, J. Algorith. 10, 557-567.
17. Tarjan, R. E. 1983. Data Structures and Network Algorithms. Siam Press, Philadelphia, Pa.
18. Vazirani, V. V. 1994. A Theory of Alternating Paths and Blossoms For Proving Correctness of the O (Vv E) General Graph Matching Algorithm. Combinatorica 14, 71-109.
19. Schrijver, A. 2003. Combinatorial Optimization: Polyhedra and Efficiency. Springer-Verlag, Berlin, Germany.
20. Szigeti, Z. 1998. The Two Ear Theorem on Matching-Covered Graphs. J. Combin. Theor. B 74, 104-109.