Communications of the ACM
Practical secret sharing scheme realizing generalized adversary structure
Journal of Computer Science and Technology
A Multiple Secrets Sharing Scheme with General Access Structure
IUCE '09 Proceedings of the 2009 International Symposium on Intelligent Ubiquitous Computing and Education
A secret sharing scheme based on (t, n) threshold and adversary structure
International Journal of Information Security
Research note: An on-line secret sharing scheme for multi-secrets
Computer Communications
Research note: General secret sharing scheme
Computer Communications
| Hi-index | 0.09 |
On the basis of the properties of the Jordan matrix, we proposed a secret sharing scheme which can realize both the (t,n) threshold and the adversary structure and share a large secret while each participant has a short share. At the same time, the scheme can prevent the participants from cheating. The shares can be kept secret in the process of reconstruction and do not need to be renewed when the shared secret is changed. If n participants want to share a large secret using a short share such that t or more participants can reconstruct the shared secret and there are some subsets that each contain at least t participants that cannot reconstruct the shared secret, our scheme will be effective.