Skip to main content
Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Code code:"if (foo != bar)"
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Saves in:saves
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with
Search options answers only not deleted user 452

Let $\Omega$ be a set of entities. An *access structure* $\mathcal{A}$ is a collection of nonempty subsets of the power set $P(\mathcal{A})$. This structure is called *monotone*, if $A\in\mathcal{A}$ implies $B\in\mathcal{A}$ for all supersets $B\supseteq A$

2 votes
Accepted

Distributing shares in a particular monotone access structure

Well, the easiest way I can see to represent this access structure is: Select three random values $r_1, r_2, r_3$ Generate a threshold-2 secret sharing scheme with the secret $S$ (where $S$ is the u …
poncho's user avatar
  • 151k