Skip to main content
SpringerLink
Log in

Basic Properties of the (t, n)-Threshold Visual Secret Sharing Scheme with Perfect Reconstruction of Black Pixels

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

In this paper we consider the (t, n)-threshold visual secret sharing scheme (VSSS) in which black pixels in a secret black-white images is reproduced perfectly as black pixels when we stack arbitrary t shares. This paper provides a new characterization of the (t, n)-threshold visual secret sharing scheme with such a property (hereafter, we call such a VSSS the (t, n)-PBVSSS for short). We use an algebraic method to characterize basis matrices of the (t, n)-PBVSSS in a certain class of matrices. We show that the set of all homogeneous polynomials each element of which yields basis matrices of the (t, n)-PBVSSS becomes a set of lattice points in an (n−t+1)-dimensional linear space. In addition, we prove that the optimal basis matrices in the sense of maximizing the relative difference among all the basis matrices in the class coincides with the basis matrices given by Blundo, Bonis and De Santis [3] for all n≥ t ≥ 2.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. C Blundo A Santis ParticleDe (1998) ArticleTitleVisual cryptography schemes with perfect reconstruction of black pixels Computer Graphics 22 IssueID4 449–455 Occurrence Handle10.1016/S0097-8493(98)00034-X

    Article  Google Scholar 

  2. C Blundo A Santis ParticleDe DR Stinson (1999) ArticleTitleOn the contrast in visual cryptography schemes J Cryptol 12 IssueID4 261–289 Occurrence Handle10.1007/s001459900057

    Article  Google Scholar 

  3. C Blundo A Bonis ParticleDe A Santis ParticleDe (2001) ArticleTitleImproved schemes for visual cryptography Designs, Codes, Cryptogr 24 255–278 Occurrence Handle10.1023/A:1011271120274

    Article  Google Scholar 

  4. C Blundo P D’Arco A Santis ParticleDe DR Stinson (2003) ArticleTitleContrast optimal threshold visual cryptography schemes SIAM J. Discrete Mathe 16 IssueID2 224–261 Occurrence Handle10.1137/S0895480198336683

    Article  Google Scholar 

  5. Choi CK, Yang SS, Park JH, Kohno R (1998) New construction for improving contrast in visual cryptography. Proc. of ISITA, Mexico City, Mexico pp 368–371

  6. Droste S (1996) New results on visual cryptography. Advance in Cryptology-CRYPT’96, LNCS 1109, Springer Verlag, pp 401–415.

  7. PA Eisen DA Stinson (2002) ArticleTitleThreshold visual cryptography schemes with specified whiteness levels of reconstructed pixels Designs, Codes Cryptogr 25 IssueID1 15–61 Occurrence Handle2003f:94059 Occurrence Handle10.1023/A:1012504516447

    Article  MathSciNet  Google Scholar 

  8. T Ishihara H Koga (2002) ArticleTitleNew constructions of the lattice-based visual secret sharing scheme using mixture of colors IEICE Trans Fundamentals E85-A IssueID1 158–166

    Google Scholar 

  9. T Hofmeister M Krause HU Simon (2000) ArticleTitleContrast-optimal k out of n secret sharing schems in visual cryptography Theoret Computer Sci 240 471–485 Occurrence Handle2001h:94022 Occurrence Handle10.1016/S0304-3975(99)00243-1

    Article  MathSciNet  Google Scholar 

  10. Kato T, Imai H (1996) An extended construction method of visual secret sharing scheme. IEICE Trans., J79-A(8), 1344–1351 (in Japanese)

  11. H Koga M Iwamoto H Yamamoto (2001) ArticleTitleAn analytic construction of the visual secret sharing scheme for color images IEICE Trans Fundamentals E84-A IssueID1 262–272

    Google Scholar 

  12. Koga H (2002) A general formula of the (t, n)-threshold visual secret sharing scheme. Advances in Cryptology-ASIACRYPT 2002, LNCS 2501, Springer-Verlag, pp 328–345.

  13. Koga H (2003) Construction of the contrast-optimal (t,n)-visual secret sharing scheme for black-white images. Proc of the 3rd Asia- Europe Workshop on Information Theory, Kamogawa, Japan pp 45–48

  14. M Krause HU Simon (2003) ArticleTitleDetermining the optimal contrast for secret sharing schemes in visual cryptography Combinatorics, Probability Computing 12 IssueID3 285–299 Occurrence Handle2004f:94065 Occurrence Handle10.1017/S096354830200559X

    Article  MathSciNet  Google Scholar 

  15. Kuhlmann C, Simon HU (2000) Construction of visual secret sharing schemes with almost optimal contrast. Proc. of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pp 262–272.

  16. H Kuwakado H Tanaka (2002) ArticleTitlePolynomial representation of visual secret sharing scheme and its application IEICE Trans Fundamentals E85-A IssueID6 1379–1386

    Google Scholar 

  17. Naor M, Shamir A (1994) Visual cryptography. Advances in Cryptology- EUROCRYPT’94, LNCS 950, Springer-Verlag, pp 1–12

  18. ER Verheul HCA Tilborg Particlevan (1997) ArticleTitleConstructions and properties of k out of n visual secret sharing schemes Designs, Codes, Cryptography 11 IssueID2 179–196 Occurrence Handle10.1023/A:1008280705142

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Graduate School of Systems and Information Engineering, University of Tsukuba, 1-1-1 Tennoudai, Tsukuba, Ibaraki, 305-8573, Japan

    Hiroki Koga & Etsuyo Ueda

Authors
  1. Hiroki Koga
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Etsuyo Ueda
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hiroki Koga.

Additional information

Communicated by H. van Tilborg

Rights and permissions

Reprints and permissions

About this article

Cite this article

Koga, H., Ueda, E. Basic Properties of the (t, n)-Threshold Visual Secret Sharing Scheme with Perfect Reconstruction of Black Pixels. Des Codes Crypt 40, 81–102 (2006). https://doi.org/10.1007/s10623-005-6700-y

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-005-6700-y

Keywords

Search

Navigation