Abstract
AbstractBipartite secret sharing schemes realize access structures in which the participants are divided into two parts, and all the participants in the same part play an equivalent role. Such a bipartite structure can be described by the collection of its minimal points. The complexity of a scheme is the ratio between the maximum share size given to the participants and the secret size, and the Shannon complexity of a structure is the best lower bound provided by the entropy method. Within this work, we compute the Shannon complexity of regular bipartite structures and provide optimal constructions for some bipartite structures defined by 2 and 3 points.
Funder
Nemzeti Kutatási, Fejlesztési és Innovaciós Alap
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications
Reference32 articles.
1. Beimel A.: Secret-sharing schemes: a survey. In: Proceedings of the Third International Conference on Coding and Cryptology (IWCC’11), pp. 11–46. Springer, Berlin (2011).
2. Bellare M., Neven G.: Identity-based multi-signatures from RSA. In: Topics in Cryptology-CT-RSA. Lecture Notes in Computer Science, vol. 4377. Springer, Berlin.
3. Ben-Or M., Goldwasser S., Wigderson A.: Completeness theorems for non-cryptographic fault-tolerant distributed computations. In: Proceedings of the 20th ACM Symposium on the Theory of Computing, pp. 1–10 (1988).
4. Blakley G.R.: Safeguarding cryptographic keys. Proc. Nat. Comput. Conf. 48, 313–317 (1979).
5. Blundo C., De Santis A., Stinson D.R., Vaccaro U.: Graph decomposition and secret sharing schemes. J. Cryptol. 8, 39–64 (1995).