Secure Image processing using LWE based Homomorphic encryption

Author(s):  
RatnaKumari Challa ◽  
G. VijayaKumari ◽  
Sunny B
Author(s):  
Mohamed Elhoseny ◽  
Ahmed Farouk ◽  
Josep Batle ◽  
Abdulaziz Shehab ◽  
Aboul Ella Hassanien

WSN as a new category of computer-based computing platforms and network structures is showing new applications in different areas such as environmental monitoring, health care and military applications. Although there are a lot of secure image processing schemas designed for image transmission over a network, the limited resources and the dynamic environment make it invisible to be used with Wireless Sensor Networks (WSNs). In addition, the current secure data transmission schemas in WSN are concentrated on the text data and are not applicable for image transmission's applications. Furthermore, secure image transmission is a big challenging issue in WSNs especially for the application that uses image as its main data such as military applications. The reason why is because the limited resources of the sensor nodes which are usually deployed in unattended environments. This chapter introduces a secure image processing and transmission schema in WSN using Elliptic Curve Cryptography (ECC) and Homomorphic Encryption (HE).


2017 ◽  
Vol 2017 ◽  
pp. 1-11 ◽  
Author(s):  
Pan Yang ◽  
Xiaolin Gui ◽  
Jian An ◽  
Feng Tian

Homomorphic encryption can protect user’s privacy when operating on user’s data in cloud computing. But it is not practical for wide using as the data and services types in cloud computing are diverse. Among these data types, digital image is an important personal data for users. There are also many image processing services in cloud computing. To protect user’s privacy in these services, this paper proposed a scheme using homomorphic encryption in image processing. Firstly, a secret key homomorphic encryption (IGHE) was constructed for encrypting image. IGHE can operate on encrypted floating numbers efficiently to adapt to the image processing service. Then, by translating the traditional image processing methods into the operations on encrypted pixels, the encrypted image can be processed homomorphically. That is, service can process the encrypted image directly, and the result after decryption is the same as processing the plain image. To illustrate our scheme, three common image processing instances were given in this paper. The experiments show that our scheme is secure, correct, and efficient enough to be used in practical image processing applications.


2020 ◽  
pp. 698-715
Author(s):  
Mohamed Elhoseny ◽  
Ahmed Farouk ◽  
Josep Batle ◽  
Abdulaziz Shehab ◽  
Aboul Ella Hassanien

WSN as a new category of computer-based computing platforms and network structures is showing new applications in different areas such as environmental monitoring, health care and military applications. Although there are a lot of secure image processing schemas designed for image transmission over a network, the limited resources and the dynamic environment make it invisible to be used with Wireless Sensor Networks (WSNs). In addition, the current secure data transmission schemas in WSN are concentrated on the text data and are not applicable for image transmission's applications. Furthermore, secure image transmission is a big challenging issue in WSNs especially for the application that uses image as its main data such as military applications. The reason why is because the limited resources of the sensor nodes which are usually deployed in unattended environments. This chapter introduces a secure image processing and transmission schema in WSN using Elliptic Curve Cryptography (ECC) and Homomorphic Encryption (HE).


Author(s):  
Ritu Gupta ◽  
Anurag Mishra ◽  
Sarika Jain

A secure solution to the problem of copyright infringement and content authentication is to carry out image watermarking in secure signal processing (SSP) domain. Homomorphic encryption is considered one such solution for image watermarking in this domain. The Paillier encryption is found to be suitable for image processing applications in general and for watermarking in particular. In this article, a detailed investigation is carried out by using Paillier cryptosystem for twelve different color images in a compressed domain. The compression of the host images is carried out by SPIHT (Set Partitioning in Hierarchical Trees) coding. The visual quality of the images post embedding and image processing attacks is assessed by using two full reference metrics, Peak Signal to Noise Ratio (PSNR) and Structural Similarity Index (SSIM). The performance evaluation of the Paillier cryptosystem vis-à-vis watermark application development is carried out by computing three benchmark metrics: number of pixels change rate (NPCR), unified average changing intensity (UACI) and encryption speed.


