Search

The act of implementing specific measures to ensure the security of cryptographic keys within an organization is referred to as key management. Securing communication in a decentralized IoT network presents many challenges due to the abundance of devices and the dynamic nature of the network. For this purpose, A Decentralized lightweight group key management (DLGKM) system is proposed in this paper, that leverages fuzzy logic and Crossover boosted Particle Swarm Optimization (CPSO) named FLCPSO-KM to enhance decisions and settle disputes in IoT environments. DLGKM system uses fuzzy logic and CPSO in decision-making and dispute resolution, this allows for qualitative and quantitative optimization, leading to reliable outcomes. The system provides a lightweight and effective solution for secure communication in a decentralized IoT network. It employs a Crossover-boosted particle swarm optimization (PSO) algorithm for secure key revocation from unauthorized devices, ensuring the security of the network and resources. Overall, the proposed DLGKM system provides an effective and efficient solution for secure communication in a decentralized IoT network. The advantages of utilizing fuzzy logic and CPSO in the system include enhanced decision-making and the ability to solve key revocation issues, thus minimizing communication and computational overheads. The proposed approach was compared to existing approaches such as Blockchain-Based Distributed Key Management Architecture (BDKMA), Cognitive Key Management Technique (CKMT), Healthcare Key Management Approach (HCKM), and Hash-Based Key Management Mechanism (AHKM) based on metrics such as security, encryption and decryption time, computational time, throughput, and fitness value. The proposed approach achieved greater efficiency with 98.7% security, encryption, and decryption time of 0.2 s and 0.3 s, throughput of 250 bits per second, and fitness values ranging from 0 to 1 respectively. [ABSTRACT FROM AUTHOR]

Wireless Sensor Networks (WSN) when simulated for implementations use Mobile Sinks (MS) which are vulnerable to unauthorized attacks. Existing works do not ensure attacker node identifications making prevention of attacks during initial iterations would a difficult task. Neighbour node selections based on their node information alone can increase the possibility of intrusions. The detection of an attacker node in the initial stages reduces information loss and increases authentication. In continuation to this statement a TNF (Trust based Node Filtering) technique which assigns trust values to nodes is introduced in this work. This proposal is an authentication scheme against replication attacks. Neighbour nodes which cannot be trusted are not considered for authentication processes thus ensuring guaranteed data transmissions. Malicious nodes are detected using a FIS (Fuzzy Inference Systems) with the proposed CFNIS (Customizable Fuzzy- Neuro Inference System). Nodes are also classified as being in normal or attacking node. Secure Key generations are performed using RSA and Elgamal algorithm and a honey pot server controls authentications. CFNIS simulation showed higher security against replication attacks. [ABSTRACT FROM AUTHOR]

In recent times, blockchain-based data auditing protocols have emerged as a cutting-edge area of study. Nevertheless, a conspicuous dearth of a generic framework upon which to ground such protocols is evident. This study introduces a pioneering and all-encompassing framework, designated as "Blockchain-assisted On-chain Auditing for Off-chain Storage" (BA2OC). The BA2OC framework operates without the reliance on a predefined auditor for the auditing process or a centralized verifier for the verification of on-chain auditing. It is conceivable that BA2OC forms the cornerstone of public data auditing protocols underpinned by blockchain technology. This framework bestows evidence of data ownership, ensures data integrity, facilitates public verification, supports batch verification, and bolsters the security against cyber threats through the utilization of cryptographic tools. The analysis underscores the comprehensive nature of the BA2OC framework, which positions it as the linchpin of blockchain-based public auditing protocols. Following a parametric evaluation of the BA2OC framework, this study takes into account real-world considerations, such as the utilization of the RSA cryptosystem and Android-based smartphones, to proffer a concrete protocol. The investigation further demonstrates that the BA2OC framework minimizes communication overhead while maintaining operational efficiency. [ABSTRACT FROM AUTHOR]

Fog computing provides a suitable development for real-time processing in the Internet of Things (IoT). Attribute-based encryption (ABE) is the main method to control data access in fog computing. A residue number system (RNS) can speed up multiplication and exponential operations by converting very large integers to small integers. This paper proposes a fine-grained lightweight access control scheme using ABE modified with RNS properties (RNS-ABE) with fog computing. Decryption is implemented with the Chinese remainder theorem (CRT), and a new access structure based on the CRT secret sharing scheme is also introduced. Security of the proposed scheme proved based on RNS properties and the complicated problem of factoring a very large integer into its large prime factors, like RSA encryption. The time cost comparison shows that the total encryption and decryption time of our scheme is more efficient than the lightweight schemes with the underlying operation of bilinear pairing. [ABSTRACT FROM AUTHOR]

Deep neural networks are vulnerable to adversarial attacks, bringing high risk to numerous security-critical applications. Existing adversarial defense algorithms primarily concentrate on optimizing adversarial training strategies to improve the robustness of neural networks, but ignore that the misguided decisions are essentially made by the activation values. Besides, such conventional strategies normally result in a great decline in clean accuracy. To address the above issues, we propose a novel RSA algorithm to counteract adversarial perturbations while maintaining clean accuracy. Specifically, RSA comprises three distinct modules: feature refinement, activation suppression, and alignment modules. First, the feature refinement module refines malicious activation values in the feature space. Subsequently, the feature activation suppression module mitigates redundant activation values induced by adversarial perturbations across both channel and spatial dimensions. Finally, to avoid an excessive performance drop on clean samples, RSA incorporates a consistency constraint and a knowledge distillation constraint for feature alignment. Extensive experiments on five public datasets and three backbone networks demonstrate that our proposed algorithm achieves consistently superior performance in both adversarial robustness and clean accuracy over the state-of-the-art. [ABSTRACT FROM AUTHOR]

In wireless sensor networks, ensuring data confidentiality and integrity is paramount, particularly in sensitive environments. However, existing encryption methods encounter challenges, including key maintenance in symmetric encryption and lower security levels in asymmetric encryption. To address these issues, this paper proposes a novel security protocol employing a hybrid encryption approach, combining both symmetric (AES) and asymmetric (RSA) cryptographic techniques. The protocol introduces a two-phase cryptographic technique utilizing AES for robust encryption in Phase 1 and RSA for efficient key management in Phase 2. Experimental results demonstrate enhanced efficiency in encryption, decryption, and total execution time compared to existing algorithms, marking a significant advancement in cryptographic protocols for improved security in data transmission and management. Key contributions include the division of plaintext for simplified cryptographic processing, AES encryption for Phase 1, RSA encryption for Phase 2, and a seamless decryption process ensuring data integrity and security against attacks. [ABSTRACT FROM AUTHOR]

