Abstract

Recently, a robust and secure image sharing scheme with personal identity information embedded was proposed based on Compressive Sensing, Secret Image Sharing and Diffie-Hellman Agreement. However, there exists a security flaw in this scheme. It cannot resist the man-in-the-middle attack in the authentication stage. Anyone can disguise himself as a legal person and get the information when exchanging the secret keys, which provides the possibility for information leakage, tampering, and other attacks. In this paper, we propose an image encryption and compression algorithm with identity authentication and blind signcryption based on Parallel Compressive Sensing (PCS), Secret Sharing(SS) and Elliptic Curve Cryptography (ECC). Firstly, Logistic-Tent system and PCS are employed to complete compression and lightweight encryption in the compression stage. Secondly, random sequences are generated based on Chebyshev map to construct four encryption matrices to perform the encryption process. Meanwhile, the participants' identity authentication and blind signcryption can be achieved by using ECC. Finally, we prove the efficiency and security of the blind signcryption, which can authenticate the participants' identity before restoring the original image. Experiments and security analysis demonstrate that the proposed scheme not only reduce the storage space and computational complexity effectively, but also has resistance against the man-in-the-middle attack, forgery attack and chosen-text attack.

Highlights

  • In recent years, big data and artificial intelligence bring great convenience to people through the Internet of Things

  • In [28], Wang et al proposed an image compression scheme with personal identity information based on Compressive Sensing (CS) and Secret Image Sharing

  • THE PROPOSED SCHEME Based on Wang’s scheme, this paper proposes a compressive sensing based image encryption and compression algorithm, which can reduce the storage space, authenticate the legitimate participant and perform blind signcryption

Read more

Summary

INTRODUCTION

Big data and artificial intelligence bring great convenience to people through the Internet of Things. In [28], Wang et al proposed an image compression scheme with personal identity information based on CS and Secret Image Sharing. A. THE ENCRYPTION PROCESS (ENCODING PHASE) 1) AGREEMENT Step: The distributor D publishes (P, f, g) among participant Pi, holds (e, v) securely,where ev = 1(modP ) , P is a large integer. B. THE DECRYPTION PROCESS OF WANG’S SCHEME(DECODING PHASE) 1) AUTHENTICATION The combiner verifies whether the equation PINνi = Hiν = g−ebi ν = g−bi = Ri (modP ) holds or not. THE DECRYPTION PROCESS OF WANG’S SCHEME(DECODING PHASE) 1) AUTHENTICATION The combiner verifies whether the equation PINνi = Hiν = g−ebi ν = g−bi = Ri (modP ) holds or not If yes, it means they are legitimate participants, otherwise, they are illegal participants. Input (μ, z0) to the Tent map, generate the sensing matrix, the original image can be reconstructed by the OMP algorithm

ANALYZE THE PROBLEM OF WANG’S SCHEME
CHAOTIC MAPS
THE PROPOSED SCHEME
THE ENCODING PHASE
THE DECODING PHASE
CORRECTNESS PROOF AND SECURITY ANALYSIS
EXPERIMENTAL ANALYSIS AND PERFORMANCE COMPARISON
HISTOGRAM ANALYSIS
THE PERFORMANCE AND COMPARISON
CONCLUSIONS
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call