Intruder deducibility constraints with negation. Decidability and application to secured service compositions
- 1 May 2017
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 80, 4-26
Abstract
No abstract availableKeywords
All Related Versions
This publication has 8 references indexed in Scilit:
- Model checking authorization requirements in business processesComputers & Security, 2014
- Secure service orchestration in open networksJournal of Systems Architecture, 2011
- Deciding security properties for cryptographic protocols. application to key cyclesACM Transactions on Computational Logic, 2010
- A logic of trust and reputationLogic Journal of the IGPL, 2009
- Deciding knowledge in security protocols under equational theoriesTheoretical Computer Science, 2006
- Protocol insecurity with a finite number of sessions and composed keys is NP-completeTheoretical Computer Science, 2003
- Automatic recognition of tractability in inference relationsJournal of the ACM, 1993
- On the security of public key protocolsIEEE Transactions on Information Theory, 1983