Cryptography and Communications

, Volume 9, Issue 5, pp 581–597

Localised multisecret sharing

  • Thalia M. Laing
  • Keith M. Martin
  • Maura B. Paterson
  • Douglas R. Stinson
Article

DOI: 10.1007/s12095-016-0202-9

Cite this article as:
Laing, T.M., Martin, K.M., Paterson, M.B. et al. Cryptogr. Commun. (2017) 9: 581. doi:10.1007/s12095-016-0202-9
  • 198 Downloads

Abstract

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.

Keywords

Multisecret sharing Information-theoretic security Ramp schemes RFID 

Mathematics Subject Classification (2010)

94A60 94A62 

Copyright information

© Springer Science+Business Media New York 2016

Authors and Affiliations

  • Thalia M. Laing
    • 1
  • Keith M. Martin
    • 1
  • Maura B. Paterson
    • 2
  • Douglas R. Stinson
    • 3
  1. 1.Information Security GroupRoyal Holloway, University of LondonLondonUK
  2. 2.Department of Economics, Mathematics and StatisticsBirkbeck, University of LondonLondonUK
  3. 3.David R. Cheriton School of Computer ScienceUniversity of WaterlooWaterlooCanada

Personalised recommendations