共享一个具有可逆和有损特性的秘密图像

Q3 Computer Science

International Journal of Electronic Commerce Studies Pub Date : 2016-12-09 DOI:10.7903/IJECS.1467

Chien-Chang Chen, Chong-An Liu, Yu-Jing Lin

{"title":"共享一个具有可逆和有损特性的秘密图像","authors":"Chien-Chang Chen, Chong-An Liu, Yu-Jing Lin","doi":"10.7903/IJECS.1467","DOIUrl":null,"url":null,"abstract":"Conventional ( t , n ) secret image sharing schemes share a secret image to n shared images, where any t shared images recovers the secret image. Among these shared images, noise-like properties easily draw attacker attention. Embedding shared images in meaningful cover images thus efficiently reduces attacker attention. This paper presents a different-expansion technique based invertible secret image sharing scheme that allows participants to perfectly restore the secret image and cover images. The proposed scheme also contains a lossy property which means that cover images do not have to be perfectly recovered to share larger secret images. The proposed scheme performs well with M-ary number systems, allowing users to determine the trade-off between covered image quality and secret image size. Experimental results show that the proposed scheme shares a large secret image and has good covered image quality.Â To cite this document: Chien-Chang Chen,Â Chong-An Liu,Â and Yu-Jing Lin, \"Share a secret image with invertible and lossy characteristics\", International Journal of Electronic Commerce Studies, Vol.7, No.2, pp.135-154, 2016. Permanent link to this document: http://dx.doi.org/10.7903/ijecs.1467","PeriodicalId":38305,"journal":{"name":"International Journal of Electronic Commerce Studies","volume":"7 1","pages":"135-154"},"PeriodicalIF":0.0000,"publicationDate":"2016-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"SHARE A SECRET IMAGE WITH INVERTIBLE AND LOSSY CHARATERISTICS\",\"authors\":\"Chien-Chang Chen, Chong-An Liu, Yu-Jing Lin\",\"doi\":\"10.7903/IJECS.1467\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Conventional ( t , n ) secret image sharing schemes share a secret image to n shared images, where any t shared images recovers the secret image. Among these shared images, noise-like properties easily draw attacker attention. Embedding shared images in meaningful cover images thus efficiently reduces attacker attention. This paper presents a different-expansion technique based invertible secret image sharing scheme that allows participants to perfectly restore the secret image and cover images. The proposed scheme also contains a lossy property which means that cover images do not have to be perfectly recovered to share larger secret images. The proposed scheme performs well with M-ary number systems, allowing users to determine the trade-off between covered image quality and secret image size. Experimental results show that the proposed scheme shares a large secret image and has good covered image quality.Â To cite this document: Chien-Chang Chen,Â Chong-An Liu,Â and Yu-Jing Lin, \\\"Share a secret image with invertible and lossy characteristics\\\", International Journal of Electronic Commerce Studies, Vol.7, No.2, pp.135-154, 2016. Permanent link to this document: http://dx.doi.org/10.7903/ijecs.1467\",\"PeriodicalId\":38305,\"journal\":{\"name\":\"International Journal of Electronic Commerce Studies\",\"volume\":\"7 1\",\"pages\":\"135-154\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-12-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Electronic Commerce Studies\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.7903/IJECS.1467\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"Computer Science\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Electronic Commerce Studies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.7903/IJECS.1467","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Computer Science","Score":null,"Total":0}

引用次数: 0

摘要

传统的(t, n)秘密图像共享方案将一个秘密图像共享给n个共享图像，其中任意t个共享图像恢复秘密图像。在这些共享图像中，类似噪声的属性很容易引起攻击者的注意。在有意义的封面图像中嵌入共享图像，从而有效地降低攻击者的注意力。本文提出了一种基于差分展开技术的可逆秘密图像共享方案，使参与者能够完美地恢复秘密图像和封面图像。该方案还包含有损特性，这意味着不需要完全恢复覆盖图像来共享更大的秘密图像。所提出的方案在m数系统中表现良好，允许用户确定覆盖图像质量和秘密图像大小之间的权衡。实验结果表明，该方案共享了较大的秘密图像，具有较好的覆盖图像质量。Â引用本文:陈建昌，Â刘重安，Â，林玉静，“具有可逆和有损特征的秘密图像共享”，《国际电子商务研究》Vol.7, No.2, pp.135-154, 2016。此文档的永久链接:http://dx.doi.org/10.7903/ijecs.1467

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

SHARE A SECRET IMAGE WITH INVERTIBLE AND LOSSY CHARATERISTICS

Conventional ( t , n ) secret image sharing schemes share a secret image to n shared images, where any t shared images recovers the secret image. Among these shared images, noise-like properties easily draw attacker attention. Embedding shared images in meaningful cover images thus efficiently reduces attacker attention. This paper presents a different-expansion technique based invertible secret image sharing scheme that allows participants to perfectly restore the secret image and cover images. The proposed scheme also contains a lossy property which means that cover images do not have to be perfectly recovered to share larger secret images. The proposed scheme performs well with M-ary number systems, allowing users to determine the trade-off between covered image quality and secret image size. Experimental results show that the proposed scheme shares a large secret image and has good covered image quality.Â To cite this document: Chien-Chang Chen,Â Chong-An Liu,Â and Yu-Jing Lin, "Share a secret image with invertible and lossy characteristics", International Journal of Electronic Commerce Studies, Vol.7, No.2, pp.135-154, 2016. Permanent link to this document: http://dx.doi.org/10.7903/ijecs.1467

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

International Journal of Electronic Commerce Studies Computer Science-Computer Science Applications

CiteScore

1.40

自引率

0.00%

发文量

期刊介绍： The IJECS is a double-blind referred academic journal for all fields of Electronic Commerce. To serve as an international platform, the IJECS encourages manuscript submissions from authors all around the world. As a multi-discipline journal, The IJECS welcome both technology oriented and business oriented electronic commerce research articles. The purpose of the International Journal of Electronic Commerce Studies is to promote electronic commerce research and provide worldwide scholars a place to publish their innovative work in electronic commerce. To be published in the journal, the manuscript must make strong empirical, theoretical, or practical contributions and highlight the significance of the contributions to the electronic commerce field. Thus, preference is given to submissions that test, extend, or build strong theoretical frameworks for electronic commerce theory, electronic commerce system development, and electronic commerce practice. The journal is not tied to any particular national context; the geographic distribution of authors publishing in the journal came from countries around the world. Articles introducing cases of innovative applications in electronic commerce around the world are also published in the journal. The journal provides scholars opportunities to realize the electronic commerce research and development around the world. Articles in the International Journal of Electronic Commerce Studies will include, but are not limited to the following areas.