Lower bounds on the information rate of secret sharing schemes with homogeneous access structure

2002 ◽  
Vol 83 (6) ◽  
pp. 345-351 ◽  
Author(s):  
Carles Padró ◽  
Germán Sáez
Keyword(s):  
Lower Bounds ◽  
Secret Sharing ◽  
Information Rate ◽  
Secret Sharing Schemes ◽  
Access Structure

Secret Sharing Schemes from Linear Codes overFp + vFp

2016 ◽  
Vol 27 (05) ◽  
pp. 595-605 ◽  
Author(s):  
Xianfang Wang ◽  
Jian Gao ◽  
Fang-Wei Fu
Keyword(s):  
Secret Sharing ◽  
Linear Code ◽  
Linear Codes ◽  
Difficult Problem ◽  
Secret Sharing Schemes ◽  
Secret Sharing Scheme ◽  
Access Structure ◽  
Chain Ring ◽  
Sharing Scheme

In principle, every linear code can be used to construct a secret sharing scheme. However, determining the access structure of the scheme is a very difficult problem. In this paper, we study MacDonald codes over the finite non-chain ring [Formula: see text], where p is a prime and [Formula: see text]. We provide a method to construct a class of two-weight linear codes over the ring. Then, we determine the access structure of secret sharing schemes based on these codes.

Combinatorial lower bounds for secret sharing schemes

1996 ◽  
Vol 60 (6) ◽  
pp. 301-304 ◽  
Author(s):  
Kaoru Kurosawa ◽  
Koji Okada
Keyword(s):  
Lower Bounds ◽  
Secret Sharing ◽  
Secret Sharing Schemes

scholarly journals Lower Bounds for Monotone Span Programs

1994 ◽  
Vol 1 (46) ◽  
Author(s):  
Amos Beimel
Keyword(s):  
Lower Bounds ◽  
Secret Sharing ◽  
Algebraic Model ◽  
New Technique ◽  
Secret Sharing Schemes ◽  
Branching Programs ◽  
Model Of Computation ◽  
Monotone Span Programs ◽  
Span Programs ◽  
A New Technique

The model of span programs is a linear algebraic model of computation. Lower bounds for span programs imply lower bounds for contact schemes, symmetric branching programs and for formula size. Monotone span programs correspond also to linear secret-sharing schemes. We present a new technique for proving lower bounds for monotone span programs. The main result proved here yields quadratic lower bounds for the size of monotone span programs, improving on the largest previously known bounds for explicit functions. The bound is asymptotically tight for the function corresponding to a class of 4-cliques.

Sign in / Sign up

Export Citation Format

Share Document