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)