Computer Science – Cryptography and Security
Scientific paper
2010-01-12
International Journal of Computer Science and Information Security, Vol. 8, No.1, pp. 234-237, Apr. 2010
Computer Science
Cryptography and Security
Added a new section demonstrating two new kinds of attack; 10 pages
Scientific paper
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 secrets. We also propose two new methods of attack which are valid under certain assumptions and observe that it is the elimination of random values that facilitates these kinds of attacks.
Nagaraj Nithin
Rajan Siddharth
Sahasranand K. R.
No associations
LandOfFree
How not to share a set of secrets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with How not to share a set of secrets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and How not to share a set of secrets will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-459276