Paper 2012/680

Natural Generalizations of Threshold Secret Sharing

Oriol Farras, Carles Padro, Chaoping Xing, and An Yang

Abstract

We present new families of access structures that, similarly to the multilevel and compartmented access structures introduced in previous works, are natural generalizations of threshold secret sharing. Namely, they admit an ideal linear secret sharing schemes over every large enough finite field, they can be described by a small number of parameters, and they have useful properties for the applications of secret sharing. The use of integer polymatroids makes it possible to find many new such families and it simplifies in great measure the proofs for the existence of ideal secret sharing schemes for them.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
A major revision of an IACR publication in ASIACRYPT 2011
Keywords
Cryptographysecret sharingideal secret sharing schemesmultipartite secret sharinginteger polymatroids
Contact author(s)
carles padro @ upc edu
History
2015-12-10: revised
2012-12-10: received
See all versions
Short URL
https://ia.cr/2012/680
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2012/680,
      author = {Oriol Farras and Carles Padro and Chaoping Xing and An Yang},
      title = {Natural Generalizations of Threshold Secret Sharing},
      howpublished = {Cryptology ePrint Archive, Paper 2012/680},
      year = {2012},
      note = {\url{https://eprint.iacr.org/2012/680}},
      url = {https://eprint.iacr.org/2012/680}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.