Introducing a Technique for Searching Data in a Cryptographically Protected SQL Database | Chapter 1 | Mathematics and Computer Science: Contemporary Developments Vol. 1

 

In recent eras, storing and processing data on third-party remote cloud servers has been widely used, showing explosive growth. The growing popularity of data outsourcing to third-party cloud servers has a downside, related to the serious concerns of data owners about their security due to possible leakage. The desire to reduce the risk of loss of data confidentiality has become a motivating start to developing mechanisms that provide the ability to effectively use encryption to protect data. However, the use of traditional encryption methods faces a problem. Namely, traditional encryption, by making it impossible for insiders and outsiders to access data without knowing the keys, excludes the possibility of searching. This paper presents a solution that provides a strong level of confidentiality when searching, inserting, modifying, and deleting the required sensitive data in a remote database whose data are encrypted.

 

 The proposed SQL query processing technique allows the DBMS server to perform search functions over encrypted data in the same way as in an unencrypted database. This study also offers a basis for implementing the solution on the server side of the Oracle DBMS using unmodified DBMS software using our own developed persistent stored modules (PSM). This is achieved through the organization of automatic decryption by specially developed secure software of the corresponding data required for search, without the possibility of viewing these data itself. We tested our prototype on a single machine that simulates both a proxy and a database server. At that, we guarantee the integrity of the stored procedures used and special tables that store encrypted modules of special software and decryption keys, the relevance and completeness of the results returned to the application. The results of the analysis of the feasibility and effectiveness of the proposed solution show that the proper privacy of the stored data can be achieved at a reasonable overhead. Future studies may focus on the conduct of an in-depth performance evaluation of this proposed solution, including a comparison with existing implementations, to show its practicality in various real-life situations.

 

Author(s) Details

Vitalii Yesin
Department of Security of Information Systems and Technologies, Faculty of Computer Science, V. Karazin National University of Kharkiv, 61022 Kharkiv, Ukraine and Department of Information Technology Security, Institute of Computer Technologies, Automation and Metrology, Lviv Polytechnic National University, 79000 Lviv, Ukraine.

Mikolaj Karpinski
Institute of Security and Computer Science, University of the National Education Commission 2 Podchorazych St., Krakow, 30-084, Poland.

Maryna Yesina
Department of Security of Information Systems and Technologies, Faculty of Computer Science, V. Karazin National University of Kharkiv, 61022 Kharkiv, Ukraine and Department of Information Technology Security, Institute of Computer Technologies, Automation and Metrology, Lviv Polytechnic National University, 79000 Lviv, Ukraine.

Vladyslav Vilihura

Department of Security of Information Systems and Technologies, Faculty of Computer Science, V. Karazin National University of Kharkiv, 61022 Kharkiv, Ukraine.

Ruslan Kozak
Department of Cyber Security, Faculty of Computer Information Systems and Software Engineering, Ternopil Ivan Puluj National Technical University, 46001 Ternopil, Ukraine.

Ruslan Shevchuk
Department of Computer Science and Automatics, Faculty of Mechanical Engineering and Computer Science, University of Bielsko-Biala, 43-309 Bielsko-Biala, Poland and Department of Computer Science, Faculty of Computer Information Technologies, West Ukrainian National University, 46009 Ternopil, Ukraine.

 

Please see the book here:- https://doi.org/10.9734/bpi/mcscd/v1/8460E

Enhanced Image Protection Using Discrete Fractional Fourier Domain and Dual Random Phase Encoding | Chapter 5 | New Horizons of Science, Technology and Culture Vol. 2

