Cloud Data Security Using Elliptic Curve Cryptography

Data security is, protecting data from ill- conceived get to, utilize, introduction, intrusion, change, examination, recording or destruction. Cloud computing is a sort of Internet-based computing that grants conjoint PC handling resources and information to PCs what's more, different gadgets according to necessity. It is a model that empowers universal, on-request access to a mutual pool of configurable computing resources. At present, security has been viewed as one of the best issues in the improvement of Cloud Computing. The key issue in effective execution of Cloud Computing is to adequately deal with the security in the cloud applications. This paper talks about the part of cryptography in cloud computing to improve the data security. The expectation here is to get bits of knowledge another security approach with the usage of cryptography to secure information at cloud data centers

Dynamic Load Balancing protocols in WSN

In recent times, significant amount of research has been done in the vast area of wireless sensors networks (WSNs) owing to their multi dimensional applications in disaster management, health-care, monitoring systems, underwater application and many more. The major focus of research has been to enhance the life of the wireless sensor network via increasing the lifetime of each sensor node as a sudden or unpredictable 'death' of a node may bring the whole network down. To prevent this kind of disaster taking place we review in this paper various approaches which aim to enhance the lifetime of the WSN by dynamically distributing the load among the nodes and some other energy aware routing protocols too. DOI: 10.17762/ijritcc2321-8169.15066

Evaluated reputation-based trust for WSN security

During the last years, Wireless Sensor Networks (WSNs) and its applications have obtained considerable momentum. However, security and power limits of WSNs are still important matters. Many existing approaches at most concentrate on cryptography to improve data authentication and integrity but this addresses only a part of the security problem without consideration for high energy consumption. Monitoring behavior of node neighbors using reputation and trust models improves the security of WSNs and maximizes the lifetime for it. However, a few of previous studies take into consideration security threats and energy consumption at the same time. Under these issues Modified Reputation-Based Trust model proposed and optimized for security strength. During evaluation of the model with well-known models two security threats (oscillating and collusion) were applied in order to measure the accuracy, scalability, trustworthiness and energy consumption. As a result, the effects of collusion and oscillating on proposed model are minimized and energy consumption for dynamic networks reduced. Also, simulation results show that MRT has better average accuracy and less average path length than other mechanisms, due to the security and energy aware. Keywords: Wireless Sensor Networks (WSNs), Collusion, Oscillating, Power Consumption, Trust and Reputation Model

A Coalition-Formation Game Model for Energy-Efficient Routing in Mobile Ad-hoc Network

One of the most routing problems in Mobile Ad-hoc Network is the node’s selfishness. Nodes are generally selfish and try to maximize their own benefit; hence these nodes refuse to forward packet on behalf of others to preserve their limited energy resources. This selfishness may lead to a low efficiency of routing. Therefore, it is important to study mechanisms which can be used encourage cooperation among nodes, to maintain the network efficiency. In this paper, we propose a cooperative game theoretic model to support more energy-aware and available bandwidth routing in MANET. We introduce a novel framework from coalitional-formation game theory, called hedonic coalition-formation game. We integrate this model to OLSR protocol that is an optimization over the classical link state protocol for the MANETs. Within each coalition, a coalition coordinator acts as a special MPR node to improve the energy efficient and the packet success rate of the transmission. Simulation results show how the proposed algorithm improve the performance in terms of the percentage of selected MPR nodes in the network, the percentage of alive nodes by time, and the Packet Delivery Ratio. Which prove that our proposed model leads, to better results compared to the classical OLSR

A Multiple Classifiers Broadcast Protocol for VANET

Many types of artificial intelligent machines have been used for decision making purposes. In VANET broadcast protocols, vehicles must decide the received messages are to be rebroadcast or not. Several attributes such as sender-to-receiver distance, sender-receiver speed difference, number of neighboring vehicles, as well as vehicle’s movement direction are important measures to take the broadcast decision. As the relationships of attributes to the broadcast decision cannot be mathematically defined, the use of a classifier-based artificial intelligence may approximately predict the relationships of all the incorporated attributes to such a decision. As the decision is based on prediction, the use of multiple classifiers in decision making may increase accuracy. Therefore, this research employs a combined-classifiers at an abstract level to provide firmer broadcast decisions on VANET. Our research results justify that the performance of our combined multiple-classifiers outperformed a single-classifier scheme. The multi-classifiers scheme contributes to an average increase of 2.5% in reachability compared to that of the efficient counter–based scheme (ECS). The combined multi-classifiers scheme also improves the saving in rebroadcast tries by 38.9%

Secret Disclosure attack on Kazahaya, a Yoking-Proof For Low-Cost RFID Tags

Peris-Lopez et al. recently provides some guidelines that should be followed to design a secure yoking-proof protocol. In addition, conforming to those guidelines and EPC C1 G2, they presented a yoking-proof for low-cost RFID tags, named Kazahaya. However, in this letter, we scrutinize its security showing how an passive adversary can retrieve secret parameters of patient\u27s tag in cost of O(216) o-line PRNG evaluations. Given the tag\u27s secret parameters, any security claims are ruined. Nevertheless, to show other weaknesses of the protocol and rule out any possible improvement by increasing the length of the used PRNG, we presented a forgery attack that shows that a proof generated at time tn can be used to forge a valid proof for any desired time tj . The success probability of this attack is `1\u27 and the complexity is negligible