کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
423924 | 685303 | 2006 | 17 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Filling Out the Gaps: A Padding Algorithm for Transforming Out Timing Leaks
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
It has been shown that secret information can be leaked to external observers through covert timing channels. In this paper we are concerned with a kind of timing attack that wants to differentiate two processes, presented as probabilistic transition systems, by observing their timing behaviour. Our goal is to make the processes indistinguishable i.e. bisimilar, by adding virtual (dummy) states and transitions to the original processes (padding). Instead of padding the processes with whole virtual copies of their counterparts - as done by some padding algorithms - we present an algorithm that uses the bisimulation equivalence relation - computed as a lumping partition - as the main criterion to optimise the padding procedure.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Electronic Notes in Theoretical Computer Science - Volume 153, Issue 2, 23 May 2006, Pages 241-257
Journal: Electronic Notes in Theoretical Computer Science - Volume 153, Issue 2, 23 May 2006, Pages 241-257