To access the full text documents, please follow this link: http://hdl.handle.net/2117/9851

Ideal homogeneous access structures constructed from graphs
Herranz Sotoca, Javier
Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada IV
Starting from a new relation between graphs and secret sharing schemes introduced by Xiao, Liu and Zhang, we show a method to construct more general ideal homogeneous access structures. The method has some advantages: it efficiently gives an ideal homogeneous access structure for the desired rank, and some conditions can be imposed (such as forbidden or necessary subsets of players), even if the exact composition of the resulting access structure cannot be fully controlled. The number of homogeneous access structures that can be constructed in this way is quite limited; for example, we show that (t, l)-threshold access structures can be constructed from a graph only when t = 1, t = l - 1 or t = l.
2012-05-10
Àrees temàtiques de la UPC::Informàtica::Seguretat informàtica::Criptografia
Cryptography
Graph connectivity
Criptografia
Grafs, Teoria de
Open Access
Article
         

Show full item record

Related documents

Other documents of the same author

Herranz Sotoca, Javier; Nin Guerrero, Jordi
Di Crescenzo, Giovanni; Herranz Sotoca, Javier; Sáez Moreno, Germán
Herranz Sotoca, Javier; Ruiz Rodríguez, Alexandre; Sáez Moreno, Germán
 

Coordination

 

Supporters