Search

Random numbers are the critical components of most security algorithms. Generating random numbers from a natural source or any deterministic algorithm suffers from shorter periods, inefficient energy consumption, smaller keyspace, etc. This work proposes a technique to generate random numbers with reduced complexity while increasing the keyspace and period of the random numbers. This work presents a novel method of cross-over operation on two chaotic maps to design a new hybrid chaotic map. The Pseudorandom Number Generator (PRNG) is constructed from the newly designed chaotic map, and the bit sequences are analyzed to justify their security strength. It is then applied to encrypt the images, and their properties are investigated. The proposed system is measured to have a 21.9% increase in keyspace and stronger key sensitivity. The correlation coefficient and entropy of ciphered images were shown to have a uniform distribution of pixel values. The average number of pixels change rate (NPCR) in ciphered images is calculated to be 99.4694%. The unified average changing intensity (UACI) is averaged at 33.4211%. The experimental analysis validates the competence of the proposed chaotic system for cryptography. [ABSTRACT FROM AUTHOR]

This study introduces a cutting-edge image encryption algorithm aimed at elevating security standards. The Pan-Tompkins Algorithm (PTA) for key generation is proposed for the first time in this study. Additionally, employing steganography through the Least Significant Bit (LSB) method for embedding keys within the encrypted image enhances secure key distribution, thereby fortifying the encryption process. On the other hand, the integration of advanced algorithms, such as Zigzag scanning, the Affine Image Encryption Algorithm (AA), and the Vigenere Image Encryption Algorithm (VA), constitutes the fundamental innovation of the proposed image encryption algorithm. The proposed algorithm is named PanAAVA:Affine Algorithm and Vigenere Algorithm Encryption with PTA-Based Key Generation. The PanAAVA algorithm ensures unparalleled security by encrypting the positions and values of pixels using AA and VA. Notably, using PTA for key generation marks a distinctive and new key generation method feature of the algorithm. To assess the effectiveness of the PanAAVA, a comprehensive comparative analysis is conducted against well-established encryption methodologies, including Lena, Baboon, Airplane, and Pepper. The PanAAVA demonstrates exceptional proficiency in histogram analysis. The PanAAVA demonstrates a Unified Average Changing Intensity (UACI) of 33.4044%. Additionally, the Number of Pixels Change Rate (NPCR) is measured at 99.7442%, showcasing the algorithm's effectiveness in inducing significant pixel changes. The proposed algorithm's Mean Square Error (MSE) is calculated at 3.20679E5%. The proposed algorithm's Peak Signal to Noise Ratio (PSNR) is recorded at 9.512475. The Key Space Size of the proposed algorithm is measured at 2209. Regarding correlation analysis, the PanAAVA achieves a high correlation score of 7.9996. The proposed algorithm successfully passes the National Institute of Standards and Technology (NIST) analysis, demonstrating a remarkably strong correlation close to 0 and a Structural Similarity Index Measure (SSIM) of 0.9977. Furthermore, regarding quantum communication, the proposed algorithm maintains stable key rates of 47.5 ± 0.8 kHz during the day and 50.9 ± 0.7 kHz at night. Additionally, PanAAVA achieves low Quantum Bit Error Rate (QBER) values of 4.77 ± 0.02, ensuring reliable and secure communication. The PanAAVA also demonstrates robust asymmetries at 49.81 ± 0.02 and 50.14 ± 0.03 for a crystal length of 20 mm. highlighting PanAAVA's adaptability and effectiveness in different scenarios. PanAAVA outperforms other encryption algorithms concerning performance measurements and comparisons. In conclusion, the PanAAVA emerges as a beacon of superior security capabilities and innovation in image encryption, showcasing the potential to redefine standards in the field. [ABSTRACT FROM AUTHOR]

Recently, cloud computing has become a growing technology in the information technology industry because of its several smooth delivery services. In cloud computing, multi-tenancy is one of the primary features that affords economic and scalability significance to the service providers and end-users by distributing a similar cloud platform. Due to the increasing demand for cloud computing, cloud usage has increased, so various vulnerabilities and threats have also been enhanced. Hence, data security and privacy are considered the major issues of multi-tenant environments in the cloud. Several existing studies have developed different mechanisms to solve security issues in multi-tenant cloud environments. However, they faced various problems while improving security, and this led to a lack of confidentiality, authenticity, and data integrity. Thus, this research paper intends to propose an efficient encryption approach for securing data delivery in the cloud with reduced time. For secure data delivery, homomorphic encryption is utilized to encode the cloud server's data. In homomorphic encryption, four stages are available for data delivery: key generation, encryption, decryption, and evaluation. The main problems in this homomorphic encryption mechanism are key sharing and key management. Due to these problems, the performance of homomorphic encryption is diminished. Thus, the proposed work introduces an Aquila optimizer for the key generation process. In this, optimal keys are selected, and it provides improved data security and privacy for cloud users. Finally, the selected keys are generated for the encryption and decryption process. The efficiency of the proposed approach is proved by comparing the performance in terms of encryption time, decryption time and throughput over the existing schemes like Rivest, Shamir and Adleman, ElGamal, Algebra Homomorphic Encryption scheme based on ElGamal (AHEE) and modified AHEE. The experimental results reveal that the proposed model achieves reduced encryption and decryption time of 972 ms and 4261 ms for the data size ranges from 5 to 25 mb. [ABSTRACT FROM AUTHOR]

