A linear-code threshold changeable secret sharing scheme that masks shares with random multiples of q is claimed to be asymptotically perfect, but the security proofs ignore the reduced entropy of the dealer's randomness and the scheme leaks the secret.
Linear codes from perfect nonlinear mappings and their secret sharing schemes
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CR 1years
2019 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Threshold Changeable Secret Sharing Scheme and Its Application to Group Authentication
A linear-code threshold changeable secret sharing scheme that masks shares with random multiples of q is claimed to be asymptotically perfect, but the security proofs ignore the reduced entropy of the dealer's randomness and the scheme leaks the secret.