Automatic recognition of tractability in inference relations
Journal of the ACM (JACM)
Constraint solving for bounded-process cryptographic protocol analysis
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Protocol Insecurity with Finite Number of Sessions is NP-Complete
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
Deciding security of protocols against off-line guessing attacks
Proceedings of the 12th ACM conference on Computer and communications security
A Logic for Constraint-based Security Protocol Analysis
SP '06 Proceedings of the 2006 IEEE Symposium on Security and Privacy
Deciding knowledge in security protocols under equational theories
Theoretical Computer Science - Automated reasoning for security protocol analysis
Infinite State AMC-Model Checking for Cryptographic Protocols
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Trust and Norms in the Context of Computer Security: A Logical Formalization
DEON '08 Proceedings of the 9th international conference on Deontic Logic in Computer Science
Automatic Composition of Services with Security Policies
SERVICES '08 Proceedings of the 2008 IEEE Congress on Services - Part I
On the Relative Soundness of the Free Algebra Model for Public Key Encryption
Electronic Notes in Theoretical Computer Science (ENTCS)
Secure service orchestration in open networks
Journal of Systems Architecture: the EUROMICRO Journal
Integrated Specification and Verification of Security Protocols and Policies
CSF '11 Proceedings of the 2011 IEEE 24th Computer Security Foundations Symposium
Towards an integrated formal analysis for security and trust
FMOODS'05 Proceedings of the 7th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Orchestration under security constraints
FMCO'10 Proceedings of the 9th international conference on Formal Methods for Components and Objects
Web services verification and prudent implementation
DPM'11 Proceedings of the 6th international conference, and 4th international conference on Data Privacy Management and Autonomous Spontaneus Security
TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
On the security of public key protocols
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
The problem of finding a mediator to compose secured services has been reduced in our former work to the problem of solving deducibility constraints similar to those employed for cryptographic protocol analysis. We extend in this paper the mediator synthesis procedure by a construction for expressing that some data is not accessible to the mediator. Then we give a decision procedure for verifying that a mediator satisfying this non-disclosure policy can be effectively synthesized. This procedure has been implemented in CL-AtSe, our protocol analysis tool. The procedure extends constraint solving for cryptographic protocol analysis in a significative way as it is able to handle negative deducibility constraints without restriction. In particular it applies to all subterm convergent theories and therefore covers several interesting theories in formal security analysis including encryption, hashing, signature and pairing.