Adaptively Secure Functional Encryption for Finite Languages from DLIN Assumption

Tapas Pandit; Rana Barua

Paper 2014/225

Adaptively Secure Functional Encryption for Finite Languages from DLIN Assumption

Tapas Pandit, Plaksha University, Mohali, India

Rana Barua, TCG CREST, Kolkata

Abstract

In this paper, we present Functional Encryption (FE) schemes for finite languages from standard static assumption, viz., \textit{Decisional Linear} (DLIN) assumption. These finite languages are described by deterministic finite automata. Our first scheme is ciphertext-policy functional encryption (CP-FE), where a key $\sk_{w}$ is labeled with a string $w$ over a fixed alphabet $Σ$ and a ciphertext $\cipher_{\amn}$ is associated with a deterministic finite Automaton (DFA) $\amn$ over the same alphabet $Σ$ . The key $\sk_{w}$ can extract the message from the ciphertext $\cipher_{\amn}$ if the DFA $\amn$ accepts the string $w$ . This CP-FE scheme is constructed based on attribute-based encryption (ABE) structure of Okamoto-Takashima in Asiacrypt, 2012. To achieve the adaptive security, we put bounds on number of occurrences of any symbol in a string and in the set of transition tuples of a DFA. Due to this restriction, the size of key space (where the keys are indexed with strings) is reduced to finite. Hence, the functional scope of any DFA in our system can capture only finite language. Similarly, we obtain our second adaptively secure FE scheme in key-policy flavor from DLIN assumption. Both the schemes are shown to be secure in the standard model.

Note: Some typos have been corrected.

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Preprint.
Keywords: Functional encryption Attribute-based encryption DFA Dual pairing vector spaces
Contact author(s): tapasgmmath @ gmail com
ranabarua isi @ gmail com
History: 2024-05-21: last of 2 revisions; 2014-03-28: received; See all versions
Short URL: https://ia.cr/2014/225
License: CC BY

BibTeX

@misc{cryptoeprint:2014/225,
      author = {Tapas Pandit and Rana Barua},
      title = {Adaptively Secure Functional Encryption for Finite Languages from {DLIN} Assumption},
      howpublished = {Cryptology {ePrint} Archive, Paper 2014/225},
      year = {2014},
      url = {https://eprint.iacr.org/2014/225}
}