Search

The technology-driven modern age emphasizes the security and privacy of communication. Through this paper, we delve deep into the need for user-centric security within cloud-based environments. The need for enhancement in encryption arises due to the increasing cases of data breaches and insider threats in cloud-based environments recently. The focus is laid upon the use of RSA encryption, end-to-end encryption, and anonymous messaging to address security-based concerns. The primary focus of this research is to develop a comprehensive security system to ensure the confidentiality and authenticity of text-based messages shared in the cloud. The proposed improved RSA algorithm, as suggested, incorporates three prime numbers in the key generation process. To address repetitive ciphertext, the proposed algorithm involves adding the index of each character in the plaintext string to the character's integer value before encryption. Conversely, during decryption, the same index is subtracted. This proposed algorithm has been utilized in a practical scenario, specifically in the implementation of a chat application. This paper presents a proof-of-concept for the proposed enhanced version of the RSA algorithm, accompanied by a thorough comparison and analysis of computational times across various bit lengths. Increase in data security at a cost of minor increase in computation time was observed through this research. [ABSTRACT FROM AUTHOR]

With increasing data transmission and the escalating risks of data theft, the demand for fast and robust encryption algorithms has intensified. The Rivest Shamir Adleman (RSA) algorithm is a widely used asymmetric cryptographic solution for secure data communication. However, the computational resources required for encryption and decryption processes can become significant, particularly as the volume of data increases. This research paper proposes a dynamic approach to enhance the RSA algorithm tailored explicitly for large-scale data encryption and decryption. The proposed method involves storing the encrypted value of repeated elements, aiming to optimize performance. To evaluate the efficacy of this approach, extensive experiments were conducted on various datasets comprising paragraphs of different sizes. The experiments involved encrypting and decrypting paragraphs containing 10, 50, 100, 200, 500, 1000, and 10,000 words. Comparative analyses were performed against existing RSA, El Gamal, and AES algorithms. Results indicate that the proposed dynamic RSA approach consistently outperforms traditional RSA in terms of encryption time, decryption time, and total execution time across all tested paragraph sizes. The regression analysis revealed stark differences between the two approaches. The regression line for traditional RSA exhibited a significantly steeper slope 1.75 and a substantially higher intercept 1001.42 compared to the proposed dynamic RSA approach, which demonstrated a lower slope 0.0113 and a much smaller intercept 28.58. These findings underscore the superior scalability and efficiency of the proposed dynamic RSA approach over traditional RSA, particularly in handling larger volumes of data while maintaining lower computational overheads. [ABSTRACT FROM AUTHOR]

Big data, cloud computing and other hot areas are the use of personal information, but in the process of using this data, a large number of improper behavior is used to steal personal information. Most of the encryption algorithms in common use nowadays are based on ones that are no longer absolutely secure, such as RSA attacked by factorization, elliptic curves attacked by Pollard's lambda algorithm, and symmetric encryption algorithms attacked by collisions. In this paper, an integrated encryption and compression algorithm is designed, firstly, the data is transformed into the form of matrix, and the Jordan decomposition is used for preliminary compression and encryption from the two-dimensional point of view, and then based on the sparsity of matrix vectors, the compression-aware technique is used for compressing the set of key vectors, and the ciphertext group J produced by Jordan decomposition (which is a string of numbers with matrix diagonal length base √2 N), as well as the set of key vectors Y and the intermediate value Θ produced by compression awareness are obtained in the end. This sidesteps the common algorithms that have already been breached and is able to combine better encryption performance with compression performance while being innovative. [ABSTRACT FROM AUTHOR]

In the face of advancing quantum computing capabilities posing significant threats to current cryptographic protocols, the need for post-quantum cryptography has become increasingly urgent. This paper presents a comprehensive analysis of the performance of various post-quantum cryptographic algorithms specifically applied to digital signatures. It focuses on the implementation and performance analysis of selected algorithms, including CRYSTALS-Dilithium, Falcon, and SPHINCS+, using the liboqs library. Performance tests reveal insights into key pair generation, file signing, and signature verification processes. Comparative tests with the well-known and popular RSA algorithm highlight the trade-offs between security and time efficiency. The results can help to select secure and efficient ciphers for specific 5G/6G services. [ABSTRACT FROM AUTHOR]

In the rapid evolving digital landscape, the imperative to ensure data security has never been more crucial. This paper addresses the pressing challenges in data security by introducing a file encryption management system, leveraging a modified advanced encryption standard (AES) algorithm with reduced round iterations and bit permutation. This system aims to comprehensively secure various file types, providing a dependable solution for file exchange. Our findings reveal substantial improvements in both encryption and decryption processes using the reduced-round permutationbased AES (RRPBA). The adapted algorithm demonstrates a significant 38.8% acceleration in encryption time and a remarkable 44.86% improvement in decryption time, positioning it as a pivotal component for efficient file operations within the management system. Moreover, the throughput assessments showcase a remarkable 33.73% improvement in encryption and 23.72% in decryption, outperforming the original AES, emphasizing the algorithm's superior computational effectiveness, signaling positive implications for future high-performance applications. In conclusion, the study not only addresses critical security challenges but also presents a viable solution with tangible speed advantages for file encryption and decryption processes within digital file management systems. [ABSTRACT FROM AUTHOR]