In the digital era, secure image transmission is critical for applications ranging from medical imaging to military surveillance. Encryption is one of the well-known techniques to provide security in the transmission of multimedia content over the internet and wireless networks. There is use of image in all the areas, so its security is of great concern nowadays. In this paper, we propose a novel method of image encryption using discrete fractional Fourier transform (DFrFT) using an exponential random phase mask. The proposed method employs a two-phase masking approach, where the input image is first modulated with a random phase mask in the spatial domain and subsequently transformed using the DFrFT with tunable fractional orders. A second random phase mask is applied in the fractional frequency domain to further obscure image content. This technique makes it almost impossible to retrieve the image without using both the right keys. The combination of multidimensional DFrFT and random phase modulation significantly increases the key space and sensitivity to initial conditions, making brute-force and plaintext attacks computationally infeasible. Experimental results validate the robustness of the proposed method in terms of Peak Signal-to-Noise Ratio (PSNR) of maximum 42.02 dB, keyspace analysis for security, computational complexity same as FrFT, processing time 2.8654 seconds and mean square error -1.5735 dB obtained.

 

Author(s) Details

Deepak Sharma
Department of Electronics and Communication Engineering, Jaypee University of Engineering & Technology, A.B. Road, Raghogarh, Guna-473226, India.

 

Subodh Kumar Singhal
Department of Electronics and Communication Engineering, Jaypee University of Engineering & Technology, A.B. Road, Raghogarh, Guna-473226, India.

 

Prateek Pandey
Department of Computer Science Engineering, Jaypee University of Engineering & Technology, A.B. Road, Raghogarh, Guna-473226, India.

 

 

Please see the book here:- https://doi.org/10.9734/bpi/nhstc/v2/5655

Comparative Analysis of Symmetric Cryptographic Algorithms for Varying Text File Sizes | Chapter 6 | Mathematics and Computer Science: Contemporary Developments Vol. 4

 

This research aims to investigate five different symmetric algorithms: AES, DES, 3DES, Rijndael, and RC2. The primary objective is to identify the most suitable algorithm for encrypting text files of varying sizes and to promote a positive cryptographic culture for text file security.

 

Each algorithm is evaluated based on its performance in encrypting and decrypting text files of different sizes, specifically 10 KB, 20 KB, 50 KB, 1 MB, 2 MB, and 5 MB. The study focuses on measuring the time duration each algorithm requires for these processes. While numerous encryption algorithms can secure computerized information across different organizations, the time efficiency of each algorithm varies with the size of the text file. Some algorithms perform optimally for small files, while others are more suitable for larger files.

 

In this study, five symmetric algorithms are integrated into a single program using object-oriented programming concepts such as classes and inheritance. The program automatically selects the appropriate encryption algorithm based on the size of the text file to be encrypted. The file size remains stable before and after encryption, ensuring the same process is applied during decryption. The encryption and decryption code is developed using Visual Studio 2013, and the results are analyzed using the R programming language.

 

The encrypted text, or ciphertext, is represented in UTF-8 format, where "UTF-8" stands for Unicode Transformation Format, with "8" indicating that each character is represented by 8 bits. The file sizes are measured in kilobytes (KB). The performance analysis prioritizes smaller text files and arranges the algorithms in ascending order of their suitability: AES, 3DES, DES, RC2, and Rijndael. AES is found to be most effective for small text files, while Rijndael is more suitable for larger text files.

 

Author (s) Details

Allajabu Dafalla Khamis
College of Computer and Information Science, Faculty of Graduate Studies, Alzaem Alazhari University, Khartoum, Sudan.

 

Saad Subair
College of Computer Studies, International University of Africa, Khartoum, Sudan.

 

Please see the book here:- https://doi.org/10.9734/bpi/mcscd/v4/1704

Robust Encryption-Compression Scheme Based on Multiple Parameter Discrete Fractional Fourier Transform for JPEG 2000 | Chapter 5 | Mathematics and Computer Science: Contemporary Developments Vol. 7

