Secure information flow in a multi-threaded imperative language
POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The SLam calculus: programming with secrecy and integrity
POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An Axiomatic Approach to Information Flow in Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Communication and Concurrency
Noninterference for concurrent programs and thread systems
Theoretical Computer Science
Formal verification of standards for distance vector routing protocols
Journal of the ACM (JACM)
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
A framework for security analysis of mobile wireless networks
Theoretical Computer Science - Automated reasoning for security protocol analysis
Controlling information release in the π-calculus
Information and Computation
Adjustable Trust Model for Access Control
ATC '08 Proceedings of the 5th international conference on Autonomic and Trusted Computing
An Observational Theory for Mobile Ad Hoc Networks (full version)
Information and Computation
Mobility Models and Behavioural Equivalence for Wireless Networks
COORDINATION '09 Proceedings of the 11th International Conference on Coordination Models and Languages
Towards a Calculus For Wireless Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
A calculus for mobile ad hoc networks
COORDINATION'07 Proceedings of the 9th international conference on Coordination models and languages
A process calculus for mobile ad hoc networks
COORDINATION'08 Proceedings of the 10th international conference on Coordination models and languages
Decentralized trust management
SP'96 Proceedings of the 1996 IEEE conference on Security and privacy
Equational reasoning on ad hoc networks
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
A timed calculus for wireless systems
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
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
A calculus for trust management
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
| Hi-index | 0.00 |
We propose a process calculus for mobile ad hoc networks which embodies a behaviour-based multilevel decentralised trust model. Our trust model supports both direct trust, by monitoring nodes behaviour, and indirect trust, by collecting recommendations and spreading reputations. The operational semantics of the calculus is given in terms of a labelled transition system, where actions are executed at a certain security level. We define a labelled bisimilarity parameterised on security levels. Our bisimilarity is a congruence and an efficient proof method for an appropriate variant of barbed congruence, a standard contextually-defined program equivalence. Communications are proved safe with respect to the security levels of the involved parties. In particular, we ensure safety despite compromise: compromised nodes cannot affect the rest of the network. A non interference result expressed in terms of information flow is also proved.