Corpus ID: 5477908

How not to share a set of secrets

@article{Sahasranand2010HowNT,
  title={How not to share a set of secrets},
  author={K. R. Sahasranand and Nithin Nagaraj and S. Rajan},
  journal={ArXiv},
  year={2010},
  volume={abs/1001.1877}
}
This note analyses one of the existing space efficient secret sharing schemes and suggests vulnerabilities in its design. We observe that the said algorithm fails for certain choices of the set of secrets and there is no reason for preferring this particular scheme over alternative schemes. The paper also elaborates the adoption of a scheme proposed by Hugo Krawczyk as an extension of Shamir's scheme, for a set of secrets. Such an implementation is space optimal and works for all choices of… Expand

Topics from this paper

Attacks to some verifiable multi-secret sharing schemes and two improved schemes
TLDR
This paper analyzes the security of several recently proposed verifiable multi-secret sharing schemes and shows that these schemes cannot withstand some deceptive behaviors of the dealer, and hence fails to satisfy the basic requirement of secure verifiable secret sharing schemes. Expand
Sharing Graphs
TLDR
A secret sharing scheme for graphs where the authors use graph intersection for reconstructing the secret which is hidden as a sub graph in the shares and achieves perfect secrecy for (2, n) scheme and requires far fewer operations compared to Shamir's algorithm. Expand

References

SHOWING 1-7 OF 7 REFERENCES
Secret Sharing Made Short
TLDR
An m-threshold scheme is presented, where m shares recover the secret but m - 1 shares give no (computational) information on the secret, in which shares corresponding to a secret S are of size |S|/m plus a short piece of information whose length does not depend on thesecret size but just in the security parameter. Expand
Space Efficient Secret Sharing: A Recursive Approach
This paper presents a recursive secret sharing technique that distributes k-1 secrets of length b each into n shares such that each share is effectively of length (n/(k-1))*b and any k pieces sufficeExpand
Space Efficient Secret Sharing
This note proposes a method of space efficient secret sharing i n which k secrets are mapped into n shares (nk) of the same size. Since, n can be chosen to be equal to k, the method is spaceExpand
How to share a secret
TLDR
This technique enables the construction of robust key management schemes for cryptographic systems that can function securely and reliably even when misfortunes destroy half the pieces and security breaches expose all but one of the remaining pieces. Expand
Space efficient secret sharing " , arXiv:0901.4798v2 [cs
  • CR] Feb
  • 2009
Vandermonde Determinant " From MathWorld–A Wolfram Web Resource
  • Vandermonde Determinant " From MathWorld–A Wolfram Web Resource