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: 700992

Zbornik radova

Autori: Kanovich, Max; Ban Kirigin, Tajana; Nigam, Vivek; Scedrov, Andre; Talcott, Carolyn
Naslov: Towards Timed Models for Cyber-Physical Security Protocols
Izvornik:
Skup: Joint Workshop on Foundations of Computer Security and Formal and Computational Cryptography
Mjesto i datum: Beč, Austria, 18.7.2014.
Ključne riječi: Timed Collaborative Systems ; Multiset Rewriting ; Distance Bounding Protocols ; Cyber-Physical Security Protocols ; Computational Complexity
Sažetak:
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.
Vrsta sudjelovanja: Predavanje
Vrsta prezentacije u zborniku: Nije objavljen
Vrsta recenzije: Međunarodna recenzija
Projekt / tema: 120-1203164-3074, 009-0091328-0941
Izvorni jezik: ENG
Kategorija: Znanstveni
Znanstvena područja:
Matematika,Računarstvo,Filozofija
Puni text rada: 700992.fcs-fcc14-abs.pdf (tekst priložen 30. Pro. 2018. u 20:45 sati)
Upisao u CROSBI: Tajana Ban Kirigin (bank@math.uniri.hr), 11. Lip. 2014. u 13:40 sati



Verzija za printanje   za tiskati


upomoc
foot_4