A Client Puzzle Based Public-key Authentication Protocol

Abstract

Network denial-of-service attacks, which exhaust the server resources, have become a serious security threat to the Internet. Public Key Infrastructure (PKI) has long been introduced in various authentication protocols to verify the identities of the communicating parties. Although the use of PKI can present difficulty to the denial-of-service attackers, the underlying problem has not been resolved completely, because the use of public-key infrastructure involves computationally expensive operations such as modular exponentiation. An improper deployment of the public-key operations in a protocol allows the attacker to exhaust the server’s resources. This paper presents a public-key based authentication protocol integrated with a sophisticated client puzzle, which together provides a good solution for network denial-of-service attacks, and various other common attacks. The basic strategy to protect against denial of service is to impose an adjustable cost on the attacker while it launches the attacks. The proposed client puzzle protocol can also be integrated with other network protocols to protect against denial-of-service attacks.