Sciweavers

14 search results - page 1 / 3
» Deciding security of protocols against off-line guessing att...
Sort
View
FC
2010
Springer
169views Cryptology» more  FC 2010»
13 years 8 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
CCS
2005
ACM
13 years 10 months ago
Deciding security of protocols against off-line guessing attacks
We provide an effective procedure for deciding the existence of off-line guessing attacks on security protocols, for a bounded number of sessions. The procedure consists of a co...
Mathieu Baudet
EUROCRYPT
2000
Springer
13 years 8 months ago
Authenticated Key Exchange Secure against Dictionary Attacks
Password-based protocols for authenticated key exchange (AKE) are designed to work despite the use of passwords drawn from a space so small that an adversary might well enumerate, ...
Mihir Bellare, David Pointcheval, Phillip Rogaway
CSFW
2008
IEEE
13 years 11 months ago
Composition of Password-Based Protocols
We investigate the composition of protocols that share a common secret. This situation arises when users employ the same password on different services. More precisely we study w...
Stéphanie Delaune, Steve Kremer, Mark Ryan
IJNSEC
2006
110views more  IJNSEC 2006»
13 years 4 months ago
The Improvement of YSYCT Scheme for Imbalanced Wireless Network
Recently, Yeh et al. proposed an improved password authenticated key exchange scheme (YSYCT scheme) which is secure against undetectable on-line password guessing attacks and prov...
Jung-Wen Lo