ISSN 1000-1239 CN 11-1777/TP

• Paper • Previous Articles     Next Articles

An Efficient Secret Sharing Scheme Realizing Graph-Based Adversary Structures

Guo Yuanbo1,2, Ma Jianfeng1,3, Wang Yadi2   

  1. 1(The Ministry of Education Key Laboratory of Computer Networks and Information Security, Xidian University, Xi'an 710071) 2(School of Electronic Technology, I nformation Engineering University of PLA, Zhengzhou 450004) 3(School of Computi ng and Automatization, Tianjin Polytechnic University, Tianjin 300160)
  • Online:2005-05-15

Abstract: Most of the existing secret sharing schemes are constructed to realize general access structure, which is defined in term of authorized groups of participants, and is unable to be applied directly to the design of an intrusion tolerant syst em. Instead, the generalized adversary structure, which specifies the corruptibl e subsets of participants, can be determined directly by exploiting the system s etting and the attributes of all participants. An efficient secret sharing schem e realizing graph-based adversary structures is proposed. The scheme requires le ss computational costs and storage overhead than the existing ones. Furthermore, it is proved that the scheme satisfy both the required properties of the secret sharing scheme, i.e., the reconstruction property and the perfect property.

Key words: secret sharing, adversary structure, graph-based