Intruder deducibility constraints with negation. Decidability and application to secured service compositions

DOI10.1016/j.jsc.2016.07.008zbMath1356.68012arXiv1207.4871OpenAlexW2132938106MaRDI QIDQ507348

Yannick Chevalier, Mathieu Turuani, Tigran Avanesov, Michaël Rusinowitch

Publication date: 6 February 2017

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1207.4871

zbMATH Keywords

synthesisformal methodscryptographic protocolsautomated verificationweb servicesorchestrationsecurity policydeducibility constraintsseparation of duty

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62) Internet topics (68M11)

Cites Work

• Unnamed Item
• Deciding knowledge in security protocols under equational theories
• Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
• Deciding security properties for cryptographic protocols. application to key cycles
• Trust and Norms in the Context of Computer Security: A Logical Formalization
• The CL-Atse Protocol Analyser
• A logic of trust and reputation
• On the security of public key protocols
• Towards an Integrated Formal Analysis for Security and Trust
• Automatic recognition of tractability in inference relations