Randomness in Multi-Secret Sharing Schemes
| dc.creator | Blundo,Carlo | |
| dc.creator | Masucci,Barbara | |
| dc.date | 1999 | |
| dc.date.accessioned | 2024-02-06T12:50:10Z | |
| dc.date.available | 2024-02-06T12:50:10Z | |
| dc.description | A multi-secret sharing scheme is a protocol to share a number of (arbitrarily related) secrets among a set of participants in such a way that only qualified sets of participants can recover the secrets, whereas non-qualified sets of participants might have partial information about them. In this paper we analyze the amount of randomness needed by multi-secret sharing schemes. Given an m-tuple of access structures, we give a lower bound on the number of random bits needed by multi-secret sharing schemes; the lower bound is expressed in terms of a combinatorial parameter that depends only upon the access structures and not on the particular multi-secret sharing scheme used. | |
| dc.format | text/html | |
| dc.identifier | https://doi.org/10.3217/jucs-005-07-0367 | |
| dc.identifier | https://lib.jucs.org/article/27569/ | |
| dc.identifier.uri | https://openrepository.mephi.ru/handle/123456789/7591 | |
| dc.language | en | |
| dc.publisher | Journal of Universal Computer Science | |
| dc.relation | info:eu-repo/semantics/altIdentifier/eissn/0948-6968 | |
| dc.relation | info:eu-repo/semantics/altIdentifier/pissn/0948-695X | |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.rights | J.UCS License | |
| dc.source | JUCS - Journal of Universal Computer Science 5(7): 367-389 | |
| dc.subject | data security | |
| dc.subject | cryptography | |
| dc.subject | randomness | |
| dc.subject | secret sharing schemes | |
| dc.title | Randomness in Multi-Secret Sharing Schemes | |
| dc.type | Research Article |