Decryption Algorithm Research Articles

Adaptively Secure KP-ABE For Circuits With Fan-In n And Fan-Out 1

Abstract The attribute-based encryption (ABE) scheme is suitable for access control of ciphertext in cloud computing. Kowalczyk and Wee proposed an adaptively secure attribute encryption scheme that supports $NC^1$ circuits. However, the circuit depth increases because this scheme supports only circuits with fan-in 2, which increases the key length and computational complexity of the key generation and decryption algorithms. To improve efficiency, we designed a secret sharing scheme for circuits with fan-in $n$, and we proposed a key-policy ABE scheme that supports circuits with fan-in $n$. We also designed pebbling rules for secret sharing in circuits with fan-in $n$, improving the compactness of the security reduction. Finally, we proved the adaptive security of the scheme by using a piecewise guessing framework and dual-system encryption. Compared with existing schemes, our scheme reduces the key size, improves the efficiency of the key generation algorithm and the decryption algorithm and provides tighter security reduction.

A New Attribute Encryption Anonymity Algorithm in Cloud Computing Environment

In order to solve the security problem of privacy information exposed by plaintext access strategy in cloud computing environment, this paper proposes a new attribute encryption anonymity algorithm which can be hidden and updated. The algorithm proposed in this paper hides the access policy attribute information through a randomized technology, which can support full hiding of the policy, and the prevention and control are more flexible. The experimental results show that, compared with the previous decryption algorithms, under the premise of the same attributes, the encryption time decreases in a few seconds. When the number of attributes is 1, the encryption time decreases by 10 s, and when the number of attributes is 10, the encryption time decreases by about 100 s, and the efficiency is greatly improved.

Light Weight Authentication Scheme for Smart Home IoT Devices

In today’s world, the use of computer networks is everywhere, and to access the home network we use the Internet. IoT networks are the new range of these networks in which we try to connect different home appliances and try to give commands from a remote place. Access to any device over an insecure network invites various types of attacks. User authentication can be performed using some password or biometric technique. However, when it comes to authenticating a device, it becomes challenging to maintain data security over a secure network such as the Internet. Many encryptions and decryption algorithms assert confidentiality, and hash code or message authentication code MAC is used for authentication. Traditional cryptographic security methods are expensive in terms of computational resources such as memory, processing capacity, and power consumption. They are incompatible with the Internet of Things devices that have limited resources. Although automatic Device-to-Device communication enables new potential applications, the limited resources of the networks’ machines and devices impose various constraints. This paper proposes a home device authentication scheme when these are accessed from a remote place. An authentication device is used for the home network and controller device to control home appliances. Our scheme can prevent various attacks such as replay attacks, server spoofing, and man-in-the-middle attack. The proposed scheme maintains the confidentiality and authenticity of the user and devices in the network. At the same time, we check the system in a simulated environment, and the results show that the network’s performance does not degrade much in terms of delay, throughput, and energy consumed.

Applying Encryption and Decryption Algorithm for Data Security in Cloud

Data security refers to the method involved with safeguarding information from unapproved access and information corruption all through its lifecycle. Data security includes information encryption, hashing, tokenization, and key administration practices that protect information across all applications and stages. Cloud framework for getting to information with mysterious confirmation gives safer client verification, client revocation and prevents replay attacks. Access control is handled on cloud KDCs it is overall safer aimed at information encryption. Produced decentralized KDC's are then gathered by (KGC). Framework gives confirmation to the client, in which just framework approved clients can unscramble, view the put away data. Client approvals and access control plot is presented in cloud, which is important for hindering replay attacks and supports change of data set aside in the cloud. The entry control plot is procuring thought since just upheld clients should approach genuine examine. Our arrangement thwarts maintains creation, replay attacks, scrutinizing and adjust data set aside in the cloud. We in like manner address client disavowal. The issues of endorsement, access control, security affirmation should be handled simultaneously.

Algebra Based Encryption and Decryption Algorithms

Algebra Based Encryption and Decryption Algorithms

Algorithm substitution attacks against receivers

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.

The Hill Cipher Algorithm for Data Encryption and Decryption

The science of encoding and decoding signals is known as cryptography. Cryptography is frequently used in people's daily life to keep sensitive data, such as Mastercard data, safe. Many regular exercises can be easily viewed by unintentional outsiders via the Internet. Hill cipher is a simple linear transformation represented by a matrix that is a traditional cryptography based on linear algebra. It is one of the symmetric key algorithms with various data encryption advantages. However, the inverse of the plaintext encryption key matrix is not always available. The encrypted text cannot be decoded if the key matrix is not invertible. The key matrix employed for encryption in the Involutory matrix generation method is invertible. As a result, we do not need to find the inverse of the key matrix during decryption.

Hybrid Technique for Cyber-Physical Security in Cloud-Based Smart Industries.

