Public-key Projective Arithmetic Functional Encryption

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 PA...

Full description

Saved in:

Bibliographic Details
Published in:	2020 Eighth International Symposium on Computing and Networking (CANDAR) pp. 115 - 121
Main Authors:	Hasegawa, Shingo, Hisai, Masashi, Shizuya, Hiroki
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01-11-2020
Subjects:	Encryption indistinguishability obfuscation projective arithmetic functional encryption Public key randomizing polynomials scheme Syntactics
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	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.
ISSN:	2379-1896
DOI:	10.1109/CANDAR51075.2020.00022