Name
Title | ||
|---|---|---|
An Application Of Covering Designs: Determining The Maximum Consistent Set Of Shares In A Threshold Scheme |
Abstract | ||
|---|---|---|
The shares in a (k, n) Shamir threshold scheme consist of n points on some polynomial of degree at most k - 1. If one or more of the shares are faulty, then the secret may not be reconstructed correctly. Supposing that at most t of the n shares are faulty, we show how a suitably chosen covering design can be used to compute the correct secret. We review known results on coverings of the desired type, and give some new constructions. We also consider a randomized algorithm for the same problem. and compare it with the deterministic algorithm obtained by using a particular class of coverings. |
Year | Venue | Field |
|---|---|---|
1999 | ARS COMBINATORIA | Randomized algorithm,Discrete mathematics,Combinatorics,Polynomial,Deterministic algorithm,Mathematics |
DocType | Volume | ISSN |
Journal | 53 | 0381-7032 |
Citations | PageRank | References |
15 | 1.42 | 2 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rolf S Rees | 1 | 81 | 9.40 |
| Douglas R. Stinson | 2 | 2387 | 274.83 |
| Ruizhong Wei | 3 | 168 | 27.42 |
| G. H. John Van Rees | 4 | 46 | 7.64 |