Introduction In 1979 Blakley and Shamir gave protocols to solve problem known as (k,n) Threshold Secret Sharing A threshold secret sharing is said to be unconditionally secure if the probability of successful cheating is limited to a specify probability even if the cheaters are assumed to have infinite computational resources.
{}