A computational justification for guessing attack formalisms
<p>Recently attempts have been made to extend the Dolev-Yao security model by allowing an intruder to learn weak secrets, such as poorly-chosen passwords, by off-line guessing. In such an attack, the intruder is able to verify a guessed value g if he can use it to produce a value called a veri...
Автори: | Newcomb, T, Lowe, G |
---|---|
Формат: | Report |
Опубліковано: |
Oxford University Computing Laboratory
2005
|
Схожі ресурси
-
A Computational Justification for Guessing Attack Formalisms
за авторством: Newcomb, T, та інші
Опубліковано: (2006) -
Analysing Protocol Subject to Guessing Attacks
за авторством: Lowe, G
Опубліковано: (2004) -
The science of guessing in collision-optimized divide-and-conquer attacks
за авторством: Ou, Changhai, та інші
Опубліковано: (2022) -
Improved guess-and-determine and distinguishing attacks on SNOW-V
за авторством: Jing Yang, та інші
Опубліковано: (2021-09-01) -
Optimal guessing in 'Guess Who'.
за авторством: Ben O'Neill
Опубліковано: (2021-01-01)