Abstract not found

this article, is such an online CA

Networked and distributed systems have introduced a new significant threat to the availability of data and services: network denial of service attacks. A well known example is the TCP SYN ooding. In general, any statefull handshake protocol is vulnerable to similar attacks. This paper examines the network denial of service in detail and surveys and compares different approaches towards preventing the attacks. As a conclusion, a number of protocol design principles are identified essential in designing network denial of service resistant protocols, and examples provided on applying the principles.

This article presents a survey of denial of service attacks and the methods that have been proposed for defense against these attacks. In this survey, we analyze the design decisions in the Internet that have created the potential for denial of service attacks. We review the state-of-art mechanisms for defending against denial of service attacks, compare the strengths and weaknesses of each proposal, and discuss potential countermeasures against each defense mechanism. We conclude by highlighting opportunities for an integrated solution to solve the problem of distributed denial of service attacks.

Integrating fault tolerance and security is crucial for building trustworthy on-line services. Such integration is studied in this dissertation through the design and implementation of COCA (Cornell On-line Certification Authority), a fault-tolerant and secure on-line certification authority. COCA maintains a service private key to sign the responses it sends to clients, and achieves availability using replicated servers that employ threshold cryptography and store shares of the service private key. Periodic share refreshing, coupled with periodic recovery of server states, defends against so-called mobile adversaries which move from one server to another. COCA is designed for a weak system model: no assumptions are made about server speed or message delay, and communications are assumed to employ links that are intermittent. The result is a service with reduced vulnerability to attacks because, by their nature, weaker assumptions are more difficult for adversaries to invalidate. COCA further employs an array of defense mechanisms specific to denial of service attacks. COCA runs both on a local area network and on the Internet. Performance measurements of COCA under simulated denial of service attacks demonstrate the effectiveness of COCA's defenses.

Denial-of-Service (DoS) attacks remain a challenging problem in the Internet. In a DoS attack the attacker is attempting to make a resource unavailable to its intended legitimate clients. Furthermore, in order to employ massive attack power, the attacker usually launches a distributed denial of service (DDoS) attack, in which several subordinate hosts attack the target in concert. Denial-of-service attacks can result in significant loss of time and money for many organizations, thus, many defense mechanisms have been proposed. In this paper we propose a novel approach for detecting DoS attackers, which we call live baiting. Live baiting leverages group-testing theory, which aims at discovering defective members in a population using the minimum number of “tests”, to detect attackers with the minimum state. We analyzed the coverage, effectiveness, in terms of false positive and false negative probabilities, and efficiency, in terms of memory, message overhead, and computational complexity, of our approach. We validated our analysis using NS-2 simulations modeled after real Web traces. Live baiting detected hundreds of DoS attackers against a Web service within 90 seconds, with few false positives and almost zero false negatives. Moreover, live baiting substantially reduced the amount of state needed to detect DoS attackers, from order of total number of clients to order of number of attackers. This saving allows live baiting to scale to large services with millions of clients.

Abstract—Network attacks are occurring continuously day after day. The researchers are expected to find the solution by identifying the address of source. We propose the IP traceback ant colony system (ITACS) algorithm to solve the IP traceback of denial of service (DoS) problem. The ITACS is novel attempted to apply in solving the problem. It is a metaheuristic algorithm, which is a technique applies so that attack detection and attack identification can be implemented. The proposed algorithm has improved by the previous one to conquer this problem successfully. We obtained the data set of topology from one of famous research organizations for the experiment. The parameters of algorithm are considered by packet contents in topology. In the meanwhile, we discussed the increment of traffic condition. By the experiment, the examples of increment of traffic are above average 70%. The results show that the performance of ITACS algorithm is efficient and accurate. Furthermore, the proposed algorithm has also nature of robust for the problem. Future work may even be extended to study the other behaviors of organisms from derivations of meta-heuristic algorithm. Keywords-IP traceback ant colony system; denial of service; meta-heuristic algorithm I.