2006
DOI: 10.7146/brics.v13i14.21919
|View full text |Cite
|
Sign up to set email alerts
|

Monotonic Set-Extended Prefix Rewriting and Verification of Recursive Ping-Pong Protocols

Abstract: Abstract. Ping-pong protocols with recursive definitions of agents, but without any active intruder, are a Turing powerful model. We show that under the environment sensitive semantics (i.e. by adding an active intruder capable of storing all exchanged messages including full analysis and synthesis of messages) some verification problems become decidable. In particular we give an algorithm to decide control state reachability, a problem related to security properties like secrecy and authenticity. The proof is… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Year Published

2011
2011
2011
2011

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
references
References 19 publications
0
0
0
Order By: Relevance