ABSTRACT
Security is one of the main challenges of service oriented computing. Services need to be loosely coupled, easily accessible and yet provide tight security guarantees enforced by cryptographic protocols. In this paper, we address how to automatically synthesize an orchestrator process able to guarantee the secure composition of electronic services, supporting different communication and cryptographic protocols. We present a theoretical model based on process algebra, partial model checking and logical satisfiability, plus an automated tool implementing the proposed theory.
- PaMoChSA 2012. http://www.iit.cnr.it/staff/vincenzo.ciancia/tools.html.Google Scholar
- H. R. Andersen. Partial model checking. In LICS, page 398. IEEE, 1995. Google ScholarDigital Library
- Y. Chevalier, M. A. Mekki, and M. Rusinowitch. Automatic composition of services with security policies. In SERVICES'08 - Part I, pages 529--537. IEEE, 2008. Google ScholarDigital Library
- J. Li, M. Yarvis, and P. Reiher. Securing distributed adaptation. Computer Networks, 38(3), 2002. Google ScholarDigital Library
- O. Maler, A. Pnueli, and J. Sifakis. On the synthesis of discrete controllers for timed systems. In STACS, volume 900 of LNCS, pages 229--242. Springer, 2005.Google Scholar
- J. A. Martín, F. Martinelli, and E. Pimentel. Synthesis of secure adaptors. J. Log. Algebr. Program., 81(2):99--126, 2012.Google ScholarCross Ref
- J. A. Martín and E. Pimentel. Contracts for security adaptation. J. Log. Algebr. Program., 80(3--5):154--179, 2011.Google ScholarCross Ref
- F. Martinelli. Analysis of security protocols as open systems. TCS, 290(1):1057--1106, 2003. Google ScholarDigital Library
- F. Martinelli and I. Matteucci. A framework for automatic generation of security controller. STVR, 2010. Google ScholarDigital Library
- F. Martinelli, M. Petrocchi, and A. Vaccarelli. Automated analysis of some security mechanisms of SCEP. In ISC, pages 414--427. Springer, 2002. Google ScholarDigital Library
- R. Milner. Communication and concurrency. Prentice-Hall, 1989. Google ScholarDigital Library
- C. Stirling. Modal and temporal logics for processes. In Logics for Concurrency: Structures versus Automata, pages 149--237, 1996. Google ScholarDigital Library
- R. S. Streett and E. A. Emerson. An automata theoretic decision procedure for the propositional mu-calculus. Information and Computation, 81(3):249--264, June 1989. Google ScholarDigital Library
- L. Viganò. Automated security protocol analysis with the AVISPA tool. ENTCS, 155:69--86, 2006. Google ScholarDigital Library
Index Terms
- A tool for the synthesis of cryptographic orchestrators
Recommendations
Automated Synthesis and Ranking of Secure BPMN Orchestrators
ARES '13: Proceedings of the 2013 International Conference on Availability, Reliability and SecurityWe describe a formal methodology for the automatic synthesis of a secure orchestrator for a set of BPMN processes. The synthesized orchestrator is able to guarantee that all the processes that are started reach their end, and the resulting orchestrator ...
Analysis of security protocols as open systems
We propose a methodology for the formal analysis of security protocols. This originates from the observation that the verification of security protocols can be conveniently treated as the verification of open systems, i.e. systems which may have ...
Automated Synthesis and Ranking of Secure BPMN Orchestrators
The authors describe a formal methodology for the automatic synthesis of a secure orchestrator for a set of BPMN processes. The synthesized orchestrator is able to guarantee that all the processes that are started reach their end, and the resulting ...
Comments