Improved topology assumptions for threshold cryptography in mobile ad hoc networks

Security is very important for the reliable operation of mobile Ad Hoc networks (MANETs). One of the critical security issues in MANETs is the revocation of misbehaving nodes. In this paper, we propose a trust based threshold cryptography revocation scheme for MANETs. In our proposed scheme, the master private key is split into n pieces according to a random polynomial. Each node in the proposed scheme is configured with a share ski of the CA private key SK, the node's public key pki, and the CA public key PK before joining the network. Meanwhile, the master private key could be recovered by combining any threshold t pieces based on Lagrange interpolation. Consequently, the proposed scheme improves the safety levels in MANETs. The proposed hop-by-hop certificate revocation scheme is based on both threshold cryptography and transitive trust between mobile nodes. Because of the decentralized nature of our proposed scheme, it enables a group of legitimate nodes to perform fast revocation of a nearby misbehaving node. The proposed scheme is highly robust in the mobility environment of MANETs. The advantages of the proposed scheme are justified through extensive simulations.

A Mobile Ad hoc NETwork (MANET) is a network that expedites nodes to communicate each other in the absence of a fixed infrastructure. In recent years research issues for securing MANET is burgeoning as it finds use in variety of applications. Security of communication in this type of network is paramount for secure transmission. Routing attacks has drawn sizable consideration since it could cause the most devastating damage to MANET. Even though there prevail many intrusion response techniques to alleviate such critical attacks, existing system usually tries to isolate malicious nodes based on binary or naïve fuzzy response decisions. Binary responses outcomes in the unexpected network partition, causing additional damages to the network infrastructure and naïve fuzzy responses could lead to uncertainty in countering routing attacks in MANET. This paper targets on the replica attack in MANET. A serious repercussion of the device capture attack is the node replication attacks in which adversaries deploy a large number of replicas of the compromised/ captured nodes throughout the network. Replicated nodes have all legitimate security credentials and therefore can launch various insider attacks or even take over the network effortlessly. They are undeniably "Attack multipliers" and therefore are immensely catastrophic to the network. An efficient detection scheme named Sentinel Protocol is proposed for detecting replica attack in MANET. Detailed simulation studies have confirmed the efficiency and effectiveness of the proposed protocol.

With the increasing demand of ubiquitous computing, the interconnection of mobile ad hoc networks (MANETs) to Internet is also getting attractive, which is so-called hybrid or connected MANET. In MANET paradigm, routing is a challenging task due to mobility and the resulting inherent dynamic network topology. In many applications, multipath routing scheme is favorable than single-path routing due to many advantages. Security issues in hybrid MANET, however, is still challenging task. There are two critical issues for providing a secure multihop route discovery: Internet connectivity and ad hoc routing. In this paper, we present architecture framework for secure hybrid multipath MANET that can provide global connectivity. We provide security analysis by using BAN logic.

Mobile ad hoc network (MANET) is an appealing technology that has attracted lots of research efforts. On-demand routing protocol such as AODV may suffer from frequent topological changes. Due to frequent communication failures, multipath MANET is preferred than single-path MANET in many applications as former is used for achieving robustness and load balancing and improving reliability. Although multipath MANET is attractive solution, there are still some major flaws that prevent commercial growth. Security is one of these main barriers; MANETs are known to be particularly vulnerable to security attack. The paper presents a design of robust and secure framework for multipath MANET. In this paper, we propose not only a robust multipath routing protocol but also an extended security scheme. We discuss security analysis for proposed security scheme. And we also conduct simulation to evaluate such a framework through different performance metrics. Results show that the proposed routing protocol achieves better performance in terms of various metrics than other protocols.

Energy is an important issue in MANET (Mobile Ad hoc Network). Nodes in network are working in presence of limited energy. So, energy efficient routing is needed for reducing energy consumption. Energy efficient routing schemes can greatly reduce energy consumption and extends the lifetime of the networks. Multipath routing protocol (AOMDV) having more than one path, if the first one is break then second provides the proper packet delivery, this causes reduced node energy consumption and the topology of MANETs always changes, due to the high mobility of nodes. This makes it more difficult to find the routes that message packets use when they are routed. The location based routing provides the location information of the destination to route a packet toward. This paper provides comparison and study on reduced energy consumption by using multipath protocol and performance which is evaluated by performance metrics in case of AOMDV and energy based AOMDV. Now here DREAM protocol is used with AOMDV to finding location of mobile nodes but not with energy but here measures their performance with both multipath protocols. I. INTRODUCTION A mobile ad hoc network (MANET) is a dynamic distributed system of mobile formed by means of multi-hop wireless communication without the use of any existing network infrastructure. MANET routing protocols can be classified into two classes. Proactive protocols, they requires the nodes to periodically exchange the table information to update the pre-determine routes between any pair of source destination nodes. Reactive protocols can establish routes only when they require. MANET routing protocols can be classified on the bases of the methods of delivery of data packets from source to destination. Single Path routing protocols learn routes and select a single best route to each destination. These protocols are incapable of load balancing traffic. Multi-path routing protocols learn routes and can select more than one path to a destination. These protocols are better for performing load balancing. This paper provides the comparison between results about Multipath routing in AOMDV (13), AOMDV with location and Energy with AOMDV.

