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$

learn more… | top users | synonyms

5
votes
1answer
56 views

Information theoretical security of an inefficient Shamir based access structure

I have studied Sharmir's scheme as well as the multiple assignment scheme proposed by M. Ito. My question is if anyone can tell me if the following scheme is theoretically secure: Terms: P = set of ...
1
vote
2answers
1k views

What are monotonic and non monotonic access structures in ABE ?

While reading Attribute Based Encryption Schemes, I did not quite understand what a monotonic access structure or non monotonic access structures are. Is there a popular explanation of those terms ? ...
4
votes
2answers
265 views

How to Distribute the Shares using Secret Sharing for arbitrary Monotone Access Structures

Consider 4 people, $A$,$B$,$C$,$D$, & a secret $s\in\{0,1\}^k$. Construct a scheme which enables the following subsets of people to retrieve the secret $\{A,B\}$, $\{A,C\}$, $\{B,C,D\}$. I know ...