Paper 2012/007

Optimal Multiple Assignments with (m,m)-Scheme for General Access Structures

Qiang Li, Xiangxue Li, Dong Zheng, and Kefei Chen


Given the number n of the participants, one can solve an integer programming on 2^n variables to construct an optimal multiple assignment with threshold schemes for general access structure. In this paper, we focus on finding optimal multiple assignments with (m,m)-schemes. We prove that most of the variables in the corresponding integer programming take the value of 0, while the remaining variables take the values of either 0 or 1. We also show that given a complete access structure, an optimal scheme may be obtaineddirectly from the scheme by Ito, Saito, and Nishizeki (Secret sharing scheme realizeing any access structure, in Globecom 1987).

Available format(s)
Cryptographic protocols
Publication info
Published elsewhere. Unknown where it was published
Contact author(s)
xxli @ cs ecnu edu cn
2012-01-08: revised
2012-01-07: received
See all versions
Short URL
Creative Commons Attribution


      author = {Qiang Li and Xiangxue Li and Dong Zheng and Kefei Chen},
      title = {Optimal Multiple Assignments with (m,m)-Scheme for General Access Structures},
      howpublished = {Cryptology ePrint Archive, Paper 2012/007},
      year = {2012},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.