ABSTRACTA certificateless public key cryptosystem can make a special contribution to building key distribution and management architecture in resource‐constrained mobile ad hoc networks (MANETs) because it has no separate certificate and no complex certificate management problems. In this paper, we present a virtual private key generator (VPKG)‐based escrow‐free certificateless public key cryptosystem as a novel combination of certificateless and threshold cryptography. Using secret sharing, we build a VPKG whose members collaboratively calculate the partial private key and send it to the user via public channels. The private key of a user is generated jointly by the VPKG and the user. Each of them has “half” of the secret information about the private key of the user. In addition, binding a user's public key with its identity and partial private key, respectively, raises our schemes to the same trust level as is enjoyed in a traditional public key infrastructure. We also show that the proposed scheme is secure against public key replacement attacks and passive attacks. Copyright © 2012 John Wiley & Sons, Ltd.

It is our great pleasure to welcome you to the 3rd ACM Workshop on Security of Ad Hoc and Sensor Networks (SASN'05), held in conjunction with the 12th ACM Conference on Computer and Communications Security (CCS'05), November 7, 2005, in Alexandria, Virginia.This year we received a total of 39 submissions on various aspects of ad-hoc and sensor network security. The program committee selected 6 as regular papers that cover a variety of topics, including trust establishment in Mobile Ad-Hoc Networks (MANETs), security of vehicular ad-hoc networks, secure group communication, key pre-distribution for sensor networks, jamming attacks against sensor network MAC protocols, and defense against Denial-of-Service (DoS) attacks. This year we continue the tradition of SASN'03 and SASN'04 to encourage the presentation and discussion of work-in-progress on ad-hoc and sensor network security. Among the 39 submissions, the program committee selected 7 papers to present in work-in-progress sessions, covering topics on anonymous routing for MANETs, key distribution for inter-group multicast in ad-hoc networks, improved topology assumptions for threshold cryptography in MANETs, RFID security, tracing in mobile wireless sensor networks, time synchronization attacks in sensor networks, and coordinated deployment for improving secure communications and sensing coverage in wireless sensor networks. In addition, the program includes a panel on Advances in Sensor and Ad-hoc Network Security and an invited keynote talk by Radha Poovandran (University of Washington) on Information Assurance in MANETs and Wireless Sensor Networks. We hope that these proceedings will serve as a valuable reference for security researchers and developers.

Key management scheme is a critical issue of Mobile Ad hoc Networks (MANETs). Malicious nodes may attack the legitimate nodes by eavesdropping. Data encryption is a solution to resolve this problem. Due to the restricted energy and computational capability of MANETs, it's necessary to design a lightweight and storage efficient key management scheme. In this paper, we propose a hop-by-hop authentication and routing-driven dynamic key management scheme. An improved Elliptic Curve Diffie-Hellman (ECDH) protocol with mutual authentication is used to generate pair-wise keys, and the pair-wise keys are stored in caches before their expiration. The simulation results and performance evaluation show that the proposed scheme can reduce more key storage space than other schemes. Furthermore, it increases the security level of MANETs.

A digital signature is one of the most widely used cryptographic primitives in asymmetry cryptography. According to the security requirements in different symmetry or asymmetry network models, various digital signatures have been developed in the literature. To protect the right of the signer, Chaum and Antrepen first introduced the concept of an undeniable signature, where interactive protocols are needed for the verification process. Besides, a signer can, also, perform a disavowal protocol to prove that they did not sign the message. On the other hand, threshold cryptography is, usually, used to protect the system from a single point of failure. In a (t,n)-threshold signature scheme, as long as t people in the group of n people participate, the signature can be smoothly signed. By combining these two features, an undeniable threshold signature enjoys the advantages from both sides. After our survey, we found that the existing undeniable threshold signature schemes are either insecure or apply impractical assumptions. Thus, in this manuscript, we aim at designing a novel and provably secure undeniable threshold signature scheme. The proposed scheme is formally proven to be unforgeable and invisible. Besides, our scheme supports cheater identification, which allows one to find the cheater, when a signing protocol fails. Moreover, the proposed scheme can be performed without the help of trusted third parties or secure cryptographic modules, which would be more practical when our scheme is deployed in real-world applications.

