Multiset Rewriting and the Complexity of Bounded Security Protocols
Abstract
We formalize the Dolev-Yao model of security protocols, using a notation based on multi-set 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.
Document Details
- Document Type
- Technical Report
- Publication Date
- Jun 06, 2003
- Accession Number
- ADA572223
Entities
People
- Andre Scedrov
- J. C. Mitchell
- N. A. Durgin
- P. D. Lincoln
Organizations
- Sandia National Laboratories