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 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… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 130 CITATIONS

Bounded Memory Protocols and Progressing Collaborative Systems

VIEW 10 EXCERPTS
CITES METHODS, BACKGROUND & RESULTS
HIGHLY INFLUENCED

Bounded Memory Dolev-Yao Adversaries in Collaborative Systems

  • Formal Aspects in Security and Trust
  • 2010
VIEW 10 EXCERPTS
CITES BACKGROUND, RESULTS & METHODS
HIGHLY INFLUENCED

State and Progress in Strand Spaces: Proving Fair Exchange

  • Journal of Automated Reasoning
  • 2010
VIEW 5 EXCERPTS
CITES BACKGROUND, METHODS & RESULTS
HIGHLY INFLUENCED

COMPLIANCE , CONFIDENTIALITY AND COMPLEXITY IN COLLABORATIVE SYSTEMS

VIEW 8 EXCERPTS
CITES RESULTS, METHODS & BACKGROUND
HIGHLY INFLUENCED

Policy Compliance in Collaborative Systems

  • 2009 22nd IEEE Computer Security Foundations Symposium
  • 2009
VIEW 7 EXCERPTS
CITES RESULTS, METHODS & BACKGROUND
HIGHLY INFLUENCED

Secrecy for Bounded Security Protocols: Disequality Tests and an Intruder with Existentials Lead to Undecidability

  • 2009 Fourth Balkan Conference in Informatics
  • 2009
VIEW 9 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

2002
2019

CITATION STATISTICS

  • 29 Highly Influenced Citations

References

Publications referenced by this paper.
SHOWING 1-10 OF 65 REFERENCES

In Proceedings of the 14th Computer Security Foundations Workshop

M. Rusinowitch, M. Turuani. Protocol insecurity with nite number of s np-complete
  • pages 174{187, Cape Breton, Nova Scotia, Canada,
  • 2001
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

1999

N. Durgin, P. Lincoln, J. Mitchell, A. Scedrov. Undecidability of bounded security protocols
  • N. Heintze and E. Clarke, editors, Proceedings of the Workshop on Formal Methods and Security Protocols | FMSP, Trento, Italy, July
  • 1999
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Complexity and expressive power of logic programming

  • Proceedings of Computational Complexity. Twelfth Annual IEEE Conference
  • 1997
VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

On the security of public key protocols

  • 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)
  • 1981
VIEW 12 EXCERPTS
HIGHLY INFLUENTIAL

editor

I. Cervesato. The Dolev-Yao intruder is the most powe Halpern
  • Proceedings of the Sixteenth Annual Symposium on Logic in Computer Science | LICS'01, Boston, MA, 16{19 June
  • 2001
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

pages 342{354

A. K. Chandra, H. R. Lewis, J. A. Makowsky. Embedded implicational dependencies, their inference problem. In Conference Proceedings of th Computation
  • Milwaukee, Wisconsin, 11{13 May
  • 1981
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

editors

I. Cervesato, N. Durgin, +7 authors A. Yonezawa
  • Software Security { Theories and Systems. Mext-NSF-JSPS International Symposium, ISSS 2002, Revised Papers, volume 426, Tokyo, Japan, 8{10 November
  • 2003

A formal analysis of ome properties of kerberos 5 using MSR

  • Proceedings 15th IEEE Computer Security Foundations Workshop. CSFW-15
  • 2002
VIEW 2 EXCERPTS