Ideal homogeneous access structures constructed from graphs

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, a...

Full description

Bibliographic Details
Author: Herranz Sotoca, Javier|||0000-0001-5141-7234
Format: article
Publication Date:2009
Country:España
Institution:Universitat Politècnica de Catalunya (UPC)
Repository:UPCommons. Portal del coneixement obert de la UPC
Language:English
OAI Identifier:oai:upcommons.upc.edu:2117/9851
Online Access:https://hdl.handle.net/2117/9851
https://dx.doi.org/10.3217/jucs-015-14-2881
Access Level:Open access
Keyword:Cryptography
Graph connectivity
Criptografia
Grafs, Teoria de
Àrees temàtiques de la UPC::Informàtica::Seguretat informàtica::Criptografia
id ES_965c8bfb92f71811ad73f7409e92b29d
oai_identifier_str oai:upcommons.upc.edu:2117/9851
network_acronym_str ES
network_name_str España
repository_id_str
spelling Ideal homogeneous access structures constructed from graphsHerranz Sotoca, Javier|||0000-0001-5141-7234CryptographyGraph connectivityCriptografiaGrafs, Teoria deÀrees temàtiques de la UPC::Informàtica::Seguretat informàtica::CriptografiaStarting 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.Peer Reviewed20092009-01-0120102010-10-20journal articlehttp://purl.org/coar/resource_type/c_6501VoRhttp://purl.org/coar/version/c_970fb48d4fbd8a85info:eu-repo/semantics/articleapplication/pdfhttps://hdl.handle.net/2117/9851https://dx.doi.org/10.3217/jucs-015-14-2881reponame:UPCommons. Portal del coneixement obert de la UPCinstname:Universitat Politècnica de Catalunya (UPC)Inglésengopen accesshttp://purl.org/coar/access_right/c_abf2info:eu-repo/semantics/openAccessoai:upcommons.upc.edu:2117/98512026-05-27T15:37:01Z
dc.title.none.fl_str_mv Ideal homogeneous access structures constructed from graphs
title Ideal homogeneous access structures constructed from graphs
spellingShingle Ideal homogeneous access structures constructed from graphs
Herranz Sotoca, Javier|||0000-0001-5141-7234
Cryptography
Graph connectivity
Criptografia
Grafs, Teoria de
Àrees temàtiques de la UPC::Informàtica::Seguretat informàtica::Criptografia
title_short Ideal homogeneous access structures constructed from graphs
title_full Ideal homogeneous access structures constructed from graphs
title_fullStr Ideal homogeneous access structures constructed from graphs
title_full_unstemmed Ideal homogeneous access structures constructed from graphs
title_sort Ideal homogeneous access structures constructed from graphs
dc.creator.none.fl_str_mv Herranz Sotoca, Javier|||0000-0001-5141-7234
author Herranz Sotoca, Javier|||0000-0001-5141-7234
author_facet Herranz Sotoca, Javier|||0000-0001-5141-7234
author_role author
dc.subject.none.fl_str_mv Cryptography
Graph connectivity
Criptografia
Grafs, Teoria de
Àrees temàtiques de la UPC::Informàtica::Seguretat informàtica::Criptografia
topic Cryptography
Graph connectivity
Criptografia
Grafs, Teoria de
Àrees temàtiques de la UPC::Informàtica::Seguretat informàtica::Criptografia
description 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.
publishDate 2009
dc.date.none.fl_str_mv 2009
2009-01-01
2010
2010-10-20
dc.type.none.fl_str_mv journal article
http://purl.org/coar/resource_type/c_6501
VoR
http://purl.org/coar/version/c_970fb48d4fbd8a85
dc.type.openaire.fl_str_mv info:eu-repo/semantics/article
format article
dc.identifier.none.fl_str_mv https://hdl.handle.net/2117/9851
https://dx.doi.org/10.3217/jucs-015-14-2881
url https://hdl.handle.net/2117/9851
https://dx.doi.org/10.3217/jucs-015-14-2881
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:UPCommons. Portal del coneixement obert de la UPC
instname:Universitat Politècnica de Catalunya (UPC)
instname_str Universitat Politècnica de Catalunya (UPC)
reponame_str UPCommons. Portal del coneixement obert de la UPC
collection UPCommons. Portal del coneixement obert de la UPC
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869413944228052992
score 15,198674

Similar Items