skip to main content
research-article

A New Approach to Image Sharing with High-Security Threshold Structure

Authors Info & Claims
Published:17 December 2014Publication History
Skip Abstract Section

Abstract

Image sharing is an attractive research subject in computer image techniques and in the information security field. This article presents a novel scheme of image sharing with a (t, n) high-security threshold structure. The scheme can encode secret images into n shadow images in such a way that all the shadow images are in a perfect and ideal (t, n) threshold structure, while each shadow image has its own visual content assigned at random. The most common method to implement image sharing is based on interpolation polynomial over the field Fp={0, 1, 2,…, p-1} [Shamir 1979]. In this article, the authors present a new approach to image sharing and its computation based on algebraic-geometry code over the pixel value field GF(2m).

References

  1. G. Alvarez, A. H. Encinas, L. H. Encinas, and A. M. del Rey. 2005. A secure scheme to share secret color images. Comput. Phys. Commun. 173, 1, 9--16.Google ScholarGoogle ScholarCross RefCross Ref
  2. G. Ateniese, C. Blundo, A. De Santis, and D. R. Stinson. 1996a. Constructions and bounds for visual cryptography. Autom. Lang. Program. 1099, 416--428. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. G. Ateniese, C. Blundo, A. De Santis, and D. R. Stinson. 1996b. Visual cryptography for general access structures. Inf. Computat. 129, 2, 86--106. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. G. Ateniese, C. Blundo, A. De Santis, and D. R. Stinson. 2001. Extended capabilities for visual cryptography. Theoret. Comput. Sci. 250, 1--2, 143--161. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. D. Aucsmith. 1998. Information Hiding, Second International Workshop. Lecture Notes in Computer Science Series, vol. 1525, Springer-Verlag, Berlin, Germany. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. I. Blake, C. Heegard, T. Hoholdt, and V. Wei. 1998. Algebraic-geometric codes. IEEE Trans. Inf. Theory 44, 6, 2596--2618. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. G. R. Blakley. 1979. Safeguarding cryptographic keys. In Proceedings of the National Computer Conference. IEEE Computer Society, Los Alamitos, CA, 313--317.Google ScholarGoogle ScholarCross RefCross Ref
  8. G. R. Blakley and G. A. Kabatianski. 1995. Ideal perfect threshold schemes and MDS codes. In Proceedings of the IEEE International Symposium on Information Theory. IEEE, Los Alamitos, CA, 488.Google ScholarGoogle Scholar
  9. C. Blundo, A. D. Bonis, and A. De Santis. 2001. Improved schemes for visual cryptography. Designs, Codes Crypt. 24, 3, 255--278. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. C. Blundo and A. De Santis. 1998. Visual cryptography schemes with perfect reconstruction of black pixels. Comput. Graph. 22, 4, 449--455.Google ScholarGoogle ScholarCross RefCross Ref
  11. C. Blundo, A. De Santis, and M. Naor. 2000. Visual cryptography for grey level images. Inf. Proc. Lett. 75, 6, 255--259. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. R. Bose. 2003. Information Theory, Coding and Cryptography. McGraw-Hill Companies, Singapore.Google ScholarGoogle Scholar
  13. C. C. Chang and R. J. Hwang. 1998. Sharing secret images using shadow codebooks. Inf. Sci. 111, 1, 335--345. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. C. C. Chang, C. C. Lin, C. H. Lin, and Y. H. Chen. 2008. A novel secret image sharing scheme in color images using small shadow images. Inf. Sci. 178, 11, 2433--2447. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. C. C. Chang and I. C. Lin. 2003. A new (t, n) threshold image hiding scheme for sharing a secret color image. In Proceedings of the International Conference on Communication Technology (ICCT'03). IEEE, Los Alamitos, CA, 196--202.Google ScholarGoogle Scholar
  16. C. C. Chang, M. H. Lin, and Y. C. Hu. 2002. A fast and secure image hiding scheme based on LSB substitution. Int. J. Patt. Recog. Artif. Intell. 16, 4, 399--416.Google ScholarGoogle ScholarCross RefCross Ref
  17. S. Cimato, R. D. Prisco, and A. De Santis. 2006. Probabilistic visual cryptography schemes. Comput. J. 49, 1, 97--107. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. E. Dawson and D. Donovan. 1994. The breadth of shamir's secret-sharing scheme. Comput. Secur. 13, 1, 69--78. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. J. B. Feng, H. C. Wu, C. S. Tsai, and Y. P. Chu. 2005. A new multi-secret images sharing scheme using largrange's interpolation. J. Syst. Softw. 76, 3, 327--339. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. T. Furon and P. Duhamel. 2003. An asymmetric watermarking method. IEEE Trans. Signal Process. 51, 4, 981--995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Y. C. Hou. 2003. Visual cryptography for color images. Patt. Recog. 36, 7, 1619--1629.Google ScholarGoogle ScholarCross RefCross Ref
  22. Y. C. Hou, C. Y. Chang, and C. S. Hsu. 2001. Visual cryptography for color images without pixel expansion. In Proceedings of the International Conference on Imaging Science, Systems and Technology (CISST'01). Vol. 16, CSREA Press, Las Vegas, NV, 595--603.Google ScholarGoogle Scholar
  23. Y. C. Hou and S. F. Du. 2004. Visual cryptography techniques for color images without pixel expansion. J. Inf. Tech. Soc. 109, 1, 95--110.Google ScholarGoogle Scholar
  24. Y. C. Hou, F. Z. Lin, and Z. Y. Zhang. 2000. A new approach on 256 color secret image sharing technique. MIS Review 9, 89--105.Google ScholarGoogle Scholar
  25. R. Ito, H. Kuwakado, and H. Tanaka. 1999. Image size invariant visual cryptography. IEICE Trans. Fund. Electon. Commun. Comput. Sci. E Ser. A 82, 10, 2172--2177.Google ScholarGoogle Scholar
  26. S. Katzenbeisser and F. Petitolas. 2000. Information hiding techniques for steganography and digital watermarking. EDP Audit, Control, and Security Newslet. 28, 6, 1--2.Google ScholarGoogle Scholar
  27. R. Lidl, H. Niederreiter, and P. M. Cohn. 1997. Finite fields (2nd ed.). Cambridge University Press, Cambridge, UK. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. S. Lin and D. J. Costello. 2004. Error Control Coding: Fundamentals and Applications. Prentice-Hall, Englewood Cliffs, NJ. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. F. J. Macwilliams and N. J. A. Sloane. 1977. The Theory of Error-Correcting Codes. North-Holland Publishing Company, New York.Google ScholarGoogle Scholar
  30. J. L. Massey. 1993. Minimal codewords and secret sharing. In Proceedings of the 6th Joint Swedish-Russian International Workshop on Information Theory. Citeseer, 276--279.Google ScholarGoogle Scholar
  31. R. J. McEliece and D. V. Sarwate. 1981. On sharing secrets and reed-solomon codes. Commun. ACM 24, 9, 583--584. Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. M. Naor and A. Shamir. 1995. Visual cryptography. In Proceedings of Advances in Cryptology: Eurocrypt'94. Lecture Notes in Computer Science Series, vol. 950, Springer-Verlag, Berlin, Germany, 1--12.Google ScholarGoogle Scholar
  33. A. Shamir. 1979. How to share a secret. Commun. ACM 22, 11, 612--613. Google ScholarGoogle ScholarDigital LibraryDigital Library
  34. H. R. Sheikh and A. C. Bovik. 2006. Image information and visual quality. IEEE Trans. Image Process. 15, 2, 430--444. Google ScholarGoogle ScholarDigital LibraryDigital Library
  35. S. J. Shyu. 2006. Efficient visual secret sharing scheme for color images. Patt. Recog. 39, 5, 866--880. Google ScholarGoogle ScholarDigital LibraryDigital Library
  36. Z. M. Su and X. L. Lin. 1996. The arbitrary share of visual secrets. Chinese J. Comput. 19, 4, 293--299.Google ScholarGoogle Scholar
  37. C. C. Thein, W. P. Fang, and J. C. Lin. 2006. Sharing secret images by using base-transform and small-size host images. Int. J. Comput. Sci. Netw. Secur. 6, 7, 219--225.Google ScholarGoogle Scholar
  38. C. C. Thien and J. C. Lin. 2002. Secret image sharing. Comput. Graph. 26, 5, 765--770.Google ScholarGoogle Scholar
  39. C. C. Thien and J. C. Lin. 2003. An image-sharing method with user-friendly shadow images. IEEE Trans. Circ. Syst. Video Tech. 13, 12, 1161--1169. Google ScholarGoogle ScholarDigital LibraryDigital Library
  40. C. S. Tsai and C. C. Chang. 2001. A generalized secret image sharing and recovery scheme. In Proceedings of the Advances in Multimedia Information Processing (PCM'01). Lecture Notes in Computer Science. Springer-Verlag, Berlin, Germany, 963--968. Google ScholarGoogle ScholarDigital LibraryDigital Library
  41. C. S. Tsai, C. C. Chang, and T. S. Chen. 2002. Sharing multiple secrets in digital images. J. Syst. Softw. 64, 2, 163--170. Google ScholarGoogle ScholarDigital LibraryDigital Library
  42. M. Van Dijk. 1995. On the information rate of perfect secret sharing schemes. Designs, Codes Cryptograph. 6, 2, 143--169. Google ScholarGoogle ScholarDigital LibraryDigital Library
  43. D. Wang, L. Zhang, N. Ma, and X. Li. 2007. Two secret sharing schemes based on Boolean operations. Patt. Recog. 40, 10, 2776--2785. Google ScholarGoogle ScholarDigital LibraryDigital Library
  44. R. Z. Wang and C. H. Su 2006. Secret image sharing with smaller shadow images. Patt. Recog. Lett. 27, 6, 551--555. Google ScholarGoogle ScholarDigital LibraryDigital Library
  45. Z. Wang, A. C. Bovik, H. R. Sheikh, and E. P. Simoncelli. 2004. Image quality assessment: From error visibility to structural similarity. IEEE Trans. Image Process. 13, 4, 600--612. Google ScholarGoogle ScholarDigital LibraryDigital Library
  46. H. C. Wu, H. C. Wang, and R. W. Yu. 2008. Color visual cryptography scheme using meaningful shares. In Proceedings of the 8th International Conference on Intelligent Systems Design and Applications (ISDA'08). IEEE Computer Society, Los Alamitos, CA, 173--178. Google ScholarGoogle ScholarDigital LibraryDigital Library
  47. Y. S. Wu, C. C. Thien, and J. C. Lin. 2004. Sharing and hiding secret images with size constraint. Patt. Recog. 37, 7, 1377--1385.Google ScholarGoogle ScholarCross RefCross Ref
  48. C. N. Yang. 2004. New visual secret sharing schemes using probabilistic method. Patt. Recog. Lett. 25, 4, 481--494. Google ScholarGoogle ScholarDigital LibraryDigital Library
  49. Z. Zhou, G. R. Arce, and G. Di Crescenzo. 2006. Halftone visual cryptography. IEEE Trans. Image Process. 15, 8, 2441--2453. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. A New Approach to Image Sharing with High-Security Threshold Structure

                Recommendations

                Comments

                Login options

                Check if you have access through your login credentials or your institution to get full access on this article.

                Sign in

                Full Access

                • Published in

                  cover image Journal of the ACM
                  Journal of the ACM  Volume 61, Issue 6
                  November 2014
                  285 pages
                  ISSN:0004-5411
                  EISSN:1557-735X
                  DOI:10.1145/2700084
                  Issue’s Table of Contents

                  Copyright © 2014 ACM

                  Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

                  Publisher

                  Association for Computing Machinery

                  New York, NY, United States

                  Publication History

                  • Published: 17 December 2014
                  • Accepted: 1 June 2014
                  • Revised: 1 September 2012
                  • Received: 1 January 2011
                  Published in jacm Volume 61, Issue 6

                  Permissions

                  Request permissions about this article.

                  Request Permissions

                  Check for updates

                  Qualifiers

                  • research-article
                  • Research
                  • Refereed

                PDF Format

                View or Download as a PDF file.

                PDF

                eReader

                View online with eReader.

                eReader