Encryption Tasks Research Articles

Research on the use of algorithms for matrix transformations for encrypting text information

AbstractSeveral algorithms are presented in the article for the transformation of numerical matrices by nonstandard means. These algorithms are shown in the data encryption task, namely, a text message with a certain set of characters. An analysis of the effectiveness of the proposed approach will be demonstrated by comparing open source and encrypted. The algorithms developed by the author are described in as detailed and clear as possible, since they are new. At the same time, they can be difficult to reach or incorrectly interpreted by those who do not have the full amount of information about them.

TD‐PSO: Task distribution approach based on particle swarm optimization for vehicular ad hoc network

AbstractThe rapid advancement of the artificial intelligence revolution during the past decade has significantly affected vehicular ad hoc networks (VANETs). Several applications have been introduced that must meet the requirements of a VANET, including automatic driving and preaccident alerts and broadcasting of video. The customization of vehicles for implementation of these applications is costly and might not be possible due to many constraints, particularly resource limitations. In order to achieve compliance with the VANET framework within the resource limitations, this article proposes limiting the time frame related with the individual parts of the process. To this end, this article recommends that the resource‐intensive ciphertext‐policy attribute‐based encryption (CP‐ABE) task be simplified by virtue of partitioning it into subtasks. This can be achieved by a machine‐learning technique (decision tree) in a manner that significantly influences the completion times of all subtasks. An approach based on particle swarm optimization (PSO), called task‐distribution PSO (TD‐PSO) , is proposed to perform the CP‐ABE task distribution on a VANET. The performance of this approach is evaluated by comparison with a genetic algorithm (GA), followed by comparison of these two solutions with the optimal solution proposed by the linear programming (LP) method. Results show that the TD‐PSO approach consumes less overhead than the GA. Moreover, comparison with the optimal solution proposed by LP shows that the near‐optimal solution obtained using TD‐PSO is more accurate than that obtained using the GA in most scenarios.

Secure and Efficient Protocol for Outsourcing Large-Scale Matrix Multiplication to the Cloud

Outsourcing computing is an application of cloud computing. It is an important method to solve the problem of client resource limitation. However, outsourcing computing brings security and efficiency challenges. Matrix multiplication computation (MMC) outsourcing has attracted many researchers to carry out research and has achieved many admirable results. Unfortunately, there is still a problem with zero elements of information protection for MMC outsourcing. In this paper, we are motivated to design a protocol, which can protect the private information of the zero elements, for outsourcing MMC to the cloud server. Our proposed protocol not only solves the problem of protecting zero elements information but also has no large client-overhead. The main idea is to add a special matrix to the original matrix for hiding zero elements before transforming the computation task. Then, the cloud server computes the received encryption task and returns the result to the client. Finally, the client decrypts and verifies the result. The experiment verifies the efficiency and practicability of our protocol. The comparison with previous schemes shows that the protocol improves security without much client overhead.

A Cluster of CP-ABE Microservices for VANET

The promising high data rate of a 5G network enables the reality of Vehicular Ad Hoc Networks (VANET). VANETS are ad-hoc networks and they have limited resources. Providing the confidentiality of data by an access control system in a highly dynamic and automated network is a major challenge. Ciphertext Policy Attribute Based Encryption (CP-ABE) enables the encryption of the access control system to provide the confidentiality of data in a broadcast message. However, as CP-ABE is a form of public key encryption, it consumes high resources. That is a feasibility issue in VANET networks. In this paper, we designing a new algorithm that distribute the CP-ABE encryption tasks on the vehicles cluster. In our scheme, we use Kubernetes to build a cluster of vehicles. Applying CP-ABE microservices to ensure the confidentiality of data greatly mitigates the computation cost on vehicle resources. Our scheme allows to distribute CP-ABE tasks between vehicles using (V2V) connection without needing assistant network components such as a Road-Side Unit (RSU). In our algorithm, we distribute the encryption tasks based on the resource information of vehicles that Kubernetes collect to reduce the execution time of CP-ABE operations. We provide a numerical analysis for our algorithm and discuss our results.

