Preventing Distributed Denial-of-Service Flooding Attacks With Dynamic Path Identifiers

Preventing Distributed Denial-of-Service Flooding Attacks With Dynamic Path Identifiers There are increasing interests in using path identifiers ( PIDs ) as inter-domain routing objects. However, the PIDs used in existing approaches are static, which makes it easy for attackers to launch the distributed denial-of-service (DDoS) flooding attacks. To address this issue, in this paper, we present the design, implementation, and evaluation of dynamic PID (D-PID), a framework that uses PIDs negotiated between the neighboring domains as inter-domain routing objects. In D-PID, the PID of an inter-domain path connecting the two…

Read More

Contradiction Based Gray-Hole Attack Minimization for Ad-Hoc Networks

Contradiction Based Gray-Hole Attack Minimization for Ad-Hoc Networks Although quite popular for the protection for ad-hoc networks (MANETs, IoT, VANETs, etc.), detection & mitigation techniques only function after the attack has commenced. Prevention, however, attempts at thwarting an attack before it is executed. Both techniques can be realized either by the collective collaboration of network nodes (i.e., adding security messages to protocols) or by internal deduction of attack state. In this paper, we propose a method for minimizing the gray-hole DoS attack. Our solution assumes no explicit node collaboration, with…

Read More

Optimal Power Allocation and Scheduling Under Jamming Attacks

Optimal Power Allocation and Scheduling Under Jamming Attacks A jammed wireless scenario is considered where a network operator aims to schedule users to maximize network performance while guaranteeing a minimum performance level to each user. We consider the case where no information about the position and the triggering threshold of the jammer is available. it is shown that the network performance maximization problem can be modeled as a finite-horizon joint power control and user scheduling problem, which is NP-hard. To find the optimal solution of the problem, we exploit dynamic…

Read More

Secure and Private Data Aggregation for Energy Consumption Scheduling in Smart Grids

Secure and Private Data Aggregation for Energy Consumption Scheduling in Smart Grids The recent proposed solutions for demand side energy management leverage the two-way communication infrastructure provided by modern smart-meters and sharing the usage information with the other users. In this paper, we first highlight the privacy and security issues involved in the distributed demand management protocols. We propose a novel protocol to share required information among users providing privacy, confidentiality, and integrity. We also propose a new clustering-based, distributed multi-party computation (MPC) protocol. Through simulation experiments we demonstrate the…

Read More

Light-weight and Robust Security-Aware D2D-assist Data Transmission Protocol for Mobile-Health Systems

Light-weight and Robust Security-Aware D2D-assist Data Transmission Protocol for Mobile-Health Systems With the rapid advancement of technology, healthcare systems have been quickly transformed into a pervasive environment, where both challenges and opportunities abound. On the one hand, the proliferation of smart phones and advances in medical sensors and devices have driven the emergence of wireless body area networks for remote patient monitoring, also known as mobile-health (M-health), thereby providing a reliable and cost effective way to improving efficiency and quality of health care. On the other hand, the advances of…

Read More

A Dynamical and Load-Balanced Flow Scheduling Approach for Big Data Centers in Clouds

A Dynamical and Load-Balanced Flow Scheduling Approach for Big Data Centers in Clouds Load-balanced flow scheduling for big data centers in clouds, in which a large amount of data needs to be transferred frequently among thousands of interconnected servers, is a key and challenging issue. The OpenFlow is a promising solution to balance data flows in a data center network through its programmatic traffic controller. Existing OpenFlow based scheduling schemes, however, statically set up routes only at the initialization stage of data transmissions, which suffers from dynamical flow distribution and…

Read More

Secure k-NN Query on Encrypted Cloud Data with Multiple Keys

Secure k-NN Query on Encrypted Cloud Data with Multiple Keys The k-nearest neighbors (k-NN) query is a fundamental primitive in spatial and multimedia databases. It has extensive applications in location-based services, classification & clustering and so on. With the promise of confidentiality and privacy, massive data are increasingly outsourced to cloud in the encrypted form for enjoying the advantages of cloud computing (e.g., reduce storage and query processing costs). Recently, many schemes have been proposed to support k-NN query on encrypted cloud data. However, prior works have all assumed that…

Read More

Privacy-Preserving Data Encryption Strategy for Big Data in Mobile Cloud Computing

Privacy-Preserving Data Encryption Strategy for Big Data in Mobile Cloud Computing Privacy has become a considerable issue when the applications of big data are dramatically growing in cloud computing. The benefits of the implementation for these emerging technologies have improved or changed service models and improve application performances in various perspectives. However, the remarkably growing volume of data sizes has also resulted in many challenges in practice. The execution time of the data encryption is one of the serious issues during the data processing and transmissions. Many current applications abandon…

Read More

Power Consumption-Aware Virtual Machine Placement in Cloud Data Center

Power Consumption-Aware Virtual Machine Placement in Cloud Data Center A set of Virtual Machine (VM) allocators for Cloud Data Centers (DCs) that perform the joint allocation of computing and network resources. VM requests are defined in terms of system (CPU, RAM and Disk) and network (Bandwidth) resources. As concerns the first ones, we allocate VM resources following two different policies, namely Best Fit and Worst Fit, corresponding to consolidation and spreading strategies respectively. For each server, the allocators choose the network path that minimizes electrical power consumption, evaluated according to…

Read More

Fast Phrase Search for Encrypted Cloud Storage

Fast Phrase Search for Encrypted Cloud Storage Cloud computing has generated much interest in the research community in recent years for its many advantages, but has also raise security and privacy concerns. The storage and access of confidential documents have been identified as one of the central problems in the area. In particular, many researchers investigated solutions to search over encrypted documents stored on remote cloud servers. While many schemes have been proposed to perform conjunctive keyword search, less attention has been noted on more specialized searching techniques. In this…

Read More