Summary: Communicating large amounts of data requires an encryption solution that ensures fast and secure data transfer. Unfortunately, it faced privacy and security issues, resulting in higher power consumption, data scarcity, energy, diversity, data reliability, low security, and packet loss in the communication process. The goal of this research is to ensure data transfer while conserving energy and protecting data transmission in WSNs. Therefore, this paper proposes a multipath routing protocol using the HGSPSO algorithm, which is a combination of hybrid gravitational search algorithm (HGSA) and particle swarm optimization (PSO), to securely transmit data from one node to another node under public and private key cryptography. The PSO approach is utilized to resolve the energy hole problem by selecting the cluster head in the sink coverage area. The RSA can be employed for data encryption, data decryption, key generation, and sharing. The metrics like acceleration constants and inertial weights are used for the HGSPSO algorithm. The result of this implementation demonstrated that the scheme had a low energy consumption of 36%, a maximum packet delivery ratio (PDR) of 96%, a higher throughput rate of 88%, and a low packet loss of 39%. [ABSTRACT FROM AUTHOR]

The article concentrates on exploring the issue of privacy‐preserving sliding mode consensus of multi‐agent systems (MASs) with disturbance. An encryption and decryption algorithm has been proposed to address data security and privacy issues during data transmission. To optimize network resource allocation, a dynamic event‐triggering mechanism has been introduced, which reduces the number of encrypted data while saving the computation cost. The consensus performance based on the sliding mode control strategy is achieved when the reachability of the slide‐mode surface is guaranteed, and then the slide‐mode controller is developed. Finally, an empirical demonstration through a numerical example validates the efficacy of the proposed strategy. [ABSTRACT FROM AUTHOR]

To secure sensitive medical records in the healthcare clouds, this paper proposes an End-to-End Encryption (E2EE) to enhance a patient-centric blockchain-based system for electronic health record (EHR) management. The suggested system with a focus on the patient enables individuals to oversee their medical records within various involved parties by authorizing or withdrawing permission for access to their records. Utilizing the inter-planetary file system (IPFS) for record storage is chosen due to its decentralized nature and its ability to guarantee the unchangeability of records. Then an E2EE enhancement maintains the medical data integrity using dual level-Hybrid encryption: symmetric Advanced Encryption Standard (AES) and asymmetric Elliptic Curve Cryptography (ECC) cryptographic techniques. The proposed system is implemented using the Ethereum blockchain system for EHR data sharing and integration utilizing a web-based interface for the patient and all users to initiate the EHR sharing transactions over the IPFS cloud. The proposed system performance is evaluated in a working system prototype. For different file sizes between 512 KB to 100 MB, the performance metrics used to evaluate the proposed system were the time consumed for generating key, encryption, and decryption. The results demonstrate the proposed system's superiority over other cutting-edge systems and its practical ability to share secure health data in cloud environments. [ABSTRACT FROM AUTHOR]

Hybrid encryption techniques are gaining popularity in the cloud platform due to their ability to address security concerns and data storage challenges. In order to ensure confidentiality at every stage of processing, this article presents an innovative strategy that merges fully homomorphic encryption (FHE) and secure hash algorithm 3 (SHA-3), offering robust protection against cyber threats. FHE and SHA-3 offer a solution to this problem. We conducted experiments using different datasets to test the performance and security strength of this hybrid approach. Our method takes into account factors such as computational overheads, complexity requirements, key management challenges, and limited support from vendors/providers offering specialized hardware/software capable of supporting complex mathematical functions required by each technique separately before combined into a hybrid form suitable enough scaled-out horizontally across different nodes within clouds themselves today globally among end-users relying upon them heavily day-to-day tasks involving mission-critical workloads running inside virtualized machines hosted on public/private clouds ecosystems worldwide. The results show that implementing FHE together with SHA-3 can significantly improve an organization's overall cyber security posture when operating critical infrastructure components residing within cloud environments. According to the results, it performs better than other methods that are currently in used complexity of encryption and decoding, including homomorphic encryption and RSA, AES & DSA, and AES & RSA. The hybrid algorithm we are proposed using fully homomorphic & SHA3 with 2048 bits 0.789 seconds of encryption time and decryption time with 0.001 seconds and execution time with 4.25 seconds. Therefore, we conclude that our proposed hybrid encryption technique is the best approach to address cyber security risks associated with storing sensitive data in cloud computing environments. [ABSTRACT FROM AUTHOR]

In recent times, the security of sensor networks, especially in the field of IoT, has become a priority. This article focuses on the security features of the Zigbee protocol in Xbee devices developed by Digi International, specifically in the Xbee 3 (XB3-24) devices. Using the TI LaunchXL-CC26X2R1 kit, we intercepted and analyzed packets in real-time using the Wireshark application. The study encompasses various stages of network formation, packet transmission and analysis of security key usage, considering scenarios as follows: without security, distributed security mode and centralized security mode. Our findings highlight the differences in security features of Xbee devices compared to the Zigbee protocol, validating and invalidating methods of establishing security keys, vulnerabilities, strengths, and recommended security measures. We also discovered that security features of the Xbee 3 devices are built around a global link key preconfigured therefore constituting a vulnerability, making those devices suitable for man-in-the-middle and reply attacks. This work not only elucidates the complexities of Zigbee security in Xbee devices but also provides direction for future research for authentication methods using asymmetric encryption algorithms such as digital signature based on RSA and ECDSA. [ABSTRACT FROM AUTHOR]

