亚洲免费av电影一区二区三区,日韩爱爱视频,51精品视频一区二区三区,91视频爱爱,日韩欧美在线播放视频,中文字幕少妇AV,亚洲电影中文字幕,久久久久亚洲av成人网址,久久综合视频网站,国产在线不卡免费播放

        ?

        Light-Weight Selective Image Encryption for Privacy Preservation

        2020-10-19 02:21:30

        Abstract—To protect personal privacy and confidential preservation,access control is used to authorize legal users for safe browsing the authorized contents on photos.The access control generates an authorization rule according to each permission assignment.However,the general access control is inappropriate to apply in some social services(e.g.,photos posted on Flickr and Instagram,personal image management in mobile phone) because of the increasing popularity of digital images being stored and managed.With low maintenance loads,this paper integrates the data hiding technique to propose an access control mechanism for privacy preservation.The proposed scheme changes the partial regions of a given image as random pads (called selective image encryption) and only allows the authorized people to remedy the random pads back to meaningful ones which are with similar visual qualities of original ones.

        1.Introduction

        In recent years,people used to obtain and store information from/up to the Internet since the widespread use of network technologies.The Internet is a public but insecure environment,which might make user’s private information vulnerable to malicious intruders during data transmission.To ensure that no illegal users can access the un-authorized contents,the access control model is one of the ways used in privacy preservation.Using the model,users can authorize people who have the rights to access their own digitized contents.After that,users can be granted or denied to resources after they log in the systems.

        Nowadays,the massive use of multimedia arises several issues including privacy and confidentiality preserving[1]-[26].Access control models for multimedia databases were proposed to provide safe browsing and publishing of multimedia[5],[6],[8].In 2003,Bertinoet al.[6]proposed a hierarchical access control model for video database systems.Based on hierarchical concepts,Thuraninsighamet al.[22],[23]created a digest between the contents of the video and the corresponding description to facilitate the specification of permissions.Pickeringet al.[20]prevented the illegal copy by controlling the quality of videos.Later on,as for quality of services (QoS),Grosboiset al.[8]and Phadikaret al.[19]proposed schemes to modify the discrete wavelet transform (DWT)coefficients and discrete cosine transform (DCT) coefficients for providing different resolution and qualities of images to different users.In [1],Adamet al.proposed an access control model dedicated to the protection of digital libraries’ contents.In [3],Atluri and Chun proposed an access control model for geospatial data.Imaizumiet al.[11]proposed a multi-layer encryption mechanism for Joint Photographic Experts Group 2000 (JPEG 2000)images used in privacy protection.However,all of them focused on accessing the whole digitalized contents,but not allowing just partial contents.

        The control for encrypting the contents of multimedia is an important issue in recent years (e.g.,masking out objects with violent scenes for TV show,hiding the sensitive information in a picture)[4].That is,one may prefer to access partial contents of an image rather than to the whole one for privacy protection,such as some leading services (e.g.,Google Street View,EveryScape,and Mapjack),personal image management,and marketing promotion.Google Street View provides users to see the street view after they look up the location in the map;however,the service results in a high probability of leaking one’s private life even without meaning to do so[2].This has raised a need to de-identify individuals from the view of the street,but not encrypt the whole content of images.Also,it is useful for personal image management to just encrypt the sensitive regions of images as random pads.It is beneficial that the owner can see the non-sensitive region to recognize which pictures he looks for.Second,only the user who has rights can decrypt the encrypted regions to prevent the personal privacy leakage.As for marketing promotion on electronic publications,the partial interest words of bubbles or patterns in e-comics can be encrypted as random pads to attract readers to know what meaning contains in the pictures[21].

        As for fine-grained access control for digitalized multimedia,Bounaet al.[4]proposed an image access control model,which enables owners to authorize partial contents on images to users.The fine-grained access control model can specify the security rules based on the constraints,which provides a simple data representation model to properly describe the image description,and present the requirement of fine-grained control on images.It has a challenge that a significantly increasing number of pictures need maintenance,because lots of authorization needs maintenance.Pintoet al.[21]changed the values of AC coefficients during the JPEG compression process to encrypt just the bubbles of e-comics,namely selective image encryption.After that,the encrypted areas can be restored to the original ones if the secret key is held.The partial image encryption keeps two advantages[21].First,the computational time can be reduced because only partial contents are required to encrypt.Second,the regions are selected by owners to encrypt partial contents according to their wishes.To achieve partial encryption,Pintoet al.proposed a selective encryption scheme[21],in which the encrypted regions are controlled by coefficients.However,it is not sophisticated;that is,some regions are not encrypted but the ones are exactly matched the correct ones to be encrypted as the wish.As for the fine-grained encryption scheme,Chenet al.[7]proposed an almost lossless encrypted scheme to achieve fine-grained encryption on partial contents of images.However,it requires an extra procedure to embed the locations of the region of interest (ROI) into the image for later indicating the position of decryption.The sensitive region might leak out personal privacy information,called ROI.To meet the requirement,in this paper,we proposed a low cost model for selective image encryption without maintaining any authorization rule for personal image management.ROI is encrypted with a secret key,namely the encryption procedure.Later on,the users can decrypt ROI only if they own the secret key,called the decryption procedure.

        This paper is organized as follows:Related works are briefly described in Section 1.In Section 2,the details of the proposed scheme are presented,including the encryption and decryption procedures.The experimental results are shown in Section 3.Finally,conclusions and directions for future work are drawn in Section 4.

        2.Proposed Scheme

        The proposed scheme is an improved version of the scheme in [8],and divides into three procedures,namely ROI processing,encryption procedure,and decryption procedure,which are described in sub-sections 2.1,2.2,and 2.3,respectively.

        2.1.ROI Regions Processing

        In the proposed method,ROI and non-ROI must be recognized for later decryption.However,the traditional location map is with a big size for embedding into the image.Actually,the pixels in ROI are consecutively beneficial for data compression.Thus,we use the Peano mask tree (PM-tree)[27]to compress the location map.

        For example,scanning the whole image,the sensitive regions are tagged as ROI and non-ROI.Also,pixels in ROI and non-ROI are marked as 1 and 0,respectively,as shown in Fig.1.The Peano count tree (P-tree) is generated as shown in Fig.2 (a)according to Fig.1.

        Fig.1.Authorization region example for a given image with the size of 8×8.

        First,the root of P-tree is the number of 1s in Fig.1.After dividing Fig.1 into four equal size pieces,the encoder accumulates 1s in each piece individually.If the number of 1s is zero or with the same as the size of the piece,the node of Fig.2 (a) is treated as a leaf node;otherwise,it continues to divide into four pieces until it is a single pixel.After that,the P-tree is transformed into the PM-tree as shown in Fig.2 (b),where the non-terminal nodes are replaced withm.The terminal nodes are replaced with 1 and 0 if the values of the leaf nodes are larger than 1 and equal to 0,respectively.

        Finally,the PM-tree is traced by using the pre-fix order to generate a bit string,where the value of node is replaced with 0,10,and 11,if the value is 0 or 1,andm,respectively.

        Fig.2.Examples of P-tree and PM-tree after compressing data in Fig.1:(a) P-tree and (b) PM-tree.

        2.2.Encryption Procedure

        Note that the pixel is checked whether it is embeddable with (1) to avoid the overflow problem after encryption,where (1) is to get the most minimum pixel whose value after decrypting is larger than 255:

        wherepxis thexth pixels of the image andαis a digit larger than 3 as the encryption factors in a range of [a,b],andαis used as a private secret value to control the mosaic strength of ROI.Different pixels are encrypted with different encryption factors chosen by a secret key.If the pixel is not satisfied (1),it is judged as a to-be encrypted pixel,and the side information of it is recorded as 1;otherwise,0.

        The side information is combined and encoded as a bit sequential (bSQ) file.Later on,the bSQ file is compressed by the PM-tree[27].The pixelpxis used to embed the bits of the compressed codes.The pixel is transformed into a bit stream.The data is embedded into the pixelpxwith (2):

        wheresis the extracted compression codes from bits of bSQ,λ=s?(pxmod 3),|λ| is the absolute value ofλ,and sign(·) is the function to get the value 1 or ?1 ifλis a positive digit or negative one.

        If the pixel is with the underflow problem after data embedding,the original pixel is plus one and do again.In the same way,if it is with the overflow problem,the pixel is minus one before data embedding.Next,the ROI pixels are encrypted with (3):

        2.3.Decryption Procedure

        During decoding,the hiddensis extracted by (4):

        Thus,the locations of ROI are extracted.Next,the extracted codes are the compression codes used to reconstruct the PM tree.The PM tree can be transformed into P-tree and then be the bQS file.Finally,ROI can be recognized.According to the extracted ROI,the encrypted regions can be decrypted with (5):

        For clarity,an example is provided to demonstrate the encryption and decryption procedures.If the pixelpxis 53 and the secret data is 1,the stego-pixel is 52 derived fromλput into (2) (λ=1?(53 mod 3)=?1,sign(λ)=?1,andIf the value ofαis 7,the encrypted pixelThe receiver can extract the hidden dataswith (4).In the case,the extracted hidden datasis 1,since (61 mod 3)=1.During the decryption procedure,to find the pixeit must hold the conditionand fall into the range ofIn this case,the pixel value is obtained as 52 satisfying the condition and in the range of [43,61].The givenpxis 111 and secret datasis 2 to output the encrypted pixel,extracted hidden secret,and decrypted pixel,which are listed in Table 1.The pixel is judged as un-embeddable if the pixel satisfies (1).

        Table 1:Example of encryption and decryption procedures

        3.Experimental Results

        In the experiments,the test images,street,people,and street2 are shown in Figs.3 (a) to (c) to evaluate the performances.After data embedding,the corresponding embedded images are shown in Figs.3 (d) to (f),respectively.The visual quality on average is higher than 65 dB;thus,it is difficult to realize the differences between the embedded images and the original ones.The images are encrypted according to different sizes of ROI as shown in Figs.3 (g) to (i) with the encrypted factorα,which is a prime digit for an encryption pixel chosen by the secret key in the range of [3,47].After encryption,it is very difficult to recognize the original content with naked eyes.After decrypting the encrypted image,the decrypted results are shown in Figs.3 (j) to (l) which are the same as the embedded images.

        The size of ROI of Figs.3 (g) to (i) and the length of compression codes are listed in Table 2.Also,the visual qualities of Figs.3 (j) to (l) evaluated by the peak signal-to-noise ratio (PSNR) are listed in Table 2,too.The results show that the larger size of ROI results in lower visual quality.In addition,if ROI region is dispersed,the length of compression codes is larger.After decrypting,the visual quality of the embedded image keeps intact,which is similar to the original one.

        Fig.3.Embedded images,encrypted images,and decrypted images:(a) street,(b) people,(c) street2,(d) embedded image of (a),(e) embedded image of (b),(f) embedded image of (c),(g) encrypted image of (d),(h) encrypted image of(e),(i) encrypted image of (f),(j) decrypted image of (g),(k) decrypted image of (h),and (l) decrypted image of (i).

        4.Conclusions

        Table 2:Visual qualities of test images based on different sizes of ROI region

        In this paper,a selective image encryption technique is proposed.The model is useful for preserving the personal privacy with low cost maintenance.The sensitive regions can be protected after data encryption.Only the people who get the key could decrypt the sensitive region.It could be applied to the image management in cloud storage.

        亚洲国产精品无码久久| 亚洲图文一区二区三区四区| 久久精品亚洲国产av网站| 亚洲精品久久激情国产片| 亚洲日本在线电影| 久久国产精品视频影院| 长腿丝袜在线观看国产| 亚洲 欧美 偷自乱 图片| 在线综合亚洲欧洲综合网站| 欧美亚洲国产日韩一区二区三区| 日韩av中文字幕亚洲天| 美利坚日韩av手机在线| 一区二区三区人妻无码| 久久久久亚洲女同一区二区| av网站可以直接看的| 高清中文字幕一区二区| 日本高清h色视频在线观看| 精品视频999| 五十路一区二区中文字幕| 久青草影院在线观看国产| 成人黄色网址| 国产激情一区二区三区成人免费| 亚洲精品中文字幕乱码无线| 中文字字幕人妻中文| 亚洲av第一成肉网| 国产精品亚洲av国产| 久久红精品一区二区三区| 性欧美牲交xxxxx视频欧美| 国产精品亚洲片夜色在线| 亚洲一区久久蜜臀av| 中文字幕 在线一区二区| 亚洲午夜狼人综合影院| 亚洲精品久久7777777| 五十路熟女一区二区三区| 精品少妇后入一区二区三区| 国产一区二区三区仙踪林| 国产乱人视频在线播放| 国产精品福利影院| 国产精品女人一区二区三区 | 亚洲性久久久影院| 北条麻妃毛片在线视频|