Multiset rewriting and the complexity of bounded security protocols

@article{Durgin2004MultisetRA,
  title={Multiset rewriting and the complexity of bounded security protocols},
  author={Nancy A. Durgin and Patrick Lincoln and John C. Mitchell},
  journal={Journal of Computer Security},
  year={2004},
  volume={12},
  pages={247-311}
}
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… CONTINUE READING
Highly Influential
This paper has highly influenced 27 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 198 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 117 extracted citations

Secrecy for Security Protocols

Sci. Ann. Cuza Univ. • 2006
View 20 Excerpts
Highly Influenced

Bounded Memory Dolev-Yao Adversaries in Collaborative Systems

Formal Aspects in Security and Trust • 2010
View 10 Excerpts
Highly Influenced

State and Progress in Strand Spaces: Proving Fair Exchange

Journal of Automated Reasoning • 2010
View 5 Excerpts
Highly Influenced

Policy Compliance in Collaborative Systems

2009 22nd IEEE Computer Security Foundations Symposium • 2009
View 7 Excerpts
Highly Influenced

198 Citations

01020'02'05'09'13'17
Citations per Year
Semantic Scholar estimates that this publication has 198 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…