Fog computing accredits by utilizing the network edge while still rendering the possibility to interact with the cloud. Nevertheless, the features of fog computing are encountering several security challenges. The security of end users and/or fog servers brings a significant dilemma in implementing fog computing. The computational power of the resources constrains Internet of Things (IoT) devices in the fog-computing environment. Therefore, an attacker can easily attack. The traditional methods like attribute-based encryption (ABE) techniques are inappropriate for resource-constraint devices with protracted computing and limited computational capabilities. In this regard, we investigate a multiauthority ciphertext policy-attribute-based encryption (MA-CP-ABE) method that enables multiauthority attribute revocation and computation outsourcing. Moreover, the encryption and decryption processes of resource-constraint IoT devices are outsourced to the fog nodes. In this way, it also reduces the computational burden of the resource-constraint IoT devices. Hence, we propose MA-CP-ABE for encryption and decryption, attribute revocation and outsourcing by reducing the computational burden and securing the system. We compare the computational offloading approach with the existing techniques to prove that the proposed approach outperforms the existing approaches. The proposed method reduces the operation time for the encryption and decryption process. We outsource cryptography operations to the fog node, reducing the end user's computational cost. Eventually, simulated outcomes are used to assess the algorithm's computational cost. [ABSTRACT FROM AUTHOR]

The objective of this paper is to present a novel application of 2-cyclic refined integers to build a novel crypto scheme for the encryption and decryption of data and information based on the algebraic properties of 2-cyclic refined integers combined with RSA algorithm, where an improved version of RSA crypto-scheme will be established and applied to the security of information and data. On the other hand, we illustrate some examples and figures to show the validity and complexity of the algorithm. [ABSTRACT FROM AUTHOR]

Data security is critical in wireless sensor networks (WSNs) because communication signals are highly available due to data transmission in free space. Attacks ranging from passive eavesdropping to active snooping are more common on these networks. This paper proposes secure data transfer using data encryption based on the improved Rivest–Shamir–Adleman (RSA) with Diffie–Hellman (DH) key exchange algorithm (IRSA-DH). For this purpose, the adaptive distance-based agglomerative hierarchical (ADAH)-based clustering method is used. Then the cluster head (CH) is selected using the improved weight-based rain optimization (IWRO) to improve the network's lifespan. This study aims to design a secure group communication method for WSNs. In order to generate and distribute the key to the group, the RSA and DH and key exchange algorithm had been hybridized with the Key Management Center (KMC). For safe communication between users, the key exchange technique is investigated. The performance measures such as throughput, packet loss ratio (PLR), packet delivery ratio (PDR), latency, energy consumption, end-to-end delay (EED) and network lifetime are analyzed and compared with the existing approaches. [ABSTRACT FROM AUTHOR]

To address a business need, most organizations allow employees to use their own devices to enhance productivity and job satisfaction. For this purpose, the Bring Your Own Device (BYOD) policy provides controllable access for employees to organize data through their personal devices. Although the BYOD practice implies plenty of advantages, this also opens the door to a variety of security risks. This study investigates these security risks and proposes a complementary encryption approach with a digital signature that uses symmetric and asymmetric algorithms, depending on the organization's digital certificate, to secure sensitive information stored in employees' devices within the framework of BYOD policies. The method uses Advanced Encryption System (AES), Blowfish, RSA and ElGamal with a digital signature to achieve strong encryption and address critical security considerations such as user authentication, confidentiality and data integrity. The proposed encryption approach offers a robust and effective cryptographic solution for securing sensitive information in organizational settings that involve BYOD policies. The study includes experimental results demonstrating the proposed approach's efficiency and performance, with reasonable encryption and decryption times for different key and file sizes. The results of the study revealed that AES and Blowfish have the best execution time. AES has a good balance of security and performance. RSA performs better than ElGamal in encryption and signature verification, while RSA is slower than ElGamal in decryption. The study also provides a comparative analysis with previous studies of the four encryption algorithms, highlighting the strengths and weaknesses of each approach. [ABSTRACT FROM AUTHOR]

This work aims to solve the specific problem in the Power Internet of Things (PIoT). PIoT is vulnerable to monitoring, tampering, forgery, and other attacks during frequent data interaction under the background of big data, leading to a severe threat to the power grid's Information Security (ISEC). Cryptosystems can solve ISEC problems, such as confidentiality, data integrity, authentication, identity recognition, data control, and nonrepudiation. Thereupon, this work expounds on cryptography from public-key encryption and digital signature and puts forward the model of network information attack. Then, the security of the two cryptograms is certified against the two cyberattack modes. On this basis, an Identity-based Combined Encryption and Signature (IBCES) ensemble scheme is proposed by combining public-key encryption with the digital signature. Finally, the security of the proposed IBCES's encryption and the signature schemes is verified, and the results prove their feasibility. The results show that the proposed IBCEs are effective and feasible, fully meeting the information confidentiality requirements. Additionally, smart grid against Information Security (ISEC) algorithms must comprehensively consider network resources and computing power. This work creatively combines the two cryptosystems. The proposal breaks the traditional key segmentation principle by applying the same key to different cryptosystems and ensures the independent security of the two cryptosystems. The conclusion provides technical support for future research on cryptography. [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]

