Complexity of universal access structures (Q413265): Difference between revisions

@@ Property / DOI @@
-.1016/j.ipl.2011.10.022
@@ Property / DOI: 10.1016/j.ipl.2011.10.022 / rank @@
-Normal rank
@@ Property / arXiv ID @@
+.05021
@@ Property / arXiv ID: 1908.05021 / rank @@
+Normal rank
@@ Property / cites work @@
+Tight bounds on the information rate of secret sharing schemes
+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 @@
+Q3686615
@@ Property / cites work: Q3686615 / rank @@
+Normal rank
@@ Property / cites work @@
+Secret sharing schemes with three or four minimal qualified subsets
+Normal rank
@@ Property / cites work @@
+Optimal complexity of secret sharing schemes with four minimal qualified subsets
+Normal rank
@@ Property / cites work @@
+Decomposition constructions for secret-sharing schemes
+Normal rank
@@ Property / DOI @@
+.1016/J.IPL.2011.10.022
@@ Property / DOI: 10.1016/J.IPL.2011.10.022 / rank @@
+Normal rank