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

Towards Timed Models for Cyber-Physical Security Protocols (CROSBI ID 611779)

Neobjavljeno sudjelovanje sa skupa | neobjavljeni prilog sa skupa | međunarodna recenzija

Kanovich, Max ; Ban Kirigin, Tajana ; Nigam, Vivek ; Scedrov, Andre ; Talcott, Carolyn Towards Timed Models for Cyber-Physical Security Protocols // Joint Workshop on Foundations of Computer Security and Formal and Computational Cryptography Beč, Austrija, 18.07.2014-18.07.2014

Podaci o odgovornosti

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

engleski

Towards Timed Models for Cyber-Physical Security Protocols

Many security protocols rely on the assumptions on the physical properties in which its protocols essions 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. The key elements of such protocols are the use of cryptographic keys, nonces and time. This paper investigates timed models for the verification of such protocols. Firstly, we introduce a multiset rewriting framework with continuous time and fresh values. We demonstrate that in this framework one can specify distance bounding protocols and intruder models for cyber-physical security protocols that take into account the physical properties of the environment. Then we prove that models with discrete time are not able to expose as many security flaws as models with continuous time. This is done by proposing a protocol and demonstrating that there is no attack to this protocol when using the model with discrete time, but there is an attack when using the model with continuous time. For the important class of Bounded Memory Cyber-Physical Security Protocols with a Memory Bounded Intruder the reachability problem is PSPACE-complete if the size of terms is bounded.

Timed Collaborative Systems ; Multiset Rewriting ; Distance Bounding Protocols ; Cyber-Physical Security Protocols ; Computational Complexity

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

Podaci o prilogu

nije evidentirano

nije evidentirano

Podaci o skupu

Joint Workshop on Foundations of Computer Security and Formal and Computational Cryptography

predavanje

18.07.2014-18.07.2014

Beč, Austrija

Povezanost rada

Matematika, Računarstvo, Filozofija