Challenges in the Automated Verification of Security Protocols

Authors:
Hubert Comon-Lundh
Affiliations:
Ecole Normale Supérieure de Cachan and, Research Center for Information Security, National Institute of Advanced, Industrial Science and Technology (AIST), Tokyo, Japan
Venue:
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Year:
2008

Citing 37
Cited 2

Automatic recognition of tractability in inference relations

Journal of the ACM (JACM)
An attack on the Needham-Schroeder public-key authentication protocol

Information Processing Letters
Towards a completeness result for model checking of security 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
Automated complexity analysis based on ordered resolution

Journal of the ACM (JACM)
Reconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption)

TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Towards an Automatic Analysis of Security Protocols in First-Order Logic

CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
Resolution decision procedures

Handbook of automated reasoning
An NP Decision Procedure for Protocol Insecurity with XOR

LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Narrowing terminates for encryption

CSFW '96 Proceedings of the 9th IEEE workshop on Computer Security Foundations
An Efficient Cryptographic Protocol Verifier Based on Prolog Rules

CSFW '01 Proceedings of the 14th 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
CDiff: a new reduction technique for constraint-based analysis of security protocols

Proceedings of the 10th ACM conference on Computer and communications security
Security properties: two agents are sufficient

Science of Computer Programming - Special issue on 12th European symposium on programming (ESOP 2003)
Tree automata with one memory set constraints and cryptographic protocols

Theoretical Computer Science - Automata, languages and programming
A resolution strategy for verifying cryptographic protocols with CBC encryption and blind signatures

PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
Deciding security of protocols against off-line guessing attacks

Proceedings of the 12th ACM conference on Computer and communications security
Symbolic protocol analysis with an Abelian group operator or Diffie-Hellman exponentiation

Journal of Computer Security
Coercion-Resistance and Receipt-Freeness in Electronic Voting

CSFW '06 Proceedings of the 19th IEEE workshop on Computer Security Foundations
Verification of cryptographic protocols: tagging enforces termination

Theoretical Computer Science - Foundations of software science and computation structures
Deciding knowledge in security protocols under equational theories

Theoretical Computer Science - Automated reasoning for security protocol analysis
A survey of algebraic properties used in cryptographic protocols

Journal of Computer Security
Symbolic protocol analysis for monoidal equational theories

Information and Computation
Joint State Theorems for Public-Key Encryption and Digital Signature Functionalities with Local Computation

CSF '08 Proceedings of the 2008 21st IEEE Computer Security Foundations Symposium
Combining Algorithms for Deciding Knowledge in Security Protocols

FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Deciding the Security of Protocols with Commuting Public Key Encryption

Electronic Notes in Theoretical Computer Science (ENTCS)
Easy intruder deduction problems with homomorphisms

Information Processing Letters
Deciding knowledge in security protocols for monoidal equational theories

LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Protocol verification via rigid/flexible resolution

LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Intruders with caps

RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Safely composing security protocols

FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Normal proofs in intruder theories

ASIAN'06 Proceedings of the 11th Asian computing science conference on Advances in computer science: secure software and related issues
Algebraic intruder deductions

LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Combining intruder theories

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
The finite variant property: how to get rid of some algebraic properties

RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Hierarchical combination of intruder theories

RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Deducibility constraints, equational theory and electronic money

Rewriting Computation and Proof

Locality Results for Certain Extensions of Theories with Bridging Functions

CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Automating security analysis: symbolic equivalence of constraint systems

IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

The application area of security protocols raises several problems that are relevant to automated deduction. We describe in this note some of these challenges.