Journal articles: 'Data encryption (Computer science) Image compression'

1

Ahmed, Mahmood Ali, and Khamees Khalaf Hasan. "Data Compression and Encryption for Remote Sensor Networks Using Different Techniques Methods." Journal of Cases on Information Technology 23, no. 2 (April 2021): 39–49. http://dx.doi.org/10.4018/jcit.20210401.oa4.

Full text

Abstract:

Wireless sensor networks (WSNs) are widely used for the different multimedia applications in which the data in multimedia form (e.g., images and videos) are captured by visual sensors and transmitted to base stations or destination nodes, and such networks, commonly called wireless multimedia sensor networks (WMSN), transmit high-quality images over sensor nodes with image quality improvement and CS technique while the security of CS data is achieved. The one-way DF-based cooperative digital image transmission model over WSNs using advanced terminologies for image compression called advanced JPEG2000 compression and modified elliptical curve cryptography (ECC) encryption is proposed. Image quality improvement efficiency is essential in multimedia applications and wireless communications. The authors proposed a novel technique based on adaptive and dynamic noise removal and quality improvement for both before compression and after compression. The compression method designed is based on CS technique.

APA, Harvard, Vancouver, ISO, and other styles

2

Huang, Bin, Chun Wan, and Kaimeng Chen. "High-Capacity Reversible Data Hiding in Encrypted Images Based on Adaptive Predictor and Compression of Prediction Errors." Mathematics 9, no. 17 (September 5, 2021): 2166. http://dx.doi.org/10.3390/math9172166.

Full text

Abstract:

Reversible data hiding in encrypted images (RDHEI) is a technology which embeds secret data into encrypted images in a reversible way. In this paper, we proposed a novel high-capacity RDHEI method which is based on the compression of prediction errors. Before image encryption, an adaptive linear regression predictor is trained from the original image. Then, the predictor is used to obtain the prediction errors of the pixels in the original image, and the prediction errors are compressed by Huffman coding. The compressed prediction errors are used to vacate additional room with no loss. After image encryption, the vacated room is reserved for data embedding. The receiver can extract the secret data and recover the image with no errors. Compared with existing approaches, the proposed method efficiently improves the embedding capacity.

APA, Harvard, Vancouver, ISO, and other styles

3

Ga, H., and W. Zeng. "Image compression and encryption based on wavelet transform and chaos." Computer Optics 43, no. 2 (April 2019): 258–63. http://dx.doi.org/10.18287/2412-6179-2019-43-2-258-263.

Full text

Abstract:

With the rapid development of network technology, more and more digital images are transmitted on the network, and gradually become one important means for people to access the information. The security problem of the image information data increasingly highlights and has become one problem to be attended. The current image encryption algorithm basically focuses on the simple encryption in the frequency domain or airspace domain, and related methods also have some shortcomings. Based on the characteristics of wavelet transform, this paper puts forward the image compression and encryption based on the wavelet transform and chaos by combining the advantages of chaotic mapping. This method introduces the chaos and wavelet transform into the digital image encryption algorithm, and transforms the image from the spatial domain to the frequency domain of wavelet transform, and adds the hybrid noise to the high frequency part of the wavelet transform, thus achieving the purpose of the image degradation and improving the encryption security by combining the encryption approaches in the spatial domain and frequency domain based on the chaotic sequence and the excellent characteristics of wavelet transform. Testing experiments show that such algorithm reduces the memory consumption and implements the complexity, not only can decrease the key spending and compress the time spending, but also can improve the quality of decoded and reconstructed image, thus showing good encryption features with better encryption effect.

APA, Harvard, Vancouver, ISO, and other styles

4

Mehta, Garima, Malay Kishore Dutta, and Pyung Soo Kim. "An Efficient and Lossless Cryptosystem for Security in Tele-Ophthalmology Applications Using Chaotic Theory." International Journal of E-Health and Medical Communications 7, no. 4 (October 2016): 28–47. http://dx.doi.org/10.4018/ijehmc.2016100102.

Full text

Abstract:

Tele-ophthalmology has gained a lot of popularity as it involves retinal fundus images which can be analyzed for identification of severe diseases like diabetic retinopathy and glaucoma. With this increasing popularity, requirement for medical data confidentiality and privacy has also increased during transmission or storage. To meet this challenge, this paper propose an efficient and lossless cryptosystem based upon chaotic theory for encryption of medical fundus images. In the proposed encryption scheme a strategic combination of scrambling and substitution architecture is proposed which complements each other. The proposed scheme of encryption for fundus images is challenging as these images are 3-D color image and cannot be compressed as compression may not be able to retain all relevant medical information. For performance analysis, the proposed algorithm has been evaluated for perceptual and cryptographic security. The experimental results indicate that the proposed method is lossless and resistant against attacks making the proposed scheme suitable for real time applications.

APA, Harvard, Vancouver, ISO, and other styles

5

Prasad, Bhagwati, and Kunti Mishra. "A Combined Encryption Compression Scheme Using Chaotic Maps." Cybernetics and Information Technologies 13, no. 2 (June 1, 2013): 75–81. http://dx.doi.org/10.2478/cait-2013-0016.

Full text

Abstract:

Abstract The intent of this paper is to propose an encryption compression scheme using multiple chaotic maps along with the concept of Galois field. This method improves the security of the encrypted data and a significant compression is also achieved. The obtained high security architectures are ideal for many real life applications such as medical images, legal documents and military and other operation

APA, Harvard, Vancouver, ISO, and other styles

6

Dengre, Amit, and A. D. Gawande. "Audio Encryption and Digital Image Watermarking in an Uncompress Video." International Journal of Advances in Applied Sciences 4, no. 2 (June 1, 2015): 66. http://dx.doi.org/10.11591/ijaas.v4.i2.pp66-72.

Full text

Abstract:

The growth of high speed computer networks and that of the Internet, in particular, has increased the ease of Information Communication. Ironically, the cause for the development is also of the apprehension - use of digital formatted data. In comparison with Analog media, Digital media offers several distinct advantages such as high quality, easy editing, high fidelity copying, compression etc. But this type advancement in the field of data communication in other sense has hiked the fear of getting the data snooped at the time of sending it from the sender to the receiver. So, Information Security is becoming an inseparable part of Data Communication. In order to address this Information Security, Steganography plays an important role. Steganography is the art and science of writing hidden messages in such a way that no one apart from the sender and intended recipient even realizes there is a hidden message. In the current internet community, secure data transfer is limited due to its attack made on data communication. So more robust methods are chosen so that they ensure secured data transfer. One of the solutions which came to the rescue is the audio Steganography. But existing audio steganographic systems have poor interface, very low level implementation, difficult to understand and valid only for certain audio formats with restricted message size. Enhanced Audio Steganography (EAS) is one proposed system which is based on audio Steganography and cryptography & watermarking, ensures secure data transfer between the source and destination.

APA, Harvard, Vancouver, ISO, and other styles

7

Tütüncü, Kemal, and Özcan Çataltaş. "Compensation of degradation, security, and capacity of LSB substitution methods by a new proposed hybrid n-LSB approach." Computer Science and Information Systems, no. 00 (2021): 48. http://dx.doi.org/10.2298/csis210227048t.

Full text

Abstract:

This study proposes a new hybrid n-LSB (Least Significant Bit) substitution-based image steganography method in the spatial plane. The previously proposed n-LSB substitution method by authors of this paper is combined with the Rivest-Shamir-Adleman (RSA), RC5, and Data Encryption Standard (DES) encryption algorithms to improve the security of the steganography, which is one of the requirements of steganography, and the Lempel-Ziv-Welch (LZW), Arithmetic and Deflate lossless compression algorithms to increase the secret message capacity. Also, embedding was done randomly using a logistic map-based chaos generator to increase the security more. The classical n-LSB substitution method and the proposed hybrid approaches based on the previously proposed n-LSB were implemented using different secret messages and cover images. When the results were examined, it has been seen that the proposed hybrid n-LSB approach showed improvement in all three criteria of steganography. The proposed hybrid approach that consists of previously proposed n-LSB, RSA, Deflate, and the logistic map had the best results regarding capacity, security, and imperceptibility.

APA, Harvard, Vancouver, ISO, and other styles

8

Tu, Rongxin, Wenying Wen, and Changsheng Hua. "An Unequal Image Privacy Protection Method Based on Saliency Detection." Security and Communication Networks 2020 (December 3, 2020): 1–13. http://dx.doi.org/10.1155/2020/8842376.

Full text

Abstract:

Cloud platforms provide a good stage for storing and sharing big image data for users, although some privacy issues arise. Image encryption technology can prevent privacy leakage and can ensure secure image data sharing on cloud platforms. Hence, in this paper, an unequal encryption scheme based on saliency detection is proposed. First, based on the mechanism of visual perception and the theory of feature integration, the visual attention model is employed to realize the recognition of significant regions and insignificant regions. Then, a dynamic DNA encryption algorithm is proposed to exploit heavyweight encryption for significant regions, while semi-tensor product compressed sensing is introduced to exploit lightweight encryption and compression for insignificant regions. Experimental results demonstrate that the proposed framework can serve to secure big image data services.

APA, Harvard, Vancouver, ISO, and other styles

9

Wang, Jijun, and Soo Fun Tan. "Separable Reversible Data Hiding in Encryption Image with Two-Tuples Coding." Computers 10, no. 7 (July 7, 2021): 86. http://dx.doi.org/10.3390/computers10070086.

Full text

Abstract:

Separable Reversible Data Hiding in Encryption Image (RDH-EI) has become widely used in clinical and military applications, social cloud and security surveillance in recent years, contributing significantly to preserving the privacy of digital images. Aiming to address the shortcomings of recent works that directed to achieve high embedding rate by compensating image quality, security, reversible and separable properties, we propose a two-tuples coding method by considering the intrinsic adjacent pixels characteristics of the carrier image, which have a high redundancy between high-order bits. Subsequently, we construct RDH-EI scheme by using high-order bits compression, low-order bits combination, vacancy filling, data embedding and pixel diffusion. Unlike the conventional RDH-EI practices, which have suffered from the deterioration of the original image while embedding additional data, the content owner in our scheme generates the embeddable space in advance, thus lessening the risk of image destruction on the data hider side. The experimental results indicate the effectiveness of our scheme. A ratio of 28.91% effectively compressed the carrier images, and the embedding rate increased to 1.753 bpp with a higher image quality, measured in the PSNR of 45.76 dB.

APA, Harvard, Vancouver, ISO, and other styles

10

Goldberg, Mark A. "Image data compression." Journal of Digital Imaging 11, S1 (August 1998): 230–32. http://dx.doi.org/10.1007/bf03168323.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Goldberg, Mark A. "Image data compression." Journal of Digital Imaging 10, S1 (August 1997): 9–11. http://dx.doi.org/10.1007/bf03168640.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Li, Peiya, and Kwok-Tung Lo. "A Content-Adaptive Joint Image Compression and Encryption Scheme." IEEE Transactions on Multimedia 20, no. 8 (August 2018): 1960–72. http://dx.doi.org/10.1109/tmm.2017.2786860.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Tan, Yanli, and Yongqiang Zhao. "Digital Watermarking Image Compression Method Based on Symmetric Encryption Algorithms." Symmetry 11, no. 12 (December 11, 2019): 1505. http://dx.doi.org/10.3390/sym11121505.

Full text

Abstract:

A digital watermarking image compression method based on symmetrical encryption algorithm is proposed in this study. First, the original image and scrambled watermarking image are processed by wavelet transform, and then the watermarking image processed by the Arnold replacement method is transformed into a meaningless image in the time domain to achieve the effect of encryption. Watermarking is generated by embedding the watermarking image into the important coefficients of the wavelet transform. As an inverse process of watermarking embedding, watermarking extraction needs to be reconstructed by the wavelet transform. Finally, the watermarking is extracted from the inverse scrambled watermarking image, and a new symmetrically encrypted digital watermarking image is obtained. The compression method compresses the embedded digital watermarking image, so that the volume of the compressed watermarking image is greatly reduced when the visual difference is very small. The experimental results show that the watermarking image encrypted by this method not only has good transparency, but also has strong anti-brightness/contrast attack, anti-shearing, and anti-noise performance. When the volume of the compressed image is greatly reduced, the root mean square error and visual difference measurement of the watermarking image are very small.

APA, Harvard, Vancouver, ISO, and other styles

14

Saidhbi, Sheik. "An Intelligent Multimedia Data Encryption and Compression and Secure Data Transmission of Public Cloud." Asian Journal of Engineering and Applied Technology 8, no. 2 (May 5, 2019): 37–40. http://dx.doi.org/10.51983/ajeat-2019.8.2.1141.

Full text

Abstract:

Data compression is a method of reducing the size of the data file so that the file should take less disk space for storage. Compression of a file depends upon encoding of file. In lossless data compression algorithm there is no data loss while compressing a file, therefore confidential data can be reproduce if it is compressed using lossless data compression. Compression reduces the redundancy and if a compressed file is encrypted it is having a better security and faster transfer rate across the network than encrypting and transferring uncompressed file. Most of the computer applications related to health are not secure and these applications exchange lot of confidential health data having different file formats like HL7, DICOM images and other audio, image, textual and video data formats etc. These types of confidential data need to be transmitted securely and stored efficiently. Therefore this paper proposes a learning compression- encryption model for identifying the files that should be compressed before encrypting and the files that should be encrypted without compressing them.

APA, Harvard, Vancouver, ISO, and other styles

15

Naseer, Yasir, Tariq Shah, Attaullah, and Adnan Javeed. "Advance image encryption technique utilizing compression, dynamical system and S-boxes." Mathematics and Computers in Simulation 178 (December 2020): 207–17. http://dx.doi.org/10.1016/j.matcom.2020.06.007.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Siddeq, Mohammed M., and Marcos A. Rodrigues. "A novel Hexa data encoding method for 2D image crypto-compression." Multimedia Tools and Applications 79, no. 9-10 (December 12, 2019): 6045–59. http://dx.doi.org/10.1007/s11042-019-08405-3.

Full text

Abstract:

AbstractWe proposed a novel method for 2D image compression-encryption whose quality is demonstrated through accurate 2D image reconstruction at higher compression ratios. The method is based on the DWT-Discrete Wavelet Transform where high frequency sub-bands are connected with a novel Hexadata crypto-compression algorithm at compression stage and a new fast matching search algorithm at decoding stage. The novel crypto-compression method consists of four main steps: 1) A five-level DWT is applied to an image to zoom out the low frequency sub-band and increase the number of high frequency sub-bands to facilitate the compression process; 2) The Hexa data compression algorithm is applied to each high frequency sub-band independently by using five different keys to reduce each sub-band to1/6of its original size; 3) Build a look up table of probability data to enable decoding of the original high frequency sub-bands, and 4) Apply arithmetic coding to the outputs of steps (2) and (3). At decompression stage a fast matching search algorithm is used to reconstruct all high frequency sub-bands. We have tested the technique on 2D images including streaming from videos (YouTube). Results show that the proposed crypto-compression method yields high compression ratios up to 99% with high perceptual quality images.

APA, Harvard, Vancouver, ISO, and other styles

17

Ferdush, Jannatul, Mahbuba Begum, and Mohammad Shorif Uddin. "Chaotic Lightweight Cryptosystem for Image Encryption." Advances in Multimedia 2021 (May 22, 2021): 1–16. http://dx.doi.org/10.1155/2021/5527295.

Full text

Abstract:

Data transmission over the Internet and the personal network has been risen day by day due to the advancement of multimedia technology. Hence, it is today’s prime concern to protect the data from unauthorized access and encrypt the multimedia element as they are stored on the web servers and transmitted over the networks. Therefore, multimedia data encryption is essential. But, the multimedia encryption algorithm is complex to implement as it requires more time and memory space. For this reason, the lightweight image encryption algorithm gains popularity that requires less memory and less time along with low power or energy and provides supreme security for limited devices. In this study, we have studied the chaotic-based lightweight image encryption method. At first, we have presented a standard framework and algorithm based on two chaotic maps such as Arnold and logistic for lightweight image encryption and performed some experiments. We have analyzed different groups of images such as miscellaneous, medical, underwater, and texture. Experimentations have provided the largest entropy 7.9920 for medical image (chest X-ray), large key space 2m×m×8, and average encryption and decryption times are 3.9771 s and 3.1447 s, respectively. Besides, we have found an equal distribution of pixels and less correlation coefficients among adjacent pixels of the encrypted image. These criteria indicate an efficient image encryption method. Also, our method is efficient and less complex than the existing state-of-the-art methods.

APA, Harvard, Vancouver, ISO, and other styles

18

Xu, Dawen. "Commutative Encryption and Data Hiding in HEVC Video Compression." IEEE Access 7 (2019): 66028–41. http://dx.doi.org/10.1109/access.2019.2916484.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Gschwandtner, Michael, Andreas Uhl, and Peter Wild. "Transmission Error and Compression Robustness of 2D Chaotic Map Image Encryption Schemes." EURASIP Journal on Information Security 2007 (2007): 1–16. http://dx.doi.org/10.1155/2007/48179.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Qiu, Shi, Ying Cui, and XianJia Meng. "A Data Encryption and Fast Transmission Algorithm Based on Surveillance Video." Wireless Communications and Mobile Computing 2020 (August 5, 2020): 1–12. http://dx.doi.org/10.1155/2020/8842412.

Full text

Abstract:

Video surveillance is an effective way to record current events. In view of the difficulty of efficient transmission of massive surveillance video and the risk of leakage in the transmission process, a new data encryption and fast transmission algorithm is proposed in this paper. From the perspective of events, the constraints of time and space dimension is broken. First, a background and moving object extraction model is built based on video composition. Then, a strong correlation data encryption and fast transmission model is constructed to achieve efficient data compression. Finally, a data mapping mechanism is established to realize the decoding of surveillance video. Our experimental results show that the compression ratio of the proposed algorithm is more than 60% under the premise of image confidentiality.

APA, Harvard, Vancouver, ISO, and other styles

21

Zhang, Miao, Xiao-Jun Tong, Jie Liu, Zhu Wang, Jinlong Liu, Baolong Liu, and Jing Ma. "Image Compression and Encryption Scheme Based on Compressive Sensing and Fourier Transform." IEEE Access 8 (2020): 40838–49. http://dx.doi.org/10.1109/access.2020.2976798.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Dong, Hao, Enjian Bai, Xue-Qin Jiang, and Yun Wu. "Color Image Compression-Encryption Using Fractional-Order Hyperchaotic System and DNA Coding." IEEE Access 8 (2020): 163524–40. http://dx.doi.org/10.1109/access.2020.3022398.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Yang, Feifei, Jun Mou, Kehui Sun, Yinghong Cao, and Jiyu Jin. "Color Image Compression-Encryption Algorithm Based on Fractional-Order Memristor Chaotic Circuit." IEEE Access 7 (2019): 58751–63. http://dx.doi.org/10.1109/access.2019.2914722.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Murtagh, F., M. Louys, J. L. Starck, and F. Bonnarel. "Compression of grayscale scientific and medical image data." Data Science Journal 1 (2002): 111–27. http://dx.doi.org/10.2481/dsj.1.111.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Singh, A. K., S. Thakur, Alireza Jolfaei, Gautam Srivastava, MD Elhoseny, and A. Mohan. "Joint Encryption and Compression-Based Watermarking Technique for Security of Digital Documents." ACM Transactions on Internet Technology 21, no. 1 (February 2021): 1–20. http://dx.doi.org/10.1145/3414474.

Full text

Abstract:

Recently, due to the increase in popularity of the Internet, the problem of digital data security over the Internet is increasing at a phenomenal rate. Watermarking is used for various notable applications to secure digital data from unauthorized individuals. To achieve this, in this article, we propose a joint encryption then-compression based watermarking technique for digital document security. This technique offers a tool for confidentiality, copyright protection, and strong compression performance of the system. The proposed method involves three major steps as follows: (1) embedding of multiple watermarks through non-sub-sampled contourlet transform, redundant discrete wavelet transform, and singular value decomposition; (2) encryption and compression via SHA-256 and Lempel Ziv Welch (LZW), respectively; and (3) extraction/recovery of multiple watermarks from the possibly distorted cover image. The performance estimations are carried out on various images at different attacks, and the efficiency of the system is determined in terms of peak signal-to-noise ratio (PSNR) and normalized correlation (NC), structural similarity index measure (SSIM), number of changing pixel rate (NPCR), unified averaged changed intensity (UACI), and compression ratio (CR). Furthermore, the comparative analysis of the proposed system with similar schemes indicates its superiority to them.

APA, Harvard, Vancouver, ISO, and other styles

26

Yang, Tingting, Yangyang Li, Chengzhe Lai, Jie Dong, and Minghua Xia. "The Improved Hill Encryption Algorithm towards the Unmanned Surface Vessel Video Monitoring System Based on Internet of Things Technology." Wireless Communications and Mobile Computing 2018 (October 3, 2018): 1–11. http://dx.doi.org/10.1155/2018/5183451.

Full text

Abstract:

Depending on the actual demand of maritime security, this paper analyzes the specific requirements of video encryption algorithm for maritime monitoring system. Based on the technology of Internet of things, the intelligent monitoring system of unmanned surface vessels (USV) is designed and realized, and the security technology and network technology of the Internet of things are adopted. The USV are utilized to monitor and collect information on the sea, which is critical to maritime security. Once the video data were captured by pirates and criminals during the transmission, the security of the sea will be affected awfully. The shortcomings of traditional algorithms are as follows: the encryption degree is not high, computing cost is expensive, and video data is intercepted and captured easily during the transmission process. In order to overcome the disadvantages, a novel encryption algorithm, i.e., the improved Hill encryption algorithm, is proposed to deal with the security problems of the unmanned video monitoring system in this paper. Specifically, the Hill algorithm of classical cryptography is transplanted into image encryption, using an invertible matrix as the key to realize the encryption of image matrix. The improved Hill encryption algorithm combines with the process of video compression and regulates the parameters of the encryption process according to the content of the video image and overcomes the disadvantages that exist in the traditional encryption algorithm and decreases the computation time of the inverse matrix so that the comprehensive performance of the algorithm is optimal with different image information. Experiments results validate the favorable performance of the proposed improved encryption algorithm.

APA, Harvard, Vancouver, ISO, and other styles

27

Alrikabi, Haider Th Salim, and Hussein Tuama Hazim. "Enhanced Data Security of Communication System Using Combined Encryption and Steganography." International Journal of Interactive Mobile Technologies (iJIM) 15, no. 16 (August 23, 2021): 144. http://dx.doi.org/10.3991/ijim.v15i16.24557.

Full text

Abstract:

<h2>Data security has become a paramount necessity and more obligation in daily life. Most of our systems can be hacked, and it causes very high risks to our confidential files inside the systems. Therefore, for various security reasons, we use various methods to save as much as possible on this data, regardless of its different forms, texts, pictures, videos, etc. In this paper, we mainly rely on storing the basic image which should be protected in another image after changing its formal to composites using the DWT wavelet transform. The process of zeroing sites and storing their contents technique is used to carry the components of the main image. Then process them mathematically by using the exponential function. The result of this process is to obtain a fully encrypted image. The image required to be protected from detection and discrimination is hidden behind the encrypted image. The proposed system contains two algorithms. the first algorithm is used for encryption and hiding, but the second algorithm is designed for returning and decoding the main image to its original state with very efficiently.</h2>