New technologies and trends in industries have opened up ways for distributed establishment of Cyber-Physical Systems (CPSs) for smart industries. CPSs are largely based upon Internet of Things (IoT) because of data storage on cloud servers which poses many constraints due to the heterogeneous nature of devices involved in communication. Among other challenges, security is the most daunting challenge that contributes, at least in part, to the impeded momentum of the CPS realization. Designers assume that CPSs are themselves protected as they cannot be accessed from external networks. However, these days, CPSs have combined parts of the cyber world and also the physical layer. Therefore, cyber security problems are large for commercial CPSs because the systems move with one another and conjointly with physical surroundings, i.e., Complex Industrial Applications (CIA). Therefore, in this paper, a novel data security algorithm Dynamic Hybrid Secured Encryption Technique (DHSE) is proposed based on the hybrid encryption scheme of Advanced Encryption Standard (AES), Identity-Based Encryption (IBE) and Attribute-Based Encryption (ABE). The proposed algorithm divides the data into three categories, i.e., less sensitive, mid-sensitive and high sensitive. The data is distributed by forming the named-data packets (NDPs) via labelling the names. One can choose the number of rounds depending on the actual size of a key; it is necessary to perform a minimum of 10 rounds for 128-bit keys in DHSE. The average encryption time taken by AES (Advanced Encryption Standard), IBE (Identity-based encryption) and ABE (Attribute-Based Encryption) is 3.25 ms, 2.18 ms and 2.39 ms, respectively. Whereas the average time taken by the DHSE encryption algorithm is 2.07 ms which is very much less when compared to other algorithms. Similarly, the average decryption times taken by AES, IBE and ABE are 1.77 ms, 1.09 ms and 1.20 ms and the average times taken by the DHSE decryption algorithms are 1.07 ms, which is very much less when compared to other algorithms. The analysis shows that the framework is well designed and provides confidentiality of data with minimum encryption and decryption time. Therefore, the proposed approach is well suited for CPS-IoT.

A novel data classification-based scheme for cloud data security using various cryptographic algorithms

Abstract Digital technologies had an effect on people's lives. The majority of these digital devices rely on cloud storage to meet their memory needs. Hundreds of thousands of images, videos, and audio files are being transferred to cloud storage. Thousands of people around the world access these media every second. Unauthorized access to these media must be avoided. One of the weak points for data breaches is the user-end encryption. This paper suggests a strategy for improving cloud data protection by combining the AES and blowfish encryption and decryption algorithms. AES-256 is used as the first layer, followed by blowfish as the second layer, in the hybrid solution. The output of the first layer is input to the second layer and the final result is analyzed. The proposed method also discusses other combined approaches such as AES with other traditional algorithms but the proposed method gives significant results compared to other approaches.

A revocable multi-authority fine-grained access control architecture against ciphertext rollback attack for mobile edge computing

Mobile edge computing is an emerging decentralized cloud paradigm that can provide real-time mobile services for users. But there are some limitations in the existing access control architectures for mobile edge computing, such as low efficiency, poor expansibility and high algorithm complexity. Therefore in this paper, we propose a decentralized ciphertext-policy attribute-based encryption scheme which with mutually verifiable outsourced decryption and non-delegated computing mode attribute revocation as the fine-grained access control model for the mobile edge cloud. Compared with the state-of-art access control models with revocation function, first, our scheme is based on Type-3 pairing, which has higher efficiency and stronger security. Second, our outsourcing decryption algorithm can realize mutual verification, that is, not only the server can verify the validity of the user’s outsourcing key, but also the user can verify the correctness of the decrypted plaintext. Thirdly, our revocation algorithm can not only resist ciphertext rollback attacks to achieve the genuine backward and forward security, but also does not need the assistance of any intermediate proxy server, which greatly simplifies the network topology.

Application of Hybrid Encryption Algorithm in Hardware Encryption Interface Card

In order to effectively solve the increasingly prominent network security problems, cryptographic algorithm is the key factor affecting the effectiveness of IPSec VPN encryption. Therefore, this paper mainly studies cryptographic algorithms and puts forward the following solutions: briefly analyze the concept and function of IPSec VPN, as well as the basic theoretical knowledge of IPSec Security Protocol and cryptography, and analyze the traditional cryptography, modern cryptography, symmetric cryptographic algorithms and asymmetric algorithms, and their security. At the same time, the executable and security performances of AES and DES algorithms are compared and analyzed. This paper studies the elliptic curve encryption algorithm ECC, expounds the mathematical basis of realizing the algorithm, and compares and analyzes the security performance and execution efficiency of ECC. Based on the above two algorithms, a hybrid encryption algorithm is proposed, and the realization mechanism of the hybrid encryption algorithm is studied and discussed. The hybrid encryption algorithm combines the advantages of ECC and AES. The algorithm selects 128-bit AES and 256-bit ECC. In order to better cover up plaintext C, AES is used to encrypt information. While enhancing security, speed is also considered. The improved encryption, decryption, and signature authentication algorithms are relatively safe and fast schemes. ECC algorithm is improved, and on this basis, ECC algorithm and AES algorithm are combined. Moreover, HMAC message authentication algorithm is added, and the performance of the improved algorithm is significantly improved.

