Hot answers tagged functional-encryption
3
PE is a subclass of FE.
This (from the other answer) is correct.
Also, from my understanding, your analogy is correct. PE returns the plaintext if the predicate evaluates to true. FE, on the other hand, returns a function of the plaintext.
We can say that PE is a subclass of FE, since we can use FE to implement PE. Just use the identity function.
...
1
Existing definitions for functional encryption don't support "combining" ciphertexts in the way that you suggest.
As far as doing more than just access control, two very recent papers (to appear next month at STOC 2013) achieve functional encryption for arbitrary functionalities:
Attribute-Based Encryption for Circuits by Gorbunov, Vaikuntanathan, Wee
...
1
My understanding of this is as follows:
Monotonic access structure: if $\mathbb{A}$ is a set of attributes satisfying an access structure $T$, then any $\mathbb{A}'$ such that $\mathbb{A} \subset \mathbb{A}'$ also satisfies $T$. For example, consider $T = A \cap B$, then both $\mathbb{A}=\{A,B\}$ and $\mathbb{A}'=\{A,B,C\}$ satisfy $T$.
Non-monotonic ...
1
Simply speaking, if any superset of the set satisfying the access structure satisfies the access structure, we call the structure monotonic.
Let $\{1,2,...,n\}$ be a set of indices. An access structure is a collection $\mathbb{A}$ of non-empty subsets of $\{1,2,3,...,n\}$. We say a collection (or an access structure) $\mathbb{A} \subseteq 2^{\{1,2,...,n\}}$ ...
Only top voted, non community-wiki answers of a minimum length are eligible
