Secret Sharing Schemes with Nice Access Structures
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
A Proactive Secret Sharing Scheme in matrix projection method
International Journal of Security and Networks
Crypto topics and applications II
Algorithms and theory of computation handbook
Secret Sharing Schemes with Nice Access Structures
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
| Hi-index | 754.84 |
For the problem of cheaters in secret-sharing schemes, we introduce dcheat which is more appropriate than the minimum Hamming distance dmin of the related error-correcting code when it is needed only to recover the correct secret s (i.e., when it is not needed to identity the cheaters in the scheme). We then prove that d min⩽dcheat=n-max/B∉Γ|B| where Γ denotes the access structure