A combinatorial characterization of regular anonymous perfect threshold schemes

Authors:
Ying Miao
Affiliations:
Institute of Policy and Planning Sciences, University of Tsukuba, Tsukuba 305-8573, Japan
Venue:
Information Processing Letters
Year:
2003

Citing 4
Cited 1

Design theory

Design theory
A combinatorial approach to threshold schemes

SIAM Journal on Discrete Mathematics
Combinatorial designs and cryptography

Surveys in combinatorics, 1993
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

Quantified Score

Hi-index	0.90

Visualization

Abstract

The notion of a regular anonymous perfect threshold scheme is introduced, and a combinatorial characterization for such a (2, w)-threshold scheme in terms of a regular difference family is given.