期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

一类秘密共享体制的信息率

Optimal Information Rate of a Kind of Secret Sharing Schemes
下载PDF
导出
摘要 文章研究了秘密共享体制的信息率。利用星覆盖的方法构造性地证明了以至多只有两个内点不与悬点相邻的树G为通道结构的秘密共享体制的最优信息率等于θ(G)2θ(G)-1,从而证明了关于树的信息率的猜想在这种情况下的正确性。 In this paper, we are interested in the optimal result is proved with the method of star-covering that schemes for access structure based on tree G which has information rates of secret sharing the optimal information rate of at most two internal vertices to schemes. The secret sharing adjacent to an end - vertex is equal toθ（G）/2θ（G）-1. Thus the correctness of the conjecture about the optimal information rates of trees is proved in such condition.
作者 刘弦
机构地区 信息工程大学理学院
出处 《信息工程大学学报》 2006年第2期128-131,共4页 Journal of Information Engineering University
关键词 秘密共享体制 最优信息率 树(图) secret sharing scheme optimal information rate tree （graph）
分类号 TN918 [电子电信—通信与信息系统]
  • 相关文献

参考文献8

  • 1R M Capocelli,A De Santis,L Gargano,U Vaccaro.On the size of shares for secret sharing schemes[J].Journal of Cryptology,1993,6:157-167.
  • 2C Blundo,A De Santis,L Gargano,U Vaccaro.On the information rate of secret sharing schemes[J].Advances in Cryptology-Crypto'92,Lecture Notes in Computer Science,Berlin:Springer-Verlag,1993,740:148-167.
  • 3C Blundo,A De Santis,D R Stinson,U Vaccaro.Garph decompositions and secret sharing schemes[J].Journal of Cryptology,1995,8:39-63.
  • 4E F Brickell,D M Davenport.On the classification of idel secret sharing schemes[J].Journal of Cryptology,1991,4:123-134.
  • 5E F Brickell,D R Stinson.Some improved bounds on the information rate of perfect secret sharing schemes[J].Journal of Cryptology,1992,5:153-166.
  • 6M van Dijk.On the information rate of perfect secret sharing schemes[J].Designs,Codes and Cryptography,1995,6:143-169.
  • 7刘弦,毕恺.树上秘密共享体制的信息率[J].高校应用数学学报（A辑）,2002,17(1):98-104. 被引量：1
  • 8Bollbas B.Graph Theory-An Introductory Course[M].Springer-Verlag,1979.

二级参考文献8

  • 1[1]Capocelli R M, de Santis A, Gargano L,et al.On the size of shares for secret sharing schemes[J].J.Cryptology,1993,6:157～167.
  • 2[2]Blundo C,de Santis A,Gargano L, et al.On the information rate of secret sharing schemes[A].In:Lecture Notes in Computer Science[C].Berlin:Springer-Verlag,1993,740:148～167.
  • 3[3]Blundo G,de Santis A,Stinson D R,et al.Garph decompositions and secret sharing schemes[J].J.Cryptology,1995,8:39～63.
  • 4[4]Brickell E F,Davenport D M,On the classification of ideal secret sharing schemes[J].J.Cryptology,1991,4:123～134.
  • 5[5]Brickell E F,Stinson D R.Some improved bounds on the information rate of perfect secret sharing schemes[J].J.Cryptology,1992,5:153～166.
  • 6[6]van Dijk M.On the information rate of perfect secret sharing schemes[J].Designs,Codes and Cryptography,1995,6:143～169.
  • 7[7]Csisar I and Korner J.Coding Theorems for Discrete Memoryless Systems[M].London:Academic Press,1981.
  • 8[8]Bollbas B.Graph Theory--An Introductory Course[M].New York:Springer-Verlag,1979.
信息工程大学学报
2006年 第2期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部