期刊名称：International Journal of Networking and Computing
印刷版ISSN：2185-2847
出版年度：2021
卷号：11
期号：2
页码：299-318
语种：English
出版社：International Journal of Networking and Computing
摘要：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.
