Multi-input Functional Encryption

  • Shafi Goldwasser
  • S. Dov Gordon
  • Vipul Goyal
  • Abhishek Jain
  • Jonathan Katz
  • Feng-Hao Liu
  • Amit Sahai
  • Elaine Shi
  • Hong-Sheng Zhou
Conference paper

DOI: 10.1007/978-3-642-55220-5_32

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8441)
Cite this paper as:
Goldwasser S. et al. (2014) Multi-input Functional Encryption. In: Nguyen P.Q., Oswald E. (eds) Advances in Cryptology – EUROCRYPT 2014. EUROCRYPT 2014. Lecture Notes in Computer Science, vol 8441. Springer, Berlin, Heidelberg

Abstract

We introduce the problem of Multi-Input Functional Encryption, where a secret key skf can correspond to an n-ary function f that takes multiple ciphertexts as input. We formulate both indistinguishability-based and simulation-based definitions of security for this notion, and show close connections with indistinguishability and virtual black-box definitions of obfuscation.

Assuming indistinguishability obfuscation for circuits, we present constructions achieving indistinguishability security for a large class of settings. We show how to modify this construction to achieve simulation-based security as well, in those settings where simulation security is possible.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© International Association for Cryptologic Research 2014

Authors and Affiliations

  • Shafi Goldwasser
    • 1
  • S. Dov Gordon
    • 2
  • Vipul Goyal
    • 3
  • Abhishek Jain
    • 4
  • Jonathan Katz
    • 5
  • Feng-Hao Liu
    • 5
  • Amit Sahai
    • 6
  • Elaine Shi
    • 5
  • Hong-Sheng Zhou
    • 7
  1. 1.MIT and WeizmannIsrael
  2. 2.Applied Communication SciencesUSA
  3. 3.Microsoft ResearchIndia
  4. 4.Boston University and MITUSA
  5. 5.University of MarylandUSA
  6. 6.UCLAUSA
  7. 7.Virginia Commonwealth UniversityUSA

Personalised recommendations