解密區(qū)域完美恢復(fù)的區(qū)域遞增式視覺(jué)密碼方案構(gòu)造

胡浩; 郁濱; 沈剛; 張學(xué)思

doi:10.11999/JEIT151448

解密區(qū)域完美恢復(fù)的區(qū)域遞增式視覺(jué)密碼方案構(gòu)造

doi: 10.11999/JEIT151448

基金項(xiàng)目:

國(guó)家自然科學(xué)基金(61070086)，信息保障技術(shù)重點(diǎn)實(shí)驗(yàn)室開放基金(KJ-13-107)

計(jì)量
- 文章訪問(wèn)數(shù): 1285
- HTML全文瀏覽量: 107
- PDF下載量: 367
- 被引次數(shù): 0
出版歷程
- 收稿日期: 2015-12-22
- 修回日期: 2016-05-26
- 刊出日期: 2016-10-19

Region Incrementing Visual Cryptography Scheme with Decrypt Regions Perfectly Recovered

Funds:

The National Natural Science Foundation of China (61070086), The Foundation of Science and Technology on Information Assurance Laboratory of China (KJ-13-107)

摘要

摘要: 為了優(yōu)化區(qū)域遞增式視覺(jué)密碼的恢復(fù)效果，該文通過(guò)為共享份添加身份標(biāo)識(shí)，并結(jié)合隨機(jī)數(shù)，構(gòu)造了單個(gè)參與者持有多個(gè)共享份的異或單秘密視覺(jué)密碼方案，在此基礎(chǔ)上，設(shè)計(jì)了異或區(qū)域遞增式視覺(jué)密碼的秘密分享與恢復(fù)算法。對(duì)于解密區(qū)域利用異或單秘密方案進(jìn)行分享，對(duì)于未解密區(qū)域，通過(guò)填充隨機(jī)數(shù)實(shí)現(xiàn)秘密遮蓋。實(shí)驗(yàn)結(jié)果表明，該方案可以實(shí)現(xiàn)解密區(qū)域圖像的完美恢復(fù)，且有效減小了共享份的存儲(chǔ)與傳輸開銷。
- 視覺(jué)密碼 /
- 圖像秘密分享 /
- 區(qū)域遞增 /
- 密級(jí) /
- 異或運(yùn)算 /
- 完美恢復(fù)
Abstract: In order to optimize the recovery quality of Region Incrementing Visual Cryptography Scheme (RIVCS), by adding identities for shares and combing the random numbers, an XOR-based single-secret sharing Visual Cryptography Scheme (XVCS) with individual participant holding multi-share is designed. On basis of this, the secret sharing and recovering algorithms for XOR-based RIVCS (XRIVCS) are designed. For the decrypt regions, XVCS is used to share, and for the not decrypt regions, the random numbers are filled to keep the secret. The experimental results show that, the proposed scheme can realize the perfect recovery of decrypt regions, and decrease the storage and transmission cost effectively.
- Visual cryptography /
- Image secret sharing /
- Region incrementing /
- Security levels /
- XOR operation /
- Perfect recovery

HTML全文

參考文獻(xiàn)(20)

李鵬, 馬培軍, 蘇小紅, 等. 多重門限的圖像秘密共享方法[J].電子學(xué)報(bào), 2012, 40(3): 518-524. doi: 10.3969/j.issn.0372-2112. 2012.03.018.

LI Ping, MA Peijun, SU Xiaohong, et al. Multi-threshold image secret sharing scheme[J]. Acta Electronica Sinica, 2012, 40(3): 518-524. doi: 10.3969/j.issn.0372-2112.2012.03.018.

付正欣, 沈剛, 郁濱, 等. 一種可完全恢復(fù)的門限多秘密視覺(jué)密碼方案[J]. 軟件學(xué)報(bào), 2015, 26(7): 1757-1771. doi: 10.13328 /j.cnki.jos.004611.

