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

Issued Date

2010-10-29

Resource Type

Conference Paper

ISSN

16113349
03029743

DOI

10.1007/978-3-642-13739-6_28

Other identifier(s)

2-s2.0-77958460199

Rights

Mahidol University

Rights Holder(s)

SCOPUS

Bibliographic Citation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol.6166 LNCS, (2010), 358-365

Suggested Citation

Suratose Tritilanunt 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). Vol.6166 LNCS, (2010), 358-365. doi:10.1007/978-3-642-13739-6_28 Retrieved from: https://repository.li.mahidol.ac.th/handle/20.500.14594/29003

Research Projects

Organizational Units

Authors

Journal Issue

Thesis

Title

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

Author(s)

Suratose Tritilanunt

Other Contributor(s)

Mahidol University

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.

Keyword(s)

Computer Science
 Mathematics

Availability

URI

https://repository.li.mahidol.ac.th/handle/20.500.14594/29003

Collections

Scopus 2006-2010