| dc.creator | Cheraghi, Abbas | |
| dc.date | 2020-07-28 | |
| dc.date.accessioned | 2020-07-29T16:38:01Z | |
| dc.date.available | 2020-07-29T16:38:01Z | |
| dc.identifier | https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/4324 | |
| dc.identifier | 10.22199/issn.0717-6279-2020-04-0063 | |
| dc.identifier.uri | https://revistaschilenas.uchile.cl/handle/2250/147151 | |
| dc.description | 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. | en-US |
| dc.format | application/pdf | |
| dc.language | eng | |
| dc.publisher | Universidad Católica del Norte. | en-US |
| dc.relation | https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/4324/3502 | |
| dc.rights | Copyright (c) 2020 Abbas Cheraghi | en-US |
| dc.rights | http://creativecommons.org/licenses/by/4.0 | en-US |
| dc.source | Proyecciones (Antofagasta, On line); Vol. 39 No. 4 (2020): Special Issue: Mathematical Computation in Combinatorics and Graph Theory; 1005-1017 | en-US |
| dc.source | Proyecciones. Revista de Matemática; Vol. 39 Núm. 4 (2020): Special Issue: Mathematical Computation in Combinatorics and Graph Theory; 1005-1017 | es-ES |
| dc.source | 0717-6279 | |
| dc.source | 10.22199/issn.0717-6279-2020-04 | |
| dc.subject | Graph access structure | en-US |
| dc.subject | Perfect secret sharing scheme | en-US |
| dc.subject | Information rate | en-US |
| dc.subject | 18A10 | en-US |
| dc.subject | Graphs, diagram schemes, precategories | en-US |
| dc.subject | 94A62 | en-US |
| dc.subject | Authentication, digital signatures and secret sharing | en-US |
| dc.title | The lower bound and exact value of the information rate of some developed graph access structures | en-US |
| dc.type | info:eu-repo/semantics/article | |
| dc.type | info:eu-repo/semantics/publishedVersion | |
| dc.type | Peer-reviewed Article | en-US |
| dc.type | text | en-US |
