CryptoDB
A New family of Ideal Multipartite Access Structure Based on MSP
Authors: | |
---|---|
Download: | |
Abstract: | Any access structure is the multipartite access structure, The set of players is devided into K different entities, in such a way that all players of the same role in the multipartite access structure, we suppose there is a threshold access structure in every different entity, there is also a threshold access structure in K different entities, we consider their composite access structure, then a new family of Multipartite Access Structure will be given, we will provide secret shring scheme realizing it and prove it is ideal. |
BibTeX
@misc{eprint-2006-21830, title={A New family of Ideal Multipartite Access Structure Based on MSP}, booktitle={IACR Eprint archive}, keywords={applications / secret sharing}, url={http://eprint.iacr.org/2006/339}, note={ xujunxmu@126.com 13455 received 7 Oct 2006, last revised 2 Nov 2006, withdrawn 2 Nov 2006}, author={Jun Xu and Jiwen Zeng and Xiaomin Zha}, year=2006 }