In recent times, there has been a significant surge in research interest in security, driven by the continuous growth of threats and cyber attacks. Recognizing that existing state-of-the-art security schemes may not adequately address the requirements for lightweight properties and enhanced security measures, the aim of this research is to contribute to the field. The focus is on the development and implementation of lightweight encryption protocols designed to bolster security measures in the face of evolving challenges. The primary objective of this endeavor is to create a secure system utilizing the 3-round Kuznyechik algorithm (SSKA). In this process we introduce key generation algorithm followed by encryption and decryption techniques. The key generation algorithm is mainly based on three-round Kuznyechik algorithm. The Kuznyechik 3-round encryption mechanism has been proven to be effective in producing an imbalanced set at the end of the round and a balanced set before to the third round by employing a set in which the first byte is active and the following bytes are passive. This encourage us to use 3-round Kuznyechik algorithm. Building upon the aforementioned findings, an effective algorithm is suggested for determining the key of the final round in the 3-round Kuznyechik algorithm, employing the integral cryptanalysis method. Based on simulation results, the proposed approach demonstrates noteworthy enhancements in comparison to baseline algorithms concerning time complexity, encryption time, throughput, decryption time, data overhead, and space complexity. [ABSTRACT FROM AUTHOR]

Nowadays, data storage in a cloud environment plays an important role in managing large scale information. However, the main problem with using a cloud environment is data security. Various encryption approaches are introduced in the existing works to provide security. However, the security issues are not resolved. This paper presented a good security enhancement with decentralized blockchain and enhanced encryption approaches. Initially, the Lamport Merkle Digital Signature Generation based blockchain approach was developed to authenticate the user data to prevent unauthorized access. This presented approach authenticates cloud users by constructing a tree, in which the leaves symbolize the hash function of sensitive user data. Then in the encryption phase, the original data is encrypted as ciphertext utilizing Optimized Elliptic curve cryptography. Here, the Collective Decision optimization approach is utilized for optimal key selection. Furthermore, the selected optimal secret key is exchanged securely utilizing the Improved Diffie-Hellman approach. The presented blockchain-based security scheme enhances data security and ensures confidential data sharing between users. The experimental results of the presented approach are examined in terms of different performance metrics. The performance analysis of the presented approach outperforms the different existing approaches. [ABSTRACT FROM AUTHOR]

Maximizing the security of the cloud system is most important need of this world. Similarly, the data controllers are also increased stealing the sensitive and personal data from the cloud computing system. A repeated data violation occurs due to a large amount of outsourced and unsecured sensitive data. At present, numerous research works have been performed to secure the data in the cloud, but sometimes they do not succeed in securing the sensitive data. A Multi-Objective Privacy Preservation Model for Cloud Security utilizing Hunter Prey Optimization approach is proposed in this paper. Initially, the data is taken from 5 types of dataset like, concrete, Heart disease, Super Conductivity, Air Quality and wholesale customer datasets. The input data is given to the sanitization of data and restoration stage. In sanitization of data and restoration phase, SMA is utilized. After preventing the leakage in the data sanitization and restoration stage, the input data is applied to the key generation phase. Multi-objective functions such as the preservation of information ratio, the ratio of hiding, and the modification degree are performed at the key generation stage with the help of the hunter prey optimization algorithm to improve cloud data security. The proposed MOPP-CS-HPOA method is evaluated under some performances metrics, like modification degree, ratio of hiding, information preservation ratio, key sensitivity and computational time. Then the proposed MOPP-CS-HPOA method attains 35.69%, 38.504% and 31.805% higher information preservation ratio; 39.52%, 30.28% and 38.14% higher hiding ratio; analysed with MOPP-CS-JSSO, MOPP-CS-PS-BMFO and MOPP-CS-SVM-KNN-RF-NB-ANN methods. [ABSTRACT FROM AUTHOR]

In this work the electrical behaviour of CMOS winner take all (WTA) cells is exploited to create a novel topology for physical unclonable functions (PUF) using current mirrors. The basic cell is based on low cascode current mirrors and high-gain Sekkerkiran WTA cells. These cells are capable to select a winner neuron according to manufacture process variations. Post-layout validation of the cell was performed using Cadence Virtuoso tools with a 65nm UMC technology. The PUF energy consumption is 5.670pJ/b with native bit instability of 2.294% among 1024 readings considering temperature variations. The PUF performance is quantified with uniqueness, uniformity and reliability metrics yielding results of 49.614%, 49.662% and 97.706% respectively among 1000 considered instances. An average inter-HD=49.837%, and intra-HD=1.570% are obtained assuming temperature variation from (-20C ∼ 120C) and 300mV of supply voltage fluctuation, the key generation latency is 73ns (8b), while the true randomness of keys is proved by NIST and autocorrelation function (ACF) tests. [ABSTRACT FROM AUTHOR]

In wireless body area network health care applications, energy-constraint wearable devices are used to monitor patient physiological parameters. The security of the private health information of a person plays a significant role because if it is captured and read by an unauthorized person, the confidentiality of the patient data is lost. Therefore, there is a requirement to secure the data by performing encryption to transfer it into an unreadable form. Since the resources used for encryption should be kept to a minimum as the devices are attached to the human body, a lightweight encryption algorithm has to be used. Therefore, the generation of a unique key used for encryption plays a significant role. In work, generating a unique key uses the ECG values taken from MIT-BIH Arrhythmia database. Four unique keys are generated, which can be used for encryption. The uniqueness and randomness of the keys generated are proved using the runs test and frequency test within the block. Also, the average hamming distance calculated between the ECG keys generated from two different ECG signals is 62.5% (≈ 80 bits), which proves the distinctiveness of the keys generated. Implementation of the work is performed using Matlab. [ABSTRACT FROM AUTHOR]

