Casper: a compiler for the analysis of security protocols
Journal of Computer Security
The inductive approach to verifying cryptographic protocols
Journal of Computer Security
A Method for Automatic Cryptographic Protocol Verification
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
On the Reachability Problem in Cryptographic Protocols
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
PROCOMET '98 Proceedings of the IFIP TC2/WG2.2,2.3 International Conference on Programming Concepts and Methods
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
Towards a Completeness Result for Model Checking of Security Protocols
CSFW '98 Proceedings of the 11th IEEE workshop on Computer Security Foundations
A Meta-Notation for Protocol Analysis
CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
Towards Automatic Verification of Authentication Protocols on an Unbounded Network
CSFW '00 Proceedings of the 13th IEEE workshop on Computer Security Foundations
Optimizing Protocol Rewrite Rules of CIL Specifications
CSFW '00 Proceedings of the 13th IEEE workshop on Computer Security Foundations
Automated analysis of cryptographic protocols using Mur/spl phi/
SP '97 Proceedings of the 1997 IEEE Symposium on Security and Privacy
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
Constraint solving for bounded-process cryptographic protocol analysis
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Experimenting with STA, a tool for automatic analysis of security protocols
Proceedings of the 2002 ACM symposium on Applied computing
On the symbolic reduction of processes with cryptographic functions
Theoretical Computer Science
A Framework for the Analysis of Security Protocols
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
On Name Generation and Set-Based Analysis in the Dolev-Yao Model
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
On the Decidability of Cryptographic Protocols with Open-Ended Data Structures
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Proof Theory, Transformations, and Logic Programming for Debugging Security Protocols
LOPSTR '01 Selected papers from the 11th International Workshop on Logic Based Program Synthesis and Transformation
An Improved Constraint-Based System for the Verification of Security Protocols
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
Protocol Engineering Applied to Formal Analysis of Security Systems
InfraSec '02 Proceedings of the International Conference on Infrastructure Security
Automated Unbounded Verification of Security Protocols
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Protocol insecurity with a finite number of sessions and composed keys is NP-complete
Theoretical Computer Science
Strategy for Verifying Security Protocols with Unbounded Message Size
Automated Software Engineering
Security properties: two agents are sufficient
Science of Computer Programming - Special issue on 12th European symposium on programming (ESOP 2003)
Multiset rewriting and the complexity of bounded security protocols
Journal of Computer Security
A decision procedure for the verification of security protocols with explicit destructors
Proceedings of the 11th ACM conference on Computer and communications security
Tree automata with one memory set constraints and cryptographic protocols
Theoretical Computer Science - Automata, languages and programming
An NP decision procedure for protocol insecurity with XOR
Theoretical Computer Science
Symbolic protocol analysis with an Abelian group operator or Diffie-Hellman exponentiation
Journal of Computer Security
Verification of cryptographic protocols: tagging enforces termination
Theoretical Computer Science - Foundations of software science and computation structures
Intruder deduction for the equational theory of Abelian groups with distributive encryption
Information and Computation
Higher-Order and Symbolic Computation
A survey of algebraic properties used in cryptographic protocols
Journal of Computer Security
Electronic Notes in Theoretical Computer Science (ENTCS)
Explicit Randomness is not Necessary when Modeling Probabilistic Encryption
Electronic Notes in Theoretical Computer Science (ENTCS)
Computational Soundness of Symbolic Analysis for Protocols Using Hash Functions
Electronic Notes in Theoretical Computer Science (ENTCS)
Transducer-based analysis of cryptographic protocols
Information and Computation
Hierarchical combination of intruder theories
Information and Computation
ACM Transactions on Computational Logic (TOCL)
ACM Transactions on Computational Logic (TOCL)
Towards an Automatic Analysis of Web Service Security
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Challenges in the Automated Verification of Security Protocols
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Rewriting Techniques in the Constraint Solver
Electronic Notes in Theoretical Computer Science (ENTCS)
Validating Integrity for the Ephemerizer's Protocol with CL-Atse
Formal to Practical Security
A Decision Procedure for Structured Cryptographic Protocols
Proceedings of the 2006 conference on New Trends in Software Methodologies, Tools and Techniques: Proceedings of the fifth SoMeT_06
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
Protocol Security and Algebraic Properties: Decision Results for a Bounded Number of Sessions
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)
A Graphical User Interface for Maude-NPA
Electronic Notes in Theoretical Computer Science (ENTCS)
Satisfiability of Dolev-Yao Constraints
Electronic Notes in Theoretical Computer Science (ENTCS)
Deciding the Security of Protocols with Commuting Public Key Encryption
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Analysing the Vulnerability of Protocols to Produce Known-pair and Chosen-text Attacks
Electronic Notes in Theoretical Computer Science (ENTCS)
Approximation-based tree regular model-checking
Nordic Journal of Computing
Symbolic protocol analysis in the union of disjoint intruder theories: Combining decision procedures
Theoretical Computer Science
Verification of cryptographic Protocols: tagging enforces termination
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Applying SDL to formal analysis of security systems
SDL'03 Proceedings of the 11th international conference on System design
Associative-commutative deducibility constraints
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Security properties: two agents are sufficient
ESOP'03 Proceedings of the 12th European conference on Programming
Pattern-based abstraction for verifying secrecy in protocols
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Verifying cryptographic protocols with subterms constraints
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Bounding messages for free in 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
Cryptographic protocol verification using tractable classes of horn clauses
Program analysis and compilation, theory and practice
A generic security API for symmetric key management on cryptographic devices
ESORICS'09 Proceedings of the 14th European conference on Research in computer security
Complexity of fairness constraints for the Dolev-Yao attacker model
Proceedings of the 2011 ACM Symposium on Applied Computing
Deciding security for protocols with recursive tests
CADE'11 Proceedings of the 23rd international conference on Automated deduction
Trace equivalence decision: negative tests and non-determinism
Proceedings of the 18th ACM conference on Computer and communications security
From security protocols to systems security
Proceedings of the 11th international conference on Security Protocols
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Decidability of Equivalence of Symbolic Derivations
Journal of Automated Reasoning
Handling algebraic properties in automatic analysis of security protocols
ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing
Computationally sound, automated proofs for security protocols
ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
Completing the picture: soundness of formal encryption in the presence of active adversaries
ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
Hierarchical combination of intruder theories
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Automating security analysis: symbolic equivalence of constraint systems
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
ASLan++ -- a formal security specification language for distributed systems
FMCO'10 Proceedings of the 9th international conference on Formal Methods for Components and Objects
Orchestration under security constraints
FMCO'10 Proceedings of the 9th international conference on Formal Methods for Components and Objects
Formal analysis of CWA 14890-1
CARDIS'11 Proceedings of the 10th IFIP WG 8.8/11.2 international conference on Smart Card Research and Advanced Applications
Analysing routing protocols: four nodes topologies are sufficient
POST'12 Proceedings of the First international conference on Principles of Security and Trust
Deducibility constraints, equational theory and electronic money
Rewriting Computation and Proof
ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security
Towards the orchestration of secured services under non-disclosure policies
MMM-ACNS'12 Proceedings of the 6th international conference on Mathematical Methods, Models and Architectures for Computer Network Security: computer network security
Sessions and separability in security protocols
POST'13 Proceedings of the Second international conference on Principles of Security and Trust
Establishing and preserving protocol security goals
Journal of Computer Security - Foundational Aspects of Security
| Hi-index | 0.00 |
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 in a Dolev-Yao model of intruders. The result does not assume a limit on the size of messages and supports nonatomic 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 polynomial size, provided that they are represented as dags.