Indexado en

Enlace externo

Licencia y uso

Citaciones

Altmetrics

Análisis de autorías institucional

Del Pozo ApAutor o Coautor

Compartir

Probabilistic secret sharing

Publicado en:Leibniz International Proceedings In Informatics, Lipics. 117 - 2018-01-01 117(), DOI: 10.4230/LIPIcs.MFCS.2018.64

Autores: D’Arco P; De Prisco R; De Santis A; Del Pozo AP; Vaccaro U

Afiliaciones

Resumen

In classical secret sharing schemes a dealer shares a secret among a set of participants in such a way that qualified subsets can reconstruct the secret, while forbidden ones do not get any kind of information about it. The basic parameter to optimize is the size of the shares, that is, the amount of secret information that the dealer has to give to participants. In this paper we formalize a notion of probabilistic secret sharing schemes, in which qualified subsets can reconstruct the secret but only with a certain controlled probability. We show that, by allowing a bounded error in the reconstruction of the secret, it is possible to drastically reduce the size of the shares the participants get (with respect to classical secret sharing schemes). We provide efficient constructions both for threshold access structures on a finite set of participants and for evolving threshold access structures, where the set of participants is potentially infinite. Some of our constructions yield shares of constant size (i.e., not depending on the number of participants) and an error probability of successfully reconstructing the secret which can be made as close to 1 as desired. © Paolo D’Arco, Roberto De Prisco, Alfredo De Santis, Angel Pérez del Pozo, and Ugo Vaccaro.

Palabras clave