Agricultural product supply chain and blockchain are closely integrated with the continuous acceleration of agricultural modernization. The clustered supply chain has gradually developed from a single supply chain in recent years. There is heat competition among peer enterprises in the clustered agricultural product supply chain blockchain. Among them, the data on the blockchain is publicly available to all participants. The private data on the chain has been adopted as an encrypted storage model, in order to protect users' privacy. The existing single-department supervision scheme is unsuitable for the complex cluster agricultural supply chain. The multi-sector supervision can be expected to serve as a promising way in the current reality. However, multi-department supervision is still challenging to ensure the sharing of encrypted data on the chain without redundant information for irrelevant departments. It is a high demand to improve supervision efficiency and credibility. Fortunately, the ciphertext-policy attribute-based encryption (CP-ABE) can be a one-to-numerous encryption, essentially a public key encryption system. The CP-ABE can realize the sharing of data for the users with specified attributes suitable for the application environment of multi-department supervision of the blockchain in the clustered agricultural supply chain. In this research, a multi-department supervision scheme was proposed in the verifiable blockchain ciphertext policy for the cluster agricultural supply chains using CP-ABE. A chain of custody was set up outside the business chain, including the supervisors from various departments to facilitate the management of supervisors. The chain of custody managed data on the business chain through “cross-chain governance.” Different supervision strategies were set for the data on the chain, according to the data type. The administrator of the supervision department was set as the department's supervisor to supervise the specific data of the specific chain. According to the supervision strategy on the chain, the enterprise users encrypted the data using CP-ABE to realize the disclosure of data for privacy. A CP-ABE-based access tree verification scheme was designed to combine the smart contracts and supervision strategies, and then to verify the CP-ABE access tree before the data was uploaded to the chain, in order to ensure that the data was available to the designated supervisor. The direct use of CP-ABE was inefficient for data encryption. Therefore, hybrid encryption was used to encrypt and share the data. The specific implementation was to encrypt the original data with symmetric encryption and then use the CP-ABE to encrypt the symmetric encryption key. A supervision prototype system was constructed under the blockchain ciphertext of the clustered agricultural supply chain using Hyperledger Fabric. The system was tested in two aspects of function and performance. The functional test showed that the system fully met the needs of essential multi-department supervision. The performance test showed that each time the number of supervisors in the supervision strategy increased by 10, while the average on-chain time was extended by about 500 ms, and the average throughput was 438 (number of transactions/s, transactions/s). When the number of supervisors for a single data type of a single enterprise was within a reasonable range, the clustered system was adept to the multi-department supervision under the condition of the primary clustered agricultural supply chain blockchain ciphertext-application requirements. Security analysis indicated the high-security system. As such, this scheme can be expected suitable for the multi-departmental, specialized, and fine-grained supervision of data on the blockchain under data encryption. The pressure of regulators can be inspired by the development of blockchain supervision of cluster agricultural supply chains. [ABSTRACT FROM AUTHOR]

Different encryption methods that emerged with the development of cryptology have different advantages and disadvantages in terms of speed and security level. The importance of cryptography in this position is to reveal the advantages of encryption techniques by using them at the right time. In other words, the time of use and their management are as important as the strength of encryption algorithms. In this part hybrid encryption schemes come into play. Hybrid encryption schemes provide safer and faster data transmission by using the advantages of different encryption schemes on appropriate time. In this study, the reasons for the emergence of hybrid encryption schemes will be examined and the new hybrid encryption scheme will be mentioned. The new hybrid architecture consists of the implementation of the new encryption scheme and RSA, which is one of the asymmetric encryption schemes. [ABSTRACT FROM AUTHOR]

Mobile Ad-Hoc Networks (MANETs) are recognised as a key emerging technology for use whenever cellular communications are either infeasible, inefficient, or cost-ineffective. MANETS are composed of nodes that are arranged in a self-organizing manner, without a central device like a switch or router. The nodes communicate with each other over wireless links and cooperate in a distributed fashion. Smartphones are the most ideal network nodes in many scenarios where traditional networks are unavailable, but building a secure network with them is not easy. This paper extensively uses the existing possibilities to build a secure MANET. The designed MANET has been built on an NS3 simulator, with the base protocol being Ad-hoc On-demand Distance Vector (AODV) and message encryption is done by using RSA Algorithm. The Secure AODV protocol extension is implemented using the RSA extension. [ABSTRACT FROM AUTHOR]

This paper focuses on analyzing the performance of various encryption algorithms, namely RSA, ECC, and DSA, in terms of encrypting and decrypting sensitive data. Encryption is crucial for ensuring the security of data, and there are two types of encryption algorithms: Symmetric key and Asymmetric-key encryption. RSA is highly secure but has high computation time, whereas ECC provides equivalent security with lower computing power and battery usage. The study compares the implementation and analysis of DES, 3DES, AES, RSA, ECC, and DSA, highlighting their strengths and weaknesses. The paper aims to provide a comprehensive comparison of these cryptographic techniques, including their performances, to assist in selecting the most appropriate algorithm for specific applications. [ABSTRACT FROM AUTHOR]

The wearable healthcare equipment is primarily designed to alert patients of any specific health conditions or to act as a useful tool for treatment or follow-up. With the growth of technologies and connectivity, the security of these devices has become a growing concern. The lack of security awareness amongst novice users and the risk of several intermediary attacks for accessing health information severely endangers the use of IoT-enabled healthcare systems. In this paper, a blockchain-based secure data storage system is proposed along with a user authentication and health status prediction system. Firstly, this work utilizes reversed public-private keys combined Rivest–Shamir–Adleman (RP2-RSA) algorithm for providing security. Secondly, feature selection is completed by employing the correlation factor-induced salp swarm optimization algorithm (CF-SSOA). Finally, health status classification is performed using advanced weight initialization adapted SignReLU activation function-based artificial neural network (ASR-ANN) which classifies the status as normal and abnormal. Meanwhile, the abnormal measures are stored in the corresponding patient blockchain. Here, blockchain technology is used to store medical data securely for further analysis. The proposed model has achieved an accuracy of 95.893% and is validated by comparing it with other baseline techniques. On the security front, the proposed RP2-RSA attains a 96.123% security level. [ABSTRACT FROM AUTHOR]