In the present time of increasing digital communication, the images are widely used over the multimedia networks for sharing of information. At the same time to ensure the security of images during transmission of data becomes a great challenge for cryptographers. In this paper, a new multi-phases image encryption algorithm based on the RSA cryptosystem and modified random matrix affine cipher (MRMAC) is proposed. The Chen's hyperchaotic system and Arnold cat map are used to create more distraction from the relationship between the original image and ciphered image. The Chen's hyperchaotic system is used for diffusion, whereas the Arnold cat map is used for increasing the confusion among pixels. In this proposed algorithm the image ciphering is carried out in different phases. Firstly the given image is encrypted using RSA algorithm with large primes. Secondly, in modified RMAC, random blocks of random entries using Chen's hyperchaotic system are generated and are diffused with image pixels using bitwise XOR operation. Also, we create confusion of pixels within these diffused blocks, and confusion of blocks as well using parameters of MRMAC. The randomness in the algorithm is improved using MRMAC is advantage against differential attacks. Further, the Arnold cat map is used to enhance the level of confusion. Since, it is tremendously difficult to factorize the product of large prime numbers, therefore, the security of data in RSA algorithm increases tremendously. For the proper decryption of ciphered images, one must have exact values of keys and their correct order. It is impossible to guess the decrypted image even with a very small change in a single key. The results obtained in statistical and security analysis shows that the proposed algorithm has a huge key space, extreme security and key sensitivity, which proves that scheme is efficient and highly secure. [ABSTRACT FROM AUTHOR]

A blockchain is a decentralized digital network system consisting of multiple blocks connected in a chain. Each block comprises multiple transactions and is linked to the previous block through its hash value. The hash values are calculated using the active transactions within each block and the hash value of the preceding block. A positive impact can be made by combining blockchain technology with the healthcare sector. The consensus mechanism is the key protocol for implementing agreements in the blockchain. This paper proposes a combined RSA (Rivest–Shamir–Adleman) cryptography algorithm with a novel consensus protocol IPBFT (Improved Practical Byzantine Fault Tolerance) in the Hyperledger Fabric platform, for a patient-centered approach using blockchain technology in the healthcare sector. It ensures the reliability and integrity of transactions and prevents malicious nodes from disrupting the network. The Hyperledger Fabric platform is used to provide transparency, security, and trust in the blockchain. Performance metrics such as latency, throughput, scalability, and comparative analysis for the proposed algorithm Improved Practical Byzantine Fault Tolerance (IPBFT) and existing Practical Byzantine Fault Tolerance (PBFT) algorithms have been evaluated to achieve enhanced results. The proposed algorithm solves many problems associated with existing Practical Byzantine Fault Tolerance solutions and improves efficiency and security in the healthcare sector. [ABSTRACT FROM AUTHOR]

Large number factorization is not only the most critical entry point for Rivest–Shamir–Adleman (RSA) security analysis, but also the most direct means of attacking the asymmetric encryption algorithm RSA. In this paper, the factorization methods of large numbers are summarized and analysed: classical integer factoring algorithms, Shor's circuit model algorithm, quantum adiabatic methods (integer factorization based on a quantum nuclear magnetic resonance (NMR) platform and D-Wave quantum annealing), and hybrid quantum-classical computing. Finally, the feasibility of integer factorization based on quantum adiabatics is discussed. In this paper, quantum annealing is regarded as a quantum attack method that is completely different from the famous Shor algorithm, and the potential of D-Wave factorization of large numbers to crack RSA cryptography is verified, which provides a new idea for a quantum attack on RSA public key cryptography. [ABSTRACT FROM AUTHOR]

We introduce a novel image encryption and decryption algorithm for multiple images incorporating multiple parameter fractional discrete cosine transform (MPFrDCT), 3D Arnold transform and RSA cryptosystem. Before encryption, the images are changed into their indexed formats by removing their color maps. The indexed formats of the images are taken as the red, green and blue channel of an RGB image. Firstly, the RGB image is taken as the input of 3D Arnold transform. The 3D Arnold transform not only dislocates the pixel positions, but also changes the pixel values. Mathematically, the 3D map performs both permutation as well as substitution. The distorted image is now encrypted using RSA cryptosystem which is a public key cryptosystem. The RSA cryptosystem makes the image secure in public domain as the hard problem is the factorization of large primes which is unbreakable. Lastly, the domain of the encrypted image is changed to frequency domain using MPFrDCT. If the secret keys are known to an unauthorized person, the encryption algorithm is still secure as the security of the presented cryptosystem depends upon the secret keys and the arrangements of the secret keys. The proposed image encryption algorithm is storage efficient. The statistical and simulation analysis are conducted to evaluate the robustness of the presented encryption and decryption processes. [ABSTRACT FROM AUTHOR]

The ever-growing threats in cybersecurity growing with the rapid development of quantum computing, necessitates the development of robust and quantum-resistant cryptographic systems. This paper introduces a novel cryptosystem, Public Key Cryptosystem based on Systematic Polar Encoding (PKC-SPE), based on the combination of systematic polar encoding and public-key cryptographic principles. The Systematic Polar Encoding (SPE), derived from the well-established field of polar codes, serves as the foundation for this proposed cryptographic scheme. Here, we have used MATLAB Software to introduce and implement the PKC-SPE Cryptosystem. The paper examines key generation, encryption, and decryption algorithms, providing insights into the adaptability and efficiency of systematic polar encoding in public-key cryptography. We assess the efficiency of the PKC-SPE Cryptosystem in three aspects: key size, computational complexity, and system implementation timings. In addition, we compare the PKC-SPE Cryptosystem with PKC-PC cryptosystem and find that it has reduced key sizes ( P r = 0.8436 kbytes). The results obtained through simulations validate the effectiveness of the proposed cryptosystem and highlighting its potential for integration into real-world communication systems. Thus, in the paradigm shift to quantum computing, the PKC-SPE cryptosystem emerges as a promising candidate to secure digital communication in the quantum computing era. [ABSTRACT FROM AUTHOR]

In emergency management, the transportation scheduling of emergency supplies and relief personnel can be regarded as the multi-objective shortest path problem with mixed time window (MOSPPMTW), which has high requirements for timeliness and effectiveness, but the current solution algorithms cannot simultaneously take into account the solution accuracy and computational speed, which is very unfavorable for emergency path decision-making. In this paper, we establish MOSPPMTW matching emergency rescue scenarios, which simultaneously enables the supplies and rescuers to arrive at the emergency scene as soon as possible in the shortest time and at the smallest cost. To solve the complete Pareto optimal surface, we present a ripple spreading algorithm (RSA), which determines the complete Pareto frontier by performing a ripple relay race to obtain the set of Pareto optimal path solutions. The proposed RSA algorithm does not require an initial solution and iterative iterations and only needs to be run once to obtain the solution set. Furthermore, we prove the optimality and time complexity of RSA and conduct multiple sets of example simulation experiments. Compared with other algorithms, RSA performs better in terms of computational speed and solution quality. The advantage is especially more obvious in the computation of large-scale problems. It is applicable to various emergency disaster relief scenarios and can meet the requirements of fast response and timeliness. [ABSTRACT FROM AUTHOR]

