The complexity of the connected graph access structure on seven participants (Q515397): Difference between revisions

@@ Property / DOI @@
-.1515/jmc-2016-0017
@@ Property / DOI: 10.1515/jmc-2016-0017 / rank @@
-Normal rank
@@ Property / cites work @@
+Graph decompositions and secret sharing schemes
@@ Property / cites work: Graph decompositions and secret sharing schemes / rank @@
+Normal rank
@@ Property / cites work @@
+On the classification of ideal secret sharing schemes
+Normal rank
@@ Property / cites work @@
+Some improved bounds on the information rate of perfect secret sharing schemes
+Normal rank
@@ Property / cites work @@
+Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming
+Normal rank
@@ Property / cites work @@
+An impossibility result on graph secret sharing
@@ Property / cites work: An impossibility result on graph secret sharing / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of the graph access structures on six participants
+Normal rank
@@ Property / cites work @@
+How to share a secret
@@ Property / cites work: How to share a secret / rank @@
+Normal rank
@@ Property / cites work @@
+Decomposition constructions for secret-sharing schemes
+Normal rank
@@ Property / cites work @@
+Weighted decomposition construction for perfect secret sharing schemes
+Normal rank
@@ Property / cites work @@
+Q4368762
@@ Property / cites work: Q4368762 / rank @@
+Normal rank
@@ Property / cites work @@
+Perfect secret sharing schemes on five participants
+Normal rank
@@ Property / DOI @@
+.1515/JMC-2016-0017
@@ Property / DOI: 10.1515/JMC-2016-0017 / rank @@
+Normal rank