Secure Data Retrieval for Decentralized Disruption-Tolerant Military Networks

Abstract

      Mobile nodes in military environments such as a battlefield or a hostile region are likely to suffer from intermittent network connectivity and frequent partitions. Disruption-tolerant network (DTN) technologies are becoming successful solutions that allow wireless devices carried by soldiers to communicate with each other and access the confidential information or command reliably by exploiting external storage nodes. Some of the most challenging issues in this scenario are the enforcement of authorization policies and the policies update for secure data retrieval. Ciphertext-policy attribute-based encryption (CP-ABE) is a promising cryptographic solution to the access control issues. However, the problem of applying CP-ABE in decentralized DTNs introduces several security and privacy challenges with regard to the attribute revocation, key escrow, and coordination of attributes issued from different authorities. In this paper, we propose a secure data retrieval scheme using CP-ABE for decentralized DTNs where multiple key authorities manage their attributes independently. We demonstrate how to apply the proposed mechanism to securely and efficiently manage the confidential data distributed in the disruption-tolerant military network.

Domain : Networking

Contact Details

Ph. no : 7200555526

e-mail : info.nanosoftwares@gmail.com

Load-Balancing Multipath Switching System with Flow Slice

ABSTRACT:-

Multipath Switching systems (MPS) are intensely used in state-of-the-art core routers to provide terabit or even petabit switching capacity. One of the most intractable issues in designing MPS is how to load balance traffic across its multiple paths while not disturbing the intraflow packet orders. Previous packet-based solutions either suffer from delay penalties or lead to O(N2 ) hardware complexity, hence do not scale. Flow-based hashing algorithms also perform badly due to the heavy-tailed flow-size distribution. In this paper, we develop a novel scheme, namely, Flow Slice (FS) that cuts off each flow into flow slices at every intraflow interval larger than a slicing threshold and balances the load on a finer granularity. Based on the studies of tens of real Internet traces, we show that setting a slicing threshold of 1-4 ms, the FS scheme achieves comparative load-balancing performance to the optimal one. It also limits the probability of out-of-order packets to a negligible level (10-6) on three popular MPSes at the cost of little hardware complexity and an internal speedup up to two. These results are proven by theoretical analyses and also validated through trace-driven prototype simulations.

 Keywords:- IEEE Project Titles 2012, Networking Titles, Cloud Communication  Titles, Secure  Computing Titles, Networking Titles.

A New Cell Counting Based Attack Against Tor.

ABSTRACT:-

Various low-latency anonymous communication systems such as Tor and Anonymizer have been designed to provide anonymity service for users. In order to hide the communication of users, most of the anonymity systems pack the application data into equal-sized cells (e.g., 512 B for Tor, a known real-world, circuit-based, low-latency anonymous communication network). Via extensive experiments on Tor, we found that the size of IP packets in the Tor network can be very dynamic because a cell is an application concept and the IP layer may repack cells. Based on this finding, we investigate a new cell-counting-based attack against Tor, which allows the attacker to confirm anonymous communication relationship among users very quickly. In this attack, by marginally varying the number of cells in the target traffic at the malicious exit onion router, the attacker can embed a secret signal into the variation of cell counter of the target traffic. The embedded signal will be carried along with the target traffic and arrive at the malicious entry onion router. Then, an accomplice of the attacker at the malicious entry onion router will detect the embedded signal based on the received cells and confirm the communication relationship among users. We have implemented this attack against Tor, and our experimental data validate its feasibility and effectiveness. There are several unique features of this attack. First, this attack is highly efficient and can confirm very short communication sessions with only tens of cells. Second, this attack is effective, and its detection rate approaches 100% with a very low false positive rate. Third, it is possible to implement the attack in a way that appears to be very difficult for honest participants to detect (e.g., using our hopping-based signal embedding).

Keywords:- IEEE Project Titles 2012, Networking Titles, Wire Less Networking Titles, Cloud Communication titles, Secure Communication Title.

View-invariant action recognition based on Artificial Neural Networks.

ABSTRACT:-

In this paper, a novel view invariant action recognition method based on neural network representation and recognition is proposed. The novel representation of action videos is based on learning spatially related human body posture prototypes using self organizing maps. Fuzzy distances from human body posture prototypes are used to produce a time invariant action representation. Multilayer perceptrons are used for action classification. The algorithm is trained using data from a multi-camera setup. An arbitrary number of cameras can be used in order to recognize actions using a Bayesian framework. The proposed method can also be applied to videos depicting interactions between humans, without any modification. The use of information captured from different viewing angles leads to high classification performance. The proposed method is the first one that has been tested in challenging experimental setups, a fact that denotes its effectiveness to deal with most of the open issues in action recognition.