2021 ◽  
pp. 2-10
Author(s):  
Liudmila Babenko ◽  
◽  
Ilya Rusalovsky ◽  

Since time immemorial, cryptography has provided secure transmission of information in an insecure environment, keeping the data secret. Not so long ago the homomorphic cryptography began to actively develop. Its distinctive feature is that this type of cryptography allows you to process encrypted data without their preliminary decryption in such a way that the result of operations on encrypted data is equivalent, after decryption, to the result of operations on open data. Because of these features, homomorphic encryption can be effectively used in various cloud services to perform secure computing and secure image processing. At the same time, it is guaranteed that no one will have open data, even the service that performs the calculations. Purpose of the work: development of methods and tools for homomorphic encryption that allow performing homomorphic implementation of image processing algorithms. Research methods: analysis of possible implementations of digital image processing using homomorphic encryption, analysis of existing problems of performing a homomorphic implementation for image processing algorithms. Results: a method for homomorphic comparison of bits and numbers presented as an array of bits is proposed; a homomorphic implementation of the EPX image resizing algorithm is proposed; the complexity of the operation is analyzed when one pixel of the original image is enlarged using the proposed method; the analysis results are presented.


2021 ◽  
Vol 2021 ◽  
pp. 1-15
Author(s):  
Liyan Zhu ◽  
Jinwei Wang ◽  
Xiangyang Luo ◽  
Yi Zhang ◽  
Chunfang Yang ◽  
...  

Cloud services have become an increasingly popular solution to provide different services to clients. More and more data are outsourced to the cloud for storage and computing. With this comes concern about the security of outsourced data. In recent years, homomorphic encryption, blockchain, steganography, and other technologies have been applied to the security and forensics of outsourced data. While encryption technologies such as homomorphic encryption and blockchain scramble data so that they cannot be understood, steganography hides the data so that they cannot be observed. Traditional steganography assumes that the environment is lossless. Robust steganography is grounded in traditional steganography and is proposed based on a real lossy social network environment. Thus, researchers, who study robust steganography, believe that the measurement should follow traditional steganography. However, the application scenario of robust steganography breaks through the traditional default lossless environment premise. It brings about changes in the focus of steganography algorithms. Simultaneously, the existing steganography methods miss the evaluation of applicability and ease of use. In this paper, “default parameters” are observed by comparing the process of robust image steganography with traditional image steganography. The idea of “perfecting default parameters” is proposed. Based on this, the attribute set of measuring robust image steganography is presented. We call it PRUDA (Payload, Robustness, ease of Use, antiDetection, and Applicability). PRUDA perfects default parameters observed in the process of traditional steganography algorithms. Statistics on image processing attacks in mobile social apps and analyses on existing algorithms have verified that PRUDA is reasonable and can better measure a robust steganography method in practical application scenarios.


1999 ◽  
Vol 173 ◽  
pp. 243-248
Author(s):  
D. Kubáček ◽  
A. Galád ◽  
A. Pravda

AbstractUnusual short-period comet 29P/Schwassmann-Wachmann 1 inspired many observers to explain its unpredictable outbursts. In this paper large scale structures and features from the inner part of the coma in time periods around outbursts are studied. CCD images were taken at Whipple Observatory, Mt. Hopkins, in 1989 and at Astronomical Observatory, Modra, from 1995 to 1998. Photographic plates of the comet were taken at Harvard College Observatory, Oak Ridge, from 1974 to 1982. The latter were digitized at first to apply the same techniques of image processing for optimizing the visibility of features in the coma during outbursts. Outbursts and coma structures show various shapes.


2000 ◽  
Vol 179 ◽  
pp. 229-232
Author(s):  
Anita Joshi ◽  
Wahab Uddin

AbstractIn this paper we present complete two-dimensional measurements of the observed brightness of the 9th November 1990Hαflare, using a PDS microdensitometer scanner and image processing software MIDAS. The resulting isophotal contour maps, were used to describe morphological-cum-temporal behaviour of the flare and also the kernels of the flare. Correlation of theHαflare with SXR and MW radiations were also studied.


Sign in / Sign up

Export Citation Format

Share Document