What is Visual Secret Sharing(VSS) Scheme ? (Conventional Secret Sharing Scheme )
(k, n) Scheme Description :
The (k, n) threshold scheme is a scheme which is designed to break the single master key to n different shadows, such that :
- the master key is recoverable from any k(k≦n) shadows
- and knowledge of k-1 or fewer shadows provide absolutely no information about
- Blakely’s scheme is a probabilistic approach based on linear projective geometry
G.R. Blakley, “Safeguarding cryptographic keys”, AFIPS conference proceedings, vol.48, pp.313-317, 1979.
- Shamir’s scheme is based on Lagrange interpolating polynomials
A. Shamir, “How to share a secret,” Commun. of th ACM, vol.22, pp.612-613, Nov. 1979.
- Asmuth-Bloom scheme is a method based on Chinese Remainder Theorem
A. Asmuth and J. Bloom, “A modular approach to key safeguarding,” IEEE Trans. On Information Theory, Vol. IT-29.547, pp.208-210, 1983.
NOTE : For recovering the share secret, this scheme needs :
- the knowledge of cryptography
- the cryptographic computations