Cryptographic technology can effectively defend against malicious attackers to attack sensitive and private information. The core of cryptographic technology is cryptographic algorithm, and the cryptographic algorithm identification is the premise of in-depth analysis of cryptography. In the cryptanalysis of unknown cryptographic algorithm, the primary task is to identify the cryptographic algorithm used in the encryption and then carry out targeted analysis. With the rapid growth of Internet data, the increasing complexity of communication environment, and the increasing number of cryptographic algorithms, the single-layer identification scheme of cryptographic algorithm faces great challenges in terms of identification ability and stability. To solve these problems, on the basis of existing identification schemes, this paper proposes a new cluster division scheme CMSSBAM-cluster, and then proposes a multi-layer composite identification scheme of cryptographic algorithm using a composite structure. The scheme adopts the method of cluster division and single division to identify various cryptographic algorithms. Based on the idea of ensemble, the scheme uses the hybrid random forest and logistic regression (HRFLR) model for training, and conducts research on a data set consisting of 1700 ciphertext files encrypted by 17 cryptographic algorithms. In addition, two ensemble learning models, hybrid gradient boosting decision tree and logistic regression (HGBDTLR) model and hybrid k-neighbors and random forest (HKNNRF) model are used as controls to conduct controlled experiments in this paper. The experimental results show that multi-layer composite identification scheme of cryptographic algorithm based on HRFLR model has an accuracy rate close to 100% in the cluster division stage, and the identification results are higher than those of the other two models in both the cluster division and single division stages. In the last layer of cluster division, the identification accuracy of ECB and CBC encryption modes in block cryptosystem is significantly higher than that of the other two classification models by 35.2% and 36.1%. In single division, the identification accuracy is higher than HGBDTLR with a maximum of 9.8%, and higher than HKNNRF with a maximum of 7.5%. At the same time, the scheme proposed in this paper has significantly improved the identification effect compared with the single division identification accuracy of 17 cryptosystem directly and the 17 classification accuracy of 5.9% compared with random classification, which indicates that multi-layer composite identification scheme of cryptographic algorithm based on HRFLR model has significant advantages in the accuracy of identifying multiple cryptographic algorithms. [ABSTRACT FROM AUTHOR]

Secure transmission of images over wireless communications systems can be done using RSA, the most known and efficient cryptographic algorithm, and OFDMA, the most preferred signal processing choice in wireless communications. This paper aims to investigate the performance of OFDMA system for wireless transmission of RSA-based encrypted images. In fact, the performance of OFDMA systems; based on different signal processing techniques, such as, discrete sine transforms (DST) and discrete cosine transforms (DCT), as well as the conventional discrete Fourier transforms (DFT) are tested for wireless transmission of gray-scale images with/without RSA encryption. The progress of transmitting the image is carried by firstly, encrypting the image with RSA algorithm. Then, the encrypted image is modulated with DFT-based, DCT-based, and DST-based OFDMA systems. After that, the modulated images are transmitted over a wireless multipath fading channel. The reverse operations will be carried at the receiver, in addition to the frequency domain equalization to overcome the channel effect. Exhaustive numbers of scenarios are performed for study and investigation of the performance of the different OFDMA systems in terms of PSNR and MSE, with different subcarriers mapping and modulation techniques, is done. Results indicate that the ability of different OFDMA systems for wireless secure transmission of images. However, the DCT-OFDMA system showed superiority over the DST-OFDMA and the conventional DFT-OFDMA systems. [ABSTRACT FROM AUTHOR]

Timed-release encryption (TRE) is a cryptographic primitive that can control the decryption time and has significant application value in time-sensitive scenarios. To solve the reliability issue of nodes in existing TRE anonymous interaction schemes, we propose a blockchain-based TRE protocol for anonymous query time trapdoors. In our protocol, the recipient divides the encrypted trapdoor request information into n ciphertext fragments using secret sharing technology near the decryption time, and employs the idea of onion routing to perform layer-by-layer encryption, creating onion-type data transmitted through middlemen selected from the smart contract. After receiving the ciphertext fragments, the time server integrates them to obtain the trapdoor request information and returns the corresponding time trapdoor to the recipient. This allows the recipient to query any time trapdoor anonymously. Our protocol provides a normative design for the smart contract and specific constraints on the participants' behavior. Compared with the related anonymous query trapdoor schemes, our protocol improves the probability of successful queries. Security analysis shows that our protocol can resist release-ahead attack, interruption attack, eavesdropping attack, and replacement attack. Performance analysis shows that our protocol outperforms related protocols regarding anonymity, efficiency, and flexibility, achieving highly efficient anonymous interactions. Finally, we conducted an experiment in the Ethereum Rinkeby test network. For the settings of ciphertext fragment number n = 3 and ciphertext fragment threshold t = 2 , the gas consumption for a user to execute the contract was $5.66, which was higher than the contract cost of related schemes, but the contract execution cost was within an acceptable range. [ABSTRACT FROM AUTHOR]

As a typical representative of the public key cryptosystem, RSA has attracted a great deal of cryptanalysis since its invention, among which a famous attack is the small private exponent attack. It is well-known that the best theoretical upper bound for the private exponent d that can be attacked is d ≤ N 0.292 , where N is a RSA modulus. However, this bound may not be achieved in practical attacks since the lattice constructed by Coppersmith method may have a large enough dimension and the lattice-based reduction algorithms cannot work so well in both efficiency and quality. In this paper, we propose a new practical attack based on the binary search for the most significant bits (MSBs) of prime divisors of N and the Herrmann-May's attack in 2010. The idea of binary search is inspired by the discovery of phenomena called "multivalued-continuous phenomena", which can significantly accelerate our attack. Together with several carefully selected parameters according to our exact and effective numerical estimations, we can improve the upper bound of d that can be practically achieved. More specifically, without the binary search method, we successfully attack RSA with a 1024-bit-modulus N when d ≤ N 0.285 . Moreover, by our new method, we can implement a successful attack for a 1024-bit-modulus RSA when d ≤ N 0.292 and for a 2048-bit-modulus RSA when d ≤ N 0.287 in about a month. We believe our method can provide some inspiration to practical attacks on RSA with mainstream-size moduli. [ABSTRACT FROM AUTHOR]

Cyberphysical systems connect physical devices and large private network environments in modern communication systems. A fundamental worry in the establishment of large private networks is mitigating the danger of transactional data privacy breaches caused by adversaries using a variety of exploitation techniques. This study presents a privacy-preserving architecture for ensuring the privacy and security of transaction data in large private networks. The proposed model employs digital certificates, RSA-based public key infrastructure, and the blockchain to address user transactional data privacy concerns. The model also guarantees that data in transit remains secure and unaltered and that its provenance remains authentic and secure during node-to-node interactions within a large private network. The proposed model has increased the encryption speed by about 17 times, while the decryption process is expedited by 4 times. Therefore, the average overall acceleration obtained was 16.5. Both the findings of the security analysis and the performance analysis demonstrate that the proposed model can safeguard transactional data during communications on large private networks more effectively and securely than the existing solutions. [ABSTRACT FROM AUTHOR]

Over the last decade, millions of 4G and 5G-enabled mobile devices have become part of the Internet. Almost, all the applications have been shifted to smartphones. A person connects his smartphone to several other devices or remote servers for exchanging sensitive data. In this sense, security threats in terms of authentication, data confidentiality, and data integrity are increasing day by day for mobile devices. The asymmetric key cryptosystem is considered more secure, but it is heavyweight for smart devices on the basis of computation and communication costs. The symmetric key cryptosystem is considered lightweight for smart devices in terms of computation and communication overheads, but it is vulnerable to several attacks such as MITM attacks. Several symmetric key security systems have been proposed for smart devices but adopt complex mathematical procedures. Therefore, existing symmetric key security systems increase the computation and communication overheads. In this paper, we propose a lightweight and authentic symmetric key cryptosystem for resource-constrained mobile client–server environments. Our proposed cryptosystem consists of a lightweight symmetric session key exchange algorithm, mutual authentication service, and data confidentiality service, respectively. Moreover, we prove the robustness of our proposed cryptosystem with the help of informal and formal security analysis through the AVISPA tool. In addition, performance evaluation and comparisons with existing security systems show that our proposed cryptosystem is efficient, lightweight, secure, and most suitable for mobile computing. [ABSTRACT FROM AUTHOR]

The modern world is rapidly changing towards a novel era of technology, where not only human beings but devices are also being connected to each other with the inherent ability of communication advancements. With the evolution of social media and Internet-based applications, a large amount of information flows through communication channels and discloses numerous vulnerabilities. Cisco Inc. forecasted that approximately 50 billion devices will be linked through the Internet by 2021 termed as the Internet of Things (IoT) across the world. Typically, IoT devices are designed to collect and share sensitive information which opens a new kind of challenge in the area of security and privacy. These devices are inefficient to perform present security-based algorithms such as RSA due to the limited number of resources associated with it. This paper presents an RSA algorithm based Efficient Improved Digital Signature Algorithm (RSAEDSA) for the IoT environment. The proposed algorithm is designed to provide a secure and efficient communication mechanism for IoT-connected devices. Meanwhile, it also addresses the limitations of traditional RSA algorithms in terms of resource usage, parameter optimization, etc. The analysis of the proposed RSAEDSA algorithm shows its effectiveness which highlights the improvements in the security measures and quality of service (QoS) in the IoT environment. The simulated results show the performance superiority of RSAEDSA over the traditional methods with respect to the QoS parameters. [ABSTRACT FROM AUTHOR]

Broadcast Encryption (BE) is public-key encryption allowing a sender to encrypt a message by specifing recipients, and only the specified recipients can decrypt the message. In several BE applications, since the privacy of recipients allowed to access the message is often as important as the confidentiality of the message, anonymity is introduced as an additional but important security requirement for BE. Kiayias and Samari (IH 2013) presented an asymptotic lower bound on the ciphertext sizes in BE schemes satisfying anonymity (ANO-BE for short). More precisely, their lower bound is derived under the assumption that ANO-BE schemes have a special property. However, it is insufficient to show their lower bound is asymptotically tight since it is unclear whether existing ANO-BE schemes meet the special property. In this work, we derive asymptotically tight lower bounds on the ciphertext size in ANO-BE by assuming only properties that most existing ANO-BE schemes satisfy. With a similar technique, we first derive asymptoticallyqueryPlease provide MSC codes. For more details, please visit http://www.ams.org/msc/. tight lower bounds on the authenticator sizes in Anonymous Broadcast Authentication (ABA). Furthermore, we extend the above result and present (non-asymptotically) tight lower and upper bounds on thequeryPlease check and confirm the Running title. ciphertext sizes in ANO-BE. We show that a variant of ANO-BE scheme proposed by Li and Gong (ACNS 2018) is optimal. We also provide tight bounds on the authenticator sizes in ABA via the same approach as ANO-BE, and propose an optimal construction for ABA. [ABSTRACT FROM AUTHOR]

Over the recent decades, incorporating Vehicular Ad-hoc Network (VANET) into Cloud computing plays a vital role, since it provides a reliable safety journey to vehicular drivers, passengers, etc. However, attaining security and emergency message dissemination is still major bottleneck in VANET combined Cloud, due to the dynamic nature of vehicles and wireless communication. Our major intention is to provide high level security in VANET-Cloud environment. In addition to it, we also reduce delay in emergency dissemination. Our proposed Delay Aware Emergency Message Dissemination and Data Retrieval in Secure (DEMD2RS) VANET-Cloudis composed of four sequential processes: Authentication, Clustering, Data Retrieval and Data dissemination. In regard to maintainingsecurity for both Road Side Unit (RSU) and Vehicles, we propose Hash based Credential Authentication Scheme (HCAS) that affords authentication using Secure Hash Algorithm-3 (SHA-3) and Elliptic Curve Points (ECP). To sustain a stable cluster, Firm Aware Clustering Scheme (FACS) is pursued where Stud Krill Herd (SKH) algorithm is exploited. In the data retrieval process, cloud provides requested information to the RSU in encrypted form using the Twofish algorithm. RSU discover the path to deliver received data through executing Artificial Neural Network (ANN) algorithm. In order to diminish delay in emergency message dissemination, best disseminator is selected by cluster head using Fuzzy-Topsis (FT) algorithm. Our DEMD2RSVANET-Cloud network is implemented in Omnet 4.6 and SUMO 0.21.0 simulation tool. Finally, the evaluation of DEMD2RS work performance is achieved by computing consequent metrics that are Throughput, Packet Delivery Ratio, Transmission delay, and Average delay, Key generation time, Encryption time and Decryption time. [ABSTRACT FROM AUTHOR]

Secure and reliable exchange of information between devices is crucial for any network in the current digital world. This information is maintained on storage devices, routing devices, and communication over the cloud. Cryptographic techniques are used to ensure the secure transmission of data, ensuring the user's privacy by storing and transmitting data in a particular format. Using encryption, only the intended user possessing the key can access the information. During data or essential transmission, the channel should be secured by using robust encryption techniques. Homomorphic Encryption (HE) techniques have been used in the past for this purpose. However, one of the flaws of the conventional HE is seen either in its slow transmission or fast key decryption. Thus, this paper proposes an optimized Homomorphic Encryption Chinese Remainder Theorem with a Rivest-Shamir-Adleman (HE-CRT-RSA) algorithm to overcome this challenge. The proposed Technique, HE-CRT-RSA, utilizes multiple keys for efficient communication and security. In addition, the performance of the HE-CRT-RSA algorithm was evaluated in comparison with the classical RSA algorithm. The result of the proposed algorithm shows performance improvement with reduced decryption time. It is observed that the proposed HE-CRT-RSA is 3–4% faster than the classical Rivest-Shamir-Adleman (RSA). The result also suggests that HE-CRT-RSA effectively enhances security issues of the cloud and helps to decrease the involvement of intruders or any third party during communication or inside the data/server centers. [ABSTRACT FROM AUTHOR]

In recent times, technology development has greatly influenced the model of Blockchain for communication due to extensive digitalization worldwide. Moreover, blockchain technology plays an essential part in the role of an educational system for sharing important data between students and teachers. However, the security hazard is the main problem while transferring the data because the malicious attacker may be able to hack the essential data in communication. A novel Signature-based Rivest Shamir Framework (SbRSF) is proposed to overcome such issues for privacy limit maintenance and security action improvement. Also, the harmful attack in data transmission is estimated by this projected approach. The implementation of this research has been done on the python platform. Hence, the proposed model has gained 98.03% throughput, encryption, and decryption time of 5 ms and reduced the error rate to 0.2%. Moreover, the achieved results are compared with the conventional methods, such as the Elliptic curve model, sensitivity-based elliptic crypto scheme, and secure record sharing, to validate the significance of the projected approach in blockchain development. [ABSTRACT FROM AUTHOR]

Nowadays, medical enterprises are gradually attracted to store their data in the cloud paradigm and distribute the data between the authorized person due to the enormous growth of cloud computing and big data. However, the rapid growth of these systems has faced some crucial challenges such as data privacy and security. Presently, different cryptography techniques are used in a large amount of data processing and storage, but it is not suitable for the security of big data over cloud-based data transmission. Thus, this article presents the novel African Buffalo-based Elapid Crypto Model (AB-ECM) method for monitoring and securing the data while transferring it to the receiver. Here, the large amount of data from the cloud is compressed by the two-stage compression approach. Then, the system's security has been enhanced by the auditing phase; if the secret key of both auditing stages in the sender and receiver is the same, then only the data is decrypted. The execution of this secure process is done in the MATLAB Platform. The simulation consequences of the proposed system have been compared with the conventional methods in terms of confidential rate, data transfer rate, encryption time, resource usage, and decryption time. The comparison shows that the developed model has attained the finest security function over the existing techniques. [ABSTRACT FROM AUTHOR]

