Napredna pretraga

Pregled bibliografske jedinice broj: 778202

Discrete vs. Dense Times in the Analysis of Cyber- Physical Security Protocols

Kanovich, Max; Ban Kirigin, Tajana; Nigam, Vivek; Scedrov, Andre; Talcott, Carolyn
Discrete vs. Dense Times in the Analysis of Cyber- Physical Security Protocols // Book of Abstracts
Dubrovnik, Hrvatska, 2015. str. 31-31 (predavanje, međunarodna recenzija, sažetak, ostalo)

Discrete vs. Dense Times in the Analysis of Cyber- Physical Security Protocols

Kanovich, Max ; Ban Kirigin, Tajana ; Nigam, Vivek ; Scedrov, Andre ; Talcott, Carolyn

Vrsta, podvrsta i kategorija rada
Sažeci sa skupova, sažetak, ostalo

Book of Abstracts / - , 2015, 31-31

Logic and Applications 2015

Mjesto i datum
Dubrovnik, Hrvatska, 21-25.09.2015

Vrsta sudjelovanja

Vrsta recenzije
Međunarodna recenzija

Ključne riječi
Cyber-Physical Security Protocols ; Multiset Rewriting ; Computational Complexity

Many security protocols rely on the assumptions on the physical properties in which its protocol sessions will be carried out. For instance, Distance Bounding Protocols take into account the round trip time of messages and the transmission velocity to infer an upper bound of the distance between two agents. We classify such security protocols as Cyber-Physical. Time plays a key role in design and analysis of many of these protocols. This paper investigates the foundational differences and the impacts on the analysis when using models with discrete time and models with dense time. We show that there are attacks that can be found by models using dense time, but not when using discrete time. We illustrate this with a novel attack that can be carried out on most distance bounding protocols. In this attack, one exploits the execution delay of instructions during one clock cycle to convince a verifier that he is in a location different from his actual position. We propose a Multiset Rewriting model with dense time suitable for specifying cyber- physical security protocols. We introduce Circle-Configurations and show that they can be used to symbolically solve the reachability problem for our model. Finally, we show that for the important class of balanced theories the reachability problem is PSPACE-complete.

Izvorni jezik

Znanstvena područja
Matematika, Računarstvo


Sveučilište u Rijeci - Odjel za matematiku

Autor s matičnim brojem:
Tajana Ban-Kirigin, (229313)