On the Power of Amortization in Secret Sharing: d-Uniform Secret Sharing and CDS with Constant Information Rate

2018 ◽  
pp. 317-344 ◽  
Author(s):  
Benny Applebaum ◽  
Barak Arkis
Keyword(s):  
Secret Sharing ◽  
Information Rate

New bounds on the information rate of secret sharing schemes

1995 ◽  
Vol 41 (2) ◽  
pp. 549-554 ◽  
Author(s):  
C. Blundo ◽  
A. De Santis ◽  
A.G. Gaggia ◽  
U. Vaccaro
Keyword(s):  
Secret Sharing ◽  
Information Rate ◽  
Secret Sharing Schemes

scholarly journals On the Information Rate of Secret Sharing Schemes

1993 ◽  
pp. 148-167 ◽  
Author(s):  
C. Blundo ◽  
A. De Santis ◽  
L. Gargano ◽  
U. Vaccaro
Keyword(s):  
Secret Sharing ◽  
Information Rate ◽  
Secret Sharing Schemes

Secret sharing schemes on graphs

2007 ◽  
Vol 44 (3) ◽  
pp. 297-306 ◽  
Author(s):  
László Csirmaz
Keyword(s):  
Secret Sharing ◽  
Constant Factor ◽  
Information Rate ◽  
Secret Sharing Schemes ◽  
Secret Sharing Scheme ◽  
Secret Data ◽  
Sharing Scheme ◽  
Dimensional Cube ◽  
Average Size ◽  
Average Information

Given a graph G , a perfect secret sharing scheme based on G is a method to distribute a secret data among the vertices of G , the participants , so that a subset of participants can recover the secret if they contain an edge of G , otherwise they can obtain no information regarding the key. The average information rate is the ratio of the size of the secret and the average size of the share a participant must remember. The information rate of G is the supremum of the information rates realizable by perfect secret sharing schemes.Based on the entropy-theoretical arguments due to Capocelli et al [4], and extending the results of M. van Dijk [7] and Blundo et al [2], we construct a graph Gn on n vertices with average information rate below < 4/log n . We obtain this result by determining, up to a constant factor, the average information rate of the d -dimensional cube.

Sign in / Sign up

Export Citation Format

Share Document