The advent of quantum computing threatens blockchain protocols and networks because they utilize non-quantum resistant cryptographic algorithms. When quantum computers become robust enough to run Shor's algorithm on a large scale, the most used asymmetric algorithms, utilized for digital signatures and message encryption, such as RSA, (EC)DSA, and (EC)DH, will be no longer secure. Quantum computers will be able to break them within a short period of time. Similarly, Grover's algorithm concedes a quadratic advantage for mining blocks in certain consensus protocols such as proof of work. Today, there are hundreds of billions of dollars denominated in cryptocurrencies and other digital assets that rely on blockchain ledgers as well as thousands of blockchain-based applications storing value in blockchain networks. Cryptocurrencies and blockchain-based applications require solutions that guarantee quantum resistance in order to preserve the integrity of data and assets in these public and immutable ledgers. The quantum threat and some potential solutions are well understood and presented in the literature. However, most proposals are theoretical, require large QKD networks, or propose new quantum-resistant blockchain networks to be built from scratch. Our work, which is presented in this paper, is pioneer in proposing an end-to-end framework for post-quantum blockchain networks that can be applied to existing blockchain to achieve quantum-resistance. We have developed an open-source implementation in an Ethereum-based (i.e., EVM compatible) network that can be extended to other existing blockchains. For the implementation we have (i) used quantum entropy to generate post-quantum key pairs, (ii) established post-quantum TLS connections and X.509 certificates to secure the exchange of information between blockchain nodes over the internet without needing a large QKD network, (iii) introduced a post-quantum second signature in transactions using Falcon-512 post-quantum keys, and (iv) developed the first on-chain verification of post-quantum signatures using three different mechanisms that are compared and analyzed: Solidity smart-contracts run by the validators for each transaction, modified EVM Opcode, and precompiled smart contracts. [ABSTRACT FROM AUTHOR]

Cloud file sharing (CFS) has become one of the important tools for enterprises to reduce technology operating costs and improve their competitiveness. Due to the untrustworthy cloud service provider, access control and security issues for sensitive data have been key problems to be addressed. Current solutions to these issues are largely related to the traditional public key cryptography, access control encryption or attribute-based encryption based on the bilinear mapping. The rapid technological advances in quantum algorithms and quantum computers make us consider the transition from the tradtional cryptographic primitives to the post-quantum counterparts. In response to these problems, we propose a lattice-based Ciphertext-Policy Attribute-Based Encryption(CP-ABE) scheme, which is designed based on the ring learing with error problem, so it is more efficient than that designed based on the learing with error problem. In our scheme, the indirect revocation and binary tree-based data structure are introduced to achieve efficient user revocation and dynamic management of user groups. At the same time, in order to further improve the efficiency of the scheme and realize file sharing across enterprises, the scheme also allows multiple authorities to jointly set up system parameters and manage distribute keys. Furthermore, by re-randomizing the user's private key and update key, we achieve decryption key exposure resistance(DKER) in the scheme. We provide a formal security model and a series of security experiments, which show that our scheme is secure under chosen-plaintext attacks. Experimental simulations and evaluation analyses demonstrate the high efficiency and practicality of our scheme. [ABSTRACT FROM AUTHOR]

Internet of Things (IoT) has a wide concentration in today's technological world. It has a significant impact on smart infrastructure with a security vision. So, IoT devices with sensors or smart gadgets are used to gather important data. The data gathered from IoT are vulnerable to signal processing attacks due to the interconnection of different network categories. In this paper, a system for securing data in IoT communication is proposed. The proposed system includes two techniques. Initially, a technique with the combination of Fuzzy and Particle swarm optimization (F-PSO) is utilized to determine a secure path. Then a cryptographic technique using the Learning with Errors over Rings (R-LWE) encryption scheme is adopted for data encryption. The trust value of every node in the network is calculated using trustworthiness analysis. Then based on the trust value, the malicious nodes are segregated. After that, the characteristics of secure nodes are utilized to find the secure path between source and destination. The secure path is selected optimally using F-PSO. After finding the secure path, the data are encrypted using the R-LWE technique. The proposed system attained a throughput of 96% with less than 0.1 ms delay. An enhanced trust-based secure routing and message delivery protocol attained better performance than existing such as Advanced Encryption Standard, Tiny Encryption Algorithm, eXtended TEA, and Rivest–Shamir–Adleman encryption schemes. [ABSTRACT FROM AUTHOR]

In this paper, a model of reversible data hiding in encrypted domain (RDH-ED) based on signal reconstruction is presented, in which homomorphic encryption is introduced to reconstruct the encrypted signal generated by non-expansible symmetric encryption (NSE). In this way, NSE guarantees the security of the original signal, homomorphic encryption with short-bit key is performed in signal reconstruction. Since the reconstructed encrypted signal is homomorphic, data hiding can be facilely achieved by using homomorphism. According to the proposed model, both homomorphic symmetric encryption and homomorphic public-key encryption can be adopted to reconstruct NSE-based signal. Meanwhile, homomorphism is not limited to additive homomorphism, and multiplicative homomorphism is also applicable. In addition, two RDH-ED methods using symmetric multiplication homomorphism and public-key addition homomorphism are devised, respectively. Experimental results are demonstrated to illustrate the superiority of the proposed methods. [ABSTRACT FROM AUTHOR]

The RSA cryptosystem comprises of two important features that are needed for encryption process known as the public parameter e and the modulus N. In 1999, a cryptanalysis on RSA which was described by Boneh and Durfee focused on the key equation e d - k ϕ (N) = 1 and e of the same magnitude to N. Their method was applicable for the case of d < N 0.292 via Coppersmith's technique. In 2012, Kumar et al. presented an improved Boneh-Durfee attack using the same equation which is valid for any e with arbitrary size. In this paper, we present an exponential increment of the two former attacks using the variant equation e a - ϕ (N) b = c . The new attack breaks the RSA system when a and |c| are suitably small integers. Moreover, the new attack shows that the Boneh-Durfee attack and the attack of Kumar et al. can be derived using a single attack. We also showed that our bound manage to improve the bounds of Ariffin et al. and Bunder and Tonien. [ABSTRACT FROM AUTHOR]

The poxvirus lumpy skin disease virus (LSDV) is the causative agent of the vexatious lumpy skin disease, which predominantly affects cattle and water buffalo. It has been endemic to South Africa since the 1950s, and in 1960, a live attenuated vaccine was commercially released for use in the country to mitigate the spread of this transboundary disease. This vaccine (Neethling/vaccine/LW-1959) was generated from serial passages of the prototype lumpy skin disease virus strain Neethling-WC/RSA/1957, which was isolated in 1957 from an outbreak in the Western Cape province of South Africa and was subsequently used to prove the infectious nature of the virus and the resulting disease in cattle. In this study, we determined the complete genome sequence of the LSDV prototype strain Neethling-WC/RSA/1957, as well as three other LSDV isolates from the 1950s, one wild-type isolate from the 1970s, and a commercial vaccine produced in 1988 (LW-1959). Phylogenomic analysis showed that all six sequences were in cluster 1.1, along with previous sequences of the vaccine strain, the oldest known isolate (LSDV/Haden/RSA/1954), and virulent viruses isolated in the 1990s from South Africa. Seven single-nucleotide polymorphisms were identified between the Neethling-WC/RSA/1957 strain and the vaccine strain (LW-1959), providing new insights into virus attenuation and possible markers for DIVA assays. [ABSTRACT FROM AUTHOR]

This work describes a class of Algorithm Substitution Attack (ASA) generically targeting the receiver of a communication between two parties. Our work provides a unified framework that applies to any scheme where a secret key is held by the receiver; in particular, message authentication schemes (MACs), authenticated encryption (AEAD) and public key encryption (PKE). Our unified framework brings together prior work targeting MAC schemes (FSE'19) and AEAD schemes (IMACC'19); we extend prior work by showing that public key encryption may also be targeted. ASAs were initially introduced by Bellare, Paterson and Rogaway in light of revelations concerning mass surveillance, as a novel attack class against the confidentiality of encryption schemes. Such an attack replaces one or more of the regular scheme algorithms with a subverted version that aims to reveal information to an adversary (engaged in mass surveillance), while remaining undetected by users. Previous work looking at ASAs against encryption schemes can be divided into two groups. ASAs against PKE schemes target key generation by creating subverted public keys that allow an adversary to recover the secret key. ASAs against symmetric encryption target the encryption algorithm and leak information through a subliminal channel in the ciphertexts. We present a new class of attack that targets the decryption algorithm of an encryption scheme for symmetric encryption and public key encryption, or the verification algorithm for an authentication scheme. We present a generic framework for subverting a cryptographic scheme between a sender and receiver, and show how a decryption oracle allows a subverter to create a subliminal channel which can be used to leak secret keys. We then show that the generic framework can be applied to authenticated encryption with associated data, message authentication schemes, public key encryption and KEM/DEM constructions. We consider practical considerations and specific conditions that apply for particular schemes, strengthening the generic approach. Furthermore, we show how the hybrid subversion of key generation and decryption algorithms can be used to amplify the effectiveness of our decryption attack. We argue that this attack represents an attractive opportunity for a mass surveillance adversary. Our work serves to refine the ASA model and contributes to a series of papers that raises awareness and understanding about what is possible with ASAs. [ABSTRACT FROM AUTHOR]

Data encryption technology can protect data from illegal theft. This study analyzed the Rivest, Shamir, and Adleman (RSA) algorithm, the Advanced Encryption Standard (AES) algorithm, and their encryption and decryption processes, compared their merits and demerits, and combined them to from the AES + RSA algorithm to achieve network data protection. It was found from the performance analysis that the AES algorithm only took a short time to encrypt and decrypt, while the RSA algorithm, due to asymmetric encryption, spent a much longer time in decryption than in encryption; the total time consumed by the AES algorithm for encryption and decryption increased hundreds of times, but the operation time of the AES + RSA algorithm was only slightly longer than that of the AES algorithm. Also, from the perspective of security analysis, both AES and RSA algorithms had high confidentiality, which could meet the needs of information security. The results show that the combination of AES and RSA algorithms is effective in information security, which can be further popularized and applied in reality. [ABSTRACT FROM AUTHOR]

The Elliptic curve cryptosystem is a public-key cryptosystem that receives more focus in recent years due to its higher security with smaller key size when compared to RSA. Smartcards and other applications have highlighted the importance of security in resource-constrained situations. To meet the increasing need for speed in today's applications, hardware acceleration with cryptographic algorithms is required. In this paper, we present a novel parallel architecture for elliptic curve scalar multiplication based on a modified Lopez-Dahab–Montgomery(LDM) algorithm, to reduce the total time delay for computing scalar multiplication. It comprises three main steps: affine to projective conversion, point addition and doubling in the main loop followed by reconversion to affine coordinate. The modified parallel algorithm with new inversion in the reconversion yields lesser clock cycle and total time delay compared to existing techniques in the literature for the National Institute of Standards and Technology recommended trinomial G F (2 233) . Our proposed architecture implemented on Virtex4 and Virtex7 FPGA technologies, respectively, achieved a lesser clock cycle of 956, which yields a lesser delay of 20.025 and 8.22 μs. Compared with the state-of-the-art of existing techniques, two multiplications are reduced in the reconstruction process and our processor yields 18.29% and 27.21% increase in area-time performance in Virtex 4 and Virtex 7 devices, respectively. [ABSTRACT FROM AUTHOR]

With the rapid development of communication technology, the optimization of communication protocol, as a new generation of intelligent traffic system technology, has attracted more and more attention, in particular, the communication technology in traffic. In the authentication protocol of this paper, the symmetric cipher algorithm ZUC and the asymmetric cryptographic algorithm RSA are used as the cryptographic algorithms of the protocol. RSA is used to decrypt digital signatures for messages. In the current communication scheme, node communication does not have scalability and communication requirements in different scenarios, and a population key negotiation communication protocol was proposed in this paper. Employing the kana and random key parameters of the nodes in the roadside cell group, 3 communication protocols for group broadcasting, group to vehicle communication, and RSU communication between groups were designed. The results show that the protocol can meet the security requirements of network communication. The results show that the communication protocol in this paper is safe and reliable. At last, the communication efficiency of communication protocol is analyzed using communication overhead and average delay. The proposed protocol is an efficient communication protocol and the scheme is superior to other schemes in terms of communication overhead and average delay. [ABSTRACT FROM AUTHOR]

Chaos-based cryptosystems have been an active area of research in recent years. Although these algorithms are not standardized like AES, DES, RSA, etc., chaos-based cryptosystems like Chebyshev polynomials can provide additional security when used with standard public key cryptosystems like RSA and El-gamal. Standard encryption algorithms such as AES have always been the primary choice, but when it comes to image or video encryption, many researchers recommend chaos-based encryption techniques due to their computational efficiency. This paper presents a survey on the most up-to-date chaos-based image encryption techniques and classifies them into spatial, temporal and spatiotemporal domains for better understanding. The significant improvements in the field of image encryption are discussed. In addition, comparative analysis is performed to validate the evaluation matrices for quantifying the encryption algorithms' security and performance in recent papers. [ABSTRACT FROM AUTHOR]

Public key cryptography is threatened by the advent of quantum computers. Using Shor's algorithm on a large-enough quantum computer, an attacker can cryptanalyze any RSA/ECC public key and generate fake digital signatures in seconds. If this vulnerability is left unaddressed, digital communications and electronic transactions can potentially be without the assurance of authenticity and non-repudiation. In this paper, we study the use of digital signatures in 14 real-world applications across the financial, critical infrastructure, Internet, and enterprise sectors. Besides understanding the digital signing usage, we compare the applications' signing requirements against all six NIST's Post-Quantum Cryptography Standardization round 3 candidate algorithms. This is done through a proposed framework where we map out the suitability of each algorithm against the applications' requirements in a feasibility matrix. Using the matrix, we identify improvements needed for all 14 applications to have a feasible post-quantum secure replacement digital signing algorithm. [ABSTRACT FROM AUTHOR]

Mobile Ad-Hoc Networks (MANETs) are useful and appropriate, especially for complex scenarios, including law, military enforcement as well disaster recovery, and emergency rescue. Among different cryptographic algorithms, there is a chance of data hacking according to random key generation. The major purpose of this work is to plan and implement a new security protocol in MANET that is applicable for IoT platforms. The approach focused on this research is the modified chaotic map for encryption and decryption to deal with MANET and IoT data. The privacy preservation model is designed with a suggested cryptographic algorithm for enhancing the privacy and security of the MANET and IoT. An enhanced chaotic map is developed for processing the key generation that maintains the encryption and decryption process and prevents the loss of data while recovering the data. The adaptive key management strategy under the chaotic map is developed in this paper using a hybrid meta-heuristic algorithm named Crow Harris Hawks Search Optimization (CHHSO). Finally, the security analysis and performance evaluation in comparison is made in terms of "statistical analysis, convergence analysis, and communication overhead" that show the improved performance of the proposed model. [ABSTRACT FROM AUTHOR]

The Coronavirus pandemic and the work-from-anywhere has created a shift toward cloud-based services. The pandemic is causing an explosion in cloud migration, expected that by 2025, 95% of workloads will live in the cloud. One of the challenges of the cloud is data security. It is the responsibility of cloud service providers to protect user data from unauthorized access. Historically, a third-party auditor (TPA) is used to provide security services over the cloud. With the tremendous growth of demand for cloud-based services, regulatory requirements, there is a need for a semi to fully automated self sovereign identity (SSI) implementation to reduce cost. It's critical to manage cloud data strategically and extend the required protection. At each stage of the data migration process, such as data discovery, classification, and cataloguing of the access to the mission-critical data, need to be secured. Cloud storage services are centralized, which requires users must place trust in a TPA. With the SSI, this can become decentralized, reducing the dependency and cost. Our current work involves replacing TPA with SSI. A cryptographic technique for secure data migration to and from the cloud using SSI implemented. SSI facilitate peer-to-peer transactions, meaning that the in-between presence of TPA needs no longer be involved. The C2C migration performance is recorded and found the background or foreground replication scenario is achievable. Mathematically computed encrypted and decrypted ASCII values for a word matched with the output by the algorithm. The keys generated by the algorithm are validated with an online validator to ensure the correctness of the generated keys. RSA based mutual TLS algorithm is a good option for SSI based C2C migration. SSI is beneficial because of the low maintenance cost, and users are more and more using a cloud platform. The result of the implemented algorithm shows that the SSI based implementation can provide a 13.32 Kbps encryption/decryption rate which is significantly higher than the TPA method of 1 Kbps. [ABSTRACT FROM AUTHOR]

In an asymmetric-key cryptosystem, the secure storage of private keys is a challenging task. This paper proposes a novel approach for generating the same public and private key pair on a need basis. Hence, the need for secure storage of the private key is done away with. The proposed approach for generating the key pair is based on two factors: fingerprint biometrics and password. A stable binary string is generated from the distances among pairs of minutiae points in a fingerprint using a gray code-based method. Experiments show that gray code representation significantly reduces the number of inconsistencies between the generated bit strings from two instances of the same fingerprint as against the binary code representation. Hence, the Reed–Solomon error correction code successfully corrects errors due to variations in multiple instances of the same fingerprint to induce stability in the generated string. Hash of the stable string generated from the fingerprint and the string generated from hashed password are XORed to derive a stable seed value. The proposed approach uses this seed value to generate two large prime numbers. These prime numbers are used to generate the public and private key pair using the RSA key generation method. This seed value ensures the generation of the same key pair every time. The experimental results show that the proposed approach can ensure a stable generation of the key. It is not required to store either the fingerprint template or the password. Moreover, the generated private key is also not stored. It can be regenerated on a need basis. [ABSTRACT FROM AUTHOR]

Surgical training provides a solution for the trainee surgeons living remotely and needs to improve their surgical skills learned from the experts around the globe. One of the main challenges in implementing an effective tele-training system is security vulnerabilities during data transmission. The current security solutions come at a price in terms of efficiency and performance. This research aims to enhance security during video transmission over the Internet with decreased processing time. y: The proposed system consists of a hybrid encryption model with 2D discrete wavelet transform level 1 steganography technique, which enhances security during data transmission by encrypting the data first and then hiding it in the cover image. This creates a ciphered image that is difficult to crack for the attackers. Advanced Encryption Standard (AES) and (Rivest-Shamir-Adleman) RSA algorithms are used for the encryption process. It modifies and improves the key generation part of the encryption algorithm to achieve higher security. The hybrid encryption algorithm with the modified and improved key generation enhances security by improving the entropy by 29% over the current best solution. Additionally, the average processing time of the encryption and decryption process has been reduced by 33% compared to the state of the art solution. The processing time for the encryption process has been reduced by 2.55 ~ 2.92 ms, and for the decryption process, 2.45 ~ 2.55 ms. The entropy is increased by 8.174 (average) for the proposed system against 6.895 for the existing best solution. The proposed approach is mainly focused on providing improved security to the video data transmission over the Internet by modifying and improving the key generation step. Finally, this study proposes a solution for brute-force attacks in RSA during a real-time transmission. [ABSTRACT FROM AUTHOR]

The optical network architecture is undergoing a significant transformation to meet the world Internet traffic that demands ultra-high capacity and Terabit data rates. Network automation, elasticity and operational efficiency have evolved as a new challenge to deploy super wavelength in the transport networks. A flexible and scalable architecture that has evolved recently is Elastic Optical Networks. Bandwidth Variable Transponders with finer granularity and Flexible ROADM provide enormous bandwidth to the heterogeneous networks. Dynamic Routing, Modulation and Spectrum Assignment strategy is intended to optimize the resource utilization. A Cut based Fragmentation aware and Balanced Load Dynamic RMSA is proposed that optimize the transponder utilization and requested light paths. An appropriate defragmentation triggering policy is also investigated in this manuscript. Numerical results reveal that the proposed algorithm achieves better results in terms of bandwidth blocking probability, number of transponders per request and spectrum resource utilization compared to the benchmark EoN-RSA algorithms like k-Shortest Path Routing and Spectrum Assignment (k-SPRSA), Balanced Load RSA (BL-DRSA), Fragmentation Aware DRSA (FA-DRSA). [ABSTRACT FROM AUTHOR]

A vehicular Ad hoc NETwork -VANET has been emerged as a novel application for revolutionizing the driving experience and optimizing the traffic flow control networks. The development of high efficiency and optimized routing protocols for VANET remains a challenging task because of characteristics like rapid topology changes, large scale sizes and frequent link disconnections. Hence investigation of security and privacy problems is required to be emphasized. This paper presents a robust and novel method for improving the security in VANET environment and to evaluate the performance of the proposed ODMRP (On Demand Multi Cast Routing Protocol). Hence the study utilized RSA (Rivest-Shamir-Adleman) based key generation integrated with the asymmetric key generation with AES (Advanced Encryption Standard) algorithm.This proposed trust based integrated algorithm for key generation introduces a novel roadside unit message to the base station that enables Road side units- RSU responsible for the verification of the authentication of the encrypted messages received from the vehicles as well as for the notification of the results to the vehicles. The performance analysis represented that the proposed ODMRP with the use of RSA and AES algorithm possess a better adaptation capacity to VANET network in accordance to packet delivery ratio and throughput. The results obtained from the study have been compared with the existing system and proved to be more efficient. [ABSTRACT FROM AUTHOR]

