Localised multisecret sharing

Thalia Laing, Keith Martin, Maura Paterson, Douglas Stinson

Research output: Contribution to journalArticlepeer-review

49 Downloads (Pure)


A 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.
Original languageEnglish
Pages (from-to)581–597
Number of pages17
JournalCryptography and Communications
Early online date31 Aug 2016
Publication statusPublished - Sept 2017

Cite this