A Recursive Threshold Visual Cryptography Scheme

Free registration required

Executive Summary

Conventional secret sharing schemes, which have several networking applications, are information theoretically very inefficient. For example, a (k, n) secret sharing scheme expands a secret of b bits into n shares each of at least bits in size. Furthermore, since only of these shares are needed to recreate the secret, each bit of any share, in a threshold secret sharing schemes, conveys at most [1/k]bits of the secret. If k=n as in the case of a non-threshold scheme, where all the shares must be brought together to recreate the secret, the information conveyed by each bit of any share is [1/n] bits of the secret.

  • Format: PDF
  • Size: 121.87 KB