An Optimal Multisecret Threshold Scheme Construction |
| |
Authors: | S G Barwick Wen-AI Jackson |
| |
Institution: | (1) Department of Pure Mathematics, University of Adelaide, Adelaide, 5005, Australia |
| |
Abstract: | A 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.
Communicated by: P. Wild |
| |
Keywords: | Secret sharing schemes multisecret schemes geometrical construction |
本文献已被 SpringerLink 等数据库收录! |