Hybrid M-Ary in Braided Single Stage Approach for Multiphoton Quantum Secure Direct Communication Protocol

Quantum secure direct communication (QSDC) is a branch of quantum cryptography which exploits laws of physics and was recently proposed for securing information transferred from sender to receiver without relying on computational complexity. Instead of an entangled photon, the quantum cryptography employs two other approaches, single photon and multiphoton for encoding the messages. The multiphoton was proposed to outperform the weaknesses of a single photon by introducing the multiplicity of a photon to perform data encryption tasks. Despite the advantages of multiphoton, the transmission time to transfer the encoded data is still regarded as a critical issue. Most of the multiphoton approaches require multiple photons to travel along a number of stages. Moreover, extra time is needed to change the polarization angle of the optical device for encoding purposes. These situations have resulted in an increase in source redundancy, which subsequently leads to an increase in the transmission time. In this paper, a compression message approach is proposed to mitigate the substantial increase in time used for the data transmission processes. The proposed compression approach, namely, hybrid M-ary in a braided single stage (HMBSS) is based on the lossless data encoding such that the number of photons is reduced in the data transmission stage. Extensive simulation experiments have been conducted to test the performance of the proposed approach against some selected multiphoton approaches. The results show that the proposed approach outperforms braided single-stage, M-ary three-stage and initialization vector in terms of reducing total average transmission time to encode the photon by about 75.9% and 91.7%, respectively. Furthermore, the HMBSS reduces the overhead on the transmission channel by minimizing the number of message's bits by about 45% in average even when the length of the message increases during the transmission as compared to others.

A novel image encryption algorithm based on polynomial combination of chaotic maps and dynamic function generation

Abstract Present paper introduces a polynomial combination of one dimensional chaotic maps that is blended in a dynamic image encryption algorithm. It is special because not only this combination has butterfly folding effect but also it shows generalization property over any polynomial combination. Hence, the butterfly folding effect is caused by governed parameters of polynomial combination. Moreover, multiple simulations and evaluations show the superiority of the proposed chaotic system. An application of this system, which we propose in cryptography, is a novel image encryption algorithm based on dynamic function generation. Compared to the state of the art algorithms, our image encryption algorithm has higher statistical and cryptanalytic properties. Even though this algorithm is not suitable for real-time applications such as streaming video encryption, it makes a good use of the proposed chaotic system. Uppermost cryptanalytic properties that are proven by statistical/numeric tests show good performance and reliability of proposed algorithm for image encryption tasks while unlike any other chaotic image encryption system, our algorithm uses a string input for secret key.

Comments on “Verifiable and Exculpable Outsourced Attribute-Based Encryption for Access Control in Cloud Computing”

Recently in IEEE Transactions on Dependable and Secure Computing (TDSC) (doi: 10.1109/TDSC.2015.2499755), Ma et al. proposed a new construction of attribute-based encryption (ABE) which can outsource the complicated encryption task to Encryption Service Provider (ESP) in a verifiable manner. Despite the authors claimed that the results of the outsourced encryption can be checked by the user, we show that Ma et al.’s proposal fails to provide the verifiability property for outsourced encryption, the most essential security goal that a verifiable computation scheme should achieve. Specifically, by giving concrete attacks, we demonstrate that the ESP can return forged intermediate ciphertext to the user without being detected.

Efficient and privacy-aware attribute-based data sharing in mobile cloud computing

In the era of cloud computing, it is convenient to share large-scale data among various kinds of users. As a kind of attribute-based encryption, ciphertext-policy attribute-based encryption (CP-ABE) is a potential technique for realizing fine-grained access control on shared data. However, traditional CP-ABE is not suitable for mobile cloud computing, where mobile users are resource-limited and privacy is fragile. In this paper, we propose an efficient and privacy-aware attribute-based data sharing system supporting offline key generation and offline encryption. In the proposed system, sensitive attribute values specified in an access structure are not explicitly sent along with a ciphertext. The online/offline encryption mechanism alleviates the computational burden of mobile users by performing most of encryption tasks without draining the battery. In addition, the online/offline key generation mechanism allows the attribute authority to finish most of operations in the key generation process in advance, which enables efficient mobile user registration. Finally, the proposed system is proven fully secure in the standard model and performance analysis shows its effectiveness in mobile cloud computing.

