All-in-one visual and computer decoding of multiple secrets: Translated-flip VC with polynomial-style sharing

Chia Hua Wu, Suiang Shyan Lee, Chih-Ching Lin*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Scopus citations


This all-in-one hiding method creates two transparencies that have several decoding options: visual decoding with or without translation flipping and computer decoding. In visual decoding, two less-important (or fake) binary secret images S1 and S2 can be revealed. S1 is viewed by the direct stacking of two transparencies. S2 is viewed by flipping one transparency and translating the other to a specified coordinate before stacking. Finally, important/true secret files can be decrypted by a computer using the information extracted from transparencies. The encoding process to hide this information includes the translated-flip visual cryptography, block types, the ways to use polynomial-style sharing, and linear congruential generator. If a thief obtained both transparencies, which are stored in distinct places, he still needs to find the values of keys used in computer decoding to break through after viewing S1 and/or S2 by stacking. However, the thief might just try every other kind of stacking and finally quit finding more secrets; for computer decoding is totally different from stacking decoding. Unlike traditional image hiding that uses images as host media, our method hides fine gray-level images in binary transparencies. Thus, our host media are transparencies. Comparisons and analysis are provided.

Original languageEnglish
Article number063106
JournalOptical Engineering
Issue number6
StatePublished - 1 Jun 2017


  • multiple decoding options
  • multiple secrets
  • polynomial-style sharing
  • visual cryptography

Fingerprint Dive into the research topics of 'All-in-one visual and computer decoding of multiple secrets: Translated-flip VC with polynomial-style sharing'. Together they form a unique fingerprint.

Cite this