Encryption of data is translating data to another shape or symbol which enables people only with an access to the secret key or a password that can read it. The data which are encrypted are generally referred to as cipher text, while data which are unencrypted are known plain text. Entropy can be used as a measure which gives the number of bits that are needed for coding the data of an image. As the values of pixel within an image are dispensed through further gray-levels, the entropy increases. The aim of this research is to compare between CAST-128 with proposed adaptive key and RSA encryption methods for video frames to determine the more accurate method with highest entropy. The first method is achieved by applying the "CAST-128" and the second is achieved by applying the "RSA ". CAST-128 utilizes a pair of sub-keys for each round as a quantum of five bits that was utilized as a key of rotation for each round and a quantum of 32 (bits) was utilized as a key of masking into a round. The proposed adaptive 128-bits key can be extracted from the main diagonal of each frame before encryption. RSA is a public-key cryptographic technique which can be known as (asymmetric) cryptography. An asymmetry of a key depends on factoring a product of two big prime values. A comparison was applied on several videos and the results showed that CAST-128 method proved the highest degree of entropy even if the frames have lots of distorted data or unclear image pixels. For example, the entropy value of a sample of a girl video is 2581.921 when using CAST-128, while it is 2271.329 when using the RSA; also the entropy value of a sample of a scooter video is 2569.814 when using the CAST-128, while it is 2282.844 when using RSA. [ABSTRACT FROM AUTHOR]

In order to ensure the protection of important data in the face of natural and man-made disasters in data centers in cloud computing services, sufficient backups of the data are required. This paper briefly introduced the security encryption measures for disaster backup of data under cloud computing. The transmission performance during disaster backup was improved by the intelligent ant colony algorithm. Simulation experiments were performed to compare the encryption performance of two encryption algorithms, the Rivest, Shamir, and Adleman (RSA) algorithm and the Advanced Encryption Standard (AES) algorithm, in disaster backup, and the transmission performance of the intelligent ant colony algorithm and the maximum network flow algorithm. The results showed that the asymmetric encryption algorithm and the RSA algorithm had better encryption performance than the AES algorithm in terms of disaster backup; with the increase of backup data volume, the transmission performance of both route assignment algorithms decreased, but the intelligent ant colony algorithm always outperformed the maximum network flow algorithm. [ABSTRACT FROM AUTHOR]

As a promising service paradigm, cloud computing has attracted lots of enterprises and individuals to outsource big data to public cloud. To facilitate secure data using and sharing, dual-policy attribute-based encryption (DP-ABE) is a suitable solution. It allows two access control mechanisms over encrypted data at the same time: one involves access policies over subjective attributes ascribed to user credentials, and the other involves policies over objective attributes ascribed to data. In this work, we are exploring methods to make DP-ABE more flexible, more efficient, and more secure for deployments in cloud scenes. Our proposal features the following achievements simultaneously: (1) beyond the access control mechanisms of DP-ABE, it also supports two flexible features called encryption and key generation in single-policy modes; (2) most operations of key generation, encryption, and decryption are securely outsourced to cloud servers, leaving extremely low overheads for the PKG, data owners, and users; and (3) it realizes the strongest security notion of public-key encryption schemes, namely, CCA security. We formalize the security definition and formally prove its security in the random oracle model. Moreover, we implement the proposed schemes using the Charm framework. The experiment results demonstrate that our schemes are efficient and practical. [ABSTRACT FROM AUTHOR]

To improve the cybersecurity of Cloud Computing (CC) system. This paper proposes a Network Anomaly Detection (NAD) model based on the Fuzzy-C-Means (FCM) clustering algorithm. Secondly, the Cybersecurity Assessment Model (CAM) based on Grey Relational Grade (GRG) is creatively constructed. Finally, combined with Rivest Shamir Adleman (RSA) algorithm, this work proposes a CC network-oriented data encryption technology, selects different data sets for different models, and tests each model through design experiments. The results show that the average Correct Detection Rate (CDR) of the NAD model for different types of abnormal data is 93.33%. The average False Positive Rate (FPR) and the average Unreported Rate (UR) are 6.65% and 16.27%, respectively. Thus, the NAD model can ensure a high detection accuracy in the case of sufficient data. Meanwhile, the cybersecurity situation prediction by the CAM is in good agreement with the actual situation. The error between the average value of cybersecurity situation prediction and the actual value is only 0.82%, and the prediction accuracy is high. The RSA algorithm can control the average encryption time for very large text, about 12s. The decryption time is slightly longer but within a reasonable range. For different-size text, the encryption time is maintained within 0.5s. This work aims to provide important technical support for anomaly detection, overall security situation analysis, and data transmission security protection of CC systems to improve their cybersecurity. [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]

COVID-19 has made the world realize that the world is a whole, and international trade is the main way to connect countries. With the increase of international trade, the trade data has also become gradually huge. However, the current international trade data is still transmitted using the traditional Internet, which not only is inefficient, but also has poor security. Therefore, this paper aimed to use blockchain technology to explore the big data sharing model and key mechanism of international trade. This paper mainly introduced the design and implementation of a blockchain-based IoT data security sharing system. Firstly, the functional architecture of the prototype system was comprehensively introduced. According to the division of different functional modules, the data interaction design of different modules and the design of related smart contracts were expounded. According to the characteristics of international trade big data, the encryption and decryption algorithms are designed for the transmission of international trade big data. Finally, the prototype system was introduced from data acquisition, experimental environment deployment, system-related functional verification, and performance testing. The experimental test results showed that the encryption and decryption of transaction data by the data security sharing prototype system were more than 2 times faster than those of the traditional algorithm, and the transmission efficiency of the system at different nodes fluctuated within 10%, which showed that the system could perform security interactive sharing of data. [ABSTRACT FROM AUTHOR]

