The lower bound and exact value of the information rate of some developed graph access structures

Abstract: Various studies have focused on secret sharing schemes and in all of them, each shareholder is interested in a shorter share. The information rate of a secret sharing scheme shows the ratio between the size of the secret to the maximum number of shares given to each shareholder. In this re...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autor principal: Cheraghi,Abbas
Lenguaje:English
Publicado: Universidad Católica del Norte, Departamento de Matemáticas 2020
Materias:
Acceso en línea:http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172020000401005
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
id oai:scielo:S0716-09172020000401005
record_format dspace
spelling oai:scielo:S0716-091720200004010052020-08-13The lower bound and exact value of the information rate of some developed graph access structuresCheraghi,Abbas Graph access structure Perfect secret sharing scheme Information rate Abstract: Various studies have focused on secret sharing schemes and in all of them, each shareholder is interested in a shorter share. The information rate of a secret sharing scheme shows the ratio between the size of the secret to the maximum number of shares given to each shareholder. In this regard, the researchers investigated the optimal information rate of the graph access structure. This paper aims to discover the exact values for the optimal information rates of the two graph access structures, which remained as open problems in Van Dijk’s paper. Furthermore, we introduced the developed multipartite graph and the developed cycle graph and calculated the exact value of their optimal information rate. Moreover, we presented a lower bound on the information rate for other developed graph access structures.info:eu-repo/semantics/openAccessUniversidad Católica del Norte, Departamento de MatemáticasProyecciones (Antofagasta) v.39 n.4 20202020-08-01text/htmlhttp://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172020000401005en10.22199/issn.0717-6279-2020-04-0063
institution Scielo Chile
collection Scielo Chile
language English
topic Graph access structure
Perfect secret sharing scheme
Information rate
spellingShingle Graph access structure
Perfect secret sharing scheme
Information rate
Cheraghi,Abbas
The lower bound and exact value of the information rate of some developed graph access structures
description Abstract: Various studies have focused on secret sharing schemes and in all of them, each shareholder is interested in a shorter share. The information rate of a secret sharing scheme shows the ratio between the size of the secret to the maximum number of shares given to each shareholder. In this regard, the researchers investigated the optimal information rate of the graph access structure. This paper aims to discover the exact values for the optimal information rates of the two graph access structures, which remained as open problems in Van Dijk’s paper. Furthermore, we introduced the developed multipartite graph and the developed cycle graph and calculated the exact value of their optimal information rate. Moreover, we presented a lower bound on the information rate for other developed graph access structures.
author Cheraghi,Abbas
author_facet Cheraghi,Abbas
author_sort Cheraghi,Abbas
title The lower bound and exact value of the information rate of some developed graph access structures
title_short The lower bound and exact value of the information rate of some developed graph access structures
title_full The lower bound and exact value of the information rate of some developed graph access structures
title_fullStr The lower bound and exact value of the information rate of some developed graph access structures
title_full_unstemmed The lower bound and exact value of the information rate of some developed graph access structures
title_sort lower bound and exact value of the information rate of some developed graph access structures
publisher Universidad Católica del Norte, Departamento de Matemáticas
publishDate 2020
url http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172020000401005
work_keys_str_mv AT cheraghiabbas thelowerboundandexactvalueoftheinformationrateofsomedevelopedgraphaccessstructures
AT cheraghiabbas lowerboundandexactvalueoftheinformationrateofsomedevelopedgraphaccessstructures
_version_ 1718439879739703296