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

Information Processing Letters

Volumn 83, Issue 6, 2002, Pages 345-351

  Padró, Carles ^a   Sáez, Germán ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Cryptography; Information rate; Secret sharing schemes

Indexed keywords

DATA PRIVACY; DATA TRANSFER; INFORMATION RETRIEVAL; OPTIMIZATION; SECURITY OF DATA; SET THEORY;

HOMOGENEOUS ACCESS STRUCTURES; SECRET SHARING SCHEMES;

CRYPTOGRAPHY;

EID: 0037200862     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(02)00213-2     Document Type: Article

References (18)

1. Safeguarding cryptographic keys
2. Generalized secret sharing and monotone functions
3. Tight bounds on the information rate of secret sharing schemes
4. Graph decompositions and secret sharing schemes
5. Some improved bounds on the information rate of perfect secret sharing schemes
6. On the size of shares of secret sharing schemes
7. Perfect secret sharing schemes on five participants
8. Weighted threshold secret sharing schemes
9. Secret sharing schemes with bipartite access structures
10. How to share a secret
11. An introduction to shared secret and/or shared control schemes and their application
12. An explication of secret sharing schemes
13. New general lower bounds on the information rate of secret sharing schemes
14. Decomposition constructions for secret-sharing schemes
15. Recursive constructions for perfect secret sharing schemes