The Network EPES8–2

The article presents the EPES8–2 network with two round functions using the same algorithm for encryption and decryption. INTRODUCTION: Currently, block encryption algorithms based on the Feystel network are widely used. Block encryption algorithms based on the Feystel network include encryption algorithms such as DES, GOST 28147-89, as well as block encryption algorithms such as CAST 256, DFC, E2, LOKI97, which participated in the competition announced by NIST. The advantage of this network is that a single algorithm is used for encryption and decryption, only the encryption round keys are used in reverse order for decryption.

Group public key encryption supporting equality test without bilinear pairings

In cloud computing scenarios, it is a common approach to encrypt the data before uploading in order to maintain the privacy. Public key encryption with equality test (PKEET) provides a generic solution to equality comparisons on encrypted data. Considering the practical requirements of PKEET in group user scenarios, Ling et al. presented a group public key encryption scheme with equality test (G-PKEET) by utilizing the computationally expensive bilinear pairing operations. In this paper, we propose an efficient and verifiable group public key encryption with equality test construction without bilinear pairings (GPKEET/BP). Our proposal is developed from a basic observation that two points determine a straight line, and is proven to be indistinguishable against the chosen-ciphertext attacks (IND-CCA) in the random oracle model under the computational Diffie-Hellman (CDH) assumption. Theoretical analysis shows that our construction only involves several modular exponentiations in the encryption, decryption and test algorithms. The theoretical results are well supported by experimental simulations, which show that the test algorithm of GPKEET/BP performs about 92% faster than that of Ling et al.’s scheme. So our GPKEET/BP scheme turns out to be better suited for group ciphertext equality test situations.

Cloud Storage Data Access Control Scheme Based on Blockchain and Attribute-Based Encryption

Cloud storage is a popular model of the application in various fields, and the security of storage data and access permission have been widely considered. Attribute-based encryption (ABE) provides fine-grained user access control and ensures data confidentiality. However, current ABE access control schemes rely on trusted cloud servers and provide a low level of security. To solve these problems of traditional encryption schemes, we propose a blockchain-based and ABE cloud storage data access control scheme. In this article, blockchain and smart contract technology are the core elements to ensure data integrity and build a decentralized verification method for outsourcing results. This application can minimize the reliance on servers in the cloud environment. Based on the ciphertext-policy ABE algorithm, the proposed scheme supports a hidden access policy to avoid the risk of privacy leakage. In addition, we adopt outsourcing technology and predetected decryption algorithms to reduce the computational overhead of local and outsourced servers. Security analysis and performance evaluation show that our proposed scheme has high computational efficiency and satisfies the condition of indistinguishability under the chosen-ciphertext attacks.

The Drivers of a Digital Signature System Adoption: Evidence from Finance and Information System Departments

Background: With the massive e-commerce transactions and document transfers, reliable system protection is needed. A digital signature is a tool that consists of encryption and decryption algorithms in a secret key to prevent data theft and online fraud. Objective: This research proposes an integrated technology-organization-environment (TOE) and the unified theory of acceptance and use of technology (UTAUT) to determine the factors affecting consumer intention to adopt the digital signature system. This research uses finance and information system departments’ perspectives in various industries. Methods: The analytical method is the Structural Equation Modeling (SEM) approach using the Smart Partial Least Square statistical version 3.0 software to examine the hypothesized connections between latent variables. Results: The results show that support from top management, size of the enterprise, and social influence have significant and positive effects on digital signature adoption. Meanwhile, user involvement and perceived simplicity have a negative effect on the adoption of a digital signature system in finance and information system departments. Conclusion: The current research suggests that executive levels in the finance and information system departments encourage the adoption of digital signature tools in doing daily tasks to increase efficiency. Keywords: Digital signature, consumer intention, finance and information system, structural equation modeling, TOE and UTAUT

Design of Novel Key Generation Technique Based RSA Algorithm for Efficient Data Encryption and Decryption

The RSA cryptosystem is the most extensively used shared key cryptosystem. It is the first cryptosystem to employ the use of a public key. The more powerful this cryptosystem is, the larger the key. There are several RSA algorithms and variants. Nonetheless, it has snatched the hot topic of science. The desire to keep sensitive data safe isn't going away. Data is continually moving over the network in today's environment. The scope of this network could be local or worldwide. It will be sent to you by email or another method. It's also critical to keep sensitive or private information out of the hands of prying eyes. There is also a requirement to develop a zero-tolerance security method. This study offered a time-saving method for generating encryption and decryption keys. This method of key generation may be beneficial to all RSA implementations.

