Protocol insecurity with a finite number of sessions and composed keys is NP-complete

Authors:
Michaël Rusinowitch;Mathieu Turuani
Affiliations:
LORIA-INRIA, Université Henri Poincaré, 54506 Vandoeuvre-les-Nancy Cedex, France and INRIA, Lorraine Technopole de Nancy-Brabois, 615, r. Jardin Botanique, B.P. 101 Campus Scientifique, ...;LORIA-INRIA, Université Henri Poincaré, 54506 Vandoeuvre-les-Nancy Cedex, France
Venue:
Theoretical Computer Science
Year:
2003

Citing 15
Cited 44

Casper: a compiler for the analysis of security protocols

Journal of Computer Security
The inductive approach to verifying cryptographic protocols

Journal of Computer Security
Constraint solving for bounded-process cryptographic protocol analysis

CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
A Method for Automatic Cryptographic Protocol Verification

IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Using state space exploration and a natural deduction style message derivation engine to verify security protocols

PROCOMET '98 Proceedings of the IFIP TC2/WG2.2,2.3 International Conference on Programming Concepts and Methods
Automated Unbounded Verification of Security Protocols

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Lazy Infinite-State Analysis of Security Protocols

Proceedings of the International Exhibition and Congress on Secure Networking - CQRE (Secure) '99
Modelling and verifying key-exchange protocols using CSP and FDR

CSFW '95 Proceedings of the 8th IEEE workshop on Computer Security Foundations
Verifying authentication protocols with CSP

CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
Towards the Formal Verification of Electronic Commerce Protocols

CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
A Meta-Notation for Protocol Analysis

CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
A Tool for Lazy Verification of Security Protocols

Proceedings of the 16th IEEE international conference on Automated software engineering
Protocol Insecurity with Finite Number of Sessions is NP-Complete

CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
On the security of public key protocols

On the security of public key protocols
Compiling and verifying security protocols

LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning

Decidability of context-explicit security protocols

Journal of Computer Security - Special issue on WITS'03
A method for symbolic analysis of security protocols

Theoretical Computer Science
Deciding knowledge properties of security protocols

TARK '05 Proceedings of the 10th conference on Theoretical aspects of rationality and knowledge
Selecting theories and recursive protocols

CONCUR 2005 - Concurrency Theory
Constraint solving for contract-signing protocols

CONCUR 2005 - Concurrency Theory
Note: An undecidability result for AGh

Theoretical Computer Science
A (restricted) quantifier elimination for security protocols

Theoretical Computer Science - Automated reasoning for security protocol analysis
Symbolic protocol analysis for monoidal equational theories

Information and Computation
Combining Algorithms for Deciding Knowledge in Security Protocols

FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
From One Session to Many: Dynamic Tags for Security Protocols

LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Complexity of Checking Freshness of Cryptographic Protocols

ICISS '08 Proceedings of the 4th International Conference on Information Systems 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
Verification of Security Protocols with a Bounded Number of Sessions Based on Resolution for Rigid Variables

Formal to Practical Security
Automatic verification of correspondences for security protocols

Journal of Computer Security
Computing Knowledge in Security Protocols under Convergent Equational Theories

CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Deciding security properties for cryptographic protocols. application to key cycles

ACM Transactions on Computational Logic (TOCL)
Correcting and Improving the NP Proof for Cryptographic Protocol Insecurity

ICISS '09 Proceedings of the 5th International Conference on Information Systems Security
Satisfiability of Dolev-Yao Constraints

Electronic Notes in Theoretical Computer Science (ENTCS)
Automated Security Protocol Analysis With the AVISPA Tool

Electronic Notes in Theoretical Computer Science (ENTCS)
Deciding strategy properties of contract-signing protocols

ACM Transactions on Computational Logic (TOCL)
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
Safely composing security protocols

FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
A DEXPTIME-complete Dolev-Yao theory with distributive encryption

MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Multi-Attacker Protocol Validation

Journal of Automated Reasoning
Bounded memory Dolev-Yao adversaries in collaborative systems

FAST'10 Proceedings of the 7th International conference on Formal aspects of security and trust
Deciding key cycles for security protocols

LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Computationally sound symbolic secrecy in the presence of hash functions

FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Symbolic protocol analysis in presence of a homomorphism operator and exclusive or

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Relating two standard notions of secrecy

CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Computing Knowledge in Security Protocols Under Convergent Equational Theories

Journal of Automated Reasoning
Deducibility constraints

ASIAN'09 Proceedings of the 13th Asian conference on Advances in Computer Science: information Security and Privacy
A dolev-yao model for zero knowledge

ASIAN'09 Proceedings of the 13th Asian conference on Advances in Computer Science: information Security and Privacy
Recursion versus replication in simple cryptographic protocols

SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Deciding properties of contract-signing protocols

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Regular protocols and attacks with regular knowledge

CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Monotonic set-extended prefix rewriting and verification of recursive ping-pong protocols

ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Secure composition of protocols

TOSCA'11 Proceedings of the 2011 international conference on Theory of Security and Applications
Decidability and Combination Results for Two Notions of Knowledge in Security Protocols

Journal of Automated Reasoning
Security protocol verification: symbolic and computational models

POST'12 Proceedings of the First international conference on Principles of Security and Trust
Diffie-Hellman without difficulty

FAST'11 Proceedings of the 8th international conference on Formal Aspects of Security and Trust
Timed protocol insecurity problem is NP-complete

Future Generation Computer Systems
Lazy mobile intruders

POST'13 Proceedings of the Second international conference on Principles of Security and Trust
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	5.23

Visualization

Abstract

We investigate the complexity of the protocol insecurity problem for a finite number of sessions (fixed number of interleaved runs). We show that this problem is NP-complete with respect to a Dolev-Yao model of intruders. The result does not assume a limit on the size of messages and supports non-atomic symmetric encryption keys. We also prove that in order to build an attack with a fixed number of sessions the intruder needs only to forge messages of linear size, provided that they are represented as dags.