با سلام خدمت کاربران در صورتی که با خطای سیستم پرداخت بانکی مواجه شدید از طریق کارت به کارت (6037997535328901 بانک ملی ناصر خنجری ) مقاله خود را دریافت کنید (تا مشکل رفع گردد).
دسته بندی:
امنیت - Security
سال انتشار:
2017
عنوان انگلیسی مقاله:
A procedure for deciding symbolic equivalence between sets of constraint systems
ترجمه فارسی عنوان مقاله:
یک روش برای تصمیم گیری همسان سازی نمادین بین مجموعه ای از سیستم های محدودیت
منبع:
Sciencedirect - Elsevier - Information and Computation, 255 (2017) 94–125. 10.1016/j.ic.2017.05.004
نویسنده:
VincentCheval, HubertComon-Lundh, StéphanieDelaune
چکیده انگلیسی:
Article history:Received 11 November 2014Received in revised form 15 September 2016Available online 31 May 2017Keywords: Formal methods VerificationSecurity protocols Privacy-type properties Symbolic modelWe consider security properties of cryptographic protocols that can be modelled using trace equivalence, a crucial notion when specifying privacy-type properties, like anonymity, vote-privacy, and unlinkability. Infinite sets of possible traces are symbolically represented using deducibility constraints. We describe an algorithm that decides trace equivalence for protocols that use standard primitives and that can be represented using such constraints. More precisely, we consider symbolic equivalence between sets of constraint systems, and we also consider disequations. Considering sets and disequations is actually crucial to decide trace equivalence for processes that may involve else branches and/or private channels (for a bounded number of sessions). Our algorithm for deciding symbolic equivalence between sets of constraint systems is implemented and performs well in practice. Unfortunately, it does not scale up well for deciding trace equivalence between processes. This is however the first implemented algorithm deciding trace equivalence on such a large class of processes. 2017 Elsevier Inc. All rights reserved.
Keywords:Formal methods | Verification | Security protocols | Privacy-type properties | Symbolic model
قیمت: رایگان
توضیحات اضافی:
تعداد نظرات : 0