Visual Multi-Secret Sharing with Friendliness

doi:10.1007/s12204-014-1525-3

上海交通大学学报（英文版） ›› 2014, Vol. 19 ›› Issue (4): 455-465.doi: 10.1007/s12204-014-1525-3

Visual Multi-Secret Sharing with Friendliness

JENG Fuh-gwoa (郑富国), LIN Kai-siangb (林恺翔), LIN Chih-hungc (林志鸿), CHEN Tzung-herb* (陈宗和)

(a. Department of Applied Mathematics; b. Department of Computer Science and Information Engineering; c. Graduate Institute of Mathematics and Science Education, National Chiayi University, Chiayi 60004, Taiwan, China)

发布日期:2014-10-13
通讯作者: CHEN Tzung-herb* (陈宗和) E-mail:thchen@mail.ncyu.edu.tw

Visual Multi-Secret Sharing with Friendliness

JENG Fuh-gwoa (郑富国), LIN Kai-siangb (林恺翔), LIN Chih-hungc (林志鸿), CHEN Tzung-herb* (陈宗和)

(a. Department of Applied Mathematics; b. Department of Computer Science and Information Engineering; c. Graduate Institute of Mathematics and Science Education, National Chiayi University, Chiayi 60004, Taiwan, China)

Published:2014-10-13
Contact: CHEN Tzung-herb* (陈宗和) E-mail:thchen@mail.ncyu.edu.tw

摘要/Abstract

摘要： Visual secret sharing (VSS) was used in the literature to encode and decode secret images until visual multi-secret sharing (VMSS) was proposed. Distinctly, multiple secret images can be encoded or decoded at a time in VMSS; however, only one secret image can be done in VSS. In VMSS, secrets are encoded into noise-like shares which have finally been stacked altogether so as to disclose each of the secrets by specific operations, such as rotating, flipping and sliding. Though the noise-like shares can be decoded by those operations, it is just like a fly in the ointment since they are hard to manage, to recognize and even to stack orderly. Based on some researches about user-friendly VSS for generating meaningful shares, a new friendly VMSS scheme is presented in this paper for achieving two main goals. One is trying to encode multiple secrets at a time and the other is making the decoding process easy to manage. The experimental results prove that our proposed scheme does work.

关键词: visual cryptography, random grids, visual secret sharing (VSS), image encryption

Abstract: Visual secret sharing (VSS) was used in the literature to encode and decode secret images until visual multi-secret sharing (VMSS) was proposed. Distinctly, multiple secret images can be encoded or decoded at a time in VMSS; however, only one secret image can be done in VSS. In VMSS, secrets are encoded into noise-like shares which have finally been stacked altogether so as to disclose each of the secrets by specific operations, such as rotating, flipping and sliding. Though the noise-like shares can be decoded by those operations, it is just like a fly in the ointment since they are hard to manage, to recognize and even to stack orderly. Based on some researches about user-friendly VSS for generating meaningful shares, a new friendly VMSS scheme is presented in this paper for achieving two main goals. One is trying to encode multiple secrets at a time and the other is making the decoding process easy to manage. The experimental results prove that our proposed scheme does work.

Key words: visual cryptography, random grids, visual secret sharing (VSS), image encryption

中图分类号:

TN 911.73

JENG Fuh-gwoa (郑富国), LIN Kai-siangb (林恺翔), LIN Chih-hungc (林志鸿), CHEN Tzung-herb. Visual Multi-Secret Sharing with Friendliness[J]. 上海交通大学学报（英文版）, 2014, 19(4): 455-465.

JENG Fuh-gwoa (郑富国), LIN Kai-siangb (林恺翔), LIN Chih-hungc (林志鸿), CHEN Tzung-herb*(陈宗和). Visual Multi-Secret Sharing with Friendliness[J]. Journal of shanghai Jiaotong University (Science), 2014, 19(4): 455-465.

参考文献

