THROTTLING DDoS ATTACKS USING DISCRETE LOGARITHM PROBLEM

Avinash Darapureddi; Radhesh Mohandas; Alwyn R. Pais

Research.Publish.Connect.

*Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Country:
Subject:

Advanced Search Affiliations Search

If you're looking for an exact phrase use quotation marks on text fields.

Proceedings

Proceedings Search *Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Papers

Papers Search *Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Authors

Authors Search *Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Advanced Search

Paper

THROTTLING DDoS ATTACKS USING DISCRETE LOGARITHM PROBLEM

Topics: Denial of Service and Attacks

In Proceedings of the International Conference on Security and Cryptography - Volume 0ICETE, 263-269, 2010 , University of Piraeus, Greece

Authors: Avinash Darapureddi ; Radhesh Mohandas and Alwyn R. Pais

Affiliation: NITK, India

Keyword(s): Distributed denial of service, Application of discrete logarithm problem, Source throttling, CPU stamps, Application level attacks.

Abstract: Amongst all the security issues that the internet world is facing, Distributed Denial of Service attack (DDoS) receives special mention. In a typical DDoS attack, an attacker runs a malicious code on compromised systems to generate enormous number of requests to a single web server. The flood of incoming requests makes the victim web server resources to wear out completely within a short period of time; thereby causing denial of service to the legitimate users. In this paper we propose a solution to trim down the impact of DDoS attacks by throttling the client’s CPU i.e., to make clients pay a stamp fee which is collected in terms of resource usage such as CPU cycles. Our proposed solution makes use of the discrete logarithm problem to generate the CPU stamps.

CC BY-NC-ND 4.0

Guest: Register as new SciTePress user now for free.

SciTePress user: please login.

My Papers

You are not signed in, therefore limits apply to your IP address 3.145.97.235

In the current month:

Recent papers: 100 available of 100 total

2⁺ years older papers: 200 available of 200 total

Paper citation in several formats:

Darapureddi, A.; Mohandas, R. and R. Pais, A. (2010). THROTTLING DDoS ATTACKS USING DISCRETE LOGARITHM PROBLEM. In Proceedings of the International Conference on Security and Cryptography (ICETE 2010) - SECRYPT; ISBN 978-989-8425-18-8; ISSN 2184-3236, SciTePress, pages 263-269. DOI: 10.5220/0002981502630269

@conference{secrypt10,
author={Avinash Darapureddi. and Radhesh Mohandas. and Alwyn {R. Pais}.},
title={THROTTLING DDoS ATTACKS USING DISCRETE LOGARITHM PROBLEM},
booktitle={Proceedings of the International Conference on Security and Cryptography (ICETE 2010) - SECRYPT},
year={2010},
pages={263-269},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002981502630269},
isbn={978-989-8425-18-8},
issn={2184-3236},
}

TY - CONF

JO - Proceedings of the International Conference on Security and Cryptography (ICETE 2010) - SECRYPT
TI - THROTTLING DDoS ATTACKS USING DISCRETE LOGARITHM PROBLEM
SN - 978-989-8425-18-8
IS - 2184-3236
AU - Darapureddi, A.
AU - Mohandas, R.
AU - R. Pais, A.
PY - 2010
SP - 263
EP - 269
DO - 10.5220/0002981502630269
PB - SciTePress