Paper 2012/007 Original: eprint.iacr.org/2012/007 ↗
Optimal Multiple Assignments with (m,m)-Scheme for General Access Structures
Abstract
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).
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2012-01-08: last updated
- 2012-01-07: published
- Short URL
- https://ia.cr/2012/007
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2012/007,
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},
url = {https://eprint.iacr.org/2012/007}
}