Localised multisecret sharing. / Laing, Thalia; Martin, Keith; Paterson, Maura; Stinson, Douglas.

In: Cryptography and Communications, Vol. 9, 09.2017, p. 581–597.

Research output: Contribution to journalArticlepeer-review

Published

Standard

Localised multisecret sharing. / Laing, Thalia; Martin, Keith; Paterson, Maura; Stinson, Douglas.

In: Cryptography and Communications, Vol. 9, 09.2017, p. 581–597.

Research output: Contribution to journalArticlepeer-review

Harvard

Laing, T, Martin, K, Paterson, M & Stinson, D 2017, 'Localised multisecret sharing', Cryptography and Communications, vol. 9, pp. 581–597. https://doi.org/10.1007/s12095-016-0202-9

APA

Laing, T., Martin, K., Paterson, M., & Stinson, D. (2017). Localised multisecret sharing. Cryptography and Communications, 9, 581–597. https://doi.org/10.1007/s12095-016-0202-9

Vancouver

Laing T, Martin K, Paterson M, Stinson D. Localised multisecret sharing. Cryptography and Communications. 2017 Sep;9:581–597. https://doi.org/10.1007/s12095-016-0202-9

Author

Laing, Thalia ; Martin, Keith ; Paterson, Maura ; Stinson, Douglas. / Localised multisecret sharing. In: Cryptography and Communications. 2017 ; Vol. 9. pp. 581–597.

BibTeX

@article{17fc3208680348fd870b94b2df2d8bf2,
title = "Localised multisecret sharing",
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.",
author = "Thalia Laing and Keith Martin and Maura Paterson and Douglas Stinson",
year = "2017",
month = sep,
doi = "10.1007/s12095-016-0202-9",
language = "English",
volume = "9",
pages = "581–597",
journal = "Cryptography and Communications",
issn = "1936-2447",
publisher = "Springer Publishing Company",

}

RIS

TY - JOUR

T1 - Localised multisecret sharing

AU - Laing, Thalia

AU - Martin, Keith

AU - Paterson, Maura

AU - Stinson, Douglas

PY - 2017/9

Y1 - 2017/9

N2 - 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.

AB - 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.

U2 - 10.1007/s12095-016-0202-9

DO - 10.1007/s12095-016-0202-9

M3 - Article

VL - 9

SP - 581

EP - 597

JO - Cryptography and Communications

JF - Cryptography and Communications

SN - 1936-2447

ER -