Cloud computing has gained attention due to its sophisticated processing architecture and data storage capabilities in the last couple of years. Due to high volume data and the endless number of possible users, the security of the account holder's stored data and privacy becomes essential for this paradigm. This article focuses on the encryption architecture of data storage and retrieval by creating an encrypted searchable index, which is inspired by symmetric searchable encryption. Ranking becomes a need for providing the best out of the search results to the user. This research article proposes an efficient and flexible artificial neural network (ANN) based ranking scheme to search for documents from the cloud server. The proposed algorithm architecture is segmented into three parts. The first part is the generation of the encryption index over the uploaded data, the second part is query analysis, and the third part is ranking. To consolidate the encryption mechanism, RSA, NTRU, and AES were used based on the requirement of the data. To orient the retrieval part, the degree of the top keyword in the server is determined by using term frequency with inverse document frequency schemes. The retrieved documents are further ranked using ANNs. The simulation setup was done on MATLAB 2016b having datasets from Kaggle (Twitter data) and FIRE dataset. [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]

In order to solve the partial optimization problems of the RSA algorithm in computer network security, a method of RSA algorithm optimization based on data encryption was proposed. In the research, the application of data encryption in network information security system was mainly investigated, using RSA as the representative algorithm in the public key cryptosystem. The network information security model on the basis of data encryption was built on the public key cryptosystem in the research. Through the introduction of the RSA algorithm and the corresponding optimization scheme, the experiments for comparison were set up. Through the experiments, the feasibility of the optimization scheme was verified. Experimental results show that the efficiency of the RSA algorithm was about 1.0% to 2% higher than that of the traditional algorithm after a reasonable selection of parameters and the use of an optimized algorithm (also known as the combination algorithm), which improved the efficiency of RSA algorithm to a certain extent and achieved the purpose of improving RSA algorithm. It was proved that the method could effectively improve the budget efficiency of the RSA algorithm and solve the optimization problem of the RSA algorithm in computer network security. [ABSTRACT FROM AUTHOR]

In order to solve the practical problem that the security of computer network information cannot be guaranteed, which seriously affects the network performance, the author proposes a public key data encryption system based on PKI. The system proposed by the author is based on the public key cryptographic algorithm RSA, including implementation of data encryption and digital signature and key distribution, an improved RSA algorithm is proposed for the slow speed of RSA. The result obtained is as follows: after reasonable selection of parameters and the use of optimized algorithms (also known as combined algorithms), the RSA algorithm is about 1.0% to 2% more efficient than the traditional algorithm, to a certain extent, the operation efficiency of the RSA algorithm is improved, and the purpose of improving the RSA algorithm is achieved. It is proved that the public key data encryption system is of great significance for modern computer network information encryption and maintaining a green and secure network environment. [ABSTRACT FROM AUTHOR]

In order to promote the research process of information security in the whole society, improve the safety factor of computer data communication, strengthen computer security management, the author proposes a computer data encryption strategy that combines the strong security of the 3DES encryption algorithm and the asymmetric encryption advantages of the RSA algorithm. Through the detailed analysis of DES encryption algorithm and 3DES encryption, creatively uses the RSA encryption algorithm to improve the single 3DES algorithm, consolidates the performance of the 3DES encryption algorithm to ensure data communication, and ensures the data integrity, better improve encryption performance. Experiments show that: The proposed encryption algorithm improves security performance by 10 times, and the response efficiency is only 1 ms away from other algorithms, compared with other algorithms, it has better encryption performance and is suitable for actual computer data communication scenarios. Conclusion: The encryption algorithm proposed by the author has achieved good results in terms of security performance and response efficiency, it is suitable for actual computer data security communication and can effectively improve computer security management. [ABSTRACT FROM AUTHOR]

In order to solve the problem of information security, the process of digital resource development and integration has become the key. A method based on focusing on the development and integration of digital instructions is proposed, which discusses digital data encryption in detail, focusing on the DES algorithm in the symmetric encryption algorithm and the RSA algorithm in the asymmetric encryption algorithm and conducts a security evaluation. Through comparative analysis, the comprehensive communication system based on the combination of DES encryption algorithm and RSA encryption algorithm aims to realize the integration and sharing of digital display. Through experimental analysis and comparison with traditional commonly used encryption methods, 64-bit keys are very easy to generate, but the keys must be distributed before communication, and the keys must be changed from time to time. In this way, key management consumes a lot of system overhead. From the final experimental data, it can be concluded that the encryption algorithm has performance advantages over the separate DES and RSA algorithms. [ABSTRACT FROM AUTHOR]

This study introduces, explores and enlists the challenges of dispute resolution pertaining to data encryption and recommends for a policy framework for systematically addressing the grievances of social media users and intermediaries. Data encryption is essential component of ensuring privacy between the sender and receiver of the message. Any law which asks for the decryption key from the intermediaries to trace the originator of the message requires a deeper understanding of the encryption architecture. It seems that there is a gap in technology and law making pertaining to data encryption which needs to be resolved using a techno-legal framework. The data used in this study stems from an online survey carried out in India by Local Circles. The findings indicate that majority of the Social Media users are in favour of strict regulations. In line with what people think, the intermediary guidelines under the Information Technology Act makes it mandatory for the intermediaries (Social Networking Sites) to comply with the rules. But, there is lack of techno-legal framework to ensure that all disputes pertaining to data encryption and social media regulation will get resolved keeping a balance. [ABSTRACT FROM AUTHOR]

Currently, medical images represent basis of clinical diagnosis and source of telehealth and teleconsultation processes. Exchange of these images can be subject to several challenges, such as transmission bandwidth scarcity, time delivery, fraud, tampering, modifying, privacy, and more. This paper will introduce an algorithm consisting of a combination of compression and encryption techniques to meet such challenges in medical images field. First, compression is done by applying the Adaptive Arithmetic Coding (AAC) technique and controllable frequency quantization process in Discrete Wavelet Transform. After that, encryption process is applied using RSA and SHA-256 algorithms to encrypt the compressed file and to create digital signature. Performance analysis has shown that the algorithm can produce high compression ratio with good image quality, whereas range of PSNR near 45 dB and SIM is 0.88 as average values. For the security analysis, we have adopted data encryption and digital signature to guarantee the main data security services including integrity, authentication, and confidentiality, making the algorithm secure against passive or active attacks. [ABSTRACT FROM AUTHOR]

