Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
On (k, n)*-visual cryptography scheme
Arumugam S., Lakshmanan R., Nagar A. Designs, Codes and Cryptography71 (1):153-162,2014.Type:Article
Date Reviewed: Jun 5 2014

Imagine you have several transparencies and they all have black and white regions or pixels. Each one of them may not show anything in particular, but stacked up, an image may be revealed. This is the gist of a visual cryptography scheme (VCS). In a (k, n)-VCS (2 ≤ kn), any set of less than k transparencies cannot reveal the image.

Several theorems are given that lead to two algorithms for constructing VCSs. One approach known in the literature is based on a cumulative array method. The second method is recursive in both the n and k parameters. The research presented gives several lower and upper bounds, laying the groundwork for shortcuts in the algorithms’ analyses, which will hopefully appear in an upcoming paper.

The paper is easy to follow due to the examples, and structured well so that readers can easily follow the exposition. While it may appear at first that this is a paper for mathematicians only, the examples make the research easy for nonmathematicians to understand.

So, we can hide a message with layers of transparencies and as long as one carrier does not have too many, the secret message will remain secret up until the time when a minimum of k of them are in one place.

Reviewer:  Goran Trajkovski Review #: CR142363 (1409-0770)
Bookmark and Share
  Featured Reviewer  
 
Set Theory (F.4.1 ... )
 
 
Mathematical Logic (F.4.1 )
 
Would you recommend this review?
yes
no
Other reviews under "Set Theory": Date
Set theory for computing: from decision procedures to declarative programming with sets
Cantone D., Omodeo E., Policriti A., Springer-Verlag New York, Inc., New York, NY, 2001.  409, Type: Book (9780387951973)
May 15 2002
Incomplete information: structure, inference, complexity
Demri S., Orlowska E., Orlowska E., Springer-Verlag New York, Inc., Secaucus, NJ, 2002.  450, Type: Book (9783540419044)
Jan 8 2003
Predicate abstraction of ANSI-C programs using SAT
Clarke E., Kroening D., Sharygina N., Yorav K. Formal Methods in System Design 25(2-3): 105-127, 2004. Type: Article
Apr 7 2005
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy