Cryptology ePrint Archive: Report 2015/153

Functional Encryption from (Small) Hardware Tokens

Kai-Min Chung and Jonathan Katz and Hong-Sheng Zhou

Abstract: Functional encryption (FE) enables fine-grained access control of encrypted data while promising simplified key management. In the past few years substantial progress has been made on functional encryption and a weaker variant called predicate encryption. Unfortunately, fundamental impossibility results have been demonstrated for constructing FE schemes for general functions satisfying a simulation-based definition of security.

We show how to use \emph{hardware tokens} to overcome these impossibility results. In our envisioned scenario, an authority gives a hardware token and some cryptographic information to each authorized user; the user combines these to decrypt received ciphertexts. Our schemes rely on \emph{stateless} tokens that are \emph{identical} for all users. (Requiring a different token for each user trivializes the problem, and would be a barrier to practical deployment.) The tokens can implement relatively ``lightweight'' computation relative to the functions supported by the scheme.

Our token-based approach can be extended to support hierarchal functional encryption, function privacy, and more.

Category / Keywords:

Original Publication (in the same form): IACR-ASIACRYPT-2013

Date: received 23 Feb 2015, last revised 4 May 2015

Contact author: hszhou at vcu edu

Available format(s): PDF | BibTeX Citation

Version: 20150504:191930 (All versions of this report)

Short URL: ia.cr/2015/153

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]