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

Časopis

Autori: Kanovich, Max; Ban Kirigin, Tajana; Nigam, Vivek; Scedrov, Andre
Naslov: Bounded Memory Protocols
Izvornik: Computer languages systems & structures (1477-8424) 40 (2014), 3/4; 137-154
Vrsta rada: članak
Ključne riječi: protocol security; Dolev-Yao adversary; secrecy problem; complexity; undecidability
Sažetak:
It is well-known that the Dolev-Yao adversary is a powerful adversary. Besides acting as the network, intercepting, decomposing, composing and sending 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 although the total number of sessions is unbounded, there is only a bounded number of concurrent sessions and the honest participants of the protocol cannot remember an unbounded number of facts nor an unbounded number of nonces at a time. 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 (Theorem 8).
Projekt / tema: 120-1203164-3074, 009-0091328-0941
Izvorni jezik: ENG
Rad je indeksiran u
bazama podataka:
Current Contents Connect (CCC)
Scopus
SCI-EXP, SSCI i/ili A&HCI
Science Citation Index Expanded (SCI-EXP) (sastavni dio Web of Science Core Collectiona)
Kategorija: Znanstveni
Znanstvena područja:
Matematika,Računarstvo,Filozofija
Puni text rada: 698722.uncompDY_COMLAN.pdf
URL Internet adrese: http://www.sciencedirect.com/science/article/pii/S1477842414000347
http://www.sciencedirect.com/science/article/pii/S1477842414000347
Broj citata:
Altmetric:
DOI: 10.1016/j.cl.2014.05.003
URL cjelovitog teksta: http://www.sciencedirect.com/science/article/pii/S1477842414000347
Google Scholar: Bounded Memory Protocols
Upisao u CROSBI: Tajana Ban Kirigin (bank@math.uniri.hr), 28. Svi. 2014. u 21:35 sati



  Verzija za printanje   za tiskati


upomoc
foot_4