Answers are grounded in this paper and cite their sources.
Two repairable threshold schemes show lower communication complexity in key sharing, suggesting improved performance.
In this paper, we construct two repairable threshold schemes (RTSs) using a resolvable balanced incomplete block design (RBIBD). First, a resolvable transversal design is given by mutually orthogonal Latin squares. Further, a RBIBD is obtained through the filling hole method, and two repairable key sharing threshold schemes based on the Ramp threshold scheme are constructed based on this design. Finally, the information rate, the repairing degree and the communication complexity of two RTSs are calculated, and the performance of the schemes is analyzed. Compared with the existing schemes, the results show that two schemes constructed in this paper have a higher information rate, a larger repairing degree and lower communication complexity.
No takes yet. Share an insight, caveat, or question.
Wang et al. (2025) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: