Author/Authors :
Wataru Kishimoto، نويسنده , , Koji Okada، نويسنده , , Kaoru Kurosawa، نويسنده , , Wakaha Ogata، نويسنده ,
Abstract :
In anonymous secret sharing schemes, the secret can be reconstructed without knowledge of which participants hold which shares. In this paper, we derive a tighter lower bound on the size of the shares than the bound of Blundo and Stinson for anonymous (k,n)-threshold schemes with 1
Keywords :
Cryptography , Secret sharing scheme , Anonymous , Steiner system
Journal title :
Discrete Applied Mathematics
Journal title :
Discrete Applied Mathematics