Cloud computing is a diversified domain and is a huge phenomenon that is a widely preferred technology in the current times. The users are unable to utilize cloud computing to the maximum, due to challenges in the security issues. To store sensitive or useful data in an insecure region is not an option for the user. Various techniques have been developed to provide security for the big data in the cloud. During voluminous data transmissions, it will not maintain the end-to-end security and the prevailing approaches do not solve the key complexities and not provides security for the keys. The Attribute-Based Encryption (ABE) can deliver a mechanism of fine-grained control by providing one-to-many encryption. But, the revocable process of accessing the privilege of encrypted data of users from cloud servers is challenging. Further, the complex process of ABE takes up huge computational time hence it becomes a burden for system users. To solve such issues, the proposed Enhanced Cipher-text Policy-based Attribute Encryption (CP-ABE) protect, broadcast and control the access of information, especially over the cloud server. In the proposed Enhanced CP-ABE method, proxy is added to securely transmit the key to the users. The Rivest Shamir Adleman (RSA) Algorithm provides security to outsourced big data in the cloud that enables public key encryption secure data when it is being sent over an insecure network such as the internet. The proposed Enhanced CP-ABE with RSA method effectively identifies the users who decrypt the ciphertexts during decryption. The experimental results show that the proposed Enhanced CP-ABE with RSA Scheme method acquires lesser encryption and decryption times of 1638 ms and 1102 ms respectively for a 256-bit key length. Whereas, the existing methods acquire encryption and decryption times of 1721ms and 1134 ms respectively. [ABSTRACT FROM AUTHOR]

Security plays a major role in an individual's life to win this world with highly secure and authentic lifestyle with the digital equipment's. The paper proposed an encryption based secure face detection and recognition model which can be implemented in daily life to generate a more robust and efficient security bubble around the world. The most crucial problem encountered during face recognition is due to the variation in face direction of an individual, the model solves the mentioned pose variation problem. The proposed model takes the help of face recognition library to recognize the face and use HOG (Histogram of Oriented Gradients) & SVM for checking the face authentication by performing an image match, the model also applies the concept of HOG to generate the encoded features from the image. The system is divided into two modules first is to detect a face and then match the detected face from the authentic persons dataset available. The system uses the concept of OpenCV library for giving a support system for the real time image. For data encryption, proposed model used the concept of DES3 and RSA algorithm. The proposed model gets 83.33% accuracy while tested for three different image types and states that the RSA algorithm performs encryption in less computational time. [ABSTRACT FROM AUTHOR]

Nowadays, the development of information technology can be described as extremely rapid, especially with the widespread use of the Internet; the security of communications in the network has become an important issue we are facing. The purpose of this article is to solve the problems in today's network security data encryption algorithms. Starting from the computer network communication security data encryption algorithm, we discuss the effects of several different encryption methods on improving network security. The research results show that it is known that the application of link encryption algorithm in network communication security encryption algorithm can increase the security index by 25%, the node encryption algorithm can increase the security index by 35%, and the end-to-end encryption algorithm can make the cyber activity safety index to increase by 40%. Among them, RSA algorithm and DES algorithm are two very representative algorithms; they represent different encryption systems. From the perspective of network data link, there are three methods of encryption algorithm, namely, link encryption algorithm, node encryption algorithm, and end-to-end encryption algorithm. [ABSTRACT FROM AUTHOR]

Cryptography is a science that studies methods so that data or messages remain safe when sent, from the sender to the recipient without experiencing interference from unauthorized parties. The cryptographic system used is a combination of symmetrical cryptographic algorithms, and asymmetric cryptographic algorithms also called hybrid cryptosystems. This research work tries to explore the need of integration of different encryption algorithms and enhance the strength of encryption and complexity. This work observes that integrity check algorithm can also be used to generate key of asymmetric key cryptography and they can help to enhance power of confidentiality. In this paper, we present a new hybrid by using Blowfish, RC6 and RSA algorithms. Within this, the data is encrypted through symmetric algorithm using RC6 and blowfish algorithm and key is encrypted using an asymmetric algorithm called RSA. The complete solution was implemented using Java technology and it was evaluated based on computation time. [ABSTRACT FROM AUTHOR]

Purpose: The privacy of the information is a major challenge in the communication process. In the present modern generation, the cryptography plays a vital role in providing security for data, such as text, images and video while transmitting from source to destination through internet or intranet. The Rivest-Shamir-Adleman (RSA) is an asymmetric key cryptographic system, where the security of the method works on the strength of the key. Design/methodology/approach: In an asymmetric key crypto system, a pair of keys is generated one public key for encryption and one private key for decryption. The major challenge of implementing the RSA is the power function which becomes tedious and time consuming as the exponential value increases. The Chinese remainder theorem proves to be the best for data encryption when it comes to execution time of the algorithm. The proposed novel RSA algorithm with lookup table (LUT) is an extension to the Chinese remainder algorithm, which works better for image and video in terms of time complexity. Findings: This paper presents a LUT approach for implementing the RSA with a minimal processing time. The proposed algorithm was compared with the standard algorithms like, Chinese remainder theorem, binary approach and squared multiplication approach. As the size of the exponent value increases, the proposed method shows better performance compared to other standard methods. Originality/value: This paper presents a LUT approach for implementing the RSA with a minimal processing time. The proposed algorithm was compared with the standard algorithms like, Chinese remainder theorem, binary approach and squared multiplication approach. As the size of the exponent value increases, the proposed method shows better performance compared to other standard methods. [ABSTRACT FROM AUTHOR]