A NOVEL SIMPLE AND HIGHLY SECURE METHOD FOR DATA ENCRYPTION-DECRYPTION

In the course of the past 30 years, data has become pivotal to all aspects of human life. Data generated, captured, and replicated are increasing in size and expanding applications. The proliferation of fast wireless networks has encouraged data storage within the cloud. So, protecting data from attackers has become urgent to maintain its security and confidentiality, need for security and privacy technologies, systems, and processes to address it. This research paper proposes a simple and highly secure encryption decryption (SHSED) algorithm that can be used for cloud computing-based applications. It achieves the Shannon’s concept of diffusion and confusion by the involvement of logical operations, such as XORing, addition, and subtraction in addition to byte shifting. It is also characterized by the flexibility in the secret key length and the number of rounds. Experimental results have demonstrated powerful security level and a clear improvement in the encryption execution time measurements and security strength as compared with cryptosystems widely used in cloud computing.

Performance Evaluation of Cryptographic Algorithms: DES, 3DES, Blowfish, Twofish, and Threefish

With the advancement of the Internet, many individuals and organizations have started to use it to store and send personal or business information. Some of this information is highly confidential and that, in turn, raises an issue of data privacy and confidentiality. Major advances in the Internet have also aided intruders in getting unauthorized access to confidential information. Information Security is the art of securing data from illegitimate access while ensuring integrity, availability, and confidentiality of data. Information Security is achieved through cryptographic encryption and decryption algorithms. Encryption hides confidential information by converting it to an unreadable form while the reverse process of retrieving data from the unreadable or encrypted form is known as decryption. Many cryptographic algorithms exist today and selecting which one to use depends on several factors and measures. This paper conducts a comparison of the encryption speed for five different cryptographic symmetric block-cipher algorithms: DES, 3DES, Blowfish, Twofish, and Threefish. The simulation is done using Python with various text file sizes. The results show that Blowfish outperforms the rest of the algorithms that were tested.

A Ring Learning with Errors-Based Ciphertext-Policy Attribute-Based Proxy Re-Encryption Scheme for Secure Big Data Sharing in Cloud Environment.

Owing to the huge volume of big data, users generally use the cloud to store big data. However, because the data are out of the control of users, sensitive data need to be protected. The ciphertext-policy attribute-based encryption scheme can not only effectively control the access of big data, but also decrypt the ciphertext as long as the user's attributes satisfy the access structure of ciphertext, so as to realize one to many big data sharing. When the user's attributes do not satisfy the access structure of ciphertext, the attribute-based proxy re-encryption scheme can be used for big data sharing. The ciphertext-policy attribute-based proxy re-encryption (CP-ABPRE) scheme combines the characteristics of the ciphertext-policy attribute-based encryption scheme and proxy re-encryption scheme. In a CP-ABPRE scheme, on the one hand, the data owner can use the ciphertext-policy attribute-based encryption scheme to encrypt the big data for cloud storage, to realize the access control of the big data. On the other hand, the proxy (cloud service provider) can convert ciphertext under one access structure into ciphertext under another access structure, thus realizing big data sharing between users of different attribute sets. In this article, we modify the existing attribute-based encryption scheme based on Ring Learning With Errors (RLWE), add re-encryption key generation algorithm, re-encryption ciphertext generation algorithm, and re-encryption ciphertext decryption algorithm, and construct CP-ABPRE scheme. In the construction of the re-encryption key, we introduce a random vector and hide the vector in the key by threshold technology. Finally, a CP-ABPRE scheme supporting threshold access structure is constructed based on RLWE. Compared with the existing attribute-based proxy re-encryption schemes, our scheme has smaller public parameters, can encrypt multiple plaintext bits at a time, and can resist selective access structure and chosen plaintext attack, so it is more suitable for big data sharing in cloud environment.

Asymmetric Encryption of Invisible Structured Light 3D Imaging

The research proposes a novel invisible structured light 3D object encryption method. The system projects invisible light on the target plane to achieve three-dimensional object reconstruction. The encryption is conducted using keys from eight stripe patterns and two fingerprint patterns using an elliptic curve encryption algorithm to generate eight corresponding ciphertexts. The three-dimensional object is reconstructed using eight fringe patterns with the elliptic curve decryption algorithm. The proposed method greatly reduces the interference of background light in the system to achieve a better 3D imaging accuracy. The elliptic curve cryptosystem is able to ensure 3D object information transmission security. The simulation results validated the robustness and effectiveness of the proposed scheme. The proposed method has practical security-sensitive applications.