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 the first formal definition of cheating and new (2,n)-threshold and (n,n)-threshold visual cryptography schemes immune to deterministic cheating.
Cheating Immune Threshold Visual Secret Sharing
DE PRISCO, Roberto;DE SANTIS, Alfredo
2010-01-01
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 the first formal definition of cheating and new (2,n)-threshold and (n,n)-threshold visual cryptography schemes immune to deterministic cheating.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
