In Distributed Secret Sharing schemes, secrets are encoded with shares distributed over multiple nodes of a network. Each involved party has access to a subset of the nodes and thus to a subset of the shares and is able to reconstruct a specific secret. Usually, these schemes are evaluated by measuring the required storage overhead, as well as the encoding and decoding complexities. In this paper, we provide new Distributed (multi) Secret Sharing Protocols for $(k,n)$-threshold access structures that improve on previous results, characterized by nearly-optimal storage overhead, achieving both storage optimality and a better encoding/decoding complexity. The protocols are also simpler than previous ones and allow for easier encoding.

Improved Protocols for Distributed Secret Sharing

R. De Prisco;A. De Santis;Palmieri F.
2022

Abstract

In Distributed Secret Sharing schemes, secrets are encoded with shares distributed over multiple nodes of a network. Each involved party has access to a subset of the nodes and thus to a subset of the shares and is able to reconstruct a specific secret. Usually, these schemes are evaluated by measuring the required storage overhead, as well as the encoding and decoding complexities. In this paper, we provide new Distributed (multi) Secret Sharing Protocols for $(k,n)$-threshold access structures that improve on previous results, characterized by nearly-optimal storage overhead, achieving both storage optimality and a better encoding/decoding complexity. The protocols are also simpler than previous ones and allow for easier encoding.
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.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11386/4806739
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? ND
social impact