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

Zbornik radova

Autori: Kanovich, Max; Ban Kirigin, Tajana; Nigam, Vivek; Scedrov, Andre
Naslov: Bounded Memory Protocols and Progressing Collaborative Systems
Izvornik: Lecture Notes in Computer Science, Volume 8134 / Crampton, Jason ; Jajodia, Sushil ; Mayes, Keith (ur.). - Springer-Verlag , 2013. 309-326 (ISBN: 978-3-642-40202-9).
Skup: European Symposium on Research in Computer Security (ESORICS) 2013
Mjesto i datum: Ehgam, Velika Britanija, 12-13.09.2013
Ključne riječi: Collaborative systems; Computational complexity; Protocol security
Sažetak:
It is well-known that the Dolev-Yao adversary is a powerful adversary. Besides acting as the network, intercepting, sending, and composing messages, he can remember as much information as he needs. That is, his memory is unbounded. We recently proposed a weaker Dolev-Yao like adversary, which also acts as the network, but whose memory is bounded. We showed that this Bounded Memory Dolev-Yao adversary, when given enough memory, can carry out many existing protocol anomalies. In particular, the known anomalies arise for bounded memory protocols, where there is only a bounded number of concurrent sessions and the honest participants of the protocol cannot generate an unbounded number of facts nor an unbounded number of nonces. This led us to the question of whether it is possible to infer an upper-bound on the memory required by the Dolev-Yao adversary to carry out an anomaly from the memory restrictions of the bounded protocol. This paper answers this question negatively. The second contribution of this paper is the formalization of Progressing Collaborative Systems that may create fresh values, such as nonces. We also prove the NP-completeness of the reachability problem for Progressing Collaborative Systems that may create fresh values.
Vrsta sudjelovanja: Predavanje
Vrsta prezentacije u zborniku: Cjeloviti rad (više od 1500 riječi)
Vrsta recenzije: Međunarodna recenzija
Projekt / tema: 009-0091328-0941, 120-1203164-3074
Izvorni jezik: ENG
Kategorija: Znanstveni
Znanstvena područja:
Matematika,Filozofija
Puni text rada: 649597.esorics2013_submission_167_1.pdf (tekst priložen 25. Lis. 2013. u 00:18 sati)
Upisao u CROSBI: Tajana Ban Kirigin (bank@math.uniri.hr), 25. Lis. 2013. u 00:18 sati



Verzija za printanje   za tiskati


upomoc
foot_4