Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2016, Article ID 9576074, 11 pages
http://dx.doi.org/10.1155/2016/9576074
Research Article

Secret Image Sharing Scheme with Threshold Changeable Capability

1School of Software Technology, Dalian University of Technology, Dalian 116620, China
2Key Laboratory for Ubiquitous Network and Service Software of Liaoning Province, Dalian 116620, China
3School of Computer and Technology, Hangzhou Dianzi University, Hangzhou 310018, China

Received 27 January 2016; Accepted 22 May 2016

Academic Editor: Nazrul Islam

Copyright © 2016 Lifeng Yuan et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. A. Shamir, “How to share a secret,” Communications of the Association for Computing Machinery, vol. 22, no. 11, pp. 612–613, 1979. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  2. G. R. Blakley, “Safeguarding cryptographic keys,” in Proceedings of the AFIPS National Computer Conference, pp. 313–317, New York, NY, USA, June 1979.
  3. M. Naor and A. Shamir, “Visual cryptography,” in Advances in Cryptology- Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques (EUROCRYPT '94), pp. 1–12, Perugia, Italy, 1994.
  4. C.-C. Lin and W.-H. Tsai, “Secret image sharing with steganography and authentication,” Journal of Systems and Software, vol. 73, no. 3, pp. 405–414, 2004. View at Publisher · View at Google Scholar · View at Scopus
  5. C.-N. Yang, T.-S. Chen, K. H. Yu, and C.-C. Wang, “Improvements of image sharing with steganography and authentication,” Journal of Systems and Software, vol. 80, no. 7, pp. 1070–1076, 2007. View at Publisher · View at Google Scholar · View at Scopus
  6. P.-Y. Lin, J.-S. Lee, and C.-C. Chang, “Distortion-free secret image sharing mechanism using modulus operator,” Pattern Recognition, vol. 42, no. 5, pp. 886–895, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  7. P.-Y. Lin and C.-S. Chan, “Invertible secret image sharing with steganography,” Pattern Recognition Letters, vol. 31, no. 13, pp. 1887–1893, 2010. View at Publisher · View at Google Scholar · View at Scopus
  8. C. Guo, C.-C. Chang, and C. Qin, “A hierarchical threshold secret image sharing,” Pattern Recognition Letters, vol. 33, no. 1, pp. 83–91, 2012. View at Publisher · View at Google Scholar · View at Scopus
  9. C. Guo, C.-C. Chang, and C. Qin, “A multi-threshold secret image sharing scheme based on MSP,” Pattern Recognition Letters, vol. 33, no. 12, pp. 1594–1600, 2012. View at Publisher · View at Google Scholar · View at Scopus
  10. M. Ulutas, G. Ulutas, and V. V. Nabiyev, “Invertible secret image sharing for gray level and dithered cover images,” Journal of Systems and Software, vol. 86, no. 2, pp. 485–500, 2013. View at Publisher · View at Google Scholar · View at Scopus
  11. N. Pakniat, M. Noroozi, and Z. Eslami, “Secret image sharing scheme with hierarchical threshold access structure,” Journal of Visual Communication and Image Representation, vol. 25, no. 5, pp. 1093–1101, 2014. View at Publisher · View at Google Scholar · View at Scopus
  12. C. S. Laih, L. Harn, J. Y. Lee, and T. Hwang, “Dynamic threshold scheme based on the definition of cross-product in an n-dimensional linear space,” Journal on Information Science and Engineering, vol. 7, no. 1, pp. 13–23, 1991. View at Google Scholar
  13. Y. Desmedt and S. Jajodia, “Redistributing secret shares to new access structures and its applications,” Tech. Rep. ISSE TR-97-01, George Mason University, Fairfax, Va, USA, 1997. View at Google Scholar
  14. L. Chen, D. Gollmann, and C. J. Mitchell, “Key escrow in mutually mistrusting domains,” in Security Protocols: International Workshop Cambridge, United Kingdom, April 10–12, 1996 Proceedings, vol. 1189 of Lecture Notes in Computer Science, pp. 139–153, Springer, Berlin, Germany, 1997. View at Publisher · View at Google Scholar
  15. K. M. Martin, R. Safavi-Naini, and H. Wang, “Bounds and techniques for efficient redistribution of secret shares to new access structures,” Computer Journal, vol. 42, no. 8, pp. 638–649, 1999. View at Publisher · View at Google Scholar · View at Scopus
  16. R. Steinfeld, J. Pieprzyk, and H. Wang, “Lattice-based threshold-changeability for standard CRT secret-sharing schemes,” Finite Fields and Their Applications, vol. 12, no. 4, pp. 653–680, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  17. H. A. Khorasgani, S. Asaad, T. Eghlidos, and M. Aref, “A lattice-based threshold secret sharing scheme,” in Proceedings of the 11th International ISC Conference on Information Security and Cryptology (ISCISC '14), pp. 173–179, Tehran, Iran, September 2014. View at Publisher · View at Google Scholar · View at Scopus
  18. R. Steinfeld, J. Pieprzyk, and H. Wang, “Lattice-based threshold changeability for standard shamir secret-sharing schemes,” IEEE Transactions on Information Theory, vol. 53, no. 7, pp. 2542–2559, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  19. C. Blundo, A. Cresti, A. De Santis, and U. Vaccaro, “Fully dynamic secret sharing schemes,” Theoretical Computer Science, vol. 165, no. 2, pp. 407–440, 1996. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  20. K. M. Martin, “Untrustworthy participants in perfect secret sharing schemes,” in Cryptography and Coding III, pp. 255–264, Oxford University Press, Oxford, UK, 1993. View at Google Scholar
  21. Z. Zhang, Y. M. Chee, S. Ling, M. Liu, and H. Wang, “Threshold changeable secret sharing schemes revisited,” Theoretical Computer Science, vol. 418, pp. 106–115, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  22. K. M. Martin, J. Pieprzyk, R. Safavi-Naini, and H. Wang, “Changing thresholds in the absence of secure channels,” Australian Computer Journal, vol. 31, no. 2, pp. 34–43, 1999. View at Google Scholar · View at Scopus
  23. S. G. Barwick, W.-A. Jackson, and K. M. Martin, “Updating the parameters of a threshold scheme by minimal broadcast,” IEEE Transactions on Information Theory, vol. 51, no. 2, pp. 620–633, 2005. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  24. H.-Y. Chien, J. Jinn-Ke, and Y. M. Tseng, “A practical (t, n) multi-secret sharing scheme,” IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, vol. 83, no. 12, pp. 2762–2765, 2000. View at Google Scholar
  25. C.-C. Chang, Y.-P. Hsieh, and C.-H. Lin, “Sharing secrets in stego images with authentication,” Pattern Recognition, vol. 41, no. 10, pp. 3130–3137, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  26. K. Kyriakopoulos and D. J. Parish, “A live system for wavelet compression of high speed computer network measurements,” in Proceedings of the 8th International Conference on Passive and Active Network Measurement, pp. 241–244, Louvain, Belgium, April 2007.
  27. B. Blakley, G. R. Blakley, A. H. Chan, and J. L. Massey, “Threshold schemes with disenrollment,” in Advances in Cryptology—CRYPTO '92, E. F. Brickell, Ed., vol. 740 of Lecture Notes in Computer Science, pp. 540–548, Springer, 1993. View at Publisher · View at Google Scholar
  28. K. M. Martin, “Dynamic access policies for unconditionally secure secret sharing schemes,” in Proceedings of the IEEE Information Theory Workshop on Theory and Practice in Information-Theoretic Security, pp. 61–66, Awaji Island, Japan, October 2005. View at Publisher · View at Google Scholar · View at Scopus