Geometric Structures, Cryptography and Security Systems Which Require a Quorum.

摘要

T-threshold schemes can be used to monitor a chain of operations which require a quorum, i.e., the assent of a certain number t of operators selected from among a fixed number k. Some of these schemes can be derived naturally from known finite geometric structures. In the known examples, although the cardinality of the blocks is always constant, there are nevertheless no known examples where t>5. We construct a new t-threshold scheme where t can be of any magnitude, but where the cardinality k of the blocks is variable. 22 refs.