|
| | | | |
| | | |
| Stat |
Members: 3669
Articles: 2'599'751
Articles rated: 2609
24 March 2025 |
|
| | | | |
|
Article overview
| |
|
|
Combinatorial Repairability for Threshold Schemes | | Douglas R. Stinson
; Ruizhong Wei
; | | Date: |
5 Sep 2016 | | Abstract: | In this paper, we consider methods whereby a subset of players in a
$(k,n)$-threshold scheme can "repair" another player’s share in the event that
their share has been lost or corrupted. This will take place without the
participation of the dealer who set up the scheme. The repairing protocol
should not compromise the (unconditional) security of the threshold scheme, and
it should be efficient, where efficiency is measured in terms of the amount of
information exchanged during the repairing process. We study two approaches to
repairing. The first method is based on the "enrollment protocol" from
cite{NSG} which was originally developed to add a new player to a threshold
scheme (without the participation of the dealer) after the scheme was set up.
The second method distributes "multiple shares" to each player, as defined by a
suitable combinatorial design. This method results in larger shares, but lower
communication complexity, as compared to the first method. | | Source: | arXiv, 1609.1240 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
|
| |
|
|
|
REGISTER