APA, Harvard, Vancouver, ISO, and other styles

28

Hu, Haiying, Yinghong Cao, Ji Xu, Chenguang Ma, and Huizhen Yan. "An Image Compression and Encryption Algorithm Based on the Fractional-Order Simplest Chaotic Circuit." IEEE Access 9 (2021): 22141–55. http://dx.doi.org/10.1109/access.2021.3054842.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Khaleel, Shahbaa. "Image Compression Using Swarm Intelligence." International Journal of Intelligent Engineering and Systems 14, no. 1 (February 28, 2021): 257–69. http://dx.doi.org/10.22266/ijies2021.0228.25.

Full text

Abstract:

As a result of the development in multimedia technology and direct dealing with it in social media, it has led to interest in the techniques of compacting color images because of their importance at present. Since image compression enables the representation of color image data with the fewest number of bits, which reduces transmission time in the network and increases transmission speed. To ensure the compression process is performed without loss of data, the lossless compression methods are used because no data is lost during the compression process. In this research, a new system was presented to compress the color images with efficiency and high quality. Where the swarm intelligent methods were used, as well as hybridizing it with fuzzy using the Gustafson kessel fuzzy method to improve the clustering process and create new clustering methods with fuzzy swarm intelligence to obtain the best results. Swarm algorithms were used to perform the process of clustering the image data to be compressed and then obtaining a clustered data for this image data. In contrast, a lossless compression method was used to perform the encoding of this clustered data where the huffman method was used for encoding. Four methods were applied in this research to different color and lighting images. The PSO swarm intelligent was used, which in turn was hybridized with the Gustafson kessel fuzzy method to produce a new method for fuzzy particle swarm (FPSO), as well as the grey wolf optimization method GWO, which was hybridized with Gustafson kessel and obtained a new method, which is the fuzzy grey wolf optimizer FGWO, and the results were graded efficiently from the first to the fourth method, where the FGWO method with the huffman was the most efficient depending on the standards measurement that were calculated for all methods, the compression ratio was high in this new method, in addition to the standards of MSE, RMSE, PSNR, etc. among the important measurements of the compressing process.

APA, Harvard, Vancouver, ISO, and other styles

30

Wang, Xu, Li-Yao Li, Ching-Chun Chang, and Chih-Cheng Chen. "High-Capacity Reversible Data Hiding in Encrypted Images Based on Prediction Error Compression and Block Selection." Security and Communication Networks 2021 (June 30, 2021): 1–12. http://dx.doi.org/10.1155/2021/9606116.

Full text

Abstract:

The popularity of cloud computing has impelled more users to upload personal data into the cloud server. The need for secure transmission and privacy protection has become a new challenge and has attracted considerable attention. In this paper, we propose a high-capacity reversible data hiding scheme in encrypted images (RDHEI) that compresses prediction errors in usable blocks of block-based encrypted images. On the content owner side, the original image is divided into 2 × 2 sized blocks, and each block is encrypted by block-based modulation. On the data hider side, an efficient block-based predictor is utilized to generate prediction errors. The Huffman coding technique is introduced to compress prediction errors in the usable blocks to embed abundant additional data. On the receiver side, the additional data can be totally extracted with a data hiding key and the original image can be losslessly recovered with an image encryption key. Experimental results demonstrate that the embedding rate of our proposed scheme is significantly improved compared to those of state-of-the-art schemes.

APA, Harvard, Vancouver, ISO, and other styles

31

Kim, Jungwon, and Jeffrey S. Vetter. "Implementing efficient data compression and encryption in a persistent key-value store for HPC." International Journal of High Performance Computing Applications 33, no. 6 (May 23, 2019): 1098–112. http://dx.doi.org/10.1177/1094342019847264.

Full text

Abstract:

Recently, persistent data structures, like key-value stores (KVSs), which are stored in a high-performance computing (HPC) system’s nonvolatile memory, provide an attractive solution for a number of emerging challenges like limited I/O performance. Data compression and encryption are two well-known techniques for improving several properties of such data-oriented systems. This article investigates how to efficiently integrate data compression and encryption into persistent KVSs for HPC with the ultimate goal of hiding their costs and complexity in terms of performance and ease of use. Our compression technique exploits deep memory hierarchy in an HPC system to achieve both storage reduction and performance improvement. Our encryption technique provides a practical level of security and enables sharing of sensitive data securely in complex scientific workflows with nearly imperceptible cost. We implement the proposed techniques on top of a distributed embedded KVS to evaluate the benefits and costs of incorporating these capabilities along different points in the dataflow path, illustrating differences in effective bandwidth, latency, and additional computational expense on Swiss National Supercomputing Centre’s Grand Tavé and National Energy Research Scientific Computing Center’s Cori.

APA, Harvard, Vancouver, ISO, and other styles

32

Singh, K. John, and R. Jayanthi. "Image encryption techniques for data transmission in networks: a survey." International Journal of Advanced Intelligence Paradigms 12, no. 1/2 (2019): 178. http://dx.doi.org/10.1504/ijaip.2019.10017748.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Li, Xinyan, Di Xiao, Huajian Mou, Dianjun Lu, and Mei Peng. "A Compressive Sensing Based Image Encryption and Compression Algorithm With Identity Authentication and Blind Signcryption." IEEE Access 8 (2020): 211676–90. http://dx.doi.org/10.1109/access.2020.3039643.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Wang, Zhongpeng. "Secure Image Transmission in Wireless OFDM Systems Using Secure Block Compression-Encryption and Symbol Scrambling." IEEE Access 7 (2019): 126985–97. http://dx.doi.org/10.1109/access.2019.2939266.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Wang, Wei, Dongming Peng, Honggang Wang, Hamid Sharif, and Hsiao-Hwa Chen. "Energy-Constrained Quality Optimization for Secure Image Transmission in Wireless Sensor Networks." Advances in Multimedia 2007 (2007): 1–9. http://dx.doi.org/10.1155/2007/25187.

