Abstract
Automatic goal-driven composition of information processing workflows, or workflow planning, has become an active area of research in recent years. Various workflow planning methods have been proposed for automatic application development in Web services, stream processing and grid computing. Significant progress has been made on the definition of composition rules. The composition rules can be specified based on the schema, interface and semantics-driven compatibility of processes and data. Workflows must also satisfy information flow security constraints. In this paper we introduce and study the problem of workflow planning in MLS systems under Bell-LaPadula (BLP) policy, or a similar lattice-based policy, such as Biba integrity model. Extending results from AI planning literature, we show that under certain simplifying assumptions the workflows satisfying BLP constraints can be constructed in linear time. When the policy allows downgraders for data declassification, the problem is NP-complete; nevertheless, with additional assumptions efficient algorithms do exist.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Gil, Y., Deelman, E., Blythe, J., Kesselman, C., Tangmurarunkit, H.: Artificial intelligence and grids: Workflow planning and beyond. IEEE Intelligent Systems (2004)
Kichkaylo, T., Ivan, A., Karamcheti, V.: Constrained component deployment in wide-area networks using AI planning techniques. In: Proceedings of IPDPS 2003 (2003)
Doshi, P., Goodwin, R., Akkiraju, R., Verma, K.: Dynamic workflow composition using Markov decision processes. In: Proceedings of ICWS 2004 (2004)
Koehler, J., Srivastava, B.: Web service composition: Current solutions and open problems. In: Proceedings of ICAPS 2003, Workshop on Planning for Web Services, pp. 28–35 (2003)
Pistore, M., Traverso, P., Bertoli, P.: Automated composition of web services by planning in asynchronous domains. In: Proceedings of ICAPS 2005 (2005)
Blythe, J., Deelman, E., Gil, Y., Kesselman, K., Agarwal, A., Mehta, G., Vahi, K.: The role of planning in grid computing. In: Proceedings of ICAPS 2003 (2003)
Riabov, A., Liu, Z.: Planning for stream processing systems. In: Proceedings of AAAI (2005)
Brown, A., Keller, A., Hellerstein, J.: A model of configuration complexity and its application to a change management system. In: Proceedings IM 2005 (2005)
Sandhu, R.: Lattice-based access control models. IEEE Computer 26, 9–19 (1993)
Bell, D., LaPadula, L.: Secure computer system: Unified exposition and Multics interpretation. MTR-2997, MITRE Corp. (1976)
Rintanen, J., Hoffmann, J.: An overview of recent algorithms for AI planning. Künstliche Intelligenz, 5–11 (2001)
Lelarge, M., Liu, Z., Riabov, A.: Automatic composition of secure workflows (2006)
Fikes, R., Hart, P.E., Nilsson, N.J.: Learning and executing generalized robot plans. Artificial Intelligence 3, 251–288 (1972)
Bylander, T.: The computational complexity of propositional STRIPS planning. Artificial Intelligence 69, 165–204 (1994)
Biba, K.: Integrity considerations for secure computer systems. MTR-3153, MITRE Corp (1977)
Denning, D.: A lattice model of secure information flow. Communications of the ACM 19, 236–243 (1976)
Bell, D.: Secure computer systems: A refinement of the mathematical model. MTR-2547, MITRE Corp., vol. III (1974)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lelarge, M., Liu, Z., Riabov, A.V. (2006). Automatic Composition of Secure Workflows. In: Yang, L.T., Jin, H., Ma, J., Ungerer, T. (eds) Autonomic and Trusted Computing. ATC 2006. Lecture Notes in Computer Science, vol 4158. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11839569_31
Download citation
DOI: https://doi.org/10.1007/11839569_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-38619-3
Online ISBN: 978-3-540-38622-3
eBook Packages: Computer ScienceComputer Science (R0)