We describe a probabilistic polynomial-time process calculus for analyzing cryptographic protocols and use it to derive compositionality properties of protocols in the presence of ...
In this paper, we propose a novel ID-based secure distance bounding protocol. Unlike traditional secure distance measurement protocols, our protocol is based on standard insecure d...
The paper presents and compares Appia and Cactus, two frameworks for protocol composition. The comparison is based on the experience gained in implementing a faulttolerant Atomic ...
Building on the work of architectural description languages and aspect-oriented programming, we try to improve current visual component composition environments. In our , we intro...
This paper addresses the dynamic service selection and composition issues for the satisfaction of user requirements. We propose an approach in which agents perform service composi...