Relational queries computable in polynomial time
Information and Control
Theoretical Computer Science
ACM Transactions on Computer Systems (TOCS)
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Programming by multiset transformation
Communications of the ACM
Automatic recognition of tractability in inference relations
Journal of the ACM (JACM)
A Model for Secure Protocols and Their Compositions
IEEE Transactions on Software Engineering
Foundations of programming languages
Foundations of programming languages
A calculus for cryptographic protocols
Information and Computation
Using encryption for authentication in large networks of computers
Communications of the ACM
Inductive methods and contract-signing protocols
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Introduction to the Theory of Computation
Introduction to the Theory of Computation
On the symbolic reduction of processes with cryptographic functions
Theoretical Computer Science
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
Analyzing the Needham-Schroeder Public-Key Protocol: A Comparison of Two Approaches
ESORICS '96 Proceedings of the 4th European Symposium on Research in Computer Security: Computer Security
PROCOMET '98 Proceedings of the IFIP TC2/WG2.2,2.3 International Conference on Programming Concepts and Methods
Finite-State Analysis of Security Protocols
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
From Petri Nets to Linear Logic
Category Theory and Computer Science
Decision Problems for Semi-Thue Systems with a Few Rules
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Complexity and Expressive Power of Logic Programming
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Modelling and verifying key-exchange protocols using CSP and FDR
CSFW '95 Proceedings of the 8th IEEE workshop on Computer Security Foundations
Mechanized proofs for a recursive authentication protocol
CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
Proving Properties of Security Protocols by Induction
CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
Efficient Finite-State Analysis for Large 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
Athena: a New Efficient Automatic Checker for Security Protocol Analysis
CSFW '99 Proceedings of the 12th 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
A Formal Analysis of Some Properties of Kerberos 5 Using MSR
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Embedded implicational dependencies and their inference problem
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
The Dolev-Yaho Intruder is the Most Powerful Attacker
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Protocol Insecurity with Finite Number of Sessions is NP-Complete
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
A Semantic Model for Authentication Protocols
SP '93 Proceedings of the 1993 IEEE Symposium on Security and Privacy
SP '96 Proceedings of the 1996 IEEE Symposium on Security and Privacy
Automated analysis of cryptographic protocols using Mur/spl phi/
SP '97 Proceedings of the 1997 IEEE Symposium on Security and Privacy
A comparison between strand spaces and multiset rewriting for security protocol analysis
ISSS'02 Proceedings of the 2002 Mext-NSF-JSPS international conference on Software security: theories and systems
Specifying Kerberos 5 cross-realm authentication
WITS '05 Proceedings of the 2005 workshop on Issues in the theory of security
Security analysis of network protocols: logical and computational methods
PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
A comparison between strand spaces and multiset rewriting for security protocol analysis
Journal of Computer Security
Theoretical Computer Science - Automated reasoning for security protocol analysis
Transducer-based analysis of cryptographic protocols
Information and Computation
Symbolic protocol analysis for monoidal equational theories
Information and Computation
Breaking and fixing public-key Kerberos
Information and Computation
Rule-based static analysis of network protocol implementations
Information and Computation
Modular Preservation of Safety Properties by Cookie-Based DoS-Protection Wrappers
FMOODS '08 Proceedings of the 10th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
Secrecy for bounded security protocols with freshness check is NEXPTIME-complete
Journal of Computer Security
Complexity of Checking Freshness of Cryptographic Protocols
ICISS '08 Proceedings of the 4th International Conference on Information Systems Security
Cryptographic Protocol Composition via the Authentication Tests
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Automatic verification of correspondences for security protocols
Journal of Computer Security
Relating state-based and process-based concurrency through linear logic (full-version)
Information and Computation
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
Analysing the Vulnerability of Protocols to Produce Known-pair and Chosen-text Attacks
Electronic Notes in Theoretical Computer Science (ENTCS)
Completeness and Counter-Example Generations of a Basic Protocol Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
Approximation-based tree regular model-checking
Nordic Journal of Computing
Searching for shapes in cryptographic protocols
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Breaking and fixing public-key Kerberos
ASIAN'06 Proceedings of the 11th Asian computing science conference on Advances in computer science: secure software and related issues
Model-checking DoS amplification for VoIP session initiation
ESORICS'09 Proceedings of the 14th European conference on Research in computer security
Formal security analysis of PKCS#11 and proprietary extensions
Journal of Computer Security - 7th International Workshop on Issues in the Theory of Security (WITS'07)
Collaborative Planning with Confidentiality
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
Rethinking about guessing attacks
Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security
Programming cryptographic protocols
TGC'05 Proceedings of the 1st international conference on Trustworthy global computing
An introduction to security API analysis
Foundations of security analysis and design VI
State and Progress in Strand Spaces: Proving Fair Exchange
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
On the Complexity of Linear Authorization Logics
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Completeness of the authentication tests
ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security
A general proof system for modalities in concurrent constraint programming
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Establishing and preserving protocol security goals
Journal of Computer Security - Foundational Aspects of Security
Efficient construction of machine-checked symbolic protocol security proofs
Journal of Computer Security
| Hi-index | 0.00 |
We formalize the Dolev-Yao model of security protocols, using a notation based on multiset rewriting with existentials. The goals are to provide a simple formal notation for describing security protocols, to formalize the assumptions of the Dolev-Yao model using this notation, and to analyze the complexity of the secrecy problem under various restrictions. We prove that, even for the case where we restrict the size of messages and the depth of message encryption, the secrecy problem is undecidable for the case of an unrestricted number of protocol roles and an unbounded number of new nonces. We also identify several decidable classes, including a DEXP-complete class when the number of nonces is restricted, and an NP-complete class when both the number of nonces and the number of roles is restricted. We point out a remaining open complexity problem, and discuss the implications these results have on the general topic of protocol analysis.