Keywords: IEEE Project Title 2012, Networking Title, Cloud Computing Title, Wireless Communication Title.  

TAM A Tiered Authentication of Multicast Protocol for Ad-Hoc Networks

ABSTRACT

Multicast streams are the dominant application traffic pattern in many mission critical ad-hoc networks. The limited computation and communication resources, the large scale deployment and the unguaranteed connectivity to trusted authorities make known security solutions for wired and single-hop wireless networks inappropriate for such application environment. This paper promotes a novel Tiered Authentication scheme for Multicast traffic (TAM) for large scale dense ad-hoc networks. Nodes are grouped into clusters. Multicast traffic within the same cluster employs one-way chains in order to authenticate the message source. Cross-cluster multicast traffic includes a message authentication codes (MACs) that are based on a set of keys. Each cluster uses a unique subset of keys to look for its distinct combination of valid MACs in the message in order to authenticate the source. TAM thus combines the advantages of the secret information asymmetry and the time asymmetry paradigms and exploits network clustering to reduce overhead and ensure scalability. The numerical and analytical results demonstrate the performance advantage of TAM.

Keywords: IEEE Project 2012, Networks Title, Image Processing Title, Data Mining Title, Cloud Computing Title. 

FESCIM: FAIR, EFFICIENT, AND SECURE COOPERATION INCENTIVE MECHANISM FOR MULTIHOP CELLULAR NETWORKS

ABSTRACT

In multihop cellular networks, the mobile nodes usually relay others' packets for enhancing the network performance and deployment. However, selfish nodes usually do not cooperate but make use of the cooperative nodes to relay their packets, which has a negative effect on the network fairness and performance. In this paper, we propose a fair and efficient incentive mechanism to stimulate the node cooperation. Our mechanism applies a fair charging policy by charging the source and destination nodes when both of them benefit from the communication. To implement this charging policy efficiently, hashing operations are used in the ACK packets to reduce the number of public-key-cryptography operations. Moreover, reducing the overhead of the payment checks is essential for the efficient implementation of the incentive mechanism due to the large number of payment transactions. Instead of generating a check per message, a small-size check can be generated per route, and a check submission scheme is proposed to reduce the number of submitted checks and protect against collusion attacks. Extensive analysis and simulations demonstrate that our mechanism can secure the payment and significantly reduce the checks' overhead, and the fair charging policy can be implemented almost computationally free by using hashing operations.

Keywords: IEEE Project 2012, Data Mining Title, Networking Title, Cloud Computing Title, Image Processing.

DSDMAC DUAL SENSING DIRECTIONAL MAC PROTOCOL FOR AD HOC NETWORKS WITH DIRECTIONAL ANTENNAS

ABSTRACT

Applying directional antennas in wireless ad hoc networks can theoretically achieve higher spatial multiplexing gain and, thus, higher network throughput. However, in practice, deafness, hidden-terminal, and exposed terminal problems are exaggerated with directional antennas, and they cause the degradation of the overall network performance. Although there are several random-access-based medium-access control (MAC) protocols being proposed in the literature for networks with directional antennas, the deafness, hidden-terminal, and exposed terminal problems have yet to be fully solved. In this paper, we present a new MAC protocol called the dual-sensing directional MAC (DSDMAC) protocol for wireless ad hoc networks with directional antennas. Different from existing protocols, the DSDMAC protocol relies on the dual-sensing strategy to identify deafness, resolve the hidden-terminal problem, and avoid unnecessary blocking. The integrity of the DSDMAC protocol is verified and validated using , which is a formal protocol verification and validation tool. We further develop an analytical framework to quantify the performance of the DSDMAC protocol and conduct extensive simulations, which verify the accuracy of the analysis. The protocol verification, analysis, and simulation results show the robustness and superior performance of the DSDMAC protocol, which can achieve a much higher network throughput and lower delay utilizing the spatial multiplexing gain of the directional antennas. The results presented in this paper show that the proposed DSDMAC protocol can substantially outperform the state-of-the-art protocols.

Keywords: IEEE Project 2012, Data Mining Title, Networking Title, Mobile Computing Title.