دانلود و نمایش مقالات مرتبط با Deducibility constraints::صفحه 1
بلافاصله پس از پرداخت دانلود کنید

با سلام خدمت کاربران در صورتی که با خطای سیستم پرداخت بانکی مواجه شدید از طریق کارت به کارت (6037997535328901 بانک ملی ناصر خنجری ) مقاله خود را دریافت کنید (تا مشکل رفع گردد). 

نتیجه جستجو - Deducibility constraints

تعداد مقالات یافته شده: 2
ردیف عنوان نوع
1 Satisfiability of general intruder constraints with and without a set constructor
رضایت از محدودیت های مزاحم عمومی با و بدون سازنده مجموعه ای-2017
Article history:Received 31 March 2014Accepted 15 April 2015Available online 18 July 2016Keywords:ACIDeducibility constraints Dolev–Yao deduction system Multiple intrudersSecurityMany decision problems on security protocols can be reduced to solving deduction constraints expressing whether an instance of a given message pattern can be constructed by the intruder. Most constraint solving procedures for protocol security rely on two properties of constraint systems called monotonicity and variable- origination. In this work we relax these restrictions by giving a decision procedure for solving general intruder constraints (that do not have these properties) that stays in NP. The result is also valid modulo an associative, commutative and idempotent theory. The procedure can be applied to verify security protocols in presence of multiple intruders. 2016 Elsevier Ltd. All rights reserved.
Keywords:ACI | Deducibility constraints | Dolev–Yao deduction system | Multiple intruders | Security
مقاله انگلیسی
2 A procedure for deciding symbolic equivalence between sets of constraint systems
یک روش برای تصمیم گیری همسان سازی نمادین بین مجموعه ای از سیستم های محدودیت-2017
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
مقاله انگلیسی
rss مقالات ترجمه شده rss مقالات انگلیسی rss کتاب های انگلیسی rss مقالات آموزشی
logo-samandehi
بازدید امروز: 2284 :::::::: بازدید دیروز: 3097 :::::::: بازدید کل: 36551 :::::::: افراد آنلاین: 36