Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1007/978-3-540-30556-9_31guideproceedingsArticle/Chapter ViewAbstractPublication PagesConference Proceedingsacm-pubtype
Article

A new black and white visual cryptographic scheme for general access structures

Published: 20 December 2004 Publication History

Abstract

In this paper we introduce a new construction of a black and white visual cryptographic scheme for general access structure. We prove that our scheme gives a strong access structure. We find out the conditions for which our scheme gives less pixel expansion compared to the schemes given in Section 4.2 of [1]. We also propose a modified algorithm giving better result from the pixel expansion’s point of view. As a particular case of general access structure, we get (k,n) – VTS with 2 ≤ kn. The (n,n) – VTS obtained from our scheme attains the optimal pixel expansion and the relative contrast. We compare the (k,n) – VTS obtained from the schemes mentioned in Section 4.1 and Section 4.2 of [1] with the (k,n) – VTS obtained from our method and it has been shown that in almost all the cases our pixel expansion is less compared to the other two schemes.

References

[1]
G. Ateniese, C. Blundo, A. De Santis, and D.R. Stinson, Visual Cryptography for General Access Structures Information and Computation, vol.129, pp.86-106, 1996.
[2]
G. Ateniese, C. Blundo, A. De Santis, and D.R. Stinson, Constructions and Bounds for Visual Cryptography, in "23rd International Colloquim on Automata, Languages and Programming" (ICALP '96), F.M. auf der Heide and B. Monien Eds., Vol. 1099 of "Lecture Notes in Computer Science", Springer-Verlag, Berlin, pp. 416-428, 1996.
[3]
C. Blundo, A.De Santis, and D.R. Stinson, On the Contrast in Visual Cryptography Schemes, J. Cryptology, vol.12, no.4, pp.261-289, 1999.
[4]
C. Blundo, A.De Santis and M. Naor, Visual Cryptography for grey Level Images, Inf. Process. Lett., Vol. 75, Issue. 6, pp.255-259, 2001.
[5]
J. R. Bitner, G. Ehrlich, and E. M. Reingold, Efficient generation of the binary reflected Gray code, Communications of the ACM, 19, Issue 9, pp. 517-521, 1976.
[6]
S. Droste, New Results on Visual Cryptography, Advance in Cryptography-CRYPTO'96, Lecture Notes in Computer Science, 1109, pp. 401-415, Springer-Verlag, 1996.
[7]
H. Koga and H. Yamamoto, Proposal of a Lattice-Based Visual Secret Sharing Scheme for Color and Gray-Scale Images, IEICE Trans. Fundamentals, Vol. E81- A, No. 6 June 1998.
[8]
H. Koga and T. Ishihara, New Constructions of the Lattice-Based Visual Secret Sharing Scheme Using Mixture of Colors, IEICE Trans. Fundamentals, Vol. E85- A, No. 1 January 2002.
[9]
H. Koga, M. Iwamoto and H. Yamamoto, An Analytic Construction of the Visual Secret Scheme for Color Images, IEICE Trans. Fundamentals, Vol. E84-A, No.1 January 2001.
[10]
L. A. MacPherson, Grey Level Visual Cryptography for General Access Structures, Master's Thesis, University of Waterloo, 2002.
[11]
M. Naor and A. Shamir, Visual Cryptography, Advance in Cryptography, Eurocrypt' 94, Lecture Notes in Computer Science 950, pp. 1-12, Springer-Verlag, 1994.
[12]
V. Rijmen and B. Preneel, Efficient Colour Visual Encryption or "Shared Colors of Benetton", presented at EUROCRYPT '96 Rump Session.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings
INDOCRYPT'04: Proceedings of the 5th international conference on Cryptology in India
December 2004
429 pages
ISBN:3540241302

Sponsors

  • Dept. of Information Techn., Government of India: Department of Information Technology, Government of India
  • Dept. of Science and Techn., Government of India: Department of Science and Technology, Government of India
  • Electronics Corporation of India Limited: Electronics Corporation of India Limited
  • Bharat Electronics Limited: Bharat Electronics Limited
  • BRNS Secretariat, Bhabha Atomic Research Centre: BRNS Secretariat, Bhabha Atomic Research Centre

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 20 December 2004

Author Tags

  1. general access structure
  2. secret sharing scheme
  3. visual cryptography
  4. visual secret sharing scheme
  5. visual threshold scheme

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 20 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2020)Color Visual Cryptography Schemes Using Linear Algebraic Techniques over RingsInformation Systems Security10.1007/978-3-030-65610-2_13(198-217)Online publication date: 16-Dec-2020
  • (2019)Maximal contrast color visual secret sharing schemesDesigns, Codes and Cryptography10.1007/s10623-018-0570-687:7(1699-1711)Online publication date: 1-Jul-2019
  • (2017)Contrast Optimal XOR Based Visual Cryptographic SchemesInformation Theoretic Security10.1007/978-3-319-72089-0_4(58-72)Online publication date: 29-Nov-2017
  • (2016)Constructions and analysis of some efficient $$t$$t-$$(k,n)^*$$(k,n)ź-visual cryptographic schemes using linear algebraic techniquesDesigns, Codes and Cryptography10.1007/s10623-015-0075-580:1(165-196)Online publication date: 1-Jul-2016
  • (2014)On (k, n)*-visual cryptography schemeDesigns, Codes and Cryptography10.1007/s10623-012-9722-271:1(153-162)Online publication date: 1-Apr-2014
  • (2014)XOR Based Non-monotone t--Visual Cryptographic Schemes Using Linear AlgebraInformation and Communications Security10.1007/978-3-319-21966-0_17(230-242)Online publication date: 16-Dec-2014
  • (2013)On Visual Cryptography Scheme with Essential PartiesInformation Theoretic Security10.1007/978-3-319-04268-8_4(56-68)Online publication date: 28-Nov-2013

View Options

View options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media