Editing Visual cryptography (section)

== Cheating the (2, ''n'') visual secret sharing scheme ==
Horng et al. proposed a method that allows {{nowrap|''n'' − 1}} colluding parties to cheat an honest party in visual cryptography. They take advantage of knowing the underlying distribution of the pixels in the shares to create new shares that combine with existing shares to form a new secret message of the cheaters choosing.<ref>{{Cite journal |doi = 10.1007/s10623-005-6342-0|title = Cheating in Visual Cryptography|journal = Designs, Codes and Cryptography|volume = 38|issue = 2|pages = 219–236|year = 2006|last1 = Horng|first1 = Gwoboa|last2 = Chen|first2 = Tzungher|last3 = Tsai|first3 = Du-Shiau|s2cid = 2109660}}</ref>

We know that 2 shares are enough to decode the secret image using the human visual system. But examining two shares also gives some information about the 3rd share. For instance, colluding participants may examine their shares to determine when they both have black pixels and use that information to determine that another participant will also have a black pixel in that location. Knowing where black pixels exist in another party's share allows them to create a new share that will combine with the predicted share to form a new secret message. In this way a set of colluding parties that have enough shares to access the secret code can cheat other honest parties.