Cyber Physical System (CPS) plays an important role in industry 4.0 applications such as smart factories, smart energy, smart transportation, smart buildings, smart healthcare, etc. Similarly, Cyber Physical Sensor System (CPSS) has gained popularity in recent times and is composed of a computing platform linked to an actuator, sensor, and wireless access point. In real-time scenarios, CPSS continuously gathers data from physical objects and conducts real-time control events based on the process algorithm. Then, the gathered data is transferred to the control centre or cloud services via network layer for further processing. In this scenario, there exists a need to identify the way of utilizing the intellect correctly, by designing effective data sensing and fusion schemes for CPSS. With this background, the current paper presents a Deep Learning with Metaheuristics based Data Sensing and Encoding (DLMB-DSE) scheme for CPSS. The aim of the proposed DLMB-DSE technique is to present a prediction-based data sensing and fusion approach to reduce the quantity of data communication and maintain maximum coverage by ensuring security. DLMB-DSE technique involves the design of Optimal Deep Belief Network (DBN) with Adagrad optimizer to primarily predict the data of the succeeding period with minimum number of data items. It also helps in making the primary predicted value, estimate the actual value, with maximum accuracy. Besides, Multi-Key Homomorphic Encryption (MKHE) technique is also applied for useful data encoding and decoding processes, thereby accomplishing security. Moreover, the novelty of the study lies in optimal key generation process, followed in MKHE technique, using Equilibrium Optimizer (EO). This helps in improving the security. A wide range of experiments was implemented to validate the better performance of the proposed DLMB-DSE technique. The experimental results exhibit the promising performance of DLMB-DSE approach over other methods under different measures. [ABSTRACT FROM AUTHOR]

With the latest technological advancements and attractive features of next generation intelligent optical networks such as high bandwidth, low power consumption, and low transmission loss, etc., they have been considered as most viable solution to satisfy promptly growing bandwidth demands. However, main optical network components bring forth a set of security challenges and reliability issues, accompanied by new vulnerabilities within the network. This paper proposes a new design for an optical encryption and decryption method for enhancing optical network security using p–i–n photodiode which generates Pseudo Random Binary Sequence (PRBS) as a shot noise fluctuations and wavelength converter based design using Semiconductor Optical Amplifier based XOR gate which utilizes Cross-Phase Modulation. The system performance based on Bit Error Rate and Q factor are analyzed at different data rates for different link lengths up to 100 km using OptiSystem. It is observed that error free transmission with a BER of 10–12 is achieved a data rate of 10 Gbps for a link length of only 30 km for the system with PIN photodiode's shot noise being used for PRBS sequence generation. However, wavelength conversion based system enables transmission of signal at 10Gbps signal up to a link length of 90 km. [ABSTRACT FROM AUTHOR]

Data Security has always been a challenge while sharing sensitive information and a lot of techniques have been developed to achieve it. Security should not hamper the availability of the data and hence, a technique that caters to both is needed. The use of classical and modern encryption technique are very common and are becoming prone to attacks by crypto-analytics. Due to the technological advancement, new ideas of data security comes very rapidly. For this reason the use of blockchain has become profound but the actual security of the data encryption technique always depends on the choice of the key. Stronger key leads to high data security. The paper aims to explore the concept of DNA encoding to propose a data encryption algorithm. It uses a dynamic DNA encoded table which contains different combination of four DNA bases A, C, G, and T but the main feature of dynamic DNA sequence table is its randomness which is changed for different characters in ASCII code in each run time. This randomness in the encryption disables attackers to perform any sort of statistical analysis to decipher the encrypted text or guess the key. [ABSTRACT FROM AUTHOR]

At present times, medical image security becomes a hot research topic in the healthcare sector. This paper presents an efficient lightweight image encryption model based on the Dynamic key generating Attribute based encryption (ABE) method with Opposition based joint Grey Wolf-Whale Optimization Algorithm (OjGW-WOA). The proposed encryption method undergoes certain pre-encryption steps like rotation and random column addition steps. Once the pre-encryption steps are done, ABE with OjGW-WOA is incorporated, where the optimal key is generated based on entropy value. In addition, the oppositional based learning concept is introduced to enhance the convergence rate and searching process of GWO and WOA algorithms. Next, the proposed encryption method is designed with a dynamic key generating model that generates updated keys during every time period. Therefore, during decryption, two-level key verification is done. At the first decryption stage, the key corresponding to that particular time period is required, then the original key is generated from that key and then employed for decrypting the original data. The proposed method is simulated using MATLAB tool and a detailed comparative results analysis is carried out. The performance of the proposed work is validated with the aid of performance metrics like Peak Signal to Noise Ratio (PSNR), number of changing pixel rate (NPCR) and unified averaged changed intensity (UACI). The experimental results stated that the presented model has resulted to a higher PSNR of 62.29 dB, NPCR of 99.23%, and UACI of 23.67%. [ABSTRACT FROM AUTHOR]

Virtual machines (VMs) are preferred by the majority of organizations due to their high performance. VMs allow for reduced overhead with multiple systems running from the same console at the same time. A physical server is a bare-metal system whose hardware is controlled by the host operating system. A physical server runs on a single instance of OS and application. A virtual server or virtual machine encapsulates the underlying hardware and networking resources. With the existing physical server, it is difficult to migrate the tasks from one platform to another platform or to a datacentre. Centralized security is difficult to setup. But with Hypervisor the virtual machine can be deployed, for instance, with automation. Virtualization cost increases as well as a decrease in hardware and infrastructure space costs. We propose an efficient Azure cloud framework for the utilization of physical server resources at remote VM servers. The proposed framework is implemented in two phases first by integrating physical servers into virtual ones by creating virtual machines, and then by integrating virtual servers into cloud service providers in a cost-effective manner. We create a virtual network in the Azure datacenter using the local host physical server to set up the various virtual machines. Two virtual machine instances, VM1 and VM2, are created using Microsoft Hyper-V with the server Windows 2016 R. The desktop application is deployed and VM performance is monitored using the PowerShell script. Tableau is used to evaluate the physical server functionality of the worksheet for the deployed application. The proposed Physical to Virtual to Cloud model (P2V2C) model is being tested, and the performance result shows that P2V2C migration is more successful in dynamic provisioning than direct migration to cloud platform infrastructure. The research work was carried out in a secure way through the migration process from P2V2C. [ABSTRACT FROM AUTHOR]

Security is necessary for performing the effective data communications in internet and cloud environment. The data security in cloud is becoming very challenging task due to the presence of huge volume of cloud users. Even though, the various secured cloud data storage mechanisms are available and tried to fulfill the current requirement in terms of security level and efficiency. However, the available works are not obtained the enough security level and the efficiency while storing and sharing the data in cloud. For this purpose, this work proposes a new secured storage method for providing data security to store the data securely in cloud. The proposed system consists of three different algorithms for performing prime number generation, digital signature creation for generating keys, encryption, decryption and authorization. Here, a new technique to find a co-prime number which is used to generate keys in key generation process and also useful for performing encryption and decryption process. Moreover, a new key generation technique is also introduced for elliptic curve cryptography and digital signature algorithm using polynomial congruence for performing key generation process securely. In addition, a new elliptic curve and polynomial congruence based encryption/decryption algorithms for performing data encryption and decryption in the process of data storage and communication. Finally, the user authenticity is verified by the proposed digital signature algorithm in this work. The experiments have been conducted for evaluating the proposed secured storage and communication system and proved as better than others in terms of efficiency and security level. [ABSTRACT FROM AUTHOR]

IoT devices are slowly turning out to be an essential part of our everyday lives. These devices perform one operation, and they specialize in doing so. When communicating with these devices, we need to set up a secured key preventing unauthorized communications. We have been using the plug-and-play model for electronic devices for decades. These IoT devices fall into the same realm. The plug–pair–play connection model follows the same principle so that the user does not feel the added pressure of remembering a complex password or rely on a default credential. It helps to generate a secret that is only known to the device and its user. We used elliptic curve cryptography to circumvent the resource limitations on the device. The model establishes a zero-trust pattern where all requests and responses are validated and verified before being processed. This paper provides a unique way to set up a secret key for each user and device pair without much user interaction. The model sets the path to end-to-end secured communication. [ABSTRACT FROM AUTHOR]

In wireless sensor networks (WSN), broadcast authentication is an important security service that provides secure communication. Several mobile users are allowed by this broadcast authentication service. There are some concerns in the sensor network, which depend on security based on maintaining consumer untracking and privacy for data transmission. To overcome the concern of security issues, an Identity (ID)-based cryptography method is introduced. This paper presented a Pairing-Free Identity-based Digital Signature (PF-IBDS) Algorithm based on Modified Elliptic Curve Cryptography (MECC) by using Battle Royal Optimization Algorithm. The main aim of this paper is to secure the data transmission for message authentication. The proposed protocol is to enhance the speed of authentication, reduce the signature size and speed up the signature verification. Moreover, this paper analyses the security by BAN (Burrows–Abadi–Needham) logic and comparing with the existing protocols. It is verified that the developed protocol is protected and well-organized for peer-to-peer communications. Therefore, the proposed method offers secure key management, fast authentication, and also minimizes the computation overhead. The proposed authentication process is simulated in the Java platform. The performance of this protocol has compared with other existing approaches in terms of key verification time, key generation time and computational time. [ABSTRACT FROM AUTHOR]

At present days, exponential growth in the transmission of multimedia data takes place due to a significant rise in network bandwidth and video image compression technologies. However, the transmission of videos over wireless channels often brings an unseen risk that sensitive video details might be corrupted and distributed in an illegal way. So, the security of video transmission has become a hot research topic. Several encryption models have been presented in the literature, yet, it is believed that the performance of encryption process can be further improved. In this perspective, an efficient novel video encryption technique is presented using an enhanced variant of Fully Homomorphic Encryption (FHE) model called as EFHE model. By the hybridization of Ducas and Micciancio (DM) with the FHE model presented by Gentry, Sahai, and Waters (GSW), matrix operations vector additions are properly employed in the proposed EFHE model. In addition, a new key generation scheme to increase the fastness of the encryption process. The EFHE model is designed and placed on a cloud environment which leads to reduced cloud user's communication and computation complexity. It is ensured that the presented EFHE model is highly efficient and secure over the compared methods. [ABSTRACT FROM AUTHOR]

With the rapid advancement in the mobile and computing technologies, individuals have an inclination to depend more on them in varied range of situations. For ensuring the secured communication among the devices, privacy and security are the most prominent concerns. Accordingly, sophisticated preventive measures that support both secure storage and secret transfer has begun as the need of the hour. Several conventional techniques focuses on the data encryption and key generation approaches to attain reliability. However, there were some short-comings in key aspects such as privacy, key management, and flexibility. So as to overcome existing issues the paper implements a compact, constant-time, and fast improvised ChaCha 20 stream cipher mechanism for encryption and decryption. Likewise, the generation of key is employed with the use of Diffie-Hellman key exchange protocol scheme based on the string comparison. Thus, a secured transmission occurs with a reduced rate of execution time, decryption time, and key generation time. The performance evaluation is made in terms of encryption time, decryption time and the key generation time and are compared with the existing techniques to prove the superiority of this proposed scheme. [ABSTRACT FROM AUTHOR]

