A few years ago, information size increased unexpectedly and a data explosion happened. In this world of growing information, a change in database generation may also be required. Historically, we used a structured query language that works best with structured data. Now, we want to work with unstructured data as well as with structured data. The solution is to use not only SQL (NoSQL) database, this means not only structured query language. Recently, NoSQL databases are widely used in many organizations. Moreover, the data is kept in external services like Database as a Service (DaaS), where server-side and client-side security concerns are created. Additionally, the database's query processing by several clients using complicated techniques and a shared resource environment may lead to ineffective data processing and retrieval. An effective data processing technique among several customers can be used to retrieve data in a secure and effective manner. In this paper, we present an Efficient Secure Query Processing Algorithm for Unstructured Data (ESQPA_U) for efficient query processing by applying data compression techniques before transferring the encrypted results from the server to clients. We have solved security concerns by using CryptDB to encrypt a database on the server to protect the data. Encryption methods have recently been suggested to give customers secrecy in cloud storage. The queries can be processed using encrypted data using this technique without having to first decrypt it. In order to evaluate ESQPA_U performance, it is contrasted with CryptDB existing query processing method. According to results, storage space is more effective and can save up to 57% of its original space.

Distributed computing includes putting aside the data utilizing outsider storage and being able to get to this information from a place at any time. Due to the advancement of distributed computing and databases, high critical data are put in databases. However, the information is saved in outsourced services like Database as a Service (DaaS), security issues are raised from both server and client-side. Also, query processing on the database by different clients through the time-consuming methods and shared resources environment may cause inefficient data processing and retrieval. Secure and efficient data regaining can be obtained with the help of an efficient data processing algorithm among different clients. This method proposes a well-organized through an Efficient Secure Query Processing Algorithm (ESQPA) for query processing efficiently by utilizing the concepts of data compression before sending the encrypted results from the server to clients. We have addressed security issues through securing the data at the server-side by an encrypted database using CryptDB. Encryption techniques have recently been proposed to present clients with confidentiality in terms of cloud storage. This method allows the queries to be processed using encrypted data without decryption. To analyze the performance of ESQPA, it is compared with the current query processing algorithm in CryptDB. Results have proven the efficiency of storage space is less and it saves up to 63% of its space.

The fractional-order functions show better performance than their corresponding integer-order functions in various image processing
applications. In this paper, the authors propose a novel utilization of fractional-order chaotic systems in color image
encryption. The 4D hyperchaotic Chen system of fractional-order combined with the Fibonacci Q-matrix. The proposed
encryption algorithm consists of three steps: in step#1, the input image decomposed into the primary color channels, R, G,
& B. The confusion and diffusion operations are performed for each channel independently. In step#2, the 4D hyperchaotic
Chen system of fractional orders generates random numbers to permit pixel positions. In step#3, we split the permitted image
into 2 × 2 blocks where the Fibonacci Q-matrix diffused each of them. Experiments performed where the obtained results
ensure the efficiency of the proposed encryption algorithm and its ability to resist attacks.

Robust watermarking is an effective method and a promising solution for securing and
protecting the copyright of digital images. Moments and moment invariants have become
popular tools for robust watermarking due to their geometric invariance and favorable
capability of image description. Many moments-based robust watermarking schemes
have been proposed. However, there is a challenging problem of these schemes that
should be addressed. One of these problems is to improve both imperceptibility and
robustness. In contrast, the other problem, most of these schemes used inefficient,
traditional computation methods of the moments, resulting in an inaccurate and inefficient
performance of the watermarking schemes. To overcome these challenges, in this paper,
we propose a novel robust color image-watermarking algorithm based on new multiple
fractional multi-channel orthogonal moments, fractional-order exponent moments
(MFrEMs), fractional-order polar harmonic transforms (MFrPHTs), and fractional-order
radial harmonic Fourier moments (MFrRHFMs). Firstly, highly accurate fractional new
multi-channel orthogonal moments are computed for the host color images. Then, more
stable and accurate coefficients of fractional new multi-channel orthogonal moments are
selected. Finally, a robust color image watermarking approach for multiple watermarks
images is proposed based on MFrEMs, MFrPHTs, and MFrRHFMs using a 1D Sine
chaotic map. The experimental results demonstrate that the proposed approach provides
robustness against various attacks and better imperceptibility than the existing methods.

A novel cryptosystem of color images is proposed. We defined a multi-channel orthogonal Gegenbauer moments with fractional order (FrMGMs) in Cartesian coordinates and then combined the FrMGMs with the 2D logistic-sine map. The proposed color image encryption method has three main steps in this process. The first step is confusion, where image pixels’ values are changed based on a 2D logistic-sine map to reconstruct the scrambled image. In the second step, the key is generated, which is used in encryption. The key is produced by combining the logistic map and the multi-channel Gegenbauer moments with fractional order. We used the original image to set the logistic map’s initial condition. In the third step, the scrambled image is diffused using the key to obtain an encrypted image. The experiments’ results and the security analysis show that the proposed technique has an extensive keyspace, high key sensitivity, and good encryption effect and can be judged robust against common security attacks.

Orthogonal moments (OMs) are used to extract features from color images. OMs with frac- tional orders are better than the OMs with integer orders due to their ability to extract fine features. This paper defined novel quaternion orthogonal shifted Gegenbauer moments (FrQSGMs) of fractional orders for color image analysis and recognition. Since both shifted Gegenbauer polynomials and the input digital images are defined in the domain [0, 1] ×[0, 1], the proposed FrQSGMs did not need any image mapping or image interpolation. The invariance to geometric transformations of the proposed FrQSGMs is derived by express- ing these moments in geometric moment invariants of fractional order. We conduct var- ious experiments to test the accuracy, invariance to RST, sensitivity to noise, recognition of similar color images, and computational times. The proposed descriptors outperformed the existing orthogonal moments with fractional orders.