Employing Keyed Hash Algorithm, Sequential Probability Ratio Test, and Temperature Comparison Test as Security Against Node Capture Attacks of IoT-Based WSNs

The emergence of IoT opened new opportunities for development in various fields. With all the information that it gathers, it became an interesting target for multiple attackers. Thus, this study will enforce security solutions to IoT-based devices specifically in the perception layer by incorporating a Temperature Comparison Test, Keyed Hash Algorithm and evaluating it using SPRT especially in the defense against malicious activities detected in the nodes of a network namely for Mobile and Immobile attacks. For immobile attacks, using the keyed hash algorithm and the SPRT, the hash key of the passcodes was compared to determine the safety of the nodes. Hence, from the functionality test that was conducted, and evaluating the data gathered using SPRT and Bernoulli’s equation, the reliability of the protocol to detect Immobile attacks is concluded to have a 100% detection rate. For mobile node attacks, the study assumes the environment to be under normal, warm, and cold room temperatures. where both mobile and without mobile attack is simulated, the result shows that there is only an overall 3% difference from the temperature measure by the sensor to the ambient temperature. Hence, combining these protocols that are applied in the study eliminates the single points of failure in the nodes that are either applicable only to a distributed scheme or mobility support, the study also compared the tested protocol to the other existing protocols.

On the Composition of Single-Keyed Tweakable Even-Mansour for Achieving BBB Security

Observing the growing popularity of random permutation (RP)-based designs (e.g, Sponge), Bart Mennink in CRYPTO 2019 has initiated an interesting research in the direction of RP-based pseudorandom functions (PRFs). Both are claimed to achieve beyond-the-birthday-bound (BBB) security of 2n/3 bits (n being the input block size in bits) but require two instances of RPs and can handle only oneblock inputs. In this work, we extend research in this direction by providing two new BBB-secure constructions by composing the tweakable Even-Mansour appropriately. Our first construction requires only one instance of an RP and requires only one key. Our second construction extends the first to a nonce-based Message Authentication Code (MAC) using a universal hash to deal with multi-block inputs. We show that the hash key can be derived from the original key when the underlying hash is the Poly hash. We provide matching attacks for both constructions to demonstrate the tightness of the proven security bounds.

High security mechanism: fragmentation and replication in the cloud with auto update in the system

Cloud Computing makes immense use of internet to store a huge amount of data. Cloud computing provides high quality service with low cost and scalability with less requirement of hardware and software management. Security plays a vital role in cloud as data is handled by third party hence security is the biggest concern to matter. This proposed mechanism focuses on the security issues on the cloud. As the file is stored at a particular location which might get affected due to attack and will lost the data. So, in this proposed work instead of storing a complete file at a particular location, the file is divided into fragments and each fragment is stored at various locations. Fragments are more secured by providing the hash key to each fragment. This mechanism will not reveal all the information regarding a particular file even after successful attack. Here, the replication of fragments is also generated with strong authentication process using key generation. The auto update of a fragment or any file is also done here. The concept of auto update of filles is done where a file or a fragment can be updated online. Instead of downloading the whole file, a fragment can be downloaded to update. More time is saved using this methodology.

Reversible Circuit Synthesis Time Reduction Based on Subtree-Circuit Mapping

Several works have been conducted regarding the reduction of the energy consumption in electrical circuits. Reversible circuit synthesis is considered to be one of the major efforts at reducing the amount of power consumption. The field of reversible circuit synthesis uses a large number of proposed algorithms to minimize the overall cost of circuits synthesis (represented in the line number and quantum cost), with minimal concern paid for synthesis time. However, because of the iterative nature of the synthesis optimization algorithms, synthesis time cannot be neglected as a parameter which needs to be tackled, especially for large-scale circuits which need to be realized by cascades of reversible gates. Reducing the synthesis cost can be achieved by Binary Decision Diagrams (BDDs), which are considered to be a step forward in this field. Nevertheless, the mapping of each BDD node into a cascade of reversible gates during the synthesis process is time-consuming. In this work, we implement the idea of the subtree-based mapping of BDD nodes to reversible gates instead of the classical nodal-based algorithm to effectively reduce the entire reversible circuit synthesis time. Considering Depth-First Search (DFS), we convert an entire BDD subtree in one step into a cascade of reversible gates. A look-up table for all possible combinations of subtrees and their corresponding reversible gates has been constructed, in which a hash key is used to directly access subtrees during the mapping process. This table is constructed as a result of a comprehensive study of all possible BDD subtrees and considered as a reference during the conversion process. The conducted experimental tests show a significant synthesis time reduction (around 95% on average), preserving the correctness of the algorithm in generating a circuit realizing the required Boolean function.