Information attacks and security in wireless sensor networks of industrial SCADA systems

Abstract The effectiveness of automated process control systems (APCS) and supervisory control and data acquisition systems (SCADA) information security depends on the applied protection technologies of transport environment data transmission components. This article investigates the problems of detecting attacks in wireless sensor networks (WSN) of SCADA systems. As a result of analytical research the authors developed the detailed classification of external attacks and intrusion detection in sensor networks and brought a detailed description of attacking impacts on components of SCADA systems in accordance with the selected directions of attacks. The cryptographic encryption tasks in the wireless sensor networks have been resolved by means of the built-in mechanism for symmetric AES encryption with 128 bit keys according to the ZigBee Pro Feature Set specification. However, analysis of the current state in the field of security of wireless sensor networks has shown that the key management problem is almost no solved. The article considers the problems and objectives of key management for data encryption in wireless sensor networks (WSN) of SCADA systems. The structure of the key information in the ZigBee network and methods of keys obtaining are discussed. The use of a hybrid key management schemes is most suitable for WSN. The session symmetric key is used to encrypt the sensor data, asymmetric keys are used to encrypt the session key transmitted from the routing information. Three algorithms of hybrid key management using routing information frames determined by routing methods and the WSN topology are presented.

Password-based key derivation function as one of Blum-Blum-Shub pseudo-random generator applications

The main objective of the research is the analysis of the practical applicability of the cryptographically secure software Blum-Blum-Shub pseudo-random number generator for different authentication and encryption tasks. It is shown that the considered pseudo-random sequence generator, which has a high computational complexity, can be effectively used in those cryptographic tasks, which require low key generation rate. An alternative way of implementing the Password-Based Key Derivation Function, which is based on the use of the Blum-Blum-Shub generator as a pseudo-random function, is proposed. The proposed algorithm allows to slow down dictionary and brute-force attacks. Experimental studies have shown that the developed algorithm allows to adaptively adjust the guaranteed minimum time of generating a cryptographic key for specific tasks of authentication and encryption.

An Encryption Scheme Based on Synchronization of Two-Layered Complex Dynamical Networks

A novel encryption scheme based on complex chaotic networks is proposed in this paper. Compared with a single chaotic system, a network of chaotic systems possesses complex dynamic characteristics, which can be used in encryption to enhance security. We adopt the drive-response synchronization method to synchronize two identical chaotic networks at the transmitter and receiver. Analysis on encryption security shows that key space is enlarged exponentially with respect to the number of nodes in the drive network, and also shows that the encryption system is highly sensitive to parameter mismatch. The proposed scheme is competent in carrying out encryption tasks of large data. Both theoretical and numerical results demonstrate that the proposed scheme is feasible for implementation in image and data encryption.

PCA Encrypted Short Acoustic Data Inculcated in Digital Color Images

We propose develop a generalized algorithm for hiding audio signal using image steganography. The authors suggest transmitting short audio messages camouflaged in digital images using Principal Component Analysis (PCA) as an encryption technique. The quantum of principal components required to represent the audio signal by removing the redundancies is a measure of the magnitude of the Eigen values. The aforementioned technique follows a dual task of encryption and in turn also compresses the audio data, sufficient enough to be buried in the image. A 57Kb audio signal is decipher from the Stego image with a high PSNR of 47.49 and a correspondingly low mse of 3.3266 × 10􀀀^(-6) with an equalized high quality audio output. The consistent and comparable experimental results on application of the proposed method across a series of images demonstrate that PCA based encryption can be adapted as an universal rule for a specific payload and the desired compression ratio.

