Optimal information ratio of secret sharing schemes on Dutch windmill graphs
| Autor: | Shahrooz Janbaz, Ali Zaghian, Bagher Bagherpour |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
TheoryofComputation_MISCELLANEOUS
Vertex (graph theory) Algebra and Number Theory Theoretical computer science Computer Networks and Communications Applied Mathematics Microbiology Secret sharing Graph Information ratio Windmill graph Discrete Mathematics and Combinatorics MathematicsofComputing_DISCRETEMATHEMATICS Computer Science::Cryptography and Security Access structure Windmill Mathematics |
| Zdroj: | Advances in Mathematics of Communications. 13:89-99 |
| ISSN: | 1930-5338 |
| DOI: | 10.3934/amc.2019005 |
| Popis: | One of the basic problems in secret sharing is to determine the exact values of the information ratio of the access structures. This task is important from the practical point of view, since the security of any system degrades as the amount of secret information increases. A Dutch windmill graph consists of the edge-disjoint cycles such that all of them meet in one vertex. In this paper, we determine the exact information ratio of secret sharing schemes on the Dutch windmill graphs. Furthermore, we determine the exact ratio of some related graph families. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|