Encryption Research Articles

Key Management Scheme for Secure Channel Establishment in Fog Computing

Fog computing is a promising extension of cloud computing, and enables computing directly at the edge of the network. Due to the decentralized and distributed nature of fog nodes, secure communication channels have to be supported in fog computing, which are generally realized through secure keys. Key management schemes are usually employed to generate, distribute and maintain the secret keys. In this paper, we propose a key management scheme called dynamic contributory broadcast encryption (DConBE) for secure channel establishment in fog computing. It allows a group of fog nodes that want to establish a fog system to negotiate a public encryption key and each node’s decryption key in one round without a trusted dealer. Any end user may encrypt messages under the public encryption key with short ciphertexts to any subset of the fog nodes in the system. Only selected fog nodes in the system can decrypt the encrypted messages using their respective decryption key. Our new key management scheme also achieves the properties of fog node dynamics, fully collusion-resistant and stateless.

A new approach of classical Hill Cipher in public key cryptography

Secure message transformation promote the creation of various cryptography systems to enable re???ceivers to interpret the transformed information. In the present age of information technology, the secure transfer of information is the main study of most agencies. In this study, a particular symmetric cryptography system, Hill Cipher method, is enhanced with the help of encryption and decryption algorithms of the asymmetric RSA cryptography system to avoid certain problems. Previous results show that the original Hill algorithms are still insufficient because of their weakness to known plaintext attack, and a modification of the Hill Cipher cryptography system is therefore presented to increase its invulnerability. The enhancement focuses on implementing the RSA algorithms over the Hill Cipher to increase its security efficiency. The suggested method relies on the security of the RSA and Hill Cipher cryptosystems to find the private decryption keys, and thus is much more secure and powerful than both methods applied separately. Also secure and dynamic generation of the Hill Cipher matrix instead of using static matrix are proposed. This new approach is composed of a public key cryptosystem that has a shared secret key (between participants only), public key (announced to all), and two private keys (for each person). Therefore, this new modification can increase the invulnerability of the Hill Cipher against future attacks during transmission of information between agencies in this age of information technology

The Perrin R-matrix and more properties with an application

In this note, we propose the Perrin R-matrix, study some properties of the Perrin sequences of numbers and derive some identities involving them such as the sum of special terms and extended relations of Perrin and Padovan numbers. Finally we give a model of cryptography based on the Padovan Q-matrix and Perrin R-matrix. This method uses a different encryption and decryption keys of the message matrix which will increase the security of the methods.

Forensic Analysis of Broken and Damaged Mobile Phone - A Crime Case Study

Forensic laboratories are frequently subjected to mobile devices that are assailed by shock or forced damage which might be the result of intentional efforts to destroy proof from the devices or accidental exposure. Chip-off technique is an effective method for data retrieval from such kind of exhibits. However, nowadays all mobiles phones are securely encrypted with full disk encryption (FDE) or file-based encryption (FBE) which makes chip-off forensics an improbable process to successfully retrieve data. In many of these cases, the encryption is on the hardware and hence, the device could be successfully decrypted by bringing it in its original condition. Thus, the original user data can be obtained for investigative purposes. This process can be enabled by replacement of electronic parts of the original device which contains user data and decryption keys i.e. PCB to the new host. This research paper covers a case study of a mobile phone obtained in broken and shattered condition whose diagnosis of PCB and subsequent actions led to data recovery.

Analysis of Combination Algorithm Data Encryption Standard (DES) and Blum-Blum-Shub (BBS)

Data Encryption Standard (DES) has a weakness in the key that is vulnerable to security threats, but it is quite popular to use because of the fast encryption and decryption process. Combining the DES algorithm with the Pseudo-random number generator Blum-Blum-Shub (BBS) in generating external keys in the encryption and decryption process of messages, produces a unique key and a good level of security. The longer the selected key and seed, the higher the security level of the DES encryption and decryption key. The use of BBS as an external key generator in the DES algorithm does not significantly affect the encryption (key and seed generated is around 0,001 – 0,003 seconds for the 2 – 4 digits experiment) processing time, meanwhile, the time in the decryption process has no effect because the BBS key and seed are no longer subject to feasibility testing or number requirements. The combination of DES and BBS algorithms can increase security in terms of encryption and decryption keys because the random number of DES keys generated by the BBS algorithm is unique and does not burden the user in determining the keys used in the DES algorithm because the keys are generated from the programming language.