Full text

Abstract:

Resource allocation for multimedia selective encryption and energy efficient transmission has not been fully investigated in literature for wireless sensor networks (WSNs). In this article, we propose a new cross-layer approach to optimize selectively encrypted image transmission quality in WSNs with strict energy constraint. A new selective image encryption approach favorable for unequal error protection (UEP) is proposed, which reduces encryption overhead considerably by controlling the structure of image bitstreams. Also, a novel cross-layer UEP scheme based on cipher-plain-text diversity is studied. In this UEP scheme, resources are unequally and optimally allocated in the encrypted bitstream structure, including data position information and magnitude value information. Simulation studies demonstrate that the proposed approach can simultaneously achieve improved image quality and assured energy efficiency with secure transmissions over WSNs.

APA, Harvard, Vancouver, ISO, and other styles

36

Khlif, Naziha, Ahmed Ghorbel, Walid Aydi, and Nouri Masmoudi. "Generation of Chaotic Signal for Scrambling Matrix Content." International Arab Journal of Information Technology 17, no. 4 (July 1, 2020): 548–53. http://dx.doi.org/10.34028/iajit/17/4/13.

Full text

Abstract:

Very well evolved, information technology made so easy the transfer of all types of data over public channels. For this reason, ensuring data security is certainly a necessary requirement. Scrambling data is one solution to hide information from non authorized users. Presenting matrix content, image scrambling can be made by only adding a mask to the real content. A user, having the appropriate mask, can recognize the image content by only subtracting it. Chaotic function is recently used for image encryption. In this paper, an algorithm of image scrambling based on three logistic chaotic functions is proposed. Defined by its initial condition and parameter, each chaotic function will generate a random signal. The set of initial conditions and parameters is the encryption key. The performance of this technique is ensured for two great reasons. First, using masks on the image makes unintelligible its content. Second, using three successive encryption processes makes so difficult attacks. This point reflects, in one hand, a sufficient key length to resist to brute force attack. In the other hand, it reflects the random aspect of the pixel distribution in the scrambled image. That means, the randomness in one mask minimizes the correlations really existent between neighboring pixels. That makes our proposed approach resistant to known attacks and suitable for applications requiring secure data transfer such as medical image exchanged between doctors

APA, Harvard, Vancouver, ISO, and other styles

37

Nagm, Ahmad, and Mohammed Safy Elwan. "Protection of the patient data against intentional attacks using a hybrid robust watermarking code." PeerJ Computer Science 7 (March 22, 2021): e400. http://dx.doi.org/10.7717/peerj-cs.400.

Full text

Abstract:

The security of patient information is important during the transfer of medical data. A hybrid spatial domain watermarking algorithm that includes encryption, integrity protection, and steganography is proposed to strengthen the information originality based on the authentication. The proposed algorithm checks whether the patient’s information has been deliberately changed or not. The created code is distributed at every pixel of the medical image and not only in the regions of non-interest pixels, while the image details are still preserved. To enhance the security of the watermarking code, SHA-1 is used to get the initial key for the Symmetric Encryption Algorithm. The target of this approach is to preserve the content of the image and the watermark simultaneously, this is achieved by synthesizing an encrypted watermark from one of the components of the original image and not by embedding a watermark in the image. To evaluate the proposed code the Least Significant Bit (LSB), Bit2SB, and Bit3SB were used. The evaluation of the proposed code showed that the LSB is of better quality but overall the Bit2SB is better in its ability against the active attacks up to a size of 2*2 pixels, and it preserves the high image quality.

APA, Harvard, Vancouver, ISO, and other styles

38

Wang, Zhou, and Yinglin Yu. "Dynamic fractal transform with applications to image data compression." Journal of Computer Science and Technology 12, no. 3 (May 1997): 202–9. http://dx.doi.org/10.1007/bf02948970.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Ratan, Ram, and Arvind Yadav. "Security Analysis of Bit plane Level Image Encryption Schemes." Defence Science Journal 71, no. 2 (March 10, 2021): 209–21. http://dx.doi.org/10.14429/dsj.71.15643.

Full text

Abstract:

A selective bit-plane encryption scheme was proposed for securing the transmission of image data in mobile environments with a claim that it provides a high security viz. the encryption of the four most significant bit-planes is sufficient for a high image data security. This paper presents the security analysis of the said encryption scheme and reports new important results. We perform the security analysis of the bit-level encryption by considering the normal images and their histogram equalised enhanced images. We consider different bit-plane aspects to analyse the security of the image encryption, and show that the encryption of the four most significant bit-planes is not adequate. The contents of the images can be obtained even when all the bit-planes except one least significant bit-plane are encrypted in the histogram equalised images as shown in the results. The bit-plane level security analysis seems very useful for the analysis of the bit-plane level image encryption schemes.

APA, Harvard, Vancouver, ISO, and other styles

40

Kamal, Ahmed, Esam Hagras, and H. A. El-Kamchochi. "Dynamic fractional chaotic biometric isomorphic elliptic curve for partial image encryption." Computer Science and Information Systems 18, no. 3 (2021): 1057–76. http://dx.doi.org/10.2298/csis200502018k.

Full text

Abstract:

