The complexity of the graph access structures on six participants

Authors:
Motahhareh Gharahi;Massoud Hadian Dehkordi
Affiliations:
Department of Mathematics, Iran University of Science and Technology, Tehran, Iran;Department of Mathematics, Iran University of Science and Technology, Tehran, Iran
Venue:
Designs, Codes and Cryptography
Year:
2013

Citing 5
Cited 1

An explication of secret sharing schemes

Designs, Codes and Cryptography
On the information rate of perfect secret sharing schemes

Designs, Codes and Cryptography
Tight Bounds on the Information Rate of Secret SharingSchemes

Designs, Codes and Cryptography
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)

Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
Finding lower bounds on the complexity of secret sharing schemes by linear programming

LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics

Finding lower bounds on the complexity of secret sharing schemes by linear programming

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we deal with determining the exact values for the complexity of the five graph access structures on six participants, which remained as open problems in van Dijk's paper (Des Codes Cryptogr 6:143---169, 1995). We prove that the complexity for each of the five graph access structures is equal to 7/4.