A calculus of mobile processes, I
Information and Computation
The computer for the 21st century
Human-computer interaction
Coloured Petri nets (2nd ed.): basic concepts, analysis methods and practical use: volume 1
Coloured Petri nets (2nd ed.): basic concepts, analysis methods and practical use: volume 1
Service Advertisement and Discovery: Enabling Universal Device Cooperation
IEEE Internet Computing
Safe, Untrusted Agents Using Proof-Carrying Code
Mobile Agents and Security
Coding Mobile Synchronizing Petri Nets into Rewriting Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
On the Expressiveness of Mobile Synchronizing Petri Nets
Electronic Notes in Theoretical Computer Science (ENTCS)
Mobile Synchronizing Petri Nets: A Choreographic Approach for Coordination in Ubiquitous Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Executing transactions in zero-safe nets
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
A calculus for trust management
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Symbolic semantics for the verification of security properties of mobile petri nets
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Hi-index | 0.00 |
Transient Secure Association has been widely accepted as a possible alternative to traditional authentication in the context of Ubiquitous Computing. We develop a formal model for the Resurrecting Duckling Policy that implements it, called TSA systems, which is based on Petri Nets, thus obtaining amenable graphical representations of our systems. We prove that TSA specifications have the same expressive power as P/T nets, so that coverability, that can be used to specify security properties, is decidable for TSA systems. Then we address the problem of implementing TSA systems with a lower level model that only relies on the secure exchange of keys. If we view these systems as closed then our implementation is still equivalent to P/T nets. However, if we consider an open framework then we need a mechanism of fresh name creation to get a correct implementation. This last model is not equivalent to P/T nets, but the coverability problem is still decidable for them.