Bandwidth Distributed Denial of Service: Attacks and Defenses

Bandwidth Distributed Denial of Service: Attacks and Defenses Distributed denial of service (DDoS) attacks pose a serious threat to the Internet. We discuss the Internet vulnerability to Bandwidth Distributed Denial of Service (BW-DDoS) attacks, where many hosts send a huge number of packets exceeding network capacity and causing congestion and losses, thereby disrupting legitimate traffic. TCP and other protocols employ congestion control mechanisms that respond to losses and delays by reducing network usage, hence, their performance may be degraded sharply due to such attacks. Attackers may disrupt connectivity to servers,…

Read More

Toward trustworthy coordination of web services business activities

Toward trustworthy coordination of web services business activities To present a lightweight Byzantine fault tolerance (BFT) algorithm, which can be used to render the coordination of web services business activities (WS-BA) more trustworthy. The lightweight design of the BFT algorithm is the result of a comprehensive study of the threats to the WS-BA coordination services and a careful analysis of the state model of WS-BA. The lightweight BFT algorithm uses source ordering, rather than total ordering, of incoming requests to achieve Byzantine fault tolerant, state-machine replication of the WS-BA coordination…

Read More

Privacy Preserving Data Sharing With Anonymous ID Assignment

Privacy Preserving Data Sharing With Anonymous ID Assignment INFORMATION FORENSICS AND SECURITY, FEBRUARY 2013 An algorithm for anonymous sharing of private data among parties is developed. This technique is used iteratively to assign these nodes ID numbers ranging from 1 to . This assignment is anonymous in that the identities received are unknown to the other members of the group. Resistance to collusion among other members is verified in an information theoretic sense when private communication channels are used. This assignment of serial numbers allows more complex data to be…

Read More

A Highly Scalable Key Pre-Distribution Scheme for Wireless Sensor Networks

A Highly Scalable Key Pre-Distribution Scheme for Wireless Sensor Networks Technology Used: Dot Net Given the sensitivity of the potential WSN applications and because of resource limitations, key management emerges as a challenging issue for WSNs. One of the main concerns when designing a key management scheme is the network scalability. Indeed, the protocol should support a large number of nodes to enable a large scale deployment of the network. In this paper, we propose a new scalable key management scheme for WSNs which provides a good secure connectivity coverage.…

Read More

Cross-domain privacy-preserving cooperative firewall optimization

Cross-domain privacy-preserving cooperative firewall optimization Technology Used: Java Firewalls have been widely deployed on the Internet for securing private networks. A firewall checks each incoming or outgoing packet to decide whether to accept or discard the packet based on its policy. Optimizing firewall policies is crucial for improving network performance. Prior work on firewall optimization focuses on either intra-firewall or inter-firewall optimization within one administrative domain where the privacy of firewall policies is not a concern. Inter-firewall optimization is considered across administrative domains for the first time. The key technical…

Read More

Bidirectional Multi-Constrained Routing Algorithms

Bidirectional Multi-Constrained Routing Algorithms Technology Used: Java QoS routing plays a critical role in providing QoS support in the Internet. Most existing QoS routing algorithms employ the strategy of unidirectional search in route selection. Bidirectional search has been recognized as an effective strategy for fast route acquisition in identifying the shortest path connecting a pair of nodes. However, its efficiency has not been well established in the context of route selection subject to multiple additive constraints, which is in general NP-Complete. To employ bidirectional search to support efficient QoS routing…

Read More

Decentralized Hypothesis Testing in Wireless Sensor Networks in the Presence of Misbehaving Nodes

Decentralized Hypothesis Testing in Wireless Sensor Networks in the Presence of Misbehaving Nodes INFORMATION FORENSICS AND SECURITY, JANUARY 2013 Technology Used: Java Wireless sensor networks are prone to node misbehavior arising from tampering by an adversary (Byzantine attack), or due to other factors such as node failure resulting from hardware or software degradation. In this paper, we consider the problem of decentralized detection in wireless sensor networks in the presence of one or more classes of misbehaving nodes. Binary hypothesis testing is considered where the honest nodes transmit their binary…

Read More

Extracting spread-spectrum hidden data from digital media

Extracting spread-spectrum hidden data from digital media Technology Used: Dot Net The problem of extracting blindly data embedded over a wide band in a spectrum (transform) domain of a digital medium image is considered. To develop a novel multicarrier/ signature iterative generalized least-squares (M-IGLS) core procedure to seek unknown data hidden in hosts via multicarrier spread-spectrum embedding. Neither the original host nor the embedding carriers are assumed available. Experimental studies on images show that the developed algorithm can achieve recovery probability of error close to what may be attained with…

Read More

A Novel Privacy Preserving Location-Based Service Protocol With Secret Circular Shift for K-NN Search

A Novel Privacy Preserving Location-Based Service Protocol With Secret Circular Shift for K-NN Search Technology Used: Java/J2EE Location-based service (LBS) is booming up in recent years with the rapid growth of mobile devices and the emerging of cloud computing paradigm. Among the challenges to establish LBS, the user privacy issue becomes the most important concern. A successful privacy-preserving LBS must be secure and provide accurate query [e.g., -nearest neighbor (NN)] results. In this work, we propose a private circular query protocol (PCQP) to deal with the privacy and the accuracy…

Read More

Redundancy Management of Multipath Routing forIntrusion Tolerance in Heterogeneous Wireless Sensor Networks

In this paper we propose redundancy management of heterogeneous wireless sensor networks (HWSNs), utilizing multipath routing to answer user queries in the presence of unreliable and malicious nodes. The key concept of our redundancy management is to exploit the tradeoff between energy consumption vs. the gain in reliability, timeliness, and security to maximize the system useful lifetime. We formulate the tradeoff as an optimization problem for dynamically determining the best redundancy level to apply to multipath routing for intrusion tolerance so that the query response success probability is maximized while…

Read More