Laing, T.M. and Martin, K.M. and Paterson, Maura B. and Stinson, D.R. (2015) Localised multisecret sharing. Technical Report. Birkbeck, University of London, London, UK.
|
Text
26742.pdf - Draft Version Download (1MB) | Preview |
Abstract
localised multisecret sharing scheme is a multisecret sharing scheme for an ordered set of players in which players in the smallest sets who are authorised to access secrets are close together in the underlying ordering. We define threshold versions of localised multisecret sharing schemes, we provide lower bounds on the share size of perfect localised multisecret sharing schemes in an information theoretic setting, and we give explicit constructions of schemes to show that these bounds are tight. We then analyse a range of approaches to relaxing the model that provide trade-offs between the share size and the level of security guarantees provided by the scheme, in order to permit the construction of schemes with smaller shares. We show how these techniques can be used in the context of an application to key distribution for RFID-based supply-chain management motivated by the proposal of Juels, Pappu and Parno from USENIX 2008.
Metadata
| Item Type: | Monograph (Technical Report) |
|---|---|
| Additional Information: | Birkbeck Pure Mathematics Preprint Series #15 |
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Administrator |
| Date Deposited: | 22 Mar 2019 13:17 |
| Last Modified: | 09 Aug 2023 12:46 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/26742 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
