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
    1 Citations

    Tables and Topics from this paper

    Explore Further: Topics Discussed in This Paper

    New protocols of cognitive data management and sharing in cloud computing
    • 1

    References

    SHOWING 1-10 OF 11 REFERENCES
    Combinatorial repairability for threshold schemes
    • 7
    • PDF
    Designing Efficient Algorithms for Combinatorial Repairable Threshold Schemes
    • 1
    A survey and refinement of repairable threshold schemes
    • 4
    • PDF
    Generalized Secret Sharing and Monotone Functions
    • 640
    • PDF
    The Combinatorics of Network Reliability
    • 1,115
    Handbook of Combinatorial Designs
    • 735
    How to share a secret
    • 11,409
    • PDF
    Handbook of Combinatorial Designs, Second Edition, Chapman & Hall/CRC
    • 2007
    Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)
    • 91