Další formáty:
BibTeX
LaTeX
RIS
@inproceedings{555143,
author = {Huttel, Hans and Srba, Jiří},
address = {Barcelona},
booktitle = {Proceedings of 4th International Workshop on Issues in the Theory of Security (WITS'04)},
keywords = {cryptographic protocols; automated verification; decidability},
language = {eng},
location = {Barcelona},
pages = {129-140},
publisher = {Peter Ryan},
title = {Recursive Ping-Pong Protocols},
url = {http://www.brics.dk/~srba/publ.html},
year = {2004}
}
TY - JOUR
ID - 555143
AU - Huttel, Hans - Srba, Jiří
PY - 2004
TI - Recursive Ping-Pong Protocols
PB - Peter Ryan
CY - Barcelona
KW - cryptographic protocols
KW - automated verification
KW - decidability
UR - http://www.brics.dk/~srba/publ.html
N2 - This paper introduces a process calculus with recursion which allows us to express an unbounded number of runs of the ping-pong protocols introduced by Dolev and Yao. We study the decidability issues associated with two common approaches to checking security properties, namely reachability analysis and bisimulation checking. Our main result is that our channel-free and memory-less calculus is Turing powerful, assuming that at least three principals are involved. We also investigate the expressive power of the calculus in the case of two participants. Here, our main results are that reachability and, under certain conditions, also strong bisimilarity become decidable.
ER -
HUTTEL, Hans a Jiří SRBA. Recursive Ping-Pong Protocols. In \textit{Proceedings of 4th International Workshop on Issues in the Theory of Security (WITS'04)}. Barcelona: Peter Ryan. s.~129-140. 2004.
|
