Application of homomorphism to secure image sharing

Abstract

In this paper, we present a new approach for sharing images between l players by exploiting the additive and multiplicative homomorphic properties of two well-known public key cryptosystems, i.e. RSA and Paillier. Contrary to the traditional schemes, the proposed approach employs secret sharing in a way that limits the influence of the dealer over the protocol and allows each player to participate with the help of his key-image. With the proposed approach, during the encryption step, each player encrypts his own key-image using the dealer's public key. The dealer encrypts the secret-to-be-shared image with the same public key and then, the l encrypted key-images plus the encrypted to-be shared image are multiplied homomorphically to get another encrypted image. After this step, the dealer can safely get a scrambled image which corresponds to the addition or multiplication of the l + 1 original images (l key-images plus the secret image) because of the additive homomorphic property of the Paillier algorithm or multiplicative homomorphic property of the RSA algorithm. When the l players want to extract the secret image, they do not need to use keys and the dealer has no role. Indeed, with our approach, to extract the secret image, the l players need only to subtract their own key-image with no specific order from the scrambled image. Thus, the proposed approach provides an opportunity to use operators like multiplication on encrypted images for the development of a secure privacy preserving protocol in the image domain. We show that it is still possible to extract a visible version of the secret image with only l-1 key-images (when one key-image is missing) or when the l key-images used for the extraction are different from the l original key-images due to a lossy compression for example. Experimental results and security analysis verify and prove that the proposed approach is secure from cryptographic viewpoint.

Privacy-preserving Machine Learning as a Service

“…Machine learning algorithms based on deep Neural Networks (NN) have attracted attention as a breakthrough in the advance of artificial intelligence (AI) and are the mainstream in current AI research. These techniques are achieving remarkable results and are extensively used for analyzing big data in a variety of domains such as spam detection, traffic analysis, intrusion detection, medical or genomics predictions, face recognition, and financial predictions [9,10,24,27,32,38,44,54]. However, training the models requires access to the raw data which is often privacy sensitive and can create potential privacy risks.…”

Phase retrieval algorithm for optical information security*

“…Suppose that the distributions of the two phase masks after kth iteration are ψ k 1 and ψ k 2 , respectively, then in the (k + 1)-th iteration process they can be described as [27] The Lagrange interpolating polynomial is the basis of (t, n) threshold secret sharing algorithm. A polynomial f about x of degree t− 1 is usually written as follows: [42][43][44][45][46]…”

Blind Faith: Privacy-Preserving Machine Learning using Function Approximation

“…Machine Learning (ML) models have attracted global adulation and are used in a plethora of applications such as medical diagnosis, pattern recognition, and credit risk assessment. Recently, deep learning -a sub-field of ML has gained extra attention from researchers due to its solid performance in many tasks such as speech recognition, spam detection, image classification, traffic analysis, face recognition, financial detection and genomics prediction [1]- [5]. ML models normally consist of a training and a testing phase.…”