Improved Extended Polynomial-Based Secret Image Sharing Scheme Using QR Code

Zhengxin Fu, Sijia Liu, Kun Xia, Bin Yu
{"title":"Improved Extended Polynomial-Based Secret Image Sharing Scheme Using QR Code","authors":"Zhengxin Fu, Sijia Liu, Kun Xia, Bin Yu","doi":"10.1109/CIS2018.2018.00058","DOIUrl":null,"url":null,"abstract":"Secret image sharing technology is an effective approach to encode the secret image into several shares, and the original image can be recovered by the remaining shares even some shares are lost. As a typical two-dimensional machine reada-ble code, QR code is widely used in human life due to its fast reading speed, high data density and strong error correction capability. Combined with the characteristics of QR code and secret image sharing, an extended secret image sharing scheme was proposed based on QR code, where \"extended\" means that the generated shares were visually similar to the QR code. The main idea is to control the parameters' selec-tion of polynomial using the binary QR codes. Meanwhile, the average gray difference of the shares was defined as α to measure the similarity between QR-like shares and the origi-nal carrier QR codes. Based on α, a secret sharing algorithm was designed to generate QR-like shares. At last, upper and lower limits of α are introduced through experimental analy-sis, and the relationship between the error correction level of carrier QR code and the lower limit of α.","PeriodicalId":185099,"journal":{"name":"2018 14th International Conference on Computational Intelligence and Security (CIS)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 14th International Conference on Computational Intelligence and Security (CIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIS2018.2018.00058","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Secret image sharing technology is an effective approach to encode the secret image into several shares, and the original image can be recovered by the remaining shares even some shares are lost. As a typical two-dimensional machine reada-ble code, QR code is widely used in human life due to its fast reading speed, high data density and strong error correction capability. Combined with the characteristics of QR code and secret image sharing, an extended secret image sharing scheme was proposed based on QR code, where "extended" means that the generated shares were visually similar to the QR code. The main idea is to control the parameters' selec-tion of polynomial using the binary QR codes. Meanwhile, the average gray difference of the shares was defined as α to measure the similarity between QR-like shares and the origi-nal carrier QR codes. Based on α, a secret sharing algorithm was designed to generate QR-like shares. At last, upper and lower limits of α are introduced through experimental analy-sis, and the relationship between the error correction level of carrier QR code and the lower limit of α.
改进的基于扩展多项式的QR码秘密图像共享方案
秘密图像共享技术是一种将秘密图像编码成多个共享的有效方法,即使部分共享丢失,剩余的共享也可以恢复原始图像。二维码作为一种典型的二维机器可读代码,以其读取速度快、数据密度高、纠错能力强等优点,在人类生活中得到了广泛的应用。结合QR码和秘密图像共享的特点,提出了一种基于QR码的扩展秘密图像共享方案,其中“扩展”是指生成的共享在视觉上与QR码相似。其主要思想是利用二进制QR码控制多项式参数的选择。同时,将类QR份额的平均灰度差定义为α,以衡量类QR份额与原始载体QR码之间的相似性。基于α,设计了一种秘密共享算法来生成类qr共享。最后通过实验分析,给出了α的上下限,以及载波QR码的纠错等级与α下限的关系。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信