Name
Abstract | ||
|---|---|---|
In today's world password are mostly used for authentication. This makes them prone to various kinds of attacks like dictionary attacks. A dictionary attack is a method of breaking the password by systematically entering every word in a dictionary as a password. This attack leads to an overload on the server leading to denial of service attack. This paper presents a protocol to reduce the rate of dictionary attack by using a prover and a verifier system. This system makes it difficult for the attacker to prove it as a valid user by becoming computationally intensive. The rate of attempts is also reduced and thus restricting the Denial of Service attack. |
Year | Venue | Field |
|---|---|---|
2012 | arXiv: Cryptography and Security | Zero-knowledge password proof,Password strength,Computer security,Challenge–response authentication,Computer science,Pre-play attack,S/KEY,One-time password,Password,Salt (cryptography) |
DocType | Volume | Citations |
Journal | abs/1212.6059 | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Priyanka Naik | 1 | 2 | 0.72 |
| Sugata Sanyal | 2 | 481 | 65.88 |