Sciweavers

115 search results - page 22 / 23
» Verifying authentication protocols with CSP
Sort
View
FC
2010
Springer
169views Cryptology» more  FC 2010»
14 years 1 months ago
A Formal Approach for Automated Reasoning about Off-Line and Undetectable On-Line Guessing
Abstract. Starting from algebraic properties that enable guessing lowentropy secrets, we formalize guessing rules for symbolic verification. The rules are suited for both off-line ...
Bogdan Groza, Marius Minea
ICCCN
2008
IEEE
14 years 4 months ago
A Lightweight Solution for Defending Against Deauthentication/Disassociation Attacks on 802.11 Networks
In this paper we investigate a special type of denial of service (DoS) attack on 802.11-based networks, namely deauthentication/disassociation attack. In the current IEEE 802.11 s...
Thuc D. Nguyen, Duc H. M. Nguyen, Bao N. Tran, Hai...
ADHOCNOW
2005
Springer
14 years 3 months ago
Enhancing the Security of On-demand Routing in Ad Hoc Networks
We present the Ad-hoc On-demand Secure Routing (AOSR) protocol, which uses pairwise shared keys between pairs of mobile nodes and hash values keyed with them to verify the validity...
Zhenjiang Li, J. J. Garcia-Luna-Aceves
CISC
2006
Springer
103views Cryptology» more  CISC 2006»
14 years 1 months ago
Dynamic Threshold and Cheater Resistance for Shamir Secret Sharing Scheme
In this paper, we investigate the problem of increasing the threshold parameter of the Shamir (t, n)-threshold scheme without interacting with the dealer. Our construction will re...
Christophe Tartary, Huaxiong Wang
CORR
2006
Springer
82views Education» more  CORR 2006»
13 years 9 months ago
Explicit Randomness is not Necessary when Modeling Probabilistic Encryption
Although good encryption functions are probabilistic, most symbolic models do not capture this aspect explicitly. A typical solution, recently used to prove the soundness of such ...
Véronique Cortier, Heinrich Hördegen, ...