On the Power of Rewinding Simulators in Functional Encryption

In the recent years, Functional Encryption (FE) has received a lot of attention due to its versatility and unique challenges it poses. In FE, a receiver with secret-key sky can compute from an encryption of x the value F(y; x) for some functionality F. The seminal work of boneh, sahai and waters [TCC'11] showed that for functional encryption the in-distinguishability notion of security (IND-Security) is weaker then simulation-based and, moreover, showed that simulation-based security is impossible to achieve even in weaker settings.

Provided by: University of Wales, Newport Topic: Security Date Added: Nov 2013 Format: PDF

Find By Topic