Memory-bounded Adversary
- 講者Akshima 博士 (中國上海紐約大學)
邀請人：鐘楷閔 - 時間2025-03-20 (Thu.) 13:30 ~ 15:30
- 地點資訊所新館101演講廳
摘要
Memory is a valuable and limited resource, sometimes even more than time, and thus should be accounted for in the abilities of the adversary while analyzing its advantage against any primitive. Security bounds ignoring memory as a parameter may be too pessimistic and their employment to decide optimal security parameter maybe an overkill of resources, in terms of computation cycles and bits of randomness used.
In this talk we will go over two noteworthy works that have analyzed the switching lemma in the bounded memory setting. Further we will look at some preliminary results on the security of Double encryption against a restricted class of memory-bounded adversaries.
In this talk we will go over two noteworthy works that have analyzed the switching lemma in the bounded memory setting. Further we will look at some preliminary results on the security of Double encryption against a restricted class of memory-bounded adversaries.