Secret image sharing with smaller shadow sizes for general access structures
- 155 Downloads
In the area of secret image sharing (SIS), most papers focused on the schemes for threshold or some special access structures. Regarding general access structures (GAS), few results have been found in the literature. Two SIS schemes for GAS were proposed in 2001 and 2010, both are based on qualified sets. However, one distorts the reconstructed secret image, and some extra information is needed in both schemes. Here, we propose three polynomial based SIS schemes for GAS. Considering either qualified or forbidden sets, these schemes can reconstruct the secret image perfectly without any extra information needed. Some proof and analysis on the shadow sizes of the three schemes are given to lead us to choose the one with the smallest size. In addition, we also give some comparisons with two existing schemes, and security issue is also addressed in conclusion.
KeywordsShadow size Secret image sharing General access structure
This work was supported in part by the National Science Council project under Grant NSC 103-2221-E-009-121-MY2.
- 2.Benaloh J, Leichter J (1988) Generalized secret sharing and monotone functions. In: Advances in Cryptology-CRYPTO’88, LNCS 1988, vol 403, pp 27–36Google Scholar
- 3.Blakley GR (1979) Safeguarding cryptographic keys. In: Proceedings AFIPS 1979 National Computer Conference, 48, New York, USA, 4-7 June, pp 313–317Google Scholar
- 7.Ito M, Saito A, Nishizeki T (1987) Secret sharing schemes realizing general access structure. In: Proc. IEEE Global Telecommunication Conf. (Globecom 87), pp 99–102Google Scholar
- 9.Lin YT, Juan JST, Wang YC (2010) A secure and efficient multi-use multi-secret images sharing scheme for general access structure. Proc. of 8th IEEE International Conference on Industrial Informatics (INDIN2010), Osaka University, Osaka, Japan, July 13-16, pp 437–442Google Scholar