A Monotone Circuit Construction for Individually-Secure Multi-Secret Sharing
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866913346621538304 |
|---|---|
| author | Bass, Cailyn Cohen, Alejandro D'Oliveira, Rafael G. L. Médard, Muriel |
| author_facet | Bass, Cailyn Cohen, Alejandro D'Oliveira, Rafael G. L. Médard, Muriel |
| contents | In this work, we introduce a new technique for taking a single-secret sharing scheme with a general access structure and transforming it into an individually secure multi-secret sharing scheme where every secret has the same general access structure. To increase the information rate, we consider Individual Security which guarantees zero mutual information with each secret individually, for any unauthorized subsets. Our approach involves identifying which shares of the single-secret sharing scheme can be replaced by linear combinations of messages. When $m-1$ shares are replaced, our scheme obtains an information rate of $m/|S|$, where $S$ is the set of shares. This provides an improvement over the information rate of $1/|S|$ in the original single-secret sharing scheme. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_06773 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A Monotone Circuit Construction for Individually-Secure Multi-Secret Sharing Bass, Cailyn Cohen, Alejandro D'Oliveira, Rafael G. L. Médard, Muriel Information Theory In this work, we introduce a new technique for taking a single-secret sharing scheme with a general access structure and transforming it into an individually secure multi-secret sharing scheme where every secret has the same general access structure. To increase the information rate, we consider Individual Security which guarantees zero mutual information with each secret individually, for any unauthorized subsets. Our approach involves identifying which shares of the single-secret sharing scheme can be replaced by linear combinations of messages. When $m-1$ shares are replaced, our scheme obtains an information rate of $m/|S|$, where $S$ is the set of shares. This provides an improvement over the information rate of $1/|S|$ in the original single-secret sharing scheme. |
| title | A Monotone Circuit Construction for Individually-Secure Multi-Secret Sharing |
| topic | Information Theory |
| url | https://arxiv.org/abs/2405.06773 |