[1] Naor M, Shamir A. Visual cryptography [J]. Lecture Notes in Computer Science, 2005, 950: 1-12.
[2] Kafri O, Keren E. Encryption of pictures and shaped by random grids [J]. Optics Letters, 1987,12(6): 377-379.
[3] Ateniese G, Blundo C, Santis A D, et al. Visual cryptography for general access structures [J]. Information Computation, 1996, 129(2): 86-106.
[4] Ateniese G, Blundo C, Santis A D, et al. Extended capabilities for visual cryptography [J]. Theoretical Computer Science, 2001, 250(1-2): 143-161.
[5] Chen T H, Tsao K H. Visual secret sharing by random grids revisited [J]. Pattern Recognition, 2009,42(9): 2203-2217.
[6] Chen T H, Tsao K H. Threshold visual secret sharing by random grids [J]. Journal of Systems and Software,2011, 84(7): 1197-1208.
[7] Lee Y S, Wang B J, Chent H. Quality-improved threshold visual secret sharing scheme by random grids [J]. IET Image Processing, 2013, 7(2): 137-143.
[8] Shyu S J. Image encryption by random grids [J]. Pattern Recognition, 2007, 40(3): 1014-1031.
[9] Chen T H, Li K C. Multi-image encryption by circular random grids [J]. Information Sciences, 2012, 189:255-265.
[10] Chen T H, Tsao K H, Leey S. Yet another multipleimage encryption by rotating random grids [J]. Signal Processing, 2012, 92(9): 2229-2237.
[11] Shyu S J, Huang S Y, Lee Y K, et al. Sharing multiple secrets in visual cryptography [J]. Pattern Recognition,2007, 40(12): 3633-3651.
[12] Wu H C, Chang C C. Sharing visual multi-secrets using circle shares [J]. Computer Standards & Interfaces,2005, 28(1): 123-135.
[13] Wu Chen-chang. A study on visual cryptography [D].Hsinchu, China: Institute of Computer Science and Engineering, National Chiao Tung University, 1998 (in Chinese).
[14] Fang W P. Friendly progressive visual secret sharing[J]. Pattern Recognition, 2008, 41(4): 1410-1414.
[15] Chen T H, Tsao K H. User-friendly random-gridbased visual secret sharing [J]. IEEE Transactions on Circuits and Systems for Video Technology, 2011,21(11): 1693-1703.

Visual Multi-Secret Sharing with Friendliness

Visual Multi-Secret Sharing with Friendliness

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 9

编辑推荐

Metrics

本文评价

[1]	LI Guanyu (李冠玉), ZHANG Fengqin (张凤芹), LIU Qiegen (刘且根) . Distribution-Transformed Network for Impulse Noise Removal[J]. J Shanghai Jiaotong Univ Sci, 2021, 26(4): 543-553.
[2]	ZHOU Zhipeng, YIN Dong, DING Jinwen, LUO Yuhao, YUAN Mingyue, ZHU Chengfeng. Collaborative Tracking Method in Multi-Camera System[J]. J Shanghai Jiaotong Univ Sci, 2020, 25(6): 802-810.
[3]	AHSAN Muhammad, CAI Yunze (蔡云泽), ZHANG Weidong (张卫东). Information Extraction of Bionic Camera-Based Polarization Navigation Patterns Under Noisy Weather Conditions[J]. Journal of Shanghai Jiao Tong University (Science), 2020, 25(1): 18-26.
[4]	JIANG Yilin* (蒋伊琳), WANG Haiyan (王海艳), SHAO Ran (邵然), ZHANG Jianfeng (张建峰). Infrared Image Reconstruction Based on Archimedes Spiral Measurement Matrix[J]. Journal of Shanghai Jiao Tong University (Science), 2019, 24(2): 204-208.
[5]	XU Xiaoling (徐晓玲), LIU Yiling (刘沂玲), LIU Qiegen (刘且根),LU Hongyang (卢红阳), ZHANG M. Gradient-Based Low Rank Method for Highly Undersampled Magnetic Resonance Imaging Reconstruction[J]. sa, 2018, 23(3): 384-.
[6]	DUAN Fengfeng (段峰峰). Consistent Depth Maps Estimation from Binocular Stereo Video Sequence[J]. 上海交通大学学报（英文版）, 2016, 21(2): 184-191.
[7]	. [J]. Journal of Shanghai Jiao Tong University(Science), 2015, 20(6): 660-669.
[8]	GUO Tian-li (郭甜莉), LIU Qie-gen (刘且根), LUO Jian-hua* (骆建华). Filter Bank Based Nonlocal Means for Denoising Magnetic Resonance Images[J]. 上海交通大学学报（英文版）, 2014, 19(1): 72-78.
[9]	LI Jian1,2* (李剑), LI Sheng-hong1 (李生红), ZHENG Xu-ping1,2 (郑旭平). Active Approach for Tamper Detection with Robustness to Lossy Compression[J]. 上海交通大学学报（英文版）, 2013, 18(4): 385-393.