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
关键词
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
相关论文
共 24 条
  • [1] BENALOH J, 1990, LECT NOTES COMPUT SC, V403, P27
  • [2] Blakley G. R., 1979, 1979 International Workshop on Managing Requirements Knowledge (MARK), P313, DOI 10.1109/MARK.1979.8817296
  • [3] Tight Bounds on the Information Rate of Secret Sharing Schemes
    Carlo Blundo
    Alfredo De Santis
    Roberto De Simone
    Ugo Vaccaro
    [J]. Designs, Codes and Cryptography, 1997, 11 (2) : 107 - 110
  • [4] On the information rate of secret sharing schemes
    Blundo, C
    DeSantis, A
    Gargano, L
    Vaccaro, U
    [J]. THEORETICAL COMPUTER SCIENCE, 1996, 154 (02) : 283 - 306
  • [5] BLUNDO C, 1993, LNCS, V658, P1
  • [6] Brickell E. F., 1993, J CRYPTOL, V4, P157
  • [7] Capocelli R. M., 1993, Journal of Cryptology, V6, P157, DOI 10.1007/BF00198463
  • [8] Cover Thomas M, 2006, Elements of information theory
  • [9] The size of a share must be large
    Csirmaz, L
    [J]. JOURNAL OF CRYPTOLOGY, 1997, 10 (04) : 223 - 231
  • [10] Optimal Information Rate of Secret Sharing Schemes on Trees
    Csirmaz, Laszlo
    Tardos, Gabor
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (04) : 2527 - 2530