2017
DOI: 10.1007/s10623-017-0336-6
|View full text |Cite
|
Sign up to set email alerts
|

Combinatorial repairability for threshold schemes

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 tw… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
18
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 13 publications
(18 citation statements)
references
References 8 publications
0
18
0
Order By: Relevance
“…The master secret can be created from some or all of the SSs [36]. In this scheme, t specifies the minimum number of keys/secrets that allow reconfiguring MS [37,38]. This scheme consists of two phases: Generation and Reconstruction.…”
Section: Overview Of Security and Privacy Techniques In Ehr Systemsmentioning
confidence: 99%
“…The master secret can be created from some or all of the SSs [36]. In this scheme, t specifies the minimum number of keys/secrets that allow reconfiguring MS [37,38]. This scheme consists of two phases: Generation and Reconstruction.…”
Section: Overview Of Security and Privacy Techniques In Ehr Systemsmentioning
confidence: 99%
“…The paper [8] provides several constructions for combinatorial RTS. Different distribution designs are studied and analyzed according to various metrics.…”
Section: Repairing a Sharementioning
confidence: 99%
“…Stinson and Wei [8] examined several types of BIBDs with λ = 1 for use as distribution designs in combinatorial RTS. They studied the thresholds of these RTS as well as their efficiency with respect to storage, communication complexity and computational complexity.…”
Section: Using Bibds As Distribution Designsmentioning
confidence: 99%
See 1 more Smart Citation
“…-Secondly, it presents mechanisms for key reshare and share repair in case some of the original shares of the key are lost or compromised. For repairing lost shares, we use a repairable threshold scheme proposed in a recent paper by Stinson and Wei in [8]. -Thirdly, it proposes a secret share generation mechanism for devices with no memory applying fuzzy extractors to behaviometric information captured by the device sensors, improving the usability of the authentication protocol.…”
Section: Introductionmentioning
confidence: 99%