wireless mobile devices that form a network on the fly to allow communication with each other without any infrastructure. Due to its nature, providing security in this network is challenging. Threshold Cryptography (TC) provides a promise of securing this network. In this paper, our purpose is to find most suitable ECC algorithm compared to RSA. Through our implementation of Elliptic Curve Cryptography-based Threshold Cryptography (ECC-TC), we have explored three most-efficient ECC encryption algorithms and put forth possibility of using these ECC-TC algorithms in different scenarios in a MANET. We compare all ECC-TC results and suggest an algorithm that would be most suitable for MANET. Finally, we put forth a new secret sharing alternative that limit communication overheads for transmitting multiple secrets at the same time. Key words:

A Mobile Ad hoc Network (MANET) is a system of wireless mobile nodes that dynamically self-organiz e in arbitrary and temporary network topologies allowing people and devices to inter-network withou t any preexisting communication infrastructure. Takin g into account its nature and challenges and security issues, we briefly discuss current security solutio ns, particularly Threshold Cryptography (TC). Already T C is being sought in computer networks to provide security in terms of availability, confidentiality, and secure key or data distribution.S o we investigate to find out what makes it difficult to implement TC in ad hoc networks. To find answers to these questions, w e discuss our RS A-based Threshold Cryptography (RS ATC) implementation. Through our implementation, we have put forth various drawbacks of key sharing in RS A-TC and have suggested an alternative method of splitting message. Our work further proves why RS ATC is unsuitable in MANET. Finally, we explore Elliptic Curve Cryptology (ECC) and suggest reasons why ECC based Threshold Cryptography (ECC-TC) could be a very effective alternative to RS A-TC schemes in MANET.

In this paper we provide a new scheme to securely forward the message in wireless mobile ad hoc networks (MANETs) by using existing homomorphic encryption schemes. This scheme is an alternative for threshold cryptography (TC) in MANETs to securely forward the message. By using homomorphic encryption schemes we remove the computational cost associated with Lagrange Interpolation scheme used in TC and also increase the success rate of the encrypted message at the destination in MANETs. In this paper we determine the computational cost of the homomorphic encryption schemes such as Domingo-Ferrer’s new Privacy Homomorphism, Domingo-Ferrer’s additive and multiplicative Privacy Homomorphism, Domingo-Ferrer’s Privacy Homomorphism allowing field operations on encrypted data and Mixed multiplicative homomorphism (MMH) and suggest a better encryption schemes to be used in MANETs. We also provide the implementation details of the proposed new scheme in MANETs. In addition we provide an alternative new scheme for Domingo-Ferrer’s new Privacy Homomorphism and

Abstract—We present a class of Minimum Cost Blocking (MCB) problems in Wireless Mesh Networks (WMNs) with multi-path wireless routing protocols. We establish the provable superiority of multi-path routing protocols over conventional protocols against blocking, node-isolation and network-partitioning type attacks. In our attack model, an adversary is considered successful if he is able to capture/isolate a subset of nodes such that no more than a certain amount of traffic from source nodes reaches the gateways. Two scenarios, viz. (a) low mobility for network nodes, and (b) high degree of node mobility, are evaluated. Scenario (a) is proven to be NP-hard and scenario (b) is proven to be #P-hard for the adversary to realize the goal. Further, several approximation algorithms are presented which show that even in the best case scenario it is at least exponentially hard for the adversary to optimally succeed in such blocking-type attacks. These results are verified through simulations which demonstrate the robustness of multi-path routing protocols against such attacks. To the best of our knowledge, this is the first work that theoretically evaluates the attack-resiliency and performance of multi-path protocols with network node mobility.