Cheating Immune Threshold Visual Secret Sharing1

  • Authors:
  • Roberto De Prisco;Alfredo De Santis

  • Affiliations:
  • -;-

  • Venue:
  • The Computer Journal
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we consider the problem of cheating for visual cryptography schemes. Although the problem of cheating has been extensively studied for secret sharing schemes, little work has been done for visual secret sharing. We provide a formal definition of cheating for visual cryptography and new (2, n)-threshold and (n, n)-threshold schemes that are immune to deterministic cheating.