New decidability results for fragments of first-order logic and application to cryptographic protocols

Authors:
Hubert Comon-Lundh;Véronique Cortier
Affiliations:
Laboratoire Spécification et Vérification, CNRS, Ecole Normale Supérieure de Cachan, France;Laboratoire Spécification et Vérification, CNRS, Ecole Normale Supérieure de Cachan, France
Venue:
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Year:
2003

Citing 16
Cited 31

Automatic recognition of tractability in inference relations

Journal of the ACM (JACM)
An attack on a recursive authentication protocol. A cautionary tale

Information Processing Letters
Strand spaces: proving security protocols correct

Journal of Computer Security
The inductive approach to verifying cryptographic protocols

Journal of Computer 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
On Name Generation and Set-Based Analysis in the Dolev-Yao Model

CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Towards a Mechanization of Cryptographic Protocal Verification

CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Unification and Matching Modulo Nilpotence

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

Handbook of automated reasoning
Combining superposition, sorts and splitting

Handbook of automated reasoning
Intruder Deductions, Constraint Solving and Insecurity Decision in Presence of Exclusive or

LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
An NP Decision Procedure for Protocol Insecurity with XOR

LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Mechanized proofs for a recursive authentication protocol

CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
TAPS: A First-Order Verifier for Cryptographic Protocols

CSFW '00 Proceedings of the 13th 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
Security properties: two agents are sufficient

ESOP'03 Proceedings of the 12th European conference on Programming

Automatic verification of cryptographic protocols: a logic programming approach

Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Analyzing security protocols with secrecy types and logic programs

Journal of the ACM (JACM)
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
A method for symbolic analysis of security protocols

Theoretical Computer Science
Verification of cryptographic protocols: tagging enforces termination

Theoretical Computer Science - Foundations of software science and computation structures
A survey of algebraic properties used in cryptographic protocols

Journal of Computer Security
Selecting theories and nonce generation for recursive protocols

Proceedings of the 2007 ACM workshop on Formal methods in security engineering
Flat and one-variable clauses: Complexity of verifying cryptographic protocols with single blind copying

ACM Transactions on Computational Logic (TOCL)
Interpretation functions-based method to verify secrecy under equational theories

TELE-INFO'08 Proceedings of the 7th WSEAS International Conference on Telecommunications and Informatics
Reducing protocol analysis with XOR to the XOR-free case in the horn theory based approach

Proceedings of the 15th ACM conference on Computer and communications security
Safely composing security protocols

Formal Methods in System Design
Verification of Security Protocols

VMCAI '09 Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation
Secrecy of cryptographic protocols under equational theory

Knowledge-Based Systems
Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case

RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Deciding security properties for cryptographic protocols. application to key cycles

ACM Transactions on Computational Logic (TOCL)
Satisfiability of Dolev-Yao Constraints

Electronic Notes in Theoretical Computer Science (ENTCS)
Towards a unified model of search in theorem-proving: subgoal-reduction strategies

Journal of Symbolic Computation
On the automatic analysis of recursive security protocols with XOR

STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Automatic analysis of the security of XOR-based key management schemes

TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Cryptographic protocol verification using tractable classes of horn clauses

Program analysis and compilation, theory and practice
Reducing Protocol Analysis with XOR to the XOR-Free Case in the Horn Theory Based Approach

Journal of Automated Reasoning
Deciding key cycles for security protocols

LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Relating two standard notions of secrecy

CSL'06 Proceedings of the 20th international conference on Computer Science Logic
On the complexity of equational horn clauses

CADE' 20 Proceedings of the 20th international conference on Automated Deduction
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
Alternation in equational tree automata modulo XOR

FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Secure composition of protocols

TOSCA'11 Proceedings of the 2011 international conference on Theory of Security and Applications
Security protocol verification: symbolic and computational models

POST'12 Proceedings of the First international conference on Principles of Security and Trust
Synthesizing secure protocols

ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security
YAPA: A Generic Tool for Computing Intruder Knowledge

ACM Transactions on Computational Logic (TOCL)
From security protocols to pushdown automata

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a new extension of the Skolem class for first-order logic and prove its decidability by resolution techniques. We then extend this class including the built-in equational theory of exclusive or. Again, we prove the decidability of the class by resolution techniques. Considering such fragments of first-order logic is motivated by the automatic verification of cryptographic protocols, for an arbitrary number of sessions; the first-order formalization is an approximation of the set of possible traces, for instance relaxing the nonce freshness assumption. As a consequence, we get some new decidability results for the verification of cryptographic protocols with exclusive or.