The concept of Fractional Fourier transform (FRFT) was first introduced by N. Wiener in 1929, in quantum mechanics, the FRFT was recognized as a ‘transform method’ by mathematical bodies after the work of Victor Namias in 1980 in which the concept of FRFT had introduced by considering fractional power of eigenfunctions of the ordinary FT. Encryption along with compression is the process used to secure any multimedia content processing with minimum data storage and transmission. The transforms play a vital role in optimizing any encryption-compression systems. Earlier the original information in the existing security system based on the fractional Fourier transform (FRFT) is protected by only a certain order of FRFT. In this article, a novel method for an encryption-compression scheme based on multiple parameters of discrete fractional Fourier transform (DFRFT) with random phase matrices is proposed. The performance analysis and salient features of the proposed encryption-compression scheme are discussed in detail. The multiple-parameter discrete fractional Fourier transform (MPDFRFT) possesses all the desired properties of discrete fractional Fourier transform. The MPDFRFT converts to the DFRFT when all of its order parameters are the same. We exploit the properties of multiple-parameter DFRFT and propose a novel encryption-compression scheme using the double random phase in the MPDFRFT domain for encryption and compression data. The proposed scheme provides two-way options for data encryption and compression as well. The proposed scheme with MPDFRFT significantly enhances the data security along with the image quality of decompressed images compared to DFRFT and FRFT and it shows consistent performance with different images. The numerical simulations demonstrate the validity and efficiency of this scheme based on Peak signal to noise ratio (PSNR) and compression ratio (CR) and the robustness of the schemes against bruit force attack is examined.

 

Author (s) Details

 

Deepak Sharma
Electronics and Communication Engineering Department, Jaypee University of Engineering and Technology, Guna, India.

 

Manish Patidar
Electronics and Communication Engineering Department, Jaypee University of Engineering and Technology, Guna, India.

 

Please see the book here:- https://doi.org/10.9734/bpi/mcscd/v7/2789

Encryption and Decryption Process of RGB Colour Image Using by Matrix Method | Chapter 3 | Research and Applications Towards Mathematics and Computer Science Vol. 1

 In this research work, we intend a new technique for RGB colour figure encryption based on change matrix. The colour concept is encrypted into Red, Green and Blue channels place each channel uses a double permutation key method for assigning a new colour to all pixel of RGB colour representation. Each channel is encrypted with a method known as double change key encoding, that assigns a various color to each pel of an RGB color image.  Additionally, we present a novel approach of detached block encryption. The number of possible encryptions is provided along with a particularized study of the encryption of a 9-pixel representation. Additionally, the Matrix representation efficiently conveys the explanation process.

Author(s) Details:

N. Avinash,
Department of Mathematics, Sacred Heart College (Autonomous), Tirupattur-635 601, Tamil Nadu, India.

S. Jaraldpushparaj,
Department of Mathematics, Sacred Heart College (Autonomous), Tirupattur-635 601, Tamil Nadu, India.

T. Sathinathan,
Department of Mathematics, Sacred Heart College (Autonomous), Tirupattur-635 601, Tamil Nadu, India.

G. Britto Antony Xavier,
Department of Mathematics, Sacred Heart College (Autonomous), Tirupattur-635 601, Tamil Nadu, India.

Please see the link here: https://stm.bookpi.org/RATMCS-V1/article/view/10686

Double Fold Encryption Algorithm Using Adjacency Matrix and Linear Feedback Shift Register (LFSR) as Diffusion | Chapter 3 | Research Highlights in Mathematics and Computer Science Vol. 2

 Sensitive dossier transfer and sharing 'tween two or more legitimate entities have enhance a difficult task on account of indiscriminate and always-increasing usage of cyberspace in technology and route. The sole plan for defending data against high-tech-attacks is to mask the main information along the way. For a very long time, diagram theory plays a important role in encryption. The proximity matrices of undirected graphs, specifically, are used in the current research to evolve a block cypher. The data is encrypted in blocks, accompanying each block having three rounds and each round bearing two different phases: the first point uses an adjacency forge, and the second phase applies a reasonable XOR operation in a particular pattern for each component of the message. The proximity matrix in this place case is known to everyone, and the systems use a linear response shit register (LFSR) to found new matrices for encrypting each block. The diffusion tier in this case is the LFSR. The LFSR polynomial is a secret key that admits the entities to communicate with one another or with a trustworthy third party.

