OPTIMAL INFORMATION RATIO OF SECRET SHARING SCHEMES ON DUTCH WINDMILL GRAPHS

被引：2
|
作者：
Bagherpour, Bagher [1 ]
Janbaz, Shahrooz [1 ]
Zaghian, Ali [1 ]
机构：
[1] Malek Ashtar Univ Technol, Appl Math & Cryptog Dept, Esfahan, Iran
来源：
ADVANCES IN MATHEMATICS OF COMMUNICATIONS | 2019年 / 13卷 / 01期
关键词：
Secret sharing; information ratio; access structure; Dutch windmill graphs;
D O I：
10.3934/amc.2019005
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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.
引用
收藏
页码：89 / 99
页数：11
相关论文
共 50 条
  • [1] Local bounds for the optimal information ratio of secret sharing schemes
    Farras, Oriol
    Ribes-Gonzalez, Jordi
    Ricci, Sara
    [J]. DESIGNS CODES AND CRYPTOGRAPHY, 2019, 87 (06) : 1323 - 1344
  • [2] Local bounds for the optimal information ratio of secret sharing schemes
    Oriol Farràs
    Jordi Ribes-González
    Sara Ricci
    [J]. Designs, Codes and Cryptography, 2019, 87 : 1323 - 1344
  • [3] The optimal average information ratio of secret-sharing schemes for the access structures based on unicycle graphs and bipartite graphs
    Lu, Hui-Chuan
    Fu, Hung-Lin
    [J]. DISCRETE APPLIED MATHEMATICS, 2017, 233 : 131 - 142
  • [4] Secret sharing schemes on graphs
    Csirmaz, Laszlo
    [J]. STUDIA SCIENTIARUM MATHEMATICARUM HUNGARICA, 2007, 44 (03) : 297 - 306
  • [5] Optimal Information Rate of Secret Sharing Schemes on Trees
    Csirmaz, Laszlo
    Tardos, Gabor
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (04) : 2527 - 2530
  • [6] On the Information Ratio of Non-perfect Secret Sharing Schemes
    Farras, Oriol
    Hansen, Torben Brandt
    Kaced, Tarik
    Padro, Carles
    [J]. ALGORITHMICA, 2017, 79 (04) : 987 - 1013
  • [7] On the Information Ratio of Non-perfect Secret Sharing Schemes
    Oriol Farràs
    Torben Brandt Hansen
    Tarik Kaced
    Carles Padró
    [J]. Algorithmica, 2017, 79 : 987 - 1013
  • [8] Efficient Secret Sharing Schemes Achieving Optimal Information Rate
    Wang, Yongge
    Desmedt, Yvo
    [J]. 2014 IEEE INFORMATION THEORY WORKSHOP (ITW), 2014, : 516 - 520
  • [9] Secret Sharing Schemes for Dense Forbidden Graphs
    Beimel, Amos
    Farras, Oriol
    Peter, Naty
    [J]. SECURITY AND CRYPTOGRAPHY FOR NETWORKS, SCN 2016, 2016, 9841 : 509 - 528
  • [10] Secret Sharing Schemes for Very Dense Graphs
    Beimel, Amos
    Farras, Oriol
    Mintz, Yuval
    [J]. ADVANCES IN CRYPTOLOGY - CRYPTO 2012, 2012, 7417 : 144 - 161
12345