We investigate the best-possible (asymptotic) efficiency of functional encryption (FE) and
attribute-based encryption (ABE) by proving inherent space-time trade-offs and constructing …

Attribute-based encryption (ABE) is an attractive extension of public key encryption, which
provides fine-grained and role-based access to encrypted data. In its key-policy flavor, the …

Abstract Constructing Attribute Based Encryption (ABE) 56 for uniform models of
computation from standard assumptions, is an important problem, about which very little is …

Laconic function evaluation (LFE) allows Alice to compress a large circuit C into a small
digest d. Given Alice's digest, Bob can encrypt some input x under d in a way that enables …

Laconic function evaluation (LFE) allows us to compress a circuit f into a short digest.
Anybody can use this digest as a public-key to efficiently encrypt some input x. Decrypting …

The celebrated work of Gorbunov, Vaikuntanathan and Wee GVW13 provided the first key
policy attribute based encryption scheme (ABE) for circuits from the Learning With Errors …

Waters Crypto, 2012 provided the first attribute based encryption scheme ABE for
Deterministic Finite Automata (DFA) from a parametrized or “q-type” assumption over …

Secret sharing allows a dealer to distribute a secret among a set of parties such that only
authorized subsets, specified by an access structure, can reconstruct the secret. Sehrawat …

Numerous high-profile works have shown that access patterns to even encrypted databases
can leak secret information and sometimes even lead to reconstruction of the entire …

Fine-grained access control systems facilitate granting differential access rights to a set of
users and allow flexibility in specifying the access rights of individual users. As an important …