© Institution of Engineering and Technology
In a multipartite access structure, the set of players is divided into K different classes in such a way that all players of the same class play the same role in the structure. Not many results are known about these structures, when K ≥ 3.Although the total characterisation of ideal multipartite access structures seems a very ambitious goal, we nevertheless take a first step in this direction. On the one hand, we detect some conditions that directly imply that a multipartite structure cannot be ideal. On the other hand, we introduce a new strategy which helps to prove that a multipartite access structure is ideal, and we apply this strategy to three wide families of multipartite access structures.
References
-
-
1)
-
Farràs, O., Martí-Farré, J., and Padró, C.: ‘Ideal multipartite secret sharing schemes’, 2006, manuscript available at http://eprint.iacr.org/2006/292/.
-
2)
-
Blakley, G.R.: `Safeguarding cryptographic keys', Proc. National Computer Conf., American Federation of Information, June 1979, New York, USA, p. 313–317.
-
3)
-
G.J. Simmons ,
W.A. Jackson ,
K.M. Martin
.
The geometry of secret sharing schemes.
Bull. ICA
,
71 -
88
-
4)
-
C. Padró ,
G. Sáez
.
Secret sharing schemes with bipartite access structure.
IEEE Trans. Inf. Theory
,
7 ,
2596 -
2604
-
5)
-
A. Shamir
.
How to share a secret.
Commun. ACM
-
6)
-
Tassa, T., Dyn, N.: `Multipartite secret sharing by bivariate interpolation', Proc. International Colloquium on Automata, Languages and Programming, Venice, Italy, Springer-Verlag, Berlin, p. 288–299.
-
7)
-
W.A. Jackson ,
K.M. Martin
.
Perfect secret sharing schemes on five players.
Des. Codes Cryptogr.
,
267 -
286
-
8)
-
S.L. Ng
.
Ideal secret sharing schemes with multipartite access structures.
IEE Proc. Commun.
,
2 ,
165 -
168
-
9)
-
Collins M.J.: ‘A note on ideal tripartite access structures’, 2002, manuscript available at http://eprint.iacr.org/2002/193/.
-
10)
-
C. Blundo ,
A. De Santis ,
D.R. Stinson ,
U. Vaccaro
.
Graph decompositions and secret sharing schemes.
J. Cryptol
,
1 ,
39 -
64
-
11)
-
P. Morillo ,
C. Padró ,
G. Sáez ,
J.L. Villar
.
Weighted threshold secret sharing schemes.
Inf. Process. Lett.
,
211 -
216
-
12)
-
C. Blundo ,
A. De Santis ,
L. Gargano ,
U. Vaccaro
.
Tight bounds on the information rate of secret sharing schemes.
Des. Codes Cryptogr.
,
107 -
122
-
13)
-
Tassa, T.: `Hierarchical threshold secret sharing', Proc. Theory of Cryptography Conf., February 2004, Cambridge, USA, Springer-Verlag, Berlin, p. 473–490.
-
14)
-
E.F. Brickell
.
Some ideal secret sharing schemes.
J. Combinat. Math. Combinat. Comput.
,
105 -
113
-
15)
-
Di Crescenzo, G., Galdi, C.: `Hypergraph decomposition and secret sharing', Proc. International Symp. on Algorithms and Computation, December 2003, Kyoto, Japan, Springer-Verlag, Berlin, p. 645–654.
-
16)
-
Beimel, A., Tassa, T., Weinreb, E.: `Characterizing ideal weighted threshold secret sharing', Proc. Theory of Cryptography Conf., February 2005, Cambridge, USA, Springer-Verlag, Berlin, p. 600–619.
-
17)
-
S.L. Ng ,
M. Walker
.
On the composition of matroids and ideal secret sharing schemes.
Des. Codes Cryptogr.
,
1 ,
49 -
67
http://iet.metastore.ingenta.com/content/journals/10.1049/ip-ifs_20060081
Related content
content/journals/10.1049/ip-ifs_20060081
pub_keyword,iet_inspecKeyword,pub_concept
6
6