Analisis Forensik Digital Memori Volatile untuk Mendapatkan Kunci Enkripsi Aplikasi Dm-Crypt

Disk encryption technology is something very useful in securing data. On the other hand, disk encryption can be used by criminals to hide the digital evidence. The information in the disk will be very useful for the investigation, but if the disk on the computer evidence encrypted then it will hamper the investigation process. The conditions will certainly be a challenge for investigator cybercrime to be able to find the disk encryption key, especially if the perpetrator did not cooperate in the investigation process. The analysis of the image memory to get the encryption key will be helpful in the investigation. In the overall memory activity on the computer evidence will be recorded, using a live image memory dump on the computer evidence, the decryption keys can be recovered. This paper will discuss about forensic analysis to getting the disk encryption key on the dm-crypt is used to encrypt the disk on Linux operating system and prove that through forensic image memory on a live memory dump, key dm-crypt disk encryption can be found with a success percentage of 80%. On this paper the research will be focused on the Linux operating system with dm-crypt function to full disk encryption.

Optical multiple-image authentication and encryption based on phase retrieval and interference with sparsity constraints

An optical multiple-image authentication and encryption method based on phase retrieval algorithm (PRA) in the Fresnel domain and interference with sparsity constraints is proposed. In our proposed method, sparse phase and space multiplexing technique are respectively introduced to authentication and encryption for multiple-image. Each target image is respectively encrypted into two phase-only masks, which contain the phase data generated from three binary images by applying PRA in the Fresnel domain and need to be verified before used for decryption. That the target images are respectively reconstructed by using different decryption keys in the proposed method increases the security of the cryptosystem. Numerical simulation shows that the proposed method has high multiplexing capacity and security.

Adaptively secure revocable hierarchical IBE from k-linear assumption

Revocable identity-based encryption (RIBE) is an extension of IBE with an efficient key revocation mechanism. Revocable hierarchical IBE (RHIBE) is its further extension with key delegation functionality. Although there are various adaptively secure pairing-based RIBE schemes, all known hierarchical analogues only satisfy selective security. In addition, the currently known most efficient adaptively secure RIBE and selectively secure RHIBE schemes rely on non-standard assumptions, which are referred to as the augmented DDH assumption and q-type assumptions, respectively. In this paper, we propose a simple but effective design methodology for RHIBE schemes. We provide a generic design framework for RHIBE based on an HIBE scheme with a few properties. Fortunately, several state-of-the-art pairing-based HIBE schemes have the properties. In addition, our construction preserves the sizes of master public keys, ciphertexts, and decryption keys, as well as the complexity assumptions of the underlying HIBE scheme. Thus, we obtain the first RHIBE schemes with adaptive security under the standard k-linear assumption. We prove adaptive security by developing a new proof technique for RHIBE. Due to the compactness-preserving construction, the proposed R(H)IBE schemes have similar efficiencies to the most efficient existing schemes.

Universal quantum circuit evaluation on encrypted data using probabilistic quantum homomorphic encryption scheme* *Project supported by the Fundamental Research Funds for the Central Universities (Grant No. 2019XDA02) and the Scientific Research Foundation of North China University of Technology.

Homomorphic encryption has giant advantages in the protection of privacy information. In this paper, we present a new kind of probabilistic quantum homomorphic encryption scheme for the universal quantum circuit evaluation. Firstly, the pre-shared non-maximally entangled states are utilized as auxiliary resources, which lower the requirements of the quantum channel, to correct the errors in non-Clifford gate evaluation. By using the set synthesized by Clifford gates and T gates, it is feasible to perform the arbitrary quantum computation on the encrypted data. Secondly, our scheme is different from the previous scheme described by the quantum homomorphic encryption algorithm. From the perspective of application, a two-party probabilistic quantum homomorphic encryption scheme is proposed. It is clear what the computation and operation that the client and the server need to perform respectively, as well as the permission to access the data. Finally, the security of probabilistic quantum homomorphic encryption scheme is analyzed in detail. It demonstrates that the scheme has favorable security in three aspects, including privacy data, evaluated data and encryption and decryption keys.

