Distributed access-rights management with delegation certificates
Secure Internet programming
Constraint solving for bounded-process cryptographic protocol analysis
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Mechanized proofs for a recursive authentication protocol
CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
Protocol Insecurity with Finite Number of Sessions is NP-Complete
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
Towards provable security for ad hoc routing protocols
Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor networks
Selecting theories and recursive protocols
CONCUR 2005 - Concurrency Theory
Ariadne: a secure on-demand routing protocol for ad hoc networks
Wireless Networks
Deciding knowledge in security protocols under equational theories
Theoretical Computer Science - Automated reasoning for security protocol analysis
Proceedings of the 6th ACM workshop on Formal methods in security engineering
Decidable Analysis for a Class of Cryptographic Group Protocols with Unbounded Lists
CSF '09 Proceedings of the 2009 22nd IEEE Computer Security Foundations Symposium
Deciding security properties for cryptographic protocols. application to key cycles
ACM Transactions on Computational Logic (TOCL)
On the automatic analysis of recursive security protocols with XOR
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
The AVISPA tool for the automated validation of internet security protocols and applications
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Key agreement in ad hoc networks
Computer Communications
Analysing routing protocols: four nodes topologies are sufficient
POST'12 Proceedings of the First international conference on Principles of Security and Trust
Hi-index | 0.00 |
Security protocols aim at securing communications over public networks. Their design is notoriously difficult and error-prone. Formal methods have shown their usefulness for providing a careful security analysis in the case of standard authentication and confidentiality protocols. However, most current techniques do not apply to protocols that perform recursive computation e.g. on a list of messages received from the network. While considering general recursive input/output actions very quickly yields undecidability, we focus on protocols that perform recursive tests on received messages but output messages that depend on the inputs in a standard way. This is in particular the case of secured routing protocols, distributed right delegation or PKI certification paths. We provide NPTIME decision procedures for protocols with recursive tests and for a bounded number of sessions. We also revisit constraint system solving, providing a complete symbolic representation of the attacker knowledge.