5 citations · 9 across the 11 of their papers we have counts for
Showing cs.CRShow all
2 papers · 1 filter
cs.CR2010
Sharing Graphs
K. R. Sahasranand, Nithin Nagaraj
Almost all known secret sharing schemes work on numbers. Such methods will have difficulty in sharing graphs since the number of graphs increases exponentially with the number of n…
cs.CR2010★ 2 cited
How not to share a set of secrets
K. R. Sahasranand, Nithin Nagaraj, S. Rajan
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 choic…