By offering sophisticated services and centralizing a huge volume of personal data, modern smartphones changed the way we socialize, entertain and work. To this aim, they rely upon complex hardware/software frameworks leading to a number of vulnerabilities, attacks and hazards to profile individuals or gather sensitive information. However, the majority of works evaluating the security degree of smartphones neglects steganography, which can be mainly used to: i) exfiltrate confidential data via camouflage methods, and ii) conceal valuable or personal information into innocent looking carriers. Therefore, this paper surveys the state of the art of steganographic techniques for smartphones, with emphasis on methods developed over the period 2005 to the second quarter of 2014. The different approaches are grouped according to the portion of the device used to hide information, leading to three different covert channels, i.e., local, object and network. Also, it reviews the relevant approaches used to detect and mitigate steganographic attacks or threats. Lastly, it showcases the most popular software applications to embed secret data into carriers, as well as possible future directions.

Steganography in Modern Smartphones and Mitigation Techniques

By offering sophisticated services and centralizing a huge volume of personal data, modern smartphones changed the way we socialize, entertain and work. To this aim, they rely upon complex hardware/software frameworks leading to a number of vulnerabilities, attacks and hazards to profile individuals or gather sensitive information. However, the majority of works evaluating the security degree of smartphones neglects steganography, which can be mainly used to: i) exfiltrate confidential data via camouflage methods, and ii) conceal valuable or personal information into innocent looking carriers. 
Therefore, this paper surveys the state of the art of steganographic techniques for smartphones, with emphasis on methods developed over the period 2005 to the second quarter of 2014. The different approaches are grouped according to the portion of the device used to hide information, leading to three different covert channels, i.e., local, object and network. Also, it reviews the relevant approaches used to detect and mitigate steganographic attacks or threats. Lastly, it showcases the most popular software applications to embed secret data into carriers, as well as possible future directions.

IoT objects that have a resource constrained nature resulting in a number of attacks in the routing protocol for lossy networks and low-power networks. RPL is very vulnerable to selfish behaviours and internal attacks though they are built with encryption protection to secure messages. To address this vulnerability, in this paper, we propose a novel trustworthiness methodology based on metric for incorporating trust evaluation, enhancing the robustness of security mechanism. Simulation results indicate that the proposed work is efficient in terms of throughput, nodes’ rank changes, energy consumption and packet delivery ratio. Moreover, using mathematical modelling, it has been observed that this methodology meets the demands of loop-freeness, optimality and consistency. This shows that this metic has both monotonicity and isotonicity requirements to enable the routing protocol. Incorporating the concepts of game theory, we can use this technique as a strategy to iterate Prisoner’s Dilemma. Both evolutionary simulation and mathematical analysis indicate that the proposed metric-based routing protocol is an efficient technique in promoting evolution and stability of the IoT network.

https://irojournals.com/itdw/V3/I2/01.pdf

Metric Routing Protocol for Detecting Untrustworthy Nodes for Packet Transmission

$K$ -anonymity has been used to protect location privacy for location monitoring services in wireless sensor networks (WSNs), where sensor nodes work together to report $k$ -anonymized aggregate locations to a server. Each $k$ -anonymized aggregate location is a cloaked area that contains at least $k$ persons. However, we identify an attack model to show that overlapping aggregate locations still pose privacy risks because an adversary can infer some overlapping areas with less than $k$ persons that violates the $k$ -anonymity privacy requirement. In this paper, we propose a reciprocal protocol for location privacy (REAL) in WSNs. In REAL, sensor nodes are required to autonomously organize their sensing areas into a set of non-overlapping and highly accurate $k$ -anonymized aggregate locations. To confront the three key challenges in REAL, namely, self-organization, reciprocity property and high accuracy, we design a state transition process, a locking mechanism and a time delay mechanism, respectively. We compare the performance of REAL with current protocols through simulated experiments. The results show that REAL protects location privacy, provides more accurate query answers, and reduces communication and computational costs.

REAL: A Reciprocal Protocol for Location Privacy in Wireless Sensor Networks

Wireless Sensor Networks (WSN) are naturally resource-constrained and have been deployed in various applications such as home monitoring, health care monitoring and military systems. These applications are connected to numerous devices capable of interacting with each other over the internet called as Internet of Things (IoT). WSN application plays a main part in the IoT environment. In WSN, sensors are randomly positioned in harsh surroundings where the communication network is facing privacy issues which is the most critical for data transmission. In this paper, we proposed a cryptographic based clustering structure for preserving data privacy using Optimal Privacy-Multihop Dynamic Clustering Routing Protocol (OP-MDCRP) that improves data privacy and energy efficient routing for the heterogeneous network which uses both clustering and multi-hop communication to reduce the energy consumption of sensor node and increases the lifetime of WSN. Based on the area, the source nodes are grouped to form a cluster in the random network. This scheme also provides high data privacy using Elliptic Curve Integrated Encryption-Key Provisioning Method (ECIES-KPM) along with small key size. Besides, data security based attacks are restricted by ECIES-KPM verification process. In this way, the sensitive data is confidentiality secured with low computational overhead. Experimental comparison shows that the evaluation of OP-MDCRP approach provides more data security than existing methods in terms of computational time, packet delivery ratio, energy consumption, average delay, network overhead and network lifetime.

Privacy preserving using multi-hop dynamic clustering routing protocol and elliptic curve cryptosystem for WSN in IoT environment

In MANET, mobile nodes communicate with each other using wireless channels, without any existing infrastructure. Transmission of all kinds of data will takes place with the help of multiple hops across the network, because the transmission as well as reception range of wireless network is limited. Therefore, routing protocol plays a vital role to facilitate communication within network and is also used to discover proper route between nodes. AODV, DSDV, DSR etc. are the most popular routing protocol for MANET which are used to established correct and efficient path between nodes. This paper examines working of two routing protocols for MANET– the Destination Sequenced Distance Vector (DSDV) which is a proactive protocol depending on routing tables which are maintained at each node and Ad hoc On- Demand Distance Vector routing (AODV) which find route to a destination on demand, whenever communication is needed and their comparison based on certain parameters.

/pdf/analysis-and-comparison-of-distance-vector-dsdv-and-aodv-o11ufzjjts.pdf

Analysis and Comparison of Distance Vector,DSDV and AODV Protocol of MANET

Multimedia Messaging Service (MMS) is a new standard in mobile messaging. Like SMS, MMS is a way to send a message from one mobile to another. MMS can include not just text, but also sound, images and video. For making MMS secure, steganography can be used with it. Without having privacy of data there is no meaning of doing communication using extremely high end technologies like SMS or MMS. This can be achieved by using steganography, which is the process of hiding secret information inside some carrier. SMS and MMS are can be used as carrier for hiding information on mobile devices. For insisting more security, encrypted data will be hidden inside MMS. As mobile devices have less memory and less processing power, we cannot use computation intensive encryption algorithms like AES, DES, and RSA. Elliptic Curve Cryptography (ECC) is emerging as an attractive alternative to traditional public-key cryptosystems. ECC offers equivalent security with smaller key sizes resulting in faster computations, lower power consumption, as well as memory and bandwidth savings. In my paper, I have proposed a method of encrypting text with ECC and then hiding encrypted text in MMS. SMS are limited to 160 character messages while MMS has no size limit. Biggest use of MMS is likely to be for companies for sending MMS messages to subscribers, enquirers or customers or for banks for sending secret information like PINS/Passwords etc. The computational burden of ECC can be minimized by executing ECC with multiple threads.

/pdf/securing-mms-with-high-performance-elliptic-curve-5aeptrydkw.pdf

Securing MMS with High Performance Elliptic Curve Cryptography

\n Routing in the Internet of Things (IoT) renders the protection against various network attacks as any attacker intrudes the routing mechanism for establishing the destructive mechanisms against the network, which insists the essentiality of the security protocols in IoT. Thus, the paper proposes a secure protocol based on an optimization algorithm, Monarch-Earthworm Algorithm (Monarch-EWA), which is the modification of the Monarch Butterfly algorithm using the Earthworm Optimization Algorithm (EWA) in order to render effective security to the network. Initially, the effective nodes are selected using the Deep Convolutional Neural Network (deep CNN) classifier based on the factors, trust and energy of the node, and stochastic gradient descent algorithm trains the deep CNN classifier. The secure nodes are involved in routing for which the secure multipath is chosen optimally using the proposed Monarch-EWA, which chooses the secure multipath based on the factors, energy and trust. The analysis of the proposed method in the presence of attacks, such as black hole, message replicate and distributed denial of service, reveals that the proposed method outperformed the existing methods. The proposed Monarch-EWA protocol acquired the maximal energy, throughput and detection rate of 0.2268 J, 48.2759% and 82.6231%, respectively, with the minimal delay of 0.0959 ms.

Monarch-EWA: Monarch-Earthworm-Based Secure Routing Protocol in IoT

Wireless Sensor Network (WSN) is a wide network consisting of a large number of sensor nodes in it. WSN is used mainly for environmental monitoring and data aggregation purpose. The main aim of an adversary is to attack the sink node which is the aggregation point for the whole WSN. So, first there comes a need to provide the privacy to sink location from the adversary. In this paper, we modified the existing sink location privacy protection scheme by dividing nodes in the network containing multiple sink into different zones in which real packets are forwarded to sink belong to corresponding zones and the intermediate node generating fake packets and sending it to fake sinks. The scheme performance analysis is done for a safe time, throughput, packet delivery ratio, end to end delay, the average energy consumption, normalized routing load and the proposed scheme tries to resist the traffic analysis attack better.

Location privacy of multiple sink using zone partitioning approach in WSN

A wireless ad-hoc network is a decentralized type of wireless network. The network is ad hoc because it does not rely on a preexisting infrastructure, such as routers in wired networks or access points in managed (infrastructure) wireless networks. Now a day in fast growing world, use of internet is increasing popularly and at the same time Location-based service is also getting more popular even in ad-hoc network. Location-based service providers require user’s current locations to answer their location-based queries. The primary objective of the present work is to develop a system which preserves the location privacy of the concerned individual by applying Kanonymization and obfuscation algorithms . This objective is achieved by simulating Kanonymization and obfuscation algorithms for Manhattan mobility model and Waypoint mobility model using NS-2.34 environment. In the experiments, the user’s current location is hide by rectangle [bounding box] according to users privacy need. General Terms Ad-hoc Networks, Security, Algorithms

/pdf/hybrid-model-for-location-privacy-in-wireless-ad-hoc-5dzq8oakkz.pdf

B. N. Jagdale

Papers

Analysis and Comparison of Distance Vector,DSDV and AODV Protocol of MANET

Securing MMS with High Performance Elliptic Curve Cryptography

Monarch-EWA: Monarch-Earthworm-Based Secure Routing Protocol in IoT

Location privacy of multiple sink using zone partitioning approach in WSN

Hybrid model for Location Privacy in Wireless Ad-Hoc Networks for Mobile Applications