Perfect secret sharing schemes for graph access structures on six participants
The purpose of this paper is to consider the problem of determining the exact values of the complexities of the three graph access structures on six participants, which are unsolved in van Dijk's paper [Des Codes Cryptogr 6 (1995), 143–169]. For each of these access structures, we obtain the up...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
De Gruyter
2013-09-01
|
| Series: | Journal of Mathematical Cryptology |
| Subjects: | |
| Online Access: | https://doi.org/10.1515/jmc-2012-0026 |