Digital multimedia information is frequently transferred over the Internet due to its widespread usage. A novel Butterfly Network Topology (BNT) based block-level permutation ( B 2 LP) and Crown Graph-based Bit-wise Substitution (CGBS) is proposed in this work to securely transfer images over untrusted networks, such as social networks. First, a plain image related initial vector generation is suggested to obtain good plain image sensitivity to withstand chosen/known plain text attacks. Using these initial vectors, Henon map is iterated to produce the random key sequence values to be utilized over the confusion and diffusion processes. Second, BNT based block-level scrambling is proposed by which the plain image is transformed into blocks to attain the block level confused image. Additionally, simple sorting based confusion is applied to obtain the final confused image. Third, crown graph-based bit-wise diffusion is proposed to attain the final encrypted image. General security measures are carried out for the proposed method to validate its security level. It is shown from the simulations that the suggested approach has good randomness, high key sensitivity, good key space, and flat cipher image pixel distribution. Differential cryptanalysis for the proposed system is also conducted to show its efficacy against differential attacks. [ABSTRACT FROM AUTHOR]

We present the first actively secure, practical protocol to generate the distributed secret keys needed in the SPDZ offline protocol. As an added bonus our protocol results in the resulting distribution of the public and secret keys are such that the associated SHE ‘noise’ analysis is the same as if the distributed keys were generated by a trusted setup. We implemented the presented protocol for distributed BGV key generation within the SCALE-MAMBA framework. Our method makes use of a new method for creating doubly (or even more) authenticated bits in different MPC engines, which has applications in other areas of MPC-based secure computation. We were able to generate keys for two parties and a plaintext size of 64 bits in around 5 min, and a little more than 18 min for a 128-bit prime. [ABSTRACT FROM AUTHOR]

Nowadays sharing secure data turns out to be a challenging task for the data owner due to its privacy and confidentiality. Several IT companies stores their important information in the cloud since computing has developed immense power in sharing the data. On the other hand, privacy is considered a serious issue in cloud computing as there are numerous privacy concerns namely integrity, authentication as well as confidentiality. Among all those concerns, this paper focuses on enhancing the data integrity in the public cloud environment using Qusai modified levy flight distribution for the RSA cryptosystem (QMLFD-RSA). An effective approach named QMLFD for the RSA cryptosystem is proposed for resolving the problem based on data integrity in public cloud environment. A secured key generation and data encryption are done by employing the RSA cryptosystem thus the data is secured from unauthorized users. The key selection is done by using quasi based modified Levy flight distribution algorithm. Thus the proposed approach provides an effective model to enhance the integrity of data in cloud computing thus checking the data integrity uploaded in the public cloud storage system. In addition to this, ten optimization benchmark functions are calculated to determine the performances and the functioning of the newly developed QMLFD algorithm. The simulation results and comparative performances are carried out and the analysis reveals that the proposed QMLFD for the RSA cryptosystem provides better results when compared with other approaches. [ABSTRACT FROM AUTHOR]

The traditional channel sounding protocol requires that the whole sounding process must be completed within a coherent time. When the communication delay is close to or greater than the coherent time, the protocol will not work properly. In order to solve this problem, a novel Non-Time-Limited channel sounding protocol is proposed. The proposed channel sounding protocol does not need to guarantee the channel reciprocity, has no limit on the communication delay and has strong multi-relay scalability. At the same time, a relay-assisted security extension mechanism is proposed to prevent the collaborative eavesdropping of the neighboring attackers. Simulation experiments show that the Non-Time-Limited channel sounding protocol can get rid of the influence of channel change speed on key generation, effectively improve key consistency in high-speed mobile scenarios, and still maintain good key agreement rate performance in underwater acoustic communication. [ABSTRACT FROM AUTHOR]

Healthcare systems are heterogeneous by nature, where each device is running on different architectures, platform and operating system. This heterogeneity affects the communication performance in-terms of delay and security threats. An optimized quantum key management technique has been proposed for the purpose of managing the keys with little overhead, which enhances the health care information security by reducing the threats. And also the communication with the key authority is simulated with the quantum channel. The generated key is distributed via a dedicated quantum channel in terms of quantum bits which decreases the eavesdropping rate, transmission error, and leakage to maximum extent which improves the security further. Healthcare User group and content server communicate with the key server via a quantum channel sending them photons. Then they discuss results using a public channel. After getting an encryption key from the key server via the quantum channel, the content server can encrypt their healthcare content and send them by any public channel to the healthcare user groups. This proposed research work investigates group secret key generation problems for different types of Healthcare networks and also addresses the quantum key distribution which enhances the key security in healthcare networks. The analysis shows that the two algorithms yield optimal group key rates in healthcare networks. Numerical results are also provided to validate the performance of the proposed key generation, optimization and quantum distribution. The key generation, optimization and healthcare content encryption and decryption using those keys enhances the security of patient data and quantum simulation shows that about 90% of eavesdropping rate is reduced in healthcare network. [ABSTRACT FROM AUTHOR]

