On the bound for anonymous secret sharing schemes

Authors:
Wataru Kishimoto;Koji Okada;Kaoru Kurosawa;Wakaha Ogata
Affiliations:
Department of Information and Image Sciences, Faculty of Engineering, Chiba University, 1-33 Yayoi-cho Inage-ku Chiba-shi, Chiba 263-8522, Japan;Department of Communication and Integrated Systems, Tokyo Institute of Technology, 2-12-1 Ookayama, Meguro-ku, Tokyo 152-8552, Japan;Department of Communication and Integrated Systems, Tokyo Institute of Technology, 2-12-1 Ookayama, Meguro-ku, Tokyo 152-8552, Japan;Center for Research in Advanced Financial Technology, Tokyo Institute of Technology, Tokyo, Japan
Venue:
Discrete Applied Mathematics
Year:
2002

Citing 5
Cited 2

A combinatorial approach to threshold schemes

SIAM Journal on Discrete Mathematics
Strongly ideal secret sharing schemes

Journal of Cryptology
Combinatorial lower bounds for secret sharing schemes

Information Processing Letters
Anonymous secret sharing schemes

Discrete Applied Mathematics
How to share a secret

Communications of the ACM

Weakly-private secret sharing schemes

TCC'07 Proceedings of the 4th conference on Theory of cryptography
On partial anonymity in secret sharing

EuroPKI'07 Proceedings of the 4th European conference on Public Key Infrastructure: theory and practice

Quantified Score

Hi-index	0.04

Visualization

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 k n. Our bound is tight for k = 2. We also show a close relationship between optimum anonymous (2, n)-threshold secret schemes and combinatorial designs.