Geometric shared secret and/or shared control schemes.

摘要

A shared secret scheme is normally specified in terms of a desired security, P(sub d), and a concurrence scheme, (Gamma). The concurrence scheme (aka access structure) identifies subsets of participants (also called trustees or shareholders) each of which should be able to cooperatively recover the secret and/or initiate the controlled action. The security requirement is expressed as the maximum acceptable probability, P(sub d), that the secret can be exposed or the controlled action initiated by a collection of persons that doesn't include at least one of the authorized subsets identified in the concurrence scheme. A concurrence scheme is said to be monotone if every set of participants that includes one or more sets from (Gamma) is also able to recover the secret. The treatment of these more general--and complicated--concurrence schemes is the primary objective of this paper. In this paper Simmons only concerns with unconditionally secure perfect monotone geometric shared secret schemes. 9 refs., 21 figs. (ERA citation 16:002429)