Barwick, S.Jackson, W.2006-12-042006-12-042005Designs, Codes, and Cryptography, 2005; 37(3):367-3890925-10221573-7586http://hdl.handle.net/2440/17772The original publication can be found at www.springerlink.comA multisecret threshold scheme is a system which protects a number of secret keys among a group of n participants. There is a secret sK associated with every subset K of k participants such that any t participants in K can reconstruct the secret sK, but a subset of w participants cannot get any information about a secret they are not associated with. This paper gives a construction for the parameters t = 2, k = 3 and for any n and w that is optimal in the sense that participants hold the minimal amount of information.enSecret sharing schemes, multisecret schemes, geometrical constructionJournal article002005116410.1007/s10623-004-4031-z0002327606000012-s2.0-2724444098054534Barwick, S. [0000-0001-9492-0323]Jackson, W. [0000-0002-0894-0916]