Author(s) Details:

Ch Suneetha,
Department of Mathematics, GITAM University, Visakhapatnam, India.

Please see the link here: https://stm.bookpi.org/RHMCS-V2/article/view/8570

New Approach in Cryptography Using RC4 Protocol | Chapter 12 | New Approaches in Engineering Research Vol. 13

 In cryptography, the RC4 protocol is the most widely used. The goal of this project is to investigate the efficient design of the RC4 stream cypher and to propose an efficient cypher architecture. The loop unrolling and pipeline concepts were used to generate two RC4 key stream bytes every clock cycle. The design is compared to prior weeks' designs to see how many cycles are needed to finish the individual KSA and PRGA modules, as well as the RC4 Stream Cipher as a whole. The XILINX 13.2 on Vertex ML605 Evaluation FPGA Board was used to create the design.

Author (S) Details

G. V. R. Sagar
G. Pulla Reddy Engineering College (Autonomous), Kurnool, Andhra Pradesh, India.

View Book :- https://stm.bookpi.org/NAER-V13/article/view/3497

End-to-end Secured Fiber Optic Communication Using a Novel Encryption Algorithm | Chapter 18 | Current Topics on Mathematics and Computer Science Vol. 7

 Fiber optic communication has become increasingly popular in recent decades due to its several advantages over traditional cable connection. Fiber optic connectivity enables for a download speed of 100 Mb/s and a fast upload speed with little latency. Despite the fact that fibre optics can send large volumes of data across long distances quickly, it is vulnerable to a range of security concerns. It's easy to connect to the fibre optic line. A fibre optic cable is a thin strand of glass or plastic used to send data from one location to another. To offer end-to-end secure fibre optic communication, a unique encryption technology based on the Advanced Encryption Standard (AES) is used. It uses a variable key cypher, in which the original key is utilised to construct a series of AES sub keys, using feedback from previous cypher blocks, and each sub block is encrypted with multiple sub keys. The proposed encryption algorithm's performance is simulated and evaluated. According to the simulation results, the suggested fibre optic communication technology provides strong end-to-end security.

Author (S) Details

Dr. Bosco Paul Alapatt
Department of Computer Science, CHRIST (Deemed to be University), Delhi NCR Campus, India.

View Book :- https://stm.bookpi.org/CTMCS-V7/article/view/3286

Study on Codon Modulo Cryptosystem for Privacy Preservation of Vertically Partitioned Outsourced Data | Chapter 12 | Current Approaches in Science and Technology Research Vol. 12

 Data is transferred across the cloud in a variety of ways. It is critical to protect data from unapproved users gaining access to it in any organisation. The information refuge is ensured by encoding plain text into an incomprehensible configuration using cryptographic computations, and these techniques are advocated for scrambling the text to ensure data security from aggressors. Deoxyribo Nucleic Acid (DNA) is a type of encryption used to protect data in distributed computing systems. To ensure security for transactional data, a Codon Modulo Cryptography-based Algorithm for vertically partitioned cloud data is used in this research. To aggregate the Association Rules among the Frequent Items in a scrambled exchange of vertically partitioned information base, Affiliation Rule Mining and Frequent Itemset techniques are used. The suggested Codon Modulo technique is compared to the traditional Homomorphic Encryption in the demonstration of Rule Mining computations such as Apriori, FP-Growth, and Eclat. The results show that the suggested algorithm outperforms Homomorphic Encryption in terms of performance while maintaining a good level of security.

Author (S) Details

M. Yogasini
Department of Computer Science and Engineering, Manonmaniam Sundaranar University, Tirunelveli-6270122, India.

Dr. B. N. Prathibha
Department of Computer Science, G. Venkataswamy Naidu College, Kovilpatti, Thoothukudi-628502, India.

View Book :- https://stm.bookpi.org/CASTR-V12/article/view/2620