Tight Bounds on the Information Rate of Secret Sharing Schemes |
| |
Authors: | Carlo Blundo Alfredo De Santis Roberto De Simone Ugo Vaccaro |
| |
Institution: | (1) Dipartimento di Informatica ed Applicazioni, Università di Salerno, 84081 Baronissi (SA), Italy |
| |
Abstract: | 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.In this paper we provide a general technique to prove upper bounds on the information rate of secret sharing schemes. The information rate is the ratio between the size of the secret and the size of the largest share given to any participant. Most of the recent upper bounds on the information rate obtained in the literature can be seen as corollaries of our result. Moreover, we prove that for any integer d there exists a d-regular graph for which any secret sharing scheme has information rate upper bounded by 2/(d+1). This improves on van Dijk's result dik and matches the corresponding lower bound proved by Stinson in 22]. |
| |
Keywords: | Secret Sharing Data Security Entropy Information Rate and Cryptography |
本文献已被 SpringerLink 等数据库收录! |