crta
Hrvatska znanstvena Sekcija img
bibliografija
3 gif
 Naslovna
 O projektu
 FAQ
 Kontakt
4 gif
Pregledavanje radova
Jednostavno pretraživanje
Napredno pretraživanje
Skupni podaci
Upis novih radova
Upute
Ispravci prijavljenih radova
Ostale bibliografije
Slični projekti
 Bibliografske baze podataka

Pregled bibliografske jedinice broj: 748195

Zbornik radova

Autori: Kanovich, Max; Ban Kirigin, Tajana; Nigam, Vivek; Scedrov, Andre; Talcott, Carolyn
Naslov: Discrete vs. Dense Times in the Analysis of Cyber- Physical Security Protocols
( Discrete vs. Dense Times in the Analysis of Cyber- Physical Security Protocols )
Izvornik: LNCS, Volume 9036 / Focardi, Riccardo ; Myers, Andrew (ur.). - Springer-Verlag , 2015. 259-279 (ISBN: 978-3-662-46666-7).
ISSN: 1611-3349
Skup: 4th Conference on Principles of Security and Trust (POST)
Mjesto i datum: London, Velika Britanija, 11-18.04.2015.
Ključne riječi: Multiset Rewriting ; Distance Bounding Protocols ; Cyber-Physical Security Protocols ; Computational Complexity ; Real Time
( Multiset Rewriting ; Distance Bounding Protocols ; Cyber-Physical Security Protocols ; Computational Complexity ; Real Time )
Sažetak:
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.
Vrsta sudjelovanja: Predavanje
Vrsta prezentacije u zborniku: Cjeloviti rad (više od 1500 riječi)
Vrsta recenzije: Međunarodna recenzija
Izvorni jezik: eng
Kategorija: Znanstveni
Znanstvena područja:
Matematika,Računarstvo
Puni text rada: 748195.POST_2015_paper_55.pdf (tekst priložen 27. Ruj. 2015. u 12:30 sati)
Upisao u CROSBI: Tajana Ban Kirigin (bank@math.uniri.hr), 18. Sij. 2015. u 12:26 sati



Verzija za printanje   za tiskati


upomoc
foot_4