We continue a study of unconditionally secure all-or-nothing transforms (AONT) begun in [12]. An AONT is a bijective mapping that constructs s outputs from s inputs. We consider the security of t inputs, when s − t outputs are known. Previous work concerned the case t = 1; here we consider the problem for general t, focussing on the case t = 2. We investigate constructions of binary matrices fo...
