International Conference on the Theory and Application of Cryptology and Information Security

ASIACRYPT 2011: Advances in Cryptology – ASIACRYPT 2011 pp 610-627

Natural Generalizations of Threshold Secret Sharing

  • Oriol Farràs
  • Carles Padró
  • Chaoping Xing
  • An Yang
Conference paper

DOI: 10.1007/978-3-642-25385-0_33

Volume 7073 of the book series Lecture Notes in Computer Science (LNCS)

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.

Keywords

Cryptographysecret sharingideal secret sharing schemesmultipartite secret sharinginteger polymatroids
Download to read the full conference paper text

Copyright information

© International Association for Cryptologic Research 2011

Authors and Affiliations

  • Oriol Farràs
    • 1
    • 2
  • Carles Padró
    • 3
  • Chaoping Xing
    • 3
  • An Yang
    • 3
  1. 1.Universitat Rovira i VirgiliTarragonaSpain
  2. 2.Ben Gurion UniversityBe’er ShevaIsrael
  3. 3.Nanyang Technological UniversitySingapore