Comment on ‘Targeted Ciphers for Format‐Preserving Encryption’ from Selected Areas in Cryptography 2018

Comment on ‘Targeted Ciphers for Format‐Preserving Encryption’ from Selected Areas in Cryptography 2018

IMAGE ENCRYPTION FOR SECURE INTERNET TRANSFER

Security is a crucial side to preserve the confidentiality of information such as pictures and text. The probability of an assailant attempting to access the image in the course of transferring process is high as assailant may get hold of important data. Therefore, encryption methods are used for securing the data. A novel image encryption algorithm that is a combination of the AES algorithm and the chaos sequence is proposed in this paper. The project will use AES for encryption and decryption of the image transfer because AES is capable of solving problem that cannot be resolved by different algorithms. The original image is transformed into cipher-image using a share secret key and this process is called encryption while the reverse of encryption process is known as decryption. This method’s sensitivity to the initial values and input image, even the tiniest changes within these values will result in significant changes in the encrypted image. We show that this approach can shield the image against different attacks exploitation using histogram analysis.

SECURE AND HIGH-SPEED CRYPTOGRAPHY ARCHITECTURAL DESIGN TECHNIQUES FOR INTERNET OF THINGS

Providing protection for the exchanged statistics performs a key role inside the modern-day world unsecured contact among IoT devices. As the technology develop giant portions of information are being exchanged, call for secure standards of encryption is as a result increasing. Security is more desirable so that in the center of the facts attack with the aid of intruders it isn't always possible for the guys to be inside the conversation link. The protection method was carried out the use of the principle of symmetric, asymmetric, and hash algorithms. Elliptic Curve Cryptography is accomplished to encrypt and share the secret AES key among sender and receiver, As well because the Sophisticated Encryption Method for the encryption / decryption of the receiving data. In this paper, especially green architectures are carried out to ensure statistics conversation among users in the IoT perceptual layer via related to initialization, authentication technique and key generation, other than encryption. Sender combines facts encryption and key encryption earlier than it is despatched to the receiver with signature schemes. The receiver verifies the signature and decryption of the key applied to realize original statistics transmitted among the Perceptual Layer devices within the Internet of Things.

Match Me if You Can: Matchmaking Encryption and Its Applications

Match Me if You Can: Matchmaking Encryption and Its Applications

Securing multiple-single-channel color image using unequal spectrum decomposition and 2D-SLIM biometric keys

A novel multiple-single-channel color image cryptosystem based on unequal spectrum decomposition (USD) and 2D sine improved 1ogistic iterative chaotic map with infinite collapse modulation map (2D-SLIM) is proposed. In this method, R, G, and B channels of each color image of an authorized user is fused with corresponding LL sub-band of a gray-scale carrier image by inverse discrete wavelet transform (DWT) to obtain single-channel and watermarked image. The individual biometric key of an authorized user is produced by his/her phase-encoded irisprint and then modulated by chaotic random phase mask (CRPM). So the parameters of CRPM are used as decryption keys with the uniqueness of the irisprint. The watermarked image as input image is normalized, multiplied with biometric key, and then Fresnel transformed. The Fresnel spectrum is divided into two complex-value masks by using unequal spectrum decomposition in which one phase mask is exploited as decryption key and other as ciphertext. The final ciphertext is obtained by adding individual ciphertexts. The encryption and decryption process can be realized with a hybrid optoelectronic system. Numerical simulations have been performed to verify the validity and feasibility of the proposed system.

A Secure Asymmetric Optical Image Encryption Based on Phase Truncation and Singular Value Decomposition in Linear Canonical Transform Domain

