Efficient Client Puzzle Schemes to Mitigate DoS Attacks

Qiang Tang, Arjan Jeckmans

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    1 Citation (Scopus)
    75 Downloads (Pure)


    A (computational) client puzzle scheme enables a client to prove to a server that a certain amount of computing resources (CPU cycles and/or Memory look-ups) has been dedicated to solve a puzzle. In a number of different scenarios, researchers have applied client puzzle schemes to mitigate DoS attacks. In this paper, we introduce two batch verification modes for the RSW client puzzle scheme in order to improve the verification efficiency for the server, and investigate three methods for handling incorrect solutions in batch verifications.
    Original languageUndefined
    Title of host publicationInternational Conference on Computational Intelligence and Security (CIS 2010)
    Place of PublicationUSA
    PublisherIEEE Computational Intelligence Society
    Number of pages5
    ISBN (Print)978-1-4244-9114-8
    Publication statusPublished - Dec 2010
    EventInternational Conference on Computational Intelligence and Security, CIS 2010 - Nanning, China
    Duration: 11 Dec 201014 Dec 2010

    Publication series

    PublisherIEEE Computational Intelligence Society


    ConferenceInternational Conference on Computational Intelligence and Security, CIS 2010
    Other11-14 dec 2010


    • METIS-277477
    • EWI-19185
    • SCS-Cybersecurity
    • IR-75366

    Cite this