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

Zbornik radova

Autori: Kanovich, Max; Ban Kirigin, Tajana; Nigam, Vivek; Scedrov, Andre
Naslov: Bounded memory Dolev-Yao adversaries in collaborative systems
Izvornik: Lecture Notes in Computer Science, Volume 6561 / Degano, Pierpaolo ; Etalle, Sandro and Guttman, Joshua D. (ur.). - Springer-Verlag , 2011. 18-33 (ISBN: 978-3-642-19750-5).
Skup: Formal Aspects of Security and Trust
Mjesto i datum: Pisa, Italija, 16-17.9.2010.
Ključne riječi: Collaborative Systems; Dolev-Yao intruders; Complexity
Sažetak:
This paper extends existing models for collaborative systems with confidentiality policies. We investigate how much damage can be done by insiders alone, without collusion with an outside adversary. In contrast to traditional intruder models, such as in protocol security, all the players inside our system, including potential adversaries, have similar capabilities. They have bounded storage capacity, that is, they can only remember at any moment a bounded number of facts. This is imposed technically by only allowing balanced actions, that is, actions that have the same number of facts in their pre and post conditions. On the other hand, the adversaries inside our system have many capabilities of the standard Dolev-Yao intruder, namely, they are able, within their bounded storage capacity, to compose, decompose, overhear, and intercept messages as well as create fresh values. We investigate the complexity of the decision problem of whether or not an adversary is able to discover secret data. We show that this problem is PSPACE-complete when all actions are balanced and can create fresh values. If we further impose the condition, called progressing, that in a run any instance of an action can be used at most once, then this new problem is NP-complete when actions are balanced and only a bounded number of fresh values can be created and it is PSPACE-hard when actions are balanced and any number of fresh values can be created. Finally, we return to traditional intruder models and demonstrate that protocol anomalies, such as the Lowe anomaly in the Needham-Schroeder public key exchange protocol, can also occur when the intruder is one of the insiders with bounded memory.
Vrsta sudjelovanja: Predavanje
Vrsta prezentacije u zborniku: Cjeloviti rad (više od 1500 riječi)
Vrsta recenzije: Međunarodna recenzija
Projekt / tema: 120-1203164-3074, 009-0091328-0941
Izvorni jezik: ENG
Kategorija: Znanstveni
Znanstvena područja:
Matematika,Računarstvo
Puni text rada: 734588.paper_331.pdf (tekst priložen 26. Stu. 2014. u 15:45 sati)
URL Internet adrese: http://link.springer.com/chapter/10.1007%2F978-3-642-19751-2_2
Upisao u CROSBI: Tajana Ban Kirigin (bank@math.uniri.hr), 26. Stu. 2014. u 15:45 sati



Verzija za printanje   za tiskati


upomoc
foot_4