C. Blundo, A. De Santis, A. Gaggia, and U. Vaccaro, New Bounds on the Information Rate of Secret Sharing Schemes, IEEE Transactions on Information Theory, to appear. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Secret Sharing Schemes with Veto Capabilities - Blundo, De Santis, Gargano.. (1994) (3 citations) Self-citation (Blundo De santis Vaccaro) (Correct)
No context found.
C. Blundo, A. De Santis, A. Gaggia, and U. Vaccaro, New Bounds on the Information Rate of Secret Sharing Schemes, IEEE Transactions on Information Theory, to appear.
Tight Bounds on the Information Rate of Secret Sharing .. - Blundo, De Santis, De .. (1997) (6 citations) Self-citation (Blundo De santis Vaccaro) (Correct)
....of the basic issue in the area of secret sharing schemes is that of estimating the information rate of the scheme, that is, the ratio between the size of the secret and that of the largest share given to any participant. This problem has received considerable attention in the last few years (e.g. [1, 5, 4, 10, 11, 13, 14, 22]) The practical relevance of this issue is based on the following observations: Firstly, the security of any system tends to degrade as the amount of information that must be kept secret, i.e. the shares of the participants, increases. Secondly, if the shares given to participants are too long, ....
....Therefore, it is important to derive significative upper and lower bounds on the information rate of secret sharing schemes. The main tool to prove upper bounds on the information rate of secret sharing schemes is the information theoretic approach introduced in [11] and further developed in [4, 5, 13, 14] 1 . However, the different results obtained so far seems to have used rather ad hoc proof techniques, limiting themselves to exhibit a particular access structure with small information rate. Therefore, it lacks a clear understanding of what makes an access structure to have necessarily small ....
C. Blundo, A. De Santis, A. Giorgio Gaggia, and U. Vaccaro, New Bounds on the Information Rate of Secret Sharing Schemes, IEEE Trans. on Inform. Theory, vol. IT-41, No. 2, pp. 549--554, March 1995.
On the Information Rate of Secret Sharing Schemes - Blundo, De Santis, Gargano.. (1992) (24 citations) Self-citation (Blundo De santis Vaccaro) (Correct)
....graph based access structure on n participants whose average information rate is upper bounded by 2= log n. It is proved in [44, Theorem 5.2] that the information rate for a graph on n vertices and maximum degree d is at least 2= d 1) This improves Theorems 4.2 and 4.3 for connected graphs. In [13] a construction technique is proposed to produce classes of access structures with information rate bounded away from 1. Finally, we mention that in the paper [11] it has been proved that if a secret sharing scheme Sigma for the access strucure A is perfect when one assumes a given probability ....
C. Blundo, A. De Santis, A. Giorgio Gaggia, and U. Vaccaro, New Bounds on the Information Rate of Secret Sharing Schemes, IEEE Transactions on Information Theory, Vol. 41, 1995.
Secret Sharing Schemes with Veto Capabilities - Blundo, De Santis, Gargano.. (1994) (3 citations) Self-citation (Blundo De santis Vaccaro) (Correct)
No context found.
C. Blundo, A. De Santis, A. Gaggia, and U. Vaccaro, New Bounds on the Information Rate of Secret Sharing Schemes, IEEE Transactions on Information Theory, to appear.
The Dealer's Random Bits in Perfect Secret Sharing Schemes - Csirmaz (1994) (11 citations) (Correct)
No context found.
C. Blundo, A. De Santis, A. G. Gaggia, U. Vaccaro, New Bounds on the Information Rate of Secret Sharing Schemes, Preprint, 1993
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC