Denial of service by server resource exhaustion has become a major security threat in open communications networks. Public-key authentication does not completely protect against the attacks because the authentication protocols often leave ways for an unauthenticated client to consume a server’s memory space and computational resources by initiating a large number of protocol runs and inducing the server to perform expensive cryptographic computations. We show how stateless authentication protocols and the client puzzles of Juels and Brainard can be used to prevent such attacks.
CITATION STYLE
Aura, T., Nikander, P., & Leiwo, J. (2001). DOS-resistant authentication with client puzzles. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2133, pp. 170–177). Springer Verlag. https://doi.org/10.1007/3-540-44810-1_22
Mendeley helps you to discover research relevant for your work.