Public-key projective arithmetic functional encryption

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

Abstract

Ananth and Sahai proposed the projective arithmetic functional encryption (PAFE) and showed that PAFE derives a single-key selective secure functional encryption with the help of the randomizing polynomials scheme (RP), namely PAFE with RP achieves the indistinguishability obfuscation (iO). Their PAFE considers a secret-key type functional encryption only and a public-key counterpart is not known. We propose the public-key version: pkPAFE, and show that pkPAFE with RP derives a public-key functional encryption which is single-key selective secure. This means that our pkPAFE achieves iO as well as the original PAFE by Ananth and Sahai.

Original languageEnglish
Title of host publicationProceedings - 2020 8th International Symposium on Computing and Networking, CANDAR 2020
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages115-121
Number of pages7
ISBN (Electronic)9781728182216
DOIs
Publication statusPublished - 2020 Nov
Event8th International Symposium on Computing and Networking, CANDAR 2020 - Virtual, Naha, Japan
Duration: 2020 Nov 242020 Nov 27

Publication series

NameProceedings - 2020 8th International Symposium on Computing and Networking, CANDAR 2020

Conference

Conference8th International Symposium on Computing and Networking, CANDAR 2020
CountryJapan
CityVirtual, Naha
Period20/11/2420/11/27

Keywords

  • Indistinguishability obfuscation
  • Projective arithmetic functional encryption
  • Randomizing polynomials scheme

ASJC Scopus subject areas

  • Artificial Intelligence
  • Computational Theory and Mathematics
  • Computer Networks and Communications
  • Computer Science Applications
  • Software

Fingerprint Dive into the research topics of 'Public-key projective arithmetic functional encryption'. Together they form a unique fingerprint.

Cite this