Hot answers tagged identity-based-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
What you are describing is an anonymous credential system. There are two different ways to go about making these and two actually systems that use those techniuqes. Microsoft's U-prove and IBM's Idemix.
If you're interested in smart card usage, you probably prefer U-prove as it tends to work better with smart cards. Its described in a by its original ...
1
If Bob and Charlie will share a secret, then it information-theoretic privacy might
be possible, otherwise the best that can be hoped for is computational anonymity.
I haven't come up up with any way to achieve information-theoretic privacy when
Bob and Charlie share a secret, so I will only be addressing computational privacy.
I assume that Bob can ...
Only top voted, non community-wiki answers of a minimum length are eligible
