Typed Multiset Rewriting Specifications of Security Protocols

@article{Cervesato2000TypedMR,
  title={Typed Multiset Rewriting Specifications of Security Protocols},
  author={Iliano Cervesato},
  journal={Electr. Notes Theor. Comput. Sci.},
  year={2000},
  volume={40},
  pages={8-51}
}
The language MSR has successfully been used in the past to prove undecidability results about security protocols modeled according to the Dolev-Yao abstraction. In this paper, we revise this formalism into a flexible specification framework for complex crypto-protocols. More specifically, we equip it with an extensible typing infrastructure based on dependent types with subsorting, which elegantly captures and enforces basic relations among objects, such as between a public key and its inverse… CONTINUE READING
Highly Cited
This paper has 32 citations. REVIEW CITATIONS
23 Citations
19 References
Similar Papers

Citations

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

References

Publications referenced by this paper.
Showing 1-10 of 19 references

Undecidability of bounded security protocols

  • Nancy Durgin, Patrick Lincoln, John Mitchell, Andre Scedrov
  • Proceedings of the Workshop on Formal Methods and…
  • 1999
Highly Influential
8 Excerpts

Authentication tests and the normal, efficient penetrator

  • Joshua Guttman, Javier Thayer Fábrega
  • Theoretical Computer Science,
  • 2001
2 Excerpts

Interpreting strands in linear logic

  • Iliano Cervesato, Nancy A. Durgin, Max Kanovich, Andre Scedrov
  • Workshop on Formal Methods and Computer Security…
  • 2000
4 Excerpts

Key management for large dynamic groups: One-way function trees and amortized initialization. Internet Draft (work in progres), draft-irtf-smug-groupkeymgmt-oft-00.txt, Internet Engineering

  • David Balenson, David McGrew, Alan Sherman
  • Task Force (August
  • 2000
1 Excerpt

Similar Papers

Loading similar papers…