Secret sharing aims at efficiently distributing and sharing a secret among a number of participants, and the secret can be recovered on condition that pre-specified and authorization subsets of participants can pool their shares, otherwise, the secret cannot be recovered.
Published in Chapter:
Secret Sharing with k-Dimensional Access Structure
Guojun Wang (Central South University, China), Yirong Wu (Central South University, China), Geyong Min (University of Bradford, UK), and Ronghua Shi (Central South University, China)
Copyright: © 2009
|Pages: 10
DOI: 10.4018/978-1-60566-262-6.ch011
Abstract
Secret sharing aims at distributing and sharing a secret among a group of participants efficiently. In this chapter, we propose a plane-based access structure for secret sharing. Specifically, if any two among a set of three participants in a graph contain an edge, these participants constitute a prohibited structure which is not able to recover the master key. Otherwise, the set of three participants constitute an access structure which can recover the master key. Subsequently, we extend the plane-based scheme and propose a generic k-dimensional secret sharing scheme. Finally, we analyze the performance of the proposed scheme and reveal its advantages compared to existing schemes.