Comments on Matrix-Based Secret Sharing Scheme for Images
Several attempts have been made to propose efficient secret sharing schemes for 2D images. Rey M.D (Iberoamerican Congress on Pattern Recognition, 2008) proposed a relatively fast image secret sharing scheme based on simple binary matrix operations. In this work, we show that care should be taken when choosing the matrices that corresponding to the shares, in particular if the rank of these singular matrices is not low enough then one can recover the secret image from only one share. Experimental results are provided to demonstrate the practicality of the recovery procedure on various 2D images.
KeywordsSecret sharing Image processing Cryptanalysis
- 4.Petitcolas, F.A.P., Anderson, R.J., Kuhn, M.G.: Information hiding-a survey. Proc. IEEE, Special Issue on Protection of Multimedia Content 87(7), 1062–1078 (1999)Google Scholar
- 6.Blakley, G.R.: Safeguarding cryptography keys. In: Proc. of the AFIPS 1979 National Computer Conference, vol. 48, pp. 313–317 (1979)Google Scholar
- 14.Bard, G.: Algorithms for the solution of linear and polynomial systems of equations over finite fields, with applications to cryptanalysis. PhD thesis, Department of Applied Mathematics and Scientific Computation, University of Maryland at College Park (2007)Google Scholar
- 16.William, S.: Sage Mathematics Software (Version 4.4.2). The Sage Group (2010), http://www.sagemath.org