Skip to main content
Conference ProceedingsOPEN ACCESS

Performance evaluation of non-parallelizable client puzzles for defeating DoS attacks in authentication protocols

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2010) 6166 LNCS 358-365
DOI: 10.1007/978-3-642-13739-6_28
1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We provides an evaluation of non-parallelizable puzzles used to prevent DoS in authentication protocols. With an evaluation based on a simulation and performance analysis, this approach helps a responder to resist against DoS, as well as improves the throughput of services for legitimate clients. Another key strength is that the construction and verification at the responder is simple and fast. © 2010 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Tritilanunt, S. (2010). Performance evaluation of non-parallelizable client puzzles for defeating DoS attacks in authentication protocols. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6166 LNCS, pp. 358–365). https://doi.org/10.1007/978-3-642-13739-6_28

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free