• DOI:10.3934/amc.2019037
Corpus ID: 53218996

A Network Reliability Approach to the Analysis of Combinatorial Repairable Threshold Schemes

@article{Kacsmar2019ANR,
  title={A Network Reliability Approach to the Analysis of Combinatorial Repairable Threshold Schemes},
  author={Bailey Kacsmar and D. Stinson},
  journal={Adv. Math. Commun.},
  year={2019},
  volume={13},
  pages={601-612}
}

Bailey Kacsmar, D. Stinson

Published 2019

Computer Science, Mathematics

Adv. Math. Commun.

A repairable threshold scheme (which we abbreviate to RTS) is a $(\tau,n)$-threshold scheme in which a subset of players 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. Combinatorial repairable threshold schemes (or combinatorial RTS) were recently introduced by Stinson… CONTINUE READING

View PDF on arXiv

Save to Library

Create Alert

Cite

Launch Research Feed