FU Zhengxin, SHEN Gang, YU Bin, et al. Threshold multi- secret visual cryptography scheme with perfect recovery[J]. Journal of Software, 2015, 26(7): 1757-1771. doi: 10.13328/ j.cnki.jos.004611.

BIN Y and GANG S. Multi-secret visual cryptography with deterministic contrast[J]. Multimedia Tools and Applications, 2014, 72(2): 1867-1886. doi: 10.1007/s11042-013-1479-8.

SHYU S J and JIANG H W. General constructions for threshold multiple-secret visual cryptography schemes[J]. IEEE Transactions on Information Forensics and Security, 2013, 8(5): 733-743. doi: 10.1109/TIFS.2013.2250432.

WANG R Z. Region incrementing visual cryptography[J]. IEEE Signal Processing Letters, 2009, 16(8): 659-662. doi: 10.1109/LSP.2009.2021334.

SHYU S J and JIANG H W. Efficient construction for region incrementing visual cryptography[J]. IEEE Transactions on Circuits and Systems for Video Technology, 2012, 22(5): 769-777. doi: 10.1109/TCSVT.2011.2180769.

YANG C N, SHIH H W, CHU Y Y, et al. New region incrementing visual cryptography scheme[C]. Proceedings of the International Conference on Image Processing, Computer Vision, and Pattern Recognition in Conjunction with WORLDCOMP, Las Vegas, USA, 2011: 323-329.

YANG C N, SHIH H W, WU C C, et al. k out of n region incrementing scheme in visual cryptography[J]. IEEE Transactions on Circuits and Systems for Video Technology, 2012, 22(5): 799-810. doi: 10.1109/TCSVT.2011.2180952.

YANG C N, LIN Y C, and WU C C. Region-in-region incrementing visual cryptography scheme[C]. Proceedings of 12th International Workshop on Digital-Forensics and Watermarking, Auckland, New Zealand, 2013: 449-463. doi: 10.1007/978-3-642-40099-5_37.

NAOR M and SHAMIR A. Visual cryptography[C]. Proceedings of the Advances in Cryptology-Eurocrypt94, Berlin, 1995: 1-12. doi: 10.1007/BFb0053419.

SHYU S. Image encryption by multiple random grids[J]. Pattern Recognition, 2009, 42(7): 1582-1596. doi:10.1016/j. patcog.2008.08.023.

WANG R Z, LAN Y C, LEE Y K, et al. Incrementing visual cryptography using random grids[J]. Optics Communications, 2010, 283(21): 4242-4249. doi: 10.1016/j.optcom.2010.06.042.

ZHONG G S and WANG J J. Region incrementing visual secret sharing scheme based on random grids [C]. Proceedings of IEEE International Symposium on Circuits and Systems, Los Alamitos, 2013: 2351-2354. doi: 10.1109/ISCAS.2013. 6572350.

TUYLS P, HOLLMANN H D L, LINT J H V, et al. XOR- based visual cryptography schemes[J]. Designs, Codes and Cryptography, 2005, 37(1): 169-186. doi: 10.1007/s10623-004- 3816-4.

OU D, SUN W, and WU X T. Non-expansible XOR-based visual cryptography scheme with meaningful shares[J]. Signal Processing, 2015, 108: 604-621. doi: 10.1016/j.sigpro.2014.10. 011.

HAO H, GANG S, FU Z X, et al. General construction for XOR-based visual cryptography and its extended capability [J]. Multimedia Tools and Applications, 2016, 1-29. doi: 10.1007/s11042-016-3250-4.

YANG C N and WANG D S. Property analysis of XOR based visual cryptography[J]. IEEE Transactions on Circuits and Systems for Video Technology, 2014, 24(2): 189-197. doi: 10.1109/TCSVT.2013.2276708.

ATENIESE G, BLUNDO C, SANTIS A D, et al. Visual cryptography for general access structures[J]. Information and Computation, 1996, 129(2): 86-106. doi: 10.1006/inco. 1996.0076.

相關(guān)文章

施引文獻(xiàn)

資源附件(0)

訪問(wèn)統(tǒng)計(jì)