Komargodski et al. have shown an equivalence between (2,∞) -threshold secret sharing schemes (evolving schemes) and prefix codes for the integers. Their approach exploits the codewords of the prefix code to share the secret. In this paper we propose an alternative approach that exploits only the tree structure underlying the prefix code. The approach works equally well both for the finite case, that is for (2, n)-threshold schemes, and for the infinite case, that is for evolving 2-threshold schemes.
On the equivalence of 2-threshold secret sharing schemes and prefix codes
D’Arco, Paolo;De Prisco, Roberto;De Santis, Alfredo
2018-01-01
Abstract
Komargodski et al. have shown an equivalence between (2,∞) -threshold secret sharing schemes (evolving schemes) and prefix codes for the integers. Their approach exploits the codewords of the prefix code to share the secret. In this paper we propose an alternative approach that exploits only the tree structure underlying the prefix code. The approach works equally well both for the finite case, that is for (2, n)-threshold schemes, and for the infinite case, that is for evolving 2-threshold schemes.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