In this paper, we propose a new cryptosystem based on matrix translation and Elliptic curve cryptography for developing a secure routing algorithm to provide energy efficient and secured data communications in Wireless Sensor Networks. Moreover, the newly proposed techniques are implemented by decomposing the process into the key generation phase, encryption phase, cluster based secure routing phase and decryption phase. For this purpose, we introduce two new tables namely space reference table and String Position based ASCII value and Prime number generation Table. Here, the Space reference table is used to assign the values for the spaces that are occurring in the sentence before the encryption and decryption process. Next, it uses the String Position based ASCII value and Prime number generation Table developed in this work to convert the strings into numerical digits and to allocate the nearest prime number for the generated numerical digits. In addition, we propose two new algorithms namely ASCII AND PRIME NUMBER based Encryption/Decryption Algorithm and a Secure Routing Algorithm using cipher text conversion and distance vectors called Matrix Translation and Elliptic Curve based Cryptosystem for Secure Routing Algorithm for performing cluster based and energy efficient secure routing. The major advantages of the proposed secure routing system include the increase in security, packet delivery ratio and overall network performance and also decrease in energy consumption and delay. This work has been implemented using NS2 simulator and Java. [ABSTRACT FROM AUTHOR]

Cloud computing provides the data storage facility for the maintenance, management and remote backup of the data. The storage cost and data retrieving time has increased. To encrypt, the Elliptical Curve Cryptographic and to generate key the Chinese Remainder Theorem (ECC-CRT) based deduplication scheme is proposed. Data deduplication is the process of eliminating the repeated data in cloud storage. Cloud service provider receives the encrypted data and checks for duplication. Deduplication is performed by using cosine similarity checking. The advantage of the method is, it avoids malicious upload and downloads in storage space. The performance is compared with existing methods. [ABSTRACT FROM AUTHOR]

Digital communication developed into an imperative element of infrastructure now-a-days. Many applications that operate infrastructure systems are internet-centered. Because of the nontrivial risks of information/data leakage, communication in the systems ought to be secured. Many techniques like cryptography are being employed on a large scale to furtively transmit information. But in the data transmission procedure, attaining the high data security along with high system efficiency is a difficult task. To trounce these difficulties, an efficient data transmission scheme utilizing improved advanced encryption standard with Butterfly Effect (IAES-BE) is proposed. The IAES-BE does the encryption procedure to thwart the data as of the attackers. The adaptive flower pollination algorithm (A-FPA) is employed for the key generation that augments the key's complexity. After that, the generated key is implemented to the IAES-BE for encrypting the input plain-text as ciphertext. Next, the ciphertext is decrypted through revising the IAES-BE. Thereby, the original data will be attained and safely transmitted to the receiver. Centered on the investigational outcomes, the proposed work offered superior performance to the remaining data transmission methods. [ABSTRACT FROM AUTHOR]

Efficient error correction and key derivation is a prerequisite to generate secure and reliable keys from PUFs. The most common methods can be divided into linear schemes and pointer-based schemes. This work compares the performance of several previous designs on an algorithmic level concerning the required number of PUF response bits, helper data bits, number of clock cycles, and FPGA slices for two scenarios. One targets the widely used key error probability of 10 - 6 , while the other one requires a key error probability of 10 - 9 . In addition, we provide a wide span of new implementation results on state-of-the-art Xilinx FPGAs and set them in context to old synthesis results on legacy FPGAs. [ABSTRACT FROM AUTHOR]

The main challenge for American Standard Code for Information Interchange (ASCII) based image encryption methods is to increase security with less computational cost. Earlier, well known image encryption techniques are not only deficient in performance but also lacked in embedding of confidential data in an image using ASCII based methods. Therefore, this study aims to contribute an ASCII based efficient and secure image encryption method having additional feature of embedding confidential data in an image. Moreover, the embedding process is not static but it is dynamic as compared to the existing work. The novelty of proposed method encompasses optimal security, effective encryption speed and randomized embedding of secret data in an image even of having multi-operations. The proposed method was evaluated experimentally with variety of tests such as Pixel correlation analysis, Number of Pixels Change Rate (NPCR), Unified Average Changing Intensity (UACI), Histogram, Entropy, Peak Signal to Noise Ratio (PSNR), and Mean Square Error (MSE) including encryption decryption time. Thus the experimental results show that the proposed method is optimally secure and outperformed in image encryption as well as in randomized embedding of confidential data than the existing techniques. [ABSTRACT FROM AUTHOR]

In vehicular ad hoc networks (VANET), effective trust establishment with authentication is an important requirement. Trust management among communicating vehicles is significant for secure message transmission; however, very less contributions have been made towards evaluating the trustworthiness of the node. This research work intends to introduce a new trust management system in VANET with two major phases: secured message transmission and node trustability prediction. The security assured message passing is carried out by incorporating the privacy preservation model under the data sanitization process. The key used for the sanitization process is optimally tuned by a new hybrid algorithm termed Sea Lion Explored-Whale Optimization Algorithm, which is the combination of Whale Optimization Algorithm and Sea Lion Optimization Algorithm, respectively. The blockchain technology is assisted to handle the key generated by the nodes. Subsequently, the trustability of the node is evaluated under novel specifics "two-level evaluation process" with a rule-based and machine learning-based evaluation process. Finally, the performance of the proposed model is verified and proved over other conventional methods for certain measures. [ABSTRACT FROM AUTHOR]

The motivation for this study about Physical Layer Security comes from bridging the gap between the vast theory and a feasible implementation. We propose a Physical-Layer-Security Box as a system-level Box is a system-level solution, named PLS-Box, to solve the key exchange between two wireless communicating parties. The PLS-Box performs a novel key generation method named time-frequency filter-bank. The entropy of the radio channel is harvested via a filter-bank processing, and then turned into a reciprocal security key, at both ends. In this concept work, we also focus on several PLS open issues, such as radio-frequency imperfections and accessibility to the baseband communication modem. The goal is to show a wide applicability of our PLS-Box to actual wireless systems, paving the way for an evolution of existing schemes. [ABSTRACT FROM AUTHOR]

Wireless communications between two devices can be protected by secret keys. However, existing key generation schemes suffer from the high bit disagreement rate and low bit generation rate. In this paper, we propose an efficient physical layer key generation scheme by exploring the Received Signal Strength (RSS) of signals. In order to reduce the high mismatch rate of the measurements and to increase the key generation rate, a pair of transmitter and receiver separately apply adaptive quantization algorithm for quantifying the measurements. Then, we implement a randomness extractor to further increase key generation rate and ensure randomness of generated of keys. Several real-world experiments are implemented to verify the effectiveness of the proposed scheme. The results show that compared with the other related schemes, our scheme performs better in bit generation rate, bit disagreement rate, and randomness. [ABSTRACT FROM AUTHOR]

Biometric recognition recognizes an identification of an individual which can be obtained with the biological characteristics such as fingerprint, iris, and voice. The challenge of biometric recognition is the matching of fingerprint database with some sort of similarity distance methods. In this paper, Minkowski distance-based matching with Merkle hash tree authentication approach is proposed to overcome the above-mentioned challenges. Merkle hash tree-based encryption algorithm is introduced to improve the privacy concerns, usability and memory durability of the proposed system. This strategy handles security concerns via feature extracted data hashing with the private key. Minutiae feature extraction procedure adequately removes edge-detected features from the sensed data. Notwithstanding the security improvement, the proposed methodology stores just the produced keys for lessening memory stockpiling of cloud framework. Thus, authentication enhancement improves the entire security considerations through the proposed Minkowski distance-based authentication methodology. Finally, to demonstrate the practicality of the scheme, we evaluate the proposed scheme using the MATLAB simulator. A fingerprint dataset named as NIST Special Database 4 (NIST-4) is used for experimental evaluation. The proposed recognition system has achieved superior accuracy of 100% compared to the existing approaches. [ABSTRACT FROM AUTHOR]

Recently, most physical-layer based security strategies for Internet of thing tackle the two fundamental issues—authentication and communication key generation. However, the cost of such schemes is often high because of advanced hardware for wireless physical-layer characteristic extraction. In this paper, a lightweight authenticated secret key extraction is proposed based on the frequency-selectivity of multipath fading channels. To perform location-based device authentication and fast secret key extraction, we exploit the received signal strength of multi freqencies. The performance of our proposed method is evaluated with CC1101 IoT nodes, which verifies the feasibility of security strategy on ordinary low cost devices and in static environment. [ABSTRACT FROM AUTHOR]

Enabling a security and privacy preservation for the cloud data is one of the demanding and crucial tasks in recent days. Because, the privacy of the sensitive data should be safeguard from the unauthorized access for improving its security. So, various key generation, encryption and decryption mechanisms are developed in the traditional works for privacy preservation in cloud. Still, it remains with the issues such as increased computational complexity, time consumption, and reduced security. Also, the traditional works use the symmetric key cryptography based. Thus, this paper aims to develop a new privacy preservation mechanism by implementing a fully homomorphic–elliptic curve cryptography (FH-ECC) algorithm. The data owner encrypts the original data by converting it into the cipher format with the use of ECC algorithm, and applies the FH operations on the encrypted data before storing it on the cloud. When the user gives the data request to the cloud, the Cloud Service Provider verifies the access control policy of the user for enabling the restricted access on the data. If the access policy is verified, the encrypted data is provided to the user, from that the cipher text is extracted. Then, the ECC decryption and FH operations are applied to generate the original text. Based on the several analysis, the research work is evaluated with the help of different performance measures such as execution time, encryption time, and decryption time. In addition the effectiveness of the novel FHE technique is justified by the comparative analysis made with the traditional techniques. [ABSTRACT FROM AUTHOR]

Security is a major concern in mobile ad hoc network (MANET) that ensure packet authentication and integrity. A data transmitted from source to destination node has to be protected from the active and passive attacks. Certificate based secure routing scheme are developed precisely to ensure authentication with certificate mechanism. However, this paper uses fuzzy enhanced secure multicast routing (FSMR) scheme ensure better security in network and data. To estimate the presence of misbehaving nodes, FSMR is established based on normal and abnormal behaviors from the statistical data. Certificateless routing is used in the proposed system and it authenticates the data from the concept of key generation, signcryption and unsigncryption. Packets are routed and validated without the knowledge of certificate routing. The evaluation on proposed system proves that the proposed system has better data packet authentication with lesser energy consumption. Further, the proposed system attains better performance in terms of authenticity, data integrity, network lifetime, average delay and maximum throughput. [ABSTRACT FROM AUTHOR]

Energy consumption and the secure transmission are the increasing fields of research challenge in wireless sensor network (WSN) applications. Heterogeneous WSN is an efficient network strategy that has sensor nodes with different processing, memory power, and transmission capacity. In order to provide effective transmission for this type of network, clustering associated with secure routing is enabled to transfer the data packets safely to the endpoint. Data gathering and clustering help to group the network and control transmission overhead during data transmission. Hybridization of K-means clustering algorithm with Ant Lion Optimizer for grouping of nodes and optimal CH selection is utilized for better energy efficiency. Thus, a Miscegenation of Ant Lion optimizer within K-means for clustering and Spherical grid based multi-curve Elliptic curve cryptographic routing (MALOKSER) is determined for effective clustering and secure routing of data packets within time to the base station. The main aim of our work is to enhance network security and energy savage in the wireless network communication system. Elliptic curve cryptography with spherical grid multi-tier routing ensure secure transmission by encrypting the messages with two different keys and forward the packets in a spherical format. The performance is evaluated under metrics such as packet deliver ratio, minimum energy consumptions, communication overheads, throughput and end to end delay with the existing standards shows better results. This proves the proposed technique can actively reduce the energy utilization with an efficient and safe routing of data over the network. [ABSTRACT FROM AUTHOR]