In most studies on mobile ad hoc networks (MANET), simulation models are used for the evaluation of devices and protocols. Typically, such simulations focus on the specific higher layer protocols that are being proposed, and tend to ignore details of models at other layers, particularly the interactions with physical layer models. In this paper, we present the set of factors at the physical layer that are relevant to the performance evaluations of higher layer protocols. Such factors include signal reception, path loss, fading, interference and noise computation, and preamble length. We start the discussion with the comparisions of physical layer models in ns-2 and GloMoSim, two commonly used simulators for MANET studies, and then quantify the impact of the preceding factors under typical scenarios used for the performance evaluation of wireless ad hoc routing protocols. Our experimental results show that the factors at the physical layer not only affect the absolute performance of a protocol, but because their impact on different protocols is non-uniform, it can even change the relative ranking among protocols for the same scenari

A mobile ad hoc network is a collection of wireless mobile nodes that communicate with one another without any fixed networking infrastructure. Since the nodes in this network are mobile, the energy management and energy conservation become very critical in mobile ad hoc network. The nodes in this network have limited battery power and limited computational power with a small amount of memory. Such nodes must conserve energy during routing to prolong their usefulness and increase network lifetime. This research paper proposes a scheme that takes into consideration the energy awareness during route selection. This scheme observes power status of each and every node in the topology and further ensures the fast selection of routes with minimal efforts and faster recovery. Along with this scheme also introduce the concept of wirelessly recharge the nodes of the networks. The scheme is incorporated with the AODV protocol and introduces new protocol EEAODV the performance has been studied through simulation over NS-2.34.

A mobile ad hoc network (MANET) is a wireless network of mobile devices-such as PDAs, laptops, cell phones, and other lightweight, easily transportable computing devices-in which each node can act as a router for network traffic rather than relying on fixed networking infrastructure. As mobile computing becomes ubiquitous, MANETS becomes increasingly important. As a design paradigm, multiagent systems (MASs) can help facilitate and coordinate ad hoc-scenarios that might include security personnel, rescue workers, police officers, firefighters, and paramedics. On this network, mobile agents perform critical functions that include delivering messages, monitoring resource usage on constrained mobile devices, assessing network traffic patterns, analyzing host behaviors, and revoking access rights for suspicious hosts and agents. Agents can effectively operate in such environments if they are environment aware - if they can sense and reason about their complex and dynamic environments. Altogether, agents living on a MANET must be network, information, and performance aware. This article fleshes out how we apply this approach to populations of mobile agents on a live MANET.

In mobile ad-hoc networks, many routing algorithms rely on some form of flooding to accomplish the route discovery process. Flooding, however, consumes many valuable network resources, such as time, bandwidth and power. Most current routing schemes expire cached routes after a time to account for nodal movement. Expired routes are resources which, to this point, have been left untapped. The paper proposes a new route discovery method, called hot/cold routing, which directs broadcasts toward the destination node even in the absence of location information. The hot/cold routing scheme reduces the search space for the destination node by implementing an expired route cache that is utilized by each node in the network. Routes are added to the expired route cache as they expire from the active route cache and remain there until some time interval has passed or a new route has been discovered. Since these expired routes can provide valuable insight into finding new routes, hot/cold routing uses them to direct broadcasts toward the destination node. Hot/cold routing can save a significant quantity of valuable network resources because only nodes near the optimal path rebroadcast route requests.

Mobile ad hoc networks (MANETs) are collections of autonomous mobile nodes with links that are made or broken in an arbitrary way. Due to frequent node and link failures, multipath MANET is preferred than single-path MANET in many applications. Multipath routing schemes are used for achieving various goals such as robustness, reliability, and load balancing. However, before they can be successfully deployed several security threats must be addressed. Due to lack of fixed infrastructure, security in ad-hoc routing is challenging task, especially in multipath MANET. In this paper, we propose a robust multipath routing scheme for MANET and also security mechanism for such a routing scheme. We discuss security analysis for our scheme. And we conduct simulation to evaluate the cost of the proposed secure multipath routing scheme and present some preliminary results.

Nodes in Mobile Ad hoc Network (MANET) are forming a dynamic topology by that the nodes are continuously change their location and also the nodes functioning is dependent on the limited battery capacity that is called energy. The dynamic behavior of network connection is not maintained for long time. All nodes in network are energy dependent and efficient energy utilization is one of the important criteria in MANET. In this paper we proposed a new location based energy efficient scheme with AODV protocol. In this scheme energy dependent nodes are improving the routing capability of AODV protocol on the basis of location based protocol LAR (Location Aided Routing protocol). In network nodes are not aware about their energy status and also recur flooding of routing packets are consumes more energy in network by that the most of the energy is wasted in connection establishment. LAR protocol reduces that possibility of destination finding by maintain the record of location of each node in network respect to other nodes. It implies that every node in network is maintaining the record of other nodes (participating in routing procedure) with their current location and speed. If the nodes in network are know about the energy status and also about the status of location of receiver that reduces the energy consumption. The main aim of proposed scheme is to enhance the energy utilization in network. The performance of normal AODV, AODV with LAR and AODV with LAR and Energy is illustrate here and observe that the LAR protocol reduces the energy consumption and prolog the network lifetime that completely depend on the energy of mobile nodes.