کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
10334342 690380 2005 25 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Weakening the perfect encryption assumption in Dolev-Yao adversaries
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
Weakening the perfect encryption assumption in Dolev-Yao adversaries
چکیده انگلیسی
We consider secrecy and authentication in a simple process calculus with cryptographic primitives. The standard Dolev-Yao adversary is enhanced so that it can guess the key required to decrypt an intercepted message. We borrow from the computational complexity approach the assumptions that guessing succeeds with a given negligible probability and that the resources available to adversaries are polynomially bounded. Under these hypotheses we prove that the standard Dolev-Yao adversary is as powerful as the enhanced one.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Theoretical Computer Science - Volume 340, Issue 1, 13 June 2005, Pages 154-178
نویسندگان
, ,