Key generation leveraging wireless channel reciprocity can establish secret keys from unauthenticated broadcast channels and thus protect the communication of wireless networks. However, in real environments, the measurements collected by the involved transceivers might have many discrepancies due to the non-simultaneous directional measurements and other factors, such as hardware differences and asymmetric interferences. Meanwhile, if the multi-level quantization in conjunction with source coding is implemented to convert measurements to bits, the resulting high bit mismatch rate makes key agreement inefficient and insecure. In this paper, key generation schemes leveraging channel reciprocity and balanced gray code are proposed. To enhance the efficiency of key generation, an efficient encoding scheme based on balanced gray code is carried out during key generation. The proposed encoding scheme can simultaneously reduce the bit mismatch rate and improve the secret bit rate. In addition, the code book is reusable once it is generated. The proposed key generation schemes can be classified into the uniform and non-uniform schemes according to different quantization processes. Several experiments in real mobile environments are conducted to validate the proposed schemes. The received signal strength measurements are extracted from heterogeneous devices as statistics of channel states in each experiment. The results of these experiments show that (1) the proposed encoding scheme significantly enhances the efficiency of key generation; (2) both the uniform and non-uniform schemes can efficiently generate secret keys between heterogeneous transceivers. [ABSTRACT FROM AUTHOR]

Cloud computing is a one of the network-based computing that provides services to computer and other cloud devices. Secure cloud data storage is a significant when using the cloud services provided by the service provider in cloud environment. Many research works have been developed to provide secure wireless communication in cloud. However, integrity verification of stored data on cloud was not addressed in an efficient manner. In order to overcome above limitations, bloom hashing based Schnorr signature (BH-SS) technique is proposed. In BH-SS technique, at first, the cloud users send the request to cloud server and it response the user requested data. Next, bloom hash function is used to increase the integrity of cloud data storage. Bloom hash function is an efficient data structure used for storing the data and its hashed value. Bloom hash function stores the various cloud user data in it bits of array by generating hash value for each cloud data. Each data has the diverse hash value in bit array. This helps for BH-SS technique to improve the data integrity and dynamic data storage in cloud environment. Lastly, BH-SS technique employed Schnorr signature to ensure confidentiality of stored data with the aid of producing private signing key and public verification key. Therefore, proposed BH-SS technique improves the data integrity rate and reduces execution time. The BH-SS technique conducts experimental works on the parameters such as data integrity, space complexity, execution time and data confidentiality rate. The experimental results observe that the BH-SS technique is able to enhance the cloud data integrity and also reduces the execution time of cloud storage and space complexity when compared to state-of-the-art-works. [ABSTRACT FROM AUTHOR]

When the applied PUF in a PUF-based key generator does not produce full entropy responses, information about the derived key material is leaked by code-offset helper data. If the PUF's entropy level is too low, the PUF-derived key is even fully disclosed by the helper data. In this work we analyze this entropy leakage, and provide several solutions for preventing leakage for PUFs suffering from i.i.d. biased bits. Our methods pose no limit on the amount of PUF bias that can be tolerated for achieving secure key generation, with only a moderate increase in the required PUF size. This solves an important open problem in this field. In addition, we also consider the reusability of PUF-based key generators and present a variant of our solution which retains the reusability property. In an exemplary application of these methods, we are able to derive a secure 128-bit key from a 15 %-noisy and 25 %-biased PUF requiring only 4890 PUF bits for the non-reusable variant, or 7392 PUF bits for the reusable variant. [ABSTRACT FROM AUTHOR]

Wireless sensor networks are used in many applications in military, ecology, health, and other areas. These applications often include the monitoring of sensitive information making the security issue one of the most important aspects to consider in this field. However, most of protocols optimize for the limited capabilities of sensor nodes and the application specific nature of the networks, but they are vulnerable to serious attacks. In this paper, a Secure Energy and Reliability Aware data gathering protocol (SERA) is proposed, which provides energy efficiency and data delivery reliability as well as security. The proposed protocol's security was confirmed by a formal verification carried out using the AVISPA tool and analysis of the most common network layer attacks such as selective forwarding, sinkhole, Sybil, wormhole, HELLO flood, and acknowledgment spoofing attacks. Additionally, a visual simulation environment was developed to evaluate the performance of the proposed protocol. [ABSTRACT FROM AUTHOR]

In this paper, a new algorithm for generating more-randomized keys for symmetrical cipher one-time pad (OTP) according to the linear congruential (LCG) method based on the idea of genetic algorithm is proposed. The method, genetic-based random key generator, is proposed for generating keys for the OTP method with a high degree of key randomness; this adds more strength to the OTP method against breaking this cryptosystem. This algorithm is composed of two parts. Initially, the first population is being generated by LCG method, and then, genetic operators for generating the next populations are being used. Generating random keys with the presented method requires seven-parameter key that increases the security of communication between the transceivers. [ABSTRACT FROM AUTHOR]

This letter presents a k-party RSA key sharing scheme and the related algorithms are presented. It is shown that the shared key can be generated in such a collaborative way that the RSA modulus is publicly known but none of the parties is able to decrypt the enciphered message individually. [ABSTRACT FROM AUTHOR]