In this paper, a Modular Fractional Chaotic Sine Map (MFC-SM) has been introduced to achieve high Lyapunov exponent values and completely chaotic behavior of the bifurcation diagram for high level security. The proposed MFC-SM is compared with the conventional non MFC-SM and it has an excellent chaotic analysis. In addition, the randomness test results indicate that the proposed MFC-SM shows better performance and satisfy all randomness tests. Due to the excellent chaotic properties and good randomization results for the proposed MFC-SM, it is used to be cooperated with the biometric digital identity to achieve dynamic chaotic biometric digital identity. Also, for real time image encryption, both Discrete Wavelet Transform (DWT)partial image encryption and Isomorphic Elliptic Curve (IEC)key exchange are used. In addition, the biometric digital identity is extracted from the user fingerprint image as fingerprint minutia data incorporated with the proposed MFC-SM and hence, a new Dynamic Fractional Chaotic Biometric Digital IdentityIEC (DFC-BID-IEC) has been introduced. Dynamic Fractional Chaotic Key Generator (DFC-KG) is used to control the key schedule for all encryption and decryption processing. The encryption process consists of the confusion and diffusion steps. In the confusion step, the 2D Arnold Cat Map (ACM) is used with secret parameters taken from DFC-KG. Also, the diffusion step is based on the dynamic chaotic self-invertible secret key matrix which can be generated from the proposed MFC-SM. The IEC key exchange secret parameters are generated based on Elliptic Curve Diffie?Hellman(ECDH) key exchange and the isomorphism parametre. Statistical analysis, differential analysis and key sensitivity tests are performed to estimate the security strengths of the proposed DFC-BID-IEC system. The experimental results show that the proposed algorithm is robust against common signal processing attacks and provides a high security level and high speed for image encryption application.

APA, Harvard, Vancouver, ISO, and other styles

41

Si, Zhuang-hao, Wei Wei, Bi-song Li, and Wei-jie Feng. "Analysis of DNA Image Encryption Effect by Logistic‐Sine System Combined with Fractional Chaos Stability Theory." Journal of Imaging Science and Technology 64, no. 4 (July 1, 2020): 40413–1. http://dx.doi.org/10.2352/j.imagingsci.technol.2020.64.4.040413.

Full text

Abstract:

Abstract To explore the DNA image encryption method based on the Logistic‐sine system and the fractional-order chaos stability theory, a fractional-order fuzzy differential equation is first introduced to construct a chaotic synchronization system. Then the green, blue, and red primary color matrix is established to design new DNA image encryption, and the encryption process is explained. Next, a data encryption algorithm and an advanced encryption algorithm are introduced to perform simulation experiments on the MATLAB 2014 software platform. It is found that the images encrypted by the new algorithm all exhibit striped snowflakes, and after decryption, it is almost the same as the original image. The histogram of the image encrypted by the new algorithm is flat, which is very different from the original image histogram. The average pixel change rate of the image encrypted by the new algorithm is 99.6267%, and the average change intensity reaches 33.5183%. The average information entropy of the image encrypted by the new algorithm is 7.9624, which is close to the upper limit of 8. The calculation time and occupied space of the new algorithm are less than those of the data encryption algorithm and the advanced encryption algorithm. This result shows that the DNA image encryption algorithm based on the Logistic‐sine system and the fractional-order chaos stability theory has excellent performance and can provide a certain theoretical basis for research in the field of digital image encryption.

APA, Harvard, Vancouver, ISO, and other styles

42

Saad, Abdul-Malik H. Y., and Mohd Z. Abdullah. "High-Speed Fractal Image Compression Featuring Deep Data Pipelining Strategy." IEEE Access 6 (2018): 71389–403. http://dx.doi.org/10.1109/access.2018.2880480.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Wilkinson, M. H. F. "A simple data compression scheme for binary images of bacteria compared with commonly used image data compression schemes." Computer Methods and Programs in Biomedicine 42, no. 4 (April 1994): 255–62. http://dx.doi.org/10.1016/0169-2607(94)90097-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Cao, Xinyue, Zhangjie Fu, and Xingming Sun. "A Privacy-Preserving Outsourcing Data Storage Scheme with Fragile Digital Watermarking-Based Data Auditing." Journal of Electrical and Computer Engineering 2016 (2016): 1–7. http://dx.doi.org/10.1155/2016/3219042.

Full text

Abstract:

Cloud storage has been recognized as the popular solution to solve the problems of the rising storage costs of IT enterprises for users. However, outsourcing data to the cloud service providers (CSPs) may leak some sensitive privacy information, as the data is out of user’s control. So how to ensure the integrity and privacy of outsourced data has become a big challenge. Encryption and data auditing provide a solution toward the challenge. In this paper, we propose a privacy-preserving and auditing-supporting outsourcing data storage scheme by using encryption and digital watermarking. Logistic map-based chaotic cryptography algorithm is used to preserve the privacy of outsourcing data, which has a fast operation speed and a good effect of encryption. Local histogram shifting digital watermark algorithm is used to protect the data integrity which has high payload and makes the original image restored losslessly if the data is verified to be integrated. Experiments show that our scheme is secure and feasible.

APA, Harvard, Vancouver, ISO, and other styles

45

Rezk, Ahmed A., Ahmed H. Madian, Ahmed G. Radwan, and Ahmed M. Soliman. "On-the-Fly Parallel Processing IP-Core for Image Blur Detection, Compression, and Chaotic Encryption Based on FPGA." IEEE Access 9 (2021): 82726–46. http://dx.doi.org/10.1109/access.2021.3086044.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Shahmohammadi Beni, Mehrdad, Hiroshi Watabe, and Kwan Ngok Yu. "SecureVision: An Open-Source User-Customizable Image Encryption Program." Applied Sciences 11, no. 17 (August 27, 2021): 7915. http://dx.doi.org/10.3390/app11177915.

Full text

Abstract:

Data security has become indispensable, with a view to keep sensitive information confidential. One important method is through image encryption, upon which features in an image would no longer be visible. The original image with its features could only be restored upon decryption using a set of keys. There are prestigious works in the literature regarding image encryption. However, there is a lack of easy-to-use, GUI-based, user-customizable computer programs for image encryption. In the present work, we developed a GUI-based image encryption and decryption program with server file transfer support, namely, SecureVision. A custom-made random number generator using the equation of an ellipse was developed to randomly shuffle the pixel positions. SecureVision was found to be robust, user-friendly and fast in both encryption and decryption. The program was highly sensitive to the supplied keys, which prevented brute-force attacks. SecureVision provided full user control, where users could modify the program modules to match their desired applications, which was particularly desirable for pedagogical purposes in that interested parties had the freedom to explore the concept of image encryption and decryption. SecureVision is distributed under a GPLv3 license, which would allow everyone to use, modify and distribute the program without any restriction.

