Napredna pretraga

Pregled bibliografske jedinice broj: 649597

Bounded Memory Protocols and Progressing Collaborative Systems


Kanovich, Max; Ban Kirigin, Tajana; Nigam, Vivek; Scedrov, Andre
Bounded Memory Protocols and Progressing Collaborative Systems // Lecture Notes in Computer Science, Volume 8134 / Crampton, Jason ; Jajodia, Sushil ; Mayes, Keith (ur.).
Ehgam, Velika Britanija: Springer-Verlag, 2013. str. 309-326 (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)


Naslov
Bounded Memory Protocols and Progressing Collaborative Systems

Autori
Kanovich, Max ; Ban Kirigin, Tajana ; Nigam, Vivek ; Scedrov, Andre

Vrsta, podvrsta i kategorija rada
Radovi u zbornicima skupova, cjeloviti rad (in extenso), znanstveni

Izvornik
Lecture Notes in Computer Science, Volume 8134 / Crampton, Jason ; Jajodia, Sushil ; Mayes, Keith - : 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

Vrsta sudjelovanja
Predavanje

Vrsta recenzije
Međunarodna recenzija

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.

Izvorni jezik
Engleski

Znanstvena područja
Matematika, Filozofija



POVEZANOST RADA


Projekt / tema
009-0091328-0941 - Logika i stvarnost (Majda Trobok, )
120-1203164-3074 - Matematička logika i primjene (Zvonimir Šikić, )

Ustanove
Sveučilište u Rijeci - Odjel za matematiku

Autor s matičnim brojem:
Tajana Ban-Kirigin, (229313)