Tight Bounds on the Information Rate of Secret Sharing Schemes

被引：89

作者：

Carlo Blundo

Alfredo De Santis

Roberto De Simone

Ugo Vaccaro

机构：

[1] Università di Salerno,Dipartimento di Informatica ed Applicazioni

来源：

Designs, Codes and Cryptography | 1997年 / 11卷 / 2期

关键词：

Secret Sharing; Data Security; Entropy; Information Rate; and Cryptography;

D O I：

10.1023/A:1008216403325

中图分类号：

学科分类号：

摘要：

A secret sharing scheme is a protocol by means of which a dealer distributes a secret s among a set of participants P in such a way that only qualified subsets of P can reconstruct the value of s whereas any other subset of P, non-qualified to know s, cannot determine anything about the value of the secret.

引用

页码：107 / 110

页数：3

共 29 条

[1]

Blakley G.R.(1979)Safeguarding Cryptographic Keys AFIPS Conference Proceedings 48 313-317

[2]

Blundo C.(1995)New Bounds on the Information Rate of Secret Sharing Schemes IEEE Trans. Inform. Theory 41 549-554

[3]

De Santis A.(1996)On the Information Rate of Secret Sharing Schemes Theoretical Computer Science 154 283-306

[4]

Giorgio Gaggia A.(1995)Graph Decomposition and Secret Sharing Schemes J. Cryptology 8 39-64

[5]

Vaccaro U.(1991)On the Classification of Ideal Secret Sharing Schemes J. Cryptology 4 123-134

[6]

Blundo C.(1992)Some Improved Bounds on the Information Rate of Perfect Secret Sharing Schemes J. Cryptology 5 153-166

[7]

De Santis A.(1993)On the Size of Shares for Secret Sharing Schemes J. Cryptology 6 157-168

[8]

Gargano L.(1995)On the Information Rate of Perfect Secret Sharing Schemes Design, Codes, and Cryptography 6 143-169

[9]

Vaccaro U.(1983)On Secret Sharing Systems IEEE Trans. Inform. Theory 29 35-41

[10]

Blundo C.(1993)New Secret Sharing Schemes from Old J. Combin. Math. Combin. Comput. 14 65-77

← 1 2 3 →