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

Logo poskytovatele

Varování

Publikace nespadá pod Filozofickou fakultu, ale pod Fakultu informatiky. Oficiální stránka publikace je na webu muni.cz.
Název česky Monotonni Prefixove Prepisovani Rozsirene o Mnoziny a Overovani Rekurzivnich Ping-Pong Protokolu
Autoři

DELZANNO Giorgio ESPARZA Javier SRBA Jiří

Rok publikování 2006
Druh Článek ve sborníku
Konference Automated Technology for Verification and Analysis (ATVA'06)
Fakulta / Pracoviště MU

Fakulta informatiky

Citace
Obor Informatika
Klíčová slova prefix rewriting; security protocols
Popis 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 via a reduction to a new prefix rewriting model called Monotonic Set-extended Prefix rewriting (MSP). We demonstrate further applicability of the introduced model by encoding a fragment of the ccp (concurrent constraint programming) language into MSP.
Související projekty:

Používáte starou verzi internetového prohlížeče. Doporučujeme aktualizovat Váš prohlížeč na nejnovější verzi.