RUS  ENG ЖУРНАЛЫ   ПЕРСОНАЛИИ   ОРГАНИЗАЦИИ   КОНФЕРЕНЦИИ   СЕМИНАРЫ   ВИДЕОТЕКА   ЛИЧНЫЙ КАБИНЕТ
Видеотека
Архив
Популярное видео

Поиск
RSS
Новые поступления





Для просмотра файлов Вам могут потребоваться






Симпозиум по логике и вычислимости «Logic and Computation Day»
7 июня 2013 г. 10:00, г. Москва, МИАН
 


Bounded Memory Protocols and the Unbounded Adversary

A. Scedrov

University of Pennsylvania

Количество просмотров:
Эта страница:32

Аннотация: The Dolev-Yao adversary is a non-deterministic adversary which can act as the network, intercept, send, compose and decompose messages, and remember as much information as it needs. That is, its memory is unbounded. We recently proposed a weaker Dolev-Yao like adversary, which can also act 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 a computable upper bound on the memory required by the standard, unbounded Dolev-Yao adversary to carry out a protocol anomaly from the memory restrictions of the bounded protocol. We answer this question negatively. This is joint work with Max Kanovich, Tajana Ban Kirigin, and Vivek Nigam.

Язык доклада: английский

ОТПРАВИТЬ: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru
 
Обратная связь:
 Пользовательское соглашение  Регистрация  Логотипы © Математический институт им. В. А. Стеклова РАН, 2017