Prover and Verifier Based Password Protection: PVBPP
Priyanka Naik, Sugata Sanyal

TL;DR
This paper introduces a protocol using prover and verifier mechanisms to enhance password security by reducing dictionary attack success rates and mitigating server overload and denial of service risks.
Contribution
It proposes a novel prover-verifier based protocol that makes password authentication more resistant to dictionary attacks and reduces attack attempt rates.
Findings
Decreases success rate of dictionary attacks
Reduces server overload from attack attempts
Limits the number of authentication attempts
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsUser Authentication and Security Systems · Advanced Authentication Protocols Security · Cryptographic Implementations and Security