APA, Harvard, Vancouver, ISO, and other styles

47

Gafsi, Mohamed, Nessrine Abbassi, Mohamed Ali Hajjaji, Jihene Malek, and Abdellatif Mtibaa. "Improved Chaos-Based Cryptosystem for Medical Image Encryption and Decryption." Scientific Programming 2020 (December 17, 2020): 1–22. http://dx.doi.org/10.1155/2020/6612390.

Full text

Abstract:

In the medical sector, the digital image is multimedia data that contain secret information. However, designing an efficient secure cryptosystem to protect the confidential images in sharing is a challenge. In this work, we propose an improved chaos-based cryptosystem to encrypt and decrypt rapidly secret medical images. A complex chaos-based PRNG is suggested to generate a high-quality key that presents high randomness behaviour, high entropy, and high complexity. An improved architecture is proposed to encrypt the secret image that is based on permutation, substitution, and diffusion properties. In the first step, the image’s pixels are randomly permuted through a matrix generated using the PRNG. Next, pixel’s bits are permuted using an internal condition. After that, the pixels are substituted using two different S-boxes with an internal condition. In the final step, the image is diffused by XORing pixels with the key stream generated by the PRNG in order to acquire an encrypted image. R rounds of encryption can be performed in a loop to increase the complexity. The cryptosystem is evaluated in depth by his application on several medical images with different types, contents, and sizes. The obtained simulation results demonstrate that the system enables high-level security and performance. The information entropy of the encrypted image has achieved an average of 7.9998 which is the most important feature of randomness. The algorithm can take full advantage of parallelism and pipeline execution in hardware implementation to meet real-time requirements. The PRNG was tested by NIST 800-22 test suit, which indicates that it is suitable for secure image encryption. It provides a large key space of 2192 which resists the brute-force attack. However, the cryptosystem is appropriate for medical image securing.

APA, Harvard, Vancouver, ISO, and other styles

48

Kochańska, Paula Adrianna, and Michal Makowski. "Compression of computer-generated holograms in image projection." Photonics Letters of Poland 9, no. 2 (July 1, 2017): 60. http://dx.doi.org/10.4302/plp.v9i2.719.

Full text

Abstract:

Computer-generated holography is a technique of a lossless and lens-less forming of images. Methods that use local devices to compute such holograms are very power- and time-consuming. In order to make it possible to transfer the calculations to the cloud, it is necessary to elaborate efficient algorithms of a lossless compression. In this paper two methods of compression are presented and supported by both simulation and experimental results. A lossy compression method omitting certain bit-planes of the holographic data is also presented, which allows insignificant loss of information, while achieving a greater compression ratio. Full Text: PDF ReferencesM. Makowski "Simple holographic projection in color.", Opt. Express 20, 25130-25136 (2012). CrossRef M. Makowski, I. Ducin, K. Kakarenko, J. Suszek, A. Kowalczyk, "Performance of the 4k phase-only spatial light modulator in image projection by computer-generated holography, " Phot. Lett. Poland 8, 26-28 (2016). CrossRef A. Kowalczyk, M. Bieda, M. Makowski, I. Ducin, K. Kakarenko, J. Suszek, A. Sobczyk, "Analysis of computational complexity in holographic lens-less projection," Phot. Lett. Poland 6, 84-86 (2014). CrossRef M. Makowski, "Minimized speckle noise in lens-less holographic projection by pixel separation," Opt. Express 21, 29205-29216 (2013). CrossRef H. Niwase, N. Takada, H. Araki, Y. Maeda, M. Fujiwara, H. Nakayama, T. Kakue, T. Shimobaba, T. Ito "Real-time electroholography using a multiple-graphics processing unit cluster system with a single spatial light modulator and the InfiniBand network." Opt. Eng. 55, 093108-093108 (2016). CrossRef T. Shimobaba and T. Ito, "Random phase-free computer-generated hologram", Opt. Express 23(7) 9549-9554 (2015) CrossRef S.R. Kodituwakku, "Comparison of lossless data compression algorithms for text data", Indian Journal of Computer Science and Engineering Vol 1 No 4 416-426 (2010) DirectLink

APA, Harvard, Vancouver, ISO, and other styles

49

Du, Anyu, Liejun Wang, Shuli Cheng, and Naixiang Ao. "A Privacy-Protected Image Retrieval Scheme for Fast and Secure Image Search." Symmetry 12, no. 2 (February 14, 2020): 282. http://dx.doi.org/10.3390/sym12020282.

Full text

Abstract:

With the development of multimedia technology, the secure image retrieval scheme has become a hot research topic. However, how to further improve algorithm performance in the ciphertext needs to be further explored. In this paper, we propose a secure image retrieval scheme based on a deep hash algorithm for index encryption and an improved 4-Dimensional(4-D)hyperchaotic system. The main contributions of this paper are as follows: (1) A novel secure retrieval scheme is proposed to control data transmission. (2) An improved 4-D hyperchaotic system is proposed to preserve privacy. (3) We propose an improved deep pairwise-supervised hashing (DPSH) algorithm and secure kNN to perform index encryption and propose an improved loss function to train the network model. (4) A secure access control scheme is shown, which aims to achieve secure access for users. The experimental results show that the proposed scheme has better retrieval efficiency and better security.

APA, Harvard, Vancouver, ISO, and other styles

50

Shukla, Awdhesh Kumar, Awdhesh K. Shukla, Balvinder Singh, and Amod Kumar. "A Secure and High-Capacity Data-Hiding Method Using Compression, Encryption and Optimized Pixel Value Differencing." IEEE Access 6 (2018): 51130–39. http://dx.doi.org/10.1109/access.2018.2868192.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Journal articles on the topic 'Data encryption (Computer science) Image compression'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles