Nalazite se na CroRIS probnoj okolini. Ovdje evidentirani podaci neće biti pohranjeni u Informacijskom sustavu znanosti RH. Ako je ovo greška, CroRIS produkcijskoj okolini moguće je pristupi putem poveznice www.croris.hr
izvor podataka: crosbi

Discrete vs. Dense Times in the Analysis of Cyber- Physical Security Protocols (CROSBI ID 621404)

Prilog sa skupa u časopisu | izvorni znanstveni rad | međunarodna recenzija

Kanovich, Max ; Ban Kirigin, Tajana ; Nigam, Vivek ; Scedrov, Andre ; Talcott, Carolyn Discrete vs. Dense Times in the Analysis of Cyber- Physical Security Protocols // Lecture notes in computer science / Focardi, Riccardo ; Myers, Andrew (ur.). 2015. str. 259-279 doi: 10.1007/978-3-662-46666-7_14

Podaci o odgovornosti

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

engleski

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

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 di erences 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 di erent 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.

Multiset Rewriting ; Distance Bounding Protocols ; Cyber-Physical Security Protocols ; Computational Complexity ; Real Time

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

Podaci o prilogu

259-279.

2015.

nije evidentirano

objavljeno

978-3-662-46666-7

10.1007/978-3-662-46666-7_14

Podaci o matičnoj publikaciji

Lecture notes in computer science

Focardi, Riccardo ; Myers, Andrew

Springer

1611-3349

Podaci o skupu

4th Conference on Principles of Security and Trust (POST)

predavanje

11.04.2015-18.04.2015

London, Ujedinjeno Kraljevstvo

Povezanost rada

Matematika, Računarstvo

Poveznice
Indeksiranost