On the Semantic Security of Functional Encryption Schemes

  • Manuel Barbosa
  • Pooya Farshim
Conference paper

DOI: 10.1007/978-3-642-36362-7_10

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7778)
Cite this paper as:
Barbosa M., Farshim P. (2013) On the Semantic Security of Functional Encryption Schemes. In: Kurosawa K., Hanaoka G. (eds) Public-Key Cryptography – PKC 2013. Lecture Notes in Computer Science, vol 7778. Springer, Berlin, Heidelberg

Abstract

Functional encryption (FE) is a powerful cryptographic primitive that generalizes many asymmetric encryption systems proposed in recent years. Syntax and security definitions for FE were proposed by Boneh, Sahai, and Waters (BSW) (TCC 2011) and independently by O’Neill (ePrint 2010/556). In this paper we revisit these definitions, identify several shortcomings in them, and propose a new definitional approach that overcomes these limitations. Our definitions display good compositionality properties and allow us to obtain new feasibility and impossibility results for adaptive token-extraction attack scenarios that shed further light on the potential reach of general FE for practical applications.

Keywords

Functional encryption Semantic security Adaptive token extraction Inner-product encryption SIS problem 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© International Association for Cryptologic Research 2013

Authors and Affiliations

  • Manuel Barbosa
    • 1
  • Pooya Farshim
    • 2
  1. 1.HASLabINESC TEC and Universidade do MinhoPortugal
  2. 2.Fachbereich InformatikTechnische Universität DarmstadtGermany

Personalised recommendations