skip to main content
10.1145/2422498.2422508acmconferencesArticle/Chapter ViewAbstractPublication PagesmodelsConference Proceedingsconference-collections
research-article

A tool for the synthesis of cryptographic orchestrators

Authors Info & Claims
Published:01 October 2012Publication History

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.

References

  1. PaMoChSA 2012. http://www.iit.cnr.it/staff/vincenzo.ciancia/tools.html.Google ScholarGoogle Scholar
  2. H. R. Andersen. Partial model checking. In LICS, page 398. IEEE, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  4. J. Li, M. Yarvis, and P. Reiher. Securing distributed adaptation. Computer Networks, 38(3), 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 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 ScholarGoogle Scholar
  6. J. A. Martín, F. Martinelli, and E. Pimentel. Synthesis of secure adaptors. J. Log. Algebr. Program., 81(2):99--126, 2012.Google ScholarGoogle ScholarCross RefCross Ref
  7. J. A. Martín and E. Pimentel. Contracts for security adaptation. J. Log. Algebr. Program., 80(3--5):154--179, 2011.Google ScholarGoogle ScholarCross RefCross Ref
  8. F. Martinelli. Analysis of security protocols as open systems. TCS, 290(1):1057--1106, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. F. Martinelli and I. Matteucci. A framework for automatic generation of security controller. STVR, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. F. Martinelli, M. Petrocchi, and A. Vaccarelli. Automated analysis of some security mechanisms of SCEP. In ISC, pages 414--427. Springer, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. R. Milner. Communication and concurrency. Prentice-Hall, 1989. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. C. Stirling. Modal and temporal logics for processes. In Logics for Concurrency: Structures versus Automata, pages 149--237, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  14. L. Viganò. Automated security protocol analysis with the AVISPA tool. ENTCS, 155:69--86, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. A tool for the synthesis of cryptographic orchestrators

              Recommendations

              Comments

              Login options

              Check if you have access through your login credentials or your institution to get full access on this article.

              Sign in
              • Published in

                cover image ACM Conferences
                MDsec '12: Proceedings of the Workshop on Model-Driven Security
                October 2012
                57 pages
                ISBN:9781450318068
                DOI:10.1145/2422498

                Copyright © 2012 ACM

                Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

                Publisher

                Association for Computing Machinery

                New York, NY, United States

                Publication History

                • Published: 1 October 2012

                Permissions

                Request permissions about this article.

                Request Permissions

                Check for updates

                Qualifiers

                • research-article

              PDF Format

              View or Download as a PDF file.

              PDF

              eReader

              View online with eReader.

              eReader