15 search results - page 1 / 3 » Guessing Attacks and the Computational Soundness of Static E... |
FOSSACS
2006
Springer
13 years 8 months ago
2006
Springer
The indistinguishability of two pieces of data (or two lists of pieces of data) can be represented formally in terms of a relation called static equivalence. Static equivalence dep...
CCS
2005
ACM
13 years 10 months ago
2005
ACM
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...
ASIAN
2006
Springer
13 years 8 months ago
2006
Springer
In the investigation of the relationship between the formal and the computational view of cryptography, a recent approach, first proposed in [10], uses static equivalence from cryp...
CSFW
2008
IEEE
13 years 11 months ago
2008
IEEE
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...
ICALP
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. The use of passwords in security protocols is particularly delicate because of the possibility of off-line guessing attacks. We study password-based protocols in the cont...