An Efficient Robust Secret Sharing Scheme with Optimal Cheater Resiliency
Citations
238 citations
57 citations
14 citations
7 citations
6 citations
References
14,340 citations
"An Efficient Robust Secret Sharing ..." refers background or methods in this paper
...In case of up to t cheaters among n (≥ 3t+ 1) participants, it was observed by McEliece and Sarwate [21] that Shamir secret sharing scheme [26] is robust via its connection to Reed-Solomon codes....
[...]
...Suppose the dealer D wants to share the secret s with the help of a polynomial f(x) of degree at most t over a finite field F as in Shamir scheme [26]....
[...]
...Shamir [26] and Blakley [4] independently addressed this problem in 1979 when they introduced the concept of the threshold secret sharing....
[...]
10,083 citations
"An Efficient Robust Secret Sharing ..." refers background in this paper
..., f(xn)) is a codeword of Reed-Solomon error correcting code [19] of the message (a0, ....
[...]
3,184 citations
"An Efficient Robust Secret Sharing ..." refers background in this paper
...Shamir [26] and Blakley [4] independently addressed this problem in 1979 when they introduced the concept of the threshold secret sharing....
[...]
1,132 citations