Dual-Layer Video Encryption using RSA Algorithm

This paper proposes a video encryption algorithm using RSA and Pseudo Noise (PN) sequence, aimed at applications requiring sensitive video information transfers. The system is primarily designed to work with files encoded using the Audio Video Interleaved (AVI) codec, although it can be easily ported for use with Moving Picture Experts Group (MPEG) encoded files. The audio and video components of the source separately undergo two layers of encryption to ensure a reasonable level of security. Encryption of the video component involves applying the RSA algorithm followed by the PN-based encryption. Similarly, the audio component is first encrypted using PN and further subjected to encryption using the Discrete Cosine Transform. Combining these techniques, an efficient system, invulnerable to security breaches and attacks with favorable values of parameters such as encryption/decryption speed, encryption/decryption ratio and visual degradation; has been put forth. For applications requiring encryption of sensitive data wherein stringent security requirements are of prime concern, the system is found to yield negligible similarities in visual perception between the original and the encrypted video sequence. For applications wherein visual similarity is not of major concern, we limit the encryption task to a single level of encryption which is accomplished by using RSA, thereby quickening the encryption process. Although some similarity between the original and encrypted video is observed in this case, it is not enough to comprehend the happenings in the video.

Analysis and Implementation of Selective Image Encryption Technique Using Matlab

Encryption plays a very significant role in secure transmission of digital images from one place to another. There are a number of encryption algorithms available which perform the task of encryption. However some algorithms are fully layered which perform the encryption of the whole content of the images. But sometimes there is a requirement of partial image encryption so that there is reduced execution time and hence increases in performance. This type of partial image encryption can be achieved through Selective image encryption technique. This paper aims to propose an analysis and implementation of Selective image encryption technique using Matlab.

A Novel Structure with Dynamic Operation Mode for Symmetric-Key Block Ciphers

Modern Internet protocols support several modes of operation in encryption tasks for data confidentiality to keep up with varied environments and provide the various choices, such as multi-mode IPSec support. To begin with we will provide a brief background on the modes of operation for symmetric-key block ciphers. Different block cipher modes of operation have distinct characteristics. For example, the cipher block chaining (CBC) mode is suitable for operating environments that require self-synchronizing capabilities, and the output feedback (OFB) mode requires encryption modules only. When using symmetric-key block cipher algorithms such as the Advanced Encryption Standard (AES), users performing information encryption often encounter difficulties selecting a suitable mode of operation. This paper describes a structure for analyzing the block operation mode combination. This unified operation structure (UOS) combines existing common and popular block modes of operation. UOS does multi-mode of operation with most existing popular symmetric-key block ciphers and do not only consist of encryption mode such as electronic codebook (ECB) mode, cipher block chaining (CBC) mode, cipher feedback (CFB) mode and output feedback (OFB) mode, that provides confidentiality but also message authentication mode such as the cipher block chaining message authentication code (CBC-MAC) in cryptography. In Cloud Computing, information exchange frequently via the Internet and on-demand. This research provides an overview and information useful for approaching low-resource hardware implementation, which is proper to ubiquitous computing devices such as a sensor mote or an RFID tag. The use of the method is discussed and an example is given. This provides a common solution for multimode and this is very suitable for ubiquitous computing with several resources and environments. This study indicates a more effectively organized structure for symmetric-key block ciphers to improve their application scenarios. We can get that it is flexible in modern communication applications.

An approach for Intranet Data Security

In this paper, combined the encrypting and compressing processes to consider the choices of which types of bits are most effective in the selective encryption sense when they are changed. So, instead of encrypting the whole file bit by bit, changed only these highly sensitive bits. Moreover, by combining the compression and encryption tasks and reducing the total encryption work required, it will helps to achieve a savings in system complexity. Selective encryption is the technique of encrypting some parts of a compressed data file while leaving others unencrypted. Selective encryption is not a new idea. It has been proposed in several applications, especially in the commercial multimedia industry. Hover, selective encryption of lossless compressed text files has not been explored, and that is the focus of this paper.