Fully secure functional encryption with general relations from the decisional linear assumption

Tatsuaki Okamoto, Katsuyuki Takashima

Research output: Chapter in Book/Report/Conference proceedingConference contribution

348 Citations (Scopus)

Abstract

This paper presents a fully secure functional encryption scheme for a wide class of relations, that are specified by non-monotone access structures combined with inner-product relations. The security is proven under a well-established assumption, the decisional linear (DLIN) assumption, in the standard model. The proposed functional encryption scheme covers, as special cases, (1) key-policy and ciphertext-policy attribute-based encryption with non-monotone access structures, and (2) (hierarchical) predicate encryption with inner-product relations and functional encryption with non-zero inner-product relations.

Original languageEnglish
Title of host publicationAdvances in Cryptology - CRYPTO 2010 - 30th Annual Cryptology Conference, Proceedings
Pages191-208
Number of pages18
DOIs
Publication statusPublished - 2010
Externally publishedYes
Event30th Annual International Cryptology Conference, CRYPTO 2010 - Santa Barbara, CA, United States
Duration: 2010 Aug 152010 Aug 19

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6223 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference30th Annual International Cryptology Conference, CRYPTO 2010
CountryUnited States
CitySanta Barbara, CA
Period10/8/1510/8/19

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Fully secure functional encryption with general relations from the decisional linear assumption'. Together they form a unique fingerprint.

Cite this