The Cloud Environment provides storage for files as well as sharing services for disseminated clients. This technology helps users in the cloud to outsource their data and get good quality services from the cloud. Often, Data Integrity is a serious issue in Cloud Storage because the service provider is a semi-trusted one. Consequently, a self-determining auditing service is essential to check data integrity. In this paper, we developed a secure Cloud Storage environment without a third-party system and proposed an Improved Rivest-Shamir-Adleman Encryption Algorithm (IREA) along with the Flexible Capacity Cuckoo Filter (FCCF) auditing technique without Third Party Auditing. In this proposed system, the data owner encrypts the data using Improved RSA and stores it in the Cloud Service, and users alone can decrypt the data with the knowledge of the data owner. Furthermore, the FCCF ensures the integrity of the verification and secure data transactions can be provided by using the Two Level Quick Response (2LQR) code. The experimental results validate that the proposed IREA-FCCF with the 2LQR technique for data security in a CE has less time compared to that of the existing schemes in terms of encryption time, decryption time, signature generation, signature verification, and cost of the dynamic records. [ABSTRACT FROM AUTHOR]

The proposed Remote SCADA System (RSS) is a smarter, faster and more reliable way to control high power machines and monitor their sensors, data, and failures. The proposed system focuses mainly on building our own complete SCADA software and not using open-source SCADA software. The proposed RSS can use unlimited number of added Remote Terminal Units (RTU) nodes and each of them can handling unlimited number of input/output and can be used under different operating systems like Windows and Android. Using RSS all machines can be monitored and controlled by a single click from anywhere at any time. By doing this a real-time response from RSS system can be achieved. It's mainly based on standard communication techniques between remote nodes and single server-side application that talk to each node with its own ID and modify its instant database. So that every time accessing this web application, a real-time access to these nodes data and a virtual control room controls each General Purpose Input/Output (GPIO) in the selected node can be gotten. When a new event is happened in server-side program, it will be broadcasted to all related. On RSS there are two main points to deal with, the request latency and security of the system. This paper studied how the system latency and security are improved to obtain the needed values. The proposed RSS is a very secure program which have 4 security levels; authentication, authorization, RSA and CBC encryption system. Also, the encryption algorithms used in RSS are RSA and CBC block cipher encryption system. It is mixed way to prevent any attacker from breaking the cipher. First of all, RSA generates the public and private keys, and then CBC generates its Initialization vector and a random encryption key. Then a special function sends all of these keys encrypted with a pre-stored token in the data base and node memory which varied from node to another. Finally, node generates its private key from loaded public key. With this combination the speed of symmetric encryption system and the security of asymmetric encryption system can be achieved. On the other hand, the level of security firewalls needed to be Brocken by the attacker to brock the cipher is increased. The proposed system achieved low cost comparing with reported work; it is lower than Arduino + WIFI method by five times and 13 times lower than Raspberry-PI method. The proposed system is applied in educational systems, where it is used for teaching unlimited number of students Online. [ABSTRACT FROM AUTHOR]

Every month, several new protocols are popping up, comparing themselves with a few others and claiming to outperform the whole state of the art. The most popular domain of protocols is the one for authentication in a client–server architecture for which both symmetric key- and public key-based protocols are being proposed. The usage of public key-based mechanisms has several consequences, not only with respect to an increased computational and communication cost, but also with respect to increased possibilities to strengthen the protocol by making it resistant against a semi-trusted third party. On the other hand, we also recall that symmetric key-based protocols can already offer a nice set of security features. We see a trend in the current generation of papers published on public key-based client–server authentication protocols, showing that only a very limited amount of them really exploit the power that public key cryptography can offer with respect to this privacy towards a semi-trusted third party, and most of them do not even satisfy the same security features able to be also realised by a much more efficient symmetric key-based protocol. This paper serves as a warm wake-up call to all protocol designers to rethink the usage of more heavyweight constructions compared to symmetric key-based mechanisms in order to ensure that if they are used, they also fully exploit their inherent strength. [ABSTRACT FROM AUTHOR]

Oblivious transfer is a fundamental problem in cryptography where it is required that a sender transfers one of potentially many pieces of information to a receiver and at the same time remains oblivious as to which piece has been transferred. There exist many oblivious transfer protocols in the literature; however, most of them lack efficiency needed in practical situations. To fill this gap, we employ the notion of asymmetric homomorphic encryption and propose a generic construction to build simple and efficient oblivious transfer protocols. We then instantiate our construction with some well-known homomorphic encryption schemes such as RSA, Paillier and NTRU to obtain concrete oblivious transfer protocols. We further prove that our generic construction is secure in the universal composable framework. [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]

Without revealing data in the plain, public key encryption with equality test can achieve the basic cryptographic functionalities required. However, the extended version, i.e., public encryption with filtered equality test (PKE-FET) can be used to only test the ciphertext only for some data. In this paper, we revisit the notion of PKE-FET on various security models. We provide a formal definition for the security of PKE-FET and present a new scheme to achieve a stronger level of security than the existing scheme. [ABSTRACT FROM AUTHOR]

The secret information may be compromised for the lack of security and concealment in conventional covert communication. Blockchain is a suitable platform for establishing covert channels to protect the secret information, due to its features of anti-tamper, anti-forgery, anonymity, and information synchronization. However, the cost of storing large files in the blockchain is too high. To solve the above problems, we propose a double steganography model which combines blockchain and interplanetary file system (IPFS) in this paper. The model consists of two parts: image steganography and plain text steganography. In image steganography, the model embeds secret information into the original image using the least significant bit (LSB) algorithm based on RSA encryption. Then the image is stored in IPFS that returns the hash value. In plain text steganography, the model embeds the hash value into plain text files by the whitespace method based on partial order. Then those files are transmitted through blockchain network covert channels. Any node can obtain the files as the receiver. But only the trusted party can extract the secret information through the inverse process of embedding. Experimental results show that the proposed model has high performance of anti-detection and guarantees the concealment of communication. [ABSTRACT FROM AUTHOR]

In the digital transparent world, share the secret messages are challenged one. Visual cryptography (VC) is safer method for information transfer without any distraction by hackers. It is giving more security to the information sharing through digital form. This method hides the messages into images. So intruder cannot understand the distorted image and the data communication become secured. Through VC method number of shares has been generated from the original images. So here each RGB pixel shares are separately created by Visual Secret Share (VSS) scheme. The created multiple shares of the secret images are encrypted and decrypted with RSA algorithm. In the encryption process the multiplication technique is used for key generation process and public key is used for encryption process and private key is used for decryption process. Secret image's quality has been compared through the Peak Signal to Noise Ratio (PSNR) and Mean Square Error (MSE) values. The experimental result of decrypted image PSNR value is 156.32 and MSE value is 0.5031. The Number of Changing Pixel Rate (NPCR) and Unified Averaged Changed Intensity (UACI) values are compared for the secure level of the secret image. The result of decrypted image NPCR value is 69.44 and UACI value is 13.88. Finally, the experiment result shows that the proposed method is giving more security and quality of secret image sharing and also execution time is faster than existing method. [ABSTRACT FROM AUTHOR]