String rewriting and security analysis: an extension of a result of Book and Otto

Siva Anantharaman 1 Paliath Narendran 2 Michael Rusinowitch 3
3 CASSIS - Combination of approaches to the security of infinite states systems
FEMTO-ST - Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174), Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
Abstract : In their seminal work Dolev and Yao used string rewriting to check protocol security against an active intruder. The main technical result and algorithm were improved by Book and Otto who formulated the security check in terms of an extended word problem for cancellation rules. We extend their main decidability result to a larger class of string rewrite systems called opt-monadic systems.
Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00659009
Contributor : Siva Anantharaman <>
Submitted on : Wednesday, January 11, 2012 - 5:58:18 PM
Last modification on : Thursday, June 27, 2019 - 1:24:46 AM

Identifiers

  • HAL Id : hal-00659009, version 1

Citation

Siva Anantharaman, Paliath Narendran, Michael Rusinowitch. String rewriting and security analysis: an extension of a result of Book and Otto. Journal of Automata Languages and Combinatorics, Otto-von-Guericke-Universität Magdeburg, 2012, 16 (2--4), pp.83--98. ⟨hal-00659009⟩

Share

Metrics

Record views

462