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...
| প্রধান লেখক: | , |
|---|---|
| বিন্যাস: | Report |
| প্রকাশিত: |
Oxford University Computing Laboratory
2005
|