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...
Asıl Yazarlar: | Newcomb, T, Lowe, G |
---|---|
Materyal Türü: | Report |
Baskı/Yayın Bilgisi: |
Oxford University Computing Laboratory
2005
|
Benzer Materyaller
-
A Computational Justification for Guessing Attack Formalisms
Yazar:: Newcomb, T, ve diğerleri
Baskı/Yayın Bilgisi: (2006) -
Analysing Protocol Subject to Guessing Attacks
Yazar:: Lowe, G
Baskı/Yayın Bilgisi: (2004) -
The science of guessing in collision-optimized divide-and-conquer attacks
Yazar:: Ou, Changhai, ve diğerleri
Baskı/Yayın Bilgisi: (2022) -
Improved guess-and-determine and distinguishing attacks on SNOW-V
Yazar:: Jing Yang, ve diğerleri
Baskı/Yayın Bilgisi: (2021-09-01) -
Optimal guessing in 'Guess Who'.
Yazar:: Ben O'Neill
Baskı/Yayın Bilgisi: (2021-01-01)