Image Steganography embedded with Advance Encryption Standard (AES) securing with SHA-256

The proposed paper, works upon the idea of securing the classified information. This is achieved by using steganography which is an approach to hide classified information into some other file while maintaining its visual aids and secondly is cryptography which works upon textual data and transform it in a way that no one can comprehend it. The proposed method secures the weaker section which is the key in Advance Encryption Standard using hashing technique. The proposed work enhances the level of concealment of information from unauthorized access and for covert information exchange by encrypting the data and hiding it into a multimedia file known as image. The Secure Hash Algorithm 256 generates a hash key of 256 bits which is an unbreakable hashing technique after that the key is used in the process of encrypting the text with Advance Encryption Standard 256 which is an unbreakable encryption technique till this time and a cipher text is obtained. The cipher text is embedded into a target image using Least Significant Bit method which make changes in image that cannot be understand by naked eyes. The change in byte is 0.000002%. It ensures the visual quality of an image remains intact. The distortion or change in the image remains intermittent to human eyes. The major issue concerned for the government and security agencies such as were to exchange highly classified information in a secure and undetectable manner and abide the notion of hacker to comprehend any such information.

A New Framework of IND-CCA Secure Public Key Encryption with Keyword Search

In the era of cloud computing, public key encryption with keyword search (PEKS) is an extremely useful cryptographic tool for searching on encryption data, whose strongest security notion is indistinguishability encryption against chosen ciphertext attack (ind-cca). Adballa et al. presented a transformation from identity based encryption (IBE) to PEKS in the Theory of Cryptography Conference 2010. This paper proposes a new framework of ind-cca secure PEKS in the standard model. Our main technical tool is a newly introduced notion of smooth projective hash function with key mapping, in which the hash key hk is mapped into another mapping projection key mhp besides the classical projection key hp. Finally, we provide an instantiation of our framework based on symmetric eXternal Diffie–Hellman assumption.

High Security Mechanism: Fragmentation and Replication in the Cloud with Auto Update in the System.

Cloud Computing makes immense use of internet to store a huge amount of data. Cloud computing provides high quality service with low cost and scalability with less requirement of hardware and software management. Security plays a vital role in cloud as data is handled by third party hence security is the biggest concern to matter. This proposed mechanism focuses on the security issues on the cloud. As the file is stored at a particular location which might get affected due to attack and will lost the data. So, in this proposed work instead of storing a complete file at a particular location, the file is divided into fragments and each fragment is stored at various locations. Fragments are more secured by providing the hash key to each fragment. This mechanism will not reveal all the information regarding a particular file even after successful attack. Here, the replication of fragments is also generated with strong authentication process using key generation. The auto update of a fragment or any file is also done here. The concept of auto update of filles is done where a file or a fragment can be updated online. Instead of downloading the whole file, a fragment can be downloaded to update. More time is saved using this methodology.

PROPOSING A NEW METHOD FOR ENCRYPTING SATELLITE IMAGES BASED ON HASH FUNCTION AND CHAOS PARAMETERS

Due to the importance of providing security in satellite imagery and their transmission, in this paper, a new method for encrypting satellite images based on Hash key-based symmetric cryptographic algorithm is proposed which is developed by combining the generated key and chaos mapping parameters. The benefits of this algorithm are high security, high sensitivity and using dynamic encryption blocks. The proposed algorithm consists of three main parts: in the first section, the encryption key is created using the SHA-512 Hash function. In the second section, the initial values and the parameters of the mapping Chaos are determined by the algebraic functions that are related to the primary key. In the third section, with the help of the encryption block, the encrypted image is finally obtained. The purpose of this article is to increase the security of encrypting satellite images by creating an unspecified encryption block to deal with a variety of attacks. In this regard, both aspects of security and performance of the proposed algorithm have been analysed and the results are evaluated.