Secure Virtual Enclaves: Supporting Coalition Use of Distributed Application Technologies

ACM Transactions on Information and System Security

Volumn 4, Issue 2, 2001, Pages 103-133

  Shands, Deborah ^a   Jacobs, Jay ^a   Yee, Richard ^b   Sebes, E John ^c  

^a NAI Labs   (United States)

^b SUN MICROSYSTEMS   (United States)

^c NONE   (United States)

Author keywords

Access Control; Coalition; Collaborative system; Group communication; Middleware; Security; Security policy

Indexed keywords

EID: 21644476470     PISSN: 10949224     EISSN: 15577406     Source Type: Journal    
DOI: 10.1145/501963.501964     Document Type: Article

References (32)

1. Alon, N., Yuster, R., and Zwick, U. 1995. Color-coding. J. ACM, 42, 844-856.
2. Alon, N., Yuster, R., and Zwick, U. 1997. Finding and counting given length cycles. Algorithmica 17, 209-223.
3. Bürgisser, P., Clausen, M., and Shokrollahi, M. 1997. Algebraic complexity theory. SpringerVerlag, New York.
4. Chan, T. 2002. Dynamic subgraph connectivity with geometric applications. In Proceedings of 34th Symposium on the Theory of Computing. ACM, New York, 7-13.
5. Cheriyan, J. 1997. Randomized Õ(M(|V~)) algorithms for problems in matching theory. SIAM J. Comput. 26, 1635-1655.
6. Chin, F. 1978. An O (n) algorithm for determining a near-optimal computation order of matrix chain products. Commun. ACM 21, 7, 544-549.
7. Cohen, E. 1997. Size-estimation framework with applications to transitive closure and reachability. J. Comput. Syst. Sciences 55, 3, 441-453.
8. Cohn, H., and Umans, C. 2003. A group-theoretic approach to fast matrix multiplication. In Proceedings of 44th Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., 438-449.
9. Coppersmith, D. 1997. Rectangular matrix multiplication revisited. J. Complex. 13, 42-49.
10. Coppersmith, D., and Winograd, S. 1990. Matrix multiplication via arithmetic progressions. J. Symb. Comput. 9, 251-280.
11. Cormen, T., Leiserson, C., Rivest, R., and Stein, C. 2001. Introduction to Algorithms, Second ed. The MIT Press, Cambridge, Mass.
12. Demetrescu, C, Anditaliano, G. 2000. Fully dynamic transitive closure: Breaking through the O (n2) barrier. In Proceedings of 41st Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., 381-389.
13. Eisenbrand, F., and Grandoni, F. 2003. Detecting directed 4-cycles still faster. Inf. Proc. Lett. 87, 1, 13-15.
14. Gustavson, F. 1978. Two fast algorithms for sparse matrices: Multiplication and permuted transposition. ACM Trans. Math. Softw. 4, 3, 250-269.
15. Hu, T., and shing, M. 1982. Computation of matrix chain products I. SIAMJ. Comput. 11, 2, 362-373.
16. Hu, T., and Shing, M. 1984. Computation of matrix chain products II. SIAM J. Comput. 13, 2, 228-251.
17. Huang, X., and Pan, V. 1998. Fast rectangular matrix multiplications and applications. J. Complex. 14, 257-299.
18. Kratsch, D., and Spinrad, J. 2003. Between O(nm) and O(na). In Proceedings of 14th Symposium on Discrete Algorithms. ACM, New York, 709-716.
19. Mucha, M., and Sankowski, P. 2004a. Maximum matchings in planar graphs via gaussian elimination. In Proceedings of 12th ESA, 532-543.
20. Mucha, M., and Sankowski, P. 2004b. Maximum matchings via gaussian elimination. In Proceedings of 45th Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., 248-255.
21. Mulmuley, K., Vazirani, U. V., and Vazirani, V. V. 1987. Matching is as easy as matrix inversion. Combinatorica 7, 105-113.
22. Nešetril, J. and Poljak, S. 1985. On the complexity of the subgraph problem. Comment. Math. Univ. Carol. 26, 2, 415-419.
23. Pan, V. 1985. How to multiply matrices faster. In Lecture Notes in Computer Science, vol. 179. SpringerVerlag, New York.
24. Rabin, M., and Vazirani, V. 1989. Maximum matchings in general graphs through randomization. J. Alg. 10, 557-567.
25. Raz, R. 2003. On the complexity of matrix product. SIAM J. Comput. 32, 1356-1369.
26. Roditty, L., and Zwick, U. 2002. Improved dynamic reachability algorithms for directed graphs. In Proceedings of 43rd Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., 679-688.
27. Seidel, R. 1995. On the all-pairs-shortest-path problem in unweighted undirected graphs. J. Comput. Syst. Sci. 51, 400-403.
28. Shoshan, A., and Zwick, U. 1999. All pairs shortest paths in undirected graphs with integer weights. In Proceedings of 40th Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., 605-614.
29. Shpilka, A. 2003. Lower bounds for matrix product. SIAM J. Comput. 32, 1185-1200.
30. Strassen, V. 1969. Gaussian elimination is not optimal. Numer. Math. 13, 354-356.
31. Yuster, R., and zwick, U. 2004. Detecting short directed cycles using rectangular matrix multiplication and dynamic programming. In Proceedings of 15th Symposium on Discrete Algorithms. ACM, New York, 247-253.
32. zwick, U. 2002. All-pairs shortest paths using bridging sets and rectangular matrix multiplication. J. ACM 49, 289-317.