A new asymmetric optical double image encryption algorithm is proposed, which combines phase truncation and singular value decomposition. The plain text is encrypted with two-stage phase keys to obtain a uniformly distributed cipher text and two new decryption keys. These keys are generated during the encryption process and are different from encryption keys. It realizes asymmetric encryption and improves the security of the system. The unscrambling keys in the encryption operation are mainly related to plain text. At the same time, the system is more resistant to selective plain text attacks; it also improves the sensitivity of decryption keys. With the application of phase truncation, the key space expanded and the security of the cryptographic system is enhanced. The efficacy of the system is calculated by evaluating the estimated error between the input and retrieved images. The proposed technique provides innumerable security keys and is robust against various potential attacks. Numerical simulations verify the effectiveness and security of the proposed technique.

Indirect Revocable KP-ABE With Revocation Undoing Resistance

Lately, many cloud-based applications proposed attribute-based encryption (ABE) as an all-in-one solution for achieving confidentiality and access control. Within this paradigm, data producers store the encrypted data on a semi-trusted cloud server, and users, holding decryption keys issued by a key authority, can decrypt data according to some access control policy. To be used in practical cases, any ABE scheme should implement a key revocation mechanism which assures that a compromised decryption key cannot be used anymore to decrypt data. Yu <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">et al.</i> (2010) introduced an ABE scheme with revocation capabilities that enjoys several unique advantages, such as reactivity and efficiency. In the scheme, the cloud server is entitled to update keys and ciphertexts in order to achieve revocation. Unfortunately, the cloud server retains the power to undo the revocation of a key (revocation undoing attack) so endangering confidentiality. In this article, we propose a revocable ABE scheme that still ensures the advantages of Yu <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">et al.</i> ’s scheme, but it also resists to the revocation undoing attack. We formally prove the security of our scheme and show through simulations that the user experiences a slightly higher computational cost with respect to Yu <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">et al.</i> ’s scheme.

Data transmitted encryption for clustering protocol in heterogeneous wireless sensor networks

In this paper, we propose a novel encryption schema (ECDH – RSA) based on Elliptic Curves Diffie – Hellman algorithm (ECDH) and RSA algorithm to secure transmitted data in Heterogeneous Wireless sensor networks (HWSNs). The proposed encryption is built under Cheesboard Clustering Routing Method (CCRM). The CCRM used to balancing node energy consumption. To achieve good scalability and performance by deploying a small number of powerful high-end sensors in addition to a large number of lowend sensors. ECDH is used to exchange public and private keys due to its ability to provide high security with small key size. The proposed encryption key is 176-bit and is produced by combining it’s key, node identification number, and distance to its cluster head (CH). To reduce energy consumption of CH, RSA encryption is used to allow CH to aggregate the encrypted data without having to decrypt them. We demonstrated that the proposed method is capable to work with different sensing environments that need to capture text data as well as images. The Simulation results demonstrated that our proposed method greatly improve the network performance in terms of energy consumption and highest paths.

UK: Interception of Encrypted Communications

UK: Interception of Encrypted Communications

Blockchain-Based Digital Rights Management Scheme via Multiauthority Ciphertext-Policy Attribute-Based Encryption and Proxy Re-Encryption

In order to ensure the confidentiality of digital contents, improve the fairness of digital copyright transactions, and reduce the time and management overhead of digital copyright owners, we proposed a blockchain-based digital rights management scheme. First, we designed a new multiauthority ciphertext-policy attribute-based encryption (MA-CPABE) scheme and showed that the new MA-CPABE has the indistinguishability of plaintext under adaptively chosen plaintext attack (IND-CPA) security and good performance. By combining the MA-CPABE and proxy re-encryption, the rights owner can flexibly sell the copyright to different users with once encryption by an agent who cannot access any information related to digital content when changing the ciphertext access policy as required. By using the smart contract of Ethereum, a fair trade of the decryption keys between the rights owner and rights requester is implemented. In order to further improve fairness, another blockchain is used as a ledge to store information related to digital rights, which greatly reduces the storage overhead in public blockchain. Security analysis shows that our scheme can provide IND-CPA security, resist collusion attacks, and protect the user’s privacy. Performance analysis shows that our scheme can provide a wealth of features to meet the various needs of users. The simulation results show that our scheme is very efficient compared to other schemes.

Security Analysis of Image Encryption Algorithm Based on Block Modulation-Scrambling

Security Analysis of Image Encryption Algorithm Based on Block Modulation-Scrambling