Control flow analysis in scheme
PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
ACM Transactions on Computer Systems (TOCS)
A calculus of broadcasting systems
ESOP '94 Selected papers of ESOP '94, the 5th European symposium on Programming
A calculus for cryptographic protocols
Information and Computation
Strand spaces: proving security protocols correct
Journal of Computer Security
The inductive approach to verifying cryptographic protocols
Journal of Computer Security
Mobile values, new names, and secure communication
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Principles of Program Analysis
Principles of Program Analysis
Ariadne: a secure on-demand routing protocol for ad hoc networks
Proceedings of the 8th annual international conference on Mobile computing and networking
Securing ad hoc routing protocols
WiSE '02 Proceedings of the 1st ACM workshop on Wireless security
Formal verification of standards for distance vector routing protocols
Journal of the ACM (JACM)
A Secure Routing Protocol for Ad Hoc Networks
ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
Control Flow Analysis for the pi-calculus
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Flow logic: a multi-paradigmatic approach to static analysis
The essence of computation
A calculus for control flow analysis of security protocols
International Journal of Information Security - Special issue on security in global computing
Static validation of security protocols
Journal of Computer Security
The modelling and analysis of security protocols: the csp approach
The modelling and analysis of security protocols: the csp approach
Formal Security Analysis for Ad-Hoc Networks
Electronic Notes in Theoretical Computer Science (ENTCS)
A methodology for model-checking ad-hoc networks
SPIN'03 Proceedings of the 10th international conference on Model checking software
An Observational Theory for Mobile Ad Hoc Networks
Electronic Notes in Theoretical Computer Science (ENTCS)
Secure neighbor discovery in wireless networks: formal investigation of possibility
Proceedings of the 2008 ACM symposium on Information, computer and communications security
A theory of system behaviour in the presence of node and link failure
Information and Computation
Automated Evaluation of Secure Route Discovery in MANET Protocols
SPIN '08 Proceedings of the 15th international workshop on Model Checking Software
Towards provable secure neighbor discovery in wireless networks
Proceedings of the 6th ACM workshop on Formal methods in security engineering
Formal Models and Analysis of Secure Multicast in Wired and Wireless Networks
Journal of Automated Reasoning
An Observational Theory for Mobile Ad Hoc Networks (full version)
Information and Computation
Formal Aspects in Security and Trust
Computer Languages, Systems and Structures
A Calculus for Mobile Ad-hoc Networks with Static Location Binding
Electronic Notes in Theoretical Computer Science (ENTCS)
Verification of Correspondence Assertions in a Calculus for Mobile Ad Hoc Networks
Electronic Notes in Theoretical Computer Science (ENTCS)
Mobility Models and Behavioural Equivalence for Wireless Networks
COORDINATION '09 Proceedings of the 11th International Conference on Coordination Models and Languages
Approximation-based tree regular model-checking
Nordic Journal of Computing
An operational semantics for a calculus for wireless systems
Theoretical Computer Science
From Flow Logic to static type systems for coordination languages
Science of Computer Programming
A process calculus for Mobile Ad Hoc Networks
Science of Computer Programming
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
Depletable channels: dynamics and behaviour
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
A calculus for the analysis of wireless network security protocols
FAST'10 Proceedings of the 7th International conference on Formal aspects of security and trust
Formal Reasoning about Physical Properties of Security Protocols
ACM Transactions on Information and System Security (TISSEC)
A process calculus for dynamic networks
FMOODS'11/FORTE'11 Proceedings of the joint 13th IFIP WG 6.1 and 30th IFIP WG 6.1 international conference on Formal techniques for distributed systems
A timed calculus for wireless systems
Theoretical Computer Science
Broadcast psi-calculi with an application to wireless protocols
SEFM'11 Proceedings of the 9th international conference on Software engineering and formal methods
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
A calculus of trustworthy ad hoc networks
FAST'09 Proceedings of the 6th international conference on Formal Aspects in Security and Trust
Formal security analysis of Ariadne secure routing protocol using model checking
International Journal of Ad Hoc and Ubiquitous Computing
Observables for mobile and wireless broadcasting systems
COORDINATION'10 Proceedings of the 12th international conference on Coordination Models and Languages
A process algebra for wireless mesh networks
ESOP'12 Proceedings of the 21st European conference on Programming Languages and Systems
Analysing routing protocols: four nodes topologies are sufficient
POST'12 Proceedings of the First international conference on Principles of Security and Trust
A semantic analysis of wireless network security protocols
NFM'12 Proceedings of the 4th international conference on NASA Formal Methods
Modelling probabilistic wireless networks
FMOODS'12/FORTE'12 Proceedings of the 14th joint IFIP WG 6.1 international conference and Proceedings of the 32nd IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
Verification of ad hoc networks with node and communication failures
FMOODS'12/FORTE'12 Proceedings of the 14th joint IFIP WG 6.1 international conference and Proceedings of the 32nd IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
Topology-dependent abstractions of broadcast networks
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Broadcast abstraction in a stochastic calculus for mobile networks
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
Formal analysis of privacy for routing protocols in mobile ad hoc networks
POST'13 Proceedings of the Second international conference on Principles of Security and Trust
Internet of things: a process calculus approach
Proceedings of the 28th Annual ACM Symposium on Applied Computing
A semantic analysis of key management protocols for wireless sensor networks
Science of Computer Programming
Behavioural equivalences and interference metrics for mobile ad-hoc networks
Performance Evaluation
Hi-index | 0.00 |
We present a framework for specification and security analysis of communication protocols for mobile wireless networks. This setting introduces new challenges which are not being addressed by classical protocol analysis techniques. The main complication stems from the fact that the actions of intermediate nodes and their connectivity can no longer be abstracted into a single unstructured adversarial environment as they form an inherent part of the system's security. In order to model this scenario faithfully, we present a broadcast calculus which makes a clear distinction between the protocol processes and the network's connectivity graph, which may change independently from protocol actions. We identify a property characterising an important aspect of security in this setting and express it using behavioural equivalences of the calculus. We complement this approach with a control flow analysis which enables us to automatically check this property on a given network and attacker specification.