We present a new protocol for the verifiable redistribution of secrets from (m,n) to (m # ,n # ) access structures for threshold sharing schemes. Our protocol enables the addition or removal of shareholders and also guards against mobile adversaries that cause permanent damage. We observe that existing protocols either cannot be readily extended to allow redistribution between different access structures, or have vulnerabilities that allow faulty old shareholders to corrupt the shares of new shareholders. Our primary contribution is that, in our protocol, new shareholders can verify the validity of their shares after redistribution between different access structures. Keywords: threshold secret sharing, verification, proactive security
In this thesis, four different methods for secret sharing with threshold schemes will be investigate...
A multi-secret sharing scheme allows several secrets to be shared amongst a group of participants. I...
. A secret sharing scheme allows to share a secret among several participants such that only certain...
We present a new protocol for the verifiable redistribution of secrets from (m,n) to (m ′,n ′ ) acce...
We present a new protocol for verifiably redistributing secrets from an (m, n) threshold sharing sch...
We present a new protocol for verifiably redistributing secrets from an (m,n) threshold sharing sche...
Proactive secret sharing deals with refreshing secret shares, i.e., redistributing the shares of a s...
[[abstract]]In this paper, we propose a verifiable multi-secret sharing scheme. Some secrets are pro...
This paper studies the methods for changing thresholds in the absence of secure channels after the s...
This paper studies the methods for changing thresholds in the absence of secure channels after the s...
A secret sharing scheme starts with a secret and then derives from it certain shares (or shadows) wh...
Proactive secret sharing deals with refreshing secret shares, i.e., redistributing the shares of a s...
AbstractThis paper studies the methods for changing thresholds in the absence of secure channels aft...
Secret Sharing is a fundamental notion for secure cryptographic design. In a Secret Sharing protocol...
In this thesis, four different methods for secret sharing with threshold schemes will be investigate...
In this thesis, four different methods for secret sharing with threshold schemes will be investigate...
A multi-secret sharing scheme allows several secrets to be shared amongst a group of participants. I...
. A secret sharing scheme allows to share a secret among several participants such that only certain...
We present a new protocol for the verifiable redistribution of secrets from (m,n) to (m ′,n ′ ) acce...
We present a new protocol for verifiably redistributing secrets from an (m, n) threshold sharing sch...
We present a new protocol for verifiably redistributing secrets from an (m,n) threshold sharing sche...
Proactive secret sharing deals with refreshing secret shares, i.e., redistributing the shares of a s...
[[abstract]]In this paper, we propose a verifiable multi-secret sharing scheme. Some secrets are pro...
This paper studies the methods for changing thresholds in the absence of secure channels after the s...
This paper studies the methods for changing thresholds in the absence of secure channels after the s...
A secret sharing scheme starts with a secret and then derives from it certain shares (or shadows) wh...
Proactive secret sharing deals with refreshing secret shares, i.e., redistributing the shares of a s...
AbstractThis paper studies the methods for changing thresholds in the absence of secure channels aft...
Secret Sharing is a fundamental notion for secure cryptographic design. In a Secret Sharing protocol...
In this thesis, four different methods for secret sharing with threshold schemes will be investigate...
In this thesis, four different methods for secret sharing with threshold schemes will be investigate...
A multi-secret sharing scheme allows several secrets to be shared amongst a group of participants. I...
. A secret sharing scheme allows to share a secret among several participants such that only certain...