A survey and refinement of repairable threshold schemes

DOI10.1515/jmc-2017-0058zbMath1391.94834OpenAlexW2794450234MaRDI QIDQ2413291

Thalia M. Laing, Douglas R. Stinson

Publication date: 10 April 2018

Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/jmc-2017-0058

zbMATH Keywords

threshold schemesregenerating codesrepairabilitycombinatorial designs

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Unnamed Item
• Unnamed Item
• A communication-privacy tradeoff for modular addition
• Combinatorial repairability for threshold schemes
• How to share a secret
• Combinatorial Designs
• Minimum Storage Regenerating Codes for All Parameters
• Information-Theoretically Secure Erasure Codes for Distributed Storage
• On secret sharing systems
• Network Coding for Distributed Storage Systems
• Securing Dynamic Distributed Storage Systems Against Eavesdropping and Adversarial Attacks
• Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction
• Explicit Constructions of High-Rate MDS Array Codes With Optimal Repair Bandwidth

This page was built for publication: A survey and refinement of repairable threshold schemes