Leakage-resilient encryption is a powerful tool to protect data confidentiality against side channel attacks. In this work, we introduce a new and strong leakage setting to counter backdoor (or Trojan horse) plus covert channel attack, by relaxing the restrictions on leakage. We allow bounded leakage at anytime and anywhere and over anything. Our leakage threshold (e.g., 10,000 bits) could be much larger than typical secret key (e.g., AES key or RSA private key) size. Under such a strong leakage setting, we propose an efficient encryption scheme which is semantic secure in standard setting (i.e., without leakage) and can tolerate strong continuous leakage.We manage to construct such a secure scheme under strong leakage setting, by hiding partial (e.g., 1 % ) ciphertext as secure as we hide the secret key using a small amount of more secure hardware resource, so that it is almost equally difficult for any adversary to steal information regarding this well-protected partial ciphertext or the secret key. We remark that the size of such well-protected small portion of ciphertext is chosen to be much larger than the leakage threshold. We provide concrete and practical examples of such more secure hardware resource for data communication and data storage. Furthermore, we also introduce a new notion of computational entropy, as a sort of computational version of Kolmogorov complexity. Our quantitative analysis shows that, hiding partial ciphertext is a powerful countermeasure, which enables us to achieve higher security level than existing approaches in case of backdoor plus covert channel attacks. We also show the relationship between our new notion of computational entropy and existing relevant concepts, including Shannon entropy, Yao entropy, Hill entropy, all-or-nothing Transform, and exposure-resilient function. This new computation entropy formulation may have independent interests. [ABSTRACT FROM AUTHOR]

To protect confidential data from computer crimes, the user must take care of the security of their information themselves, using existing modern software. One such tool is the implementation of message encryption by attaching a digital signature to the data. Three algorithms are required for cryptosystems to operate with a public key: an encryption algorithm, a decryption algorithm, and a key generation algorithm. One of the promising ways to develop public key encryption is to use the model of raising highly discrete logarithms to generate keys, the so-called Diffie-Hellman algorithm. The recurrent relations that form the basis of the Mandelbrot set provide chaotic behavior and a significant dependence of the process on the initial conditions. These properties allow you to create a cryptographic system that can use them to solve problems. The designed cryptographic system must combine the means of generating keys, encrypting text messages and generating a digital signature. The key exchange protocol provides for the establishment of a shared secret key between the participants, which can then be used to encrypt text or image messages with a digital signature. The tools with which it is possible to solve and implement a system of fractal algorithms for information protection are analyzed. The study implemented a software product in the C # programming language in Visual Studio 2010. The system is designed as part of an object-oriented approach to software development, so it uses software classes to distribute functionality. The implemented algorithm has a larger number of possible keys in comparison with the Diffie-Hellman key exchange scheme common today. The large size of the key space makes it difficult to implement a bust, also known as the method of "brute force". The chaotic properties of the fractal algorithm do not require the use of large numbers, but provide high quality encryption. Saving time on calculations allows you to reduce resource costs and increase system performance as a whole. [ABSTRACT FROM AUTHOR]

This paper describes a new opto-hybrid technique of two-stage encryption for the secure transmission and reception of sensitive information contained in the form of images and data. An advanced encryption–decryption technique based on optical scanning holography (optical scanning cryptography) and Fibonacci–Lucas transformation is proposed. The first stage of this hybrid system includes a point spread function engineered optical scanning cryptographic system. A new key based on fused biometric array is used in this stage. A digital encryption strategy follows this stage. This hybrid encryption scheme can be used for the secure transfer and storage of medical images in the Internet, especially in cloud-based services. The quantitative analysis is performed using different figure of merits. The quantitative investigations have been conducted through computer simulations. The parameters analyzed for establishing the performance characteristics of this system are Structural Similarity Index, Correlation Coefficient, Maximum Absolute Deviation, etc. This system shows a remarkable performance improvement during encryption. The method can be explicitly used in the radiograph image transfer over the Internet for telemedicine applications. [ABSTRACT FROM AUTHOR]

Big data require cloud that provides dynamically expanding data storage accessed through the Internet. The outsourcing data in the cloud for storing makes the user data management easier and reduces the cost of maintaining data. Still organizations are not confident to store their data in the cloud, because of security and privacy concerns. However, existing encryption methods are able to protect data confidentiality, but it has some drawbacks of access patterns can also leak sensitive information. The proposed system uses an Elliptic curve with Diffie–Hellman (ECDH) algorithm for encryption and decryption of data to improve the data security in the cloud. This algorithm reduced the computational complexity and encrypted data efficiently. In experimental analysis, the performance of proposed ECDH is calculated using evaluation parameters such as encryption time, decryption time, computation overhead and key generation time. The proposed ECDH algorithm has approximately 70% better performance in terms of encryption time than existing methods such as RSA, MRSA and MRSAC. [ABSTRACT FROM AUTHOR]

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

All the associations are genuine thoughts to receive the cloud computing administrations, seeing its advantages as far as cost, openness, accessibility, adaptability and profoundly computerized procedure of upgrading. Cloud computing upgrade the present capacities progressively without further speculation. Cloud computing is a band of assets, applications, and administrations. With the execution of cloud computing, associations have solid worries about the security of their information. The research focuses on the security issues of cloud services. The AES and RSA algorithms will be verified on five parameters key generation time, encryption execution time, memory usage, file uploading time and file downloading time. The CloudSim simulator will be used to find results that the RSA is performing much better than AES in terms of encryption execution time. [ABSTRACT FROM AUTHOR]