Optimal non-perfect uniform secret sharing schemes
Tipus de documentText en actes de congrés
Condicions d'accésAccés obert
A secret sharing scheme is non-perfect if some subsets of participants that cannot recover the secret value have partial information about it. The information ratio of a secret sharing scheme is the ratio between the maximum length of the shares and the length of the secret. This work is dedicated to the search of bounds on the information ratio of non-perfect secret sharing schemes. To this end, we extend the known connections between polymatroids and perfect secret sharing schemes to the non-perfect case. In order to study non-perfect secret sharing schemes in all generality, we describe their structure through their access function, a real function that measures the amount of information that every subset of participants obtains about the secret value. We prove that there exists a secret sharing scheme for every access function. Uniform access functions, that is, the ones whose values depend only on the number of participants, generalize the threshold access structures. Our main result is to determine the optimal information ratio of the uniform access functions. Moreover, we present a construction of linear secret sharing schemes with optimal information ratio for the rational uniform access functions.
CitacióFarràs Ventura, O., Hansen, T., Kaced, T., Padro, C. Optimal non-perfect uniform secret sharing schemes. A: Annual International Cryptology Conference. "Advances in Cryptology (CRYPTO 2014). 34th Annual Cryptology Conference: Santa Barbara, CA, USA: august 17-21, 2014: proceedings, part II". Santa Barbara, CA: Springer, 2014, p. 217-234.
Versió de l'editorhttps://link.springer.com/chapter/10.1007%2F978-3-662-44381-1_13