Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Functional Encryption for Randomized Functionalities

Vipul Goyal, Abhishek Jain, Venkata Koppula, Amit Sahai

Published Jan 1, 2015• 53 citations
Publisher
DOI
10.1007/978-3-662-46497-7_13

Related papers

Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions

Ilan Komargodski, Gil Segev, Eylon Yogev

Journal of Cryptology•Feb 14, 2017•14 citations

Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions

Ilan Komargodski, Gil Segev, Eylon Yogev

Lecture notes in computer science•Jan 1, 2015•23 citations

Simulation-Based Secure Functional Encryption in the Random Oracle Model

Vincenzo Iovino, Karol Żebroski

Lecture notes in computer science•Jan 1, 2015•11 citations

Impossibility of Simulation Secure Functional Encryption Even with Random Oracles

Shashank Agrawal, Venkata Koppula, Brent R. Waters

Lecture notes in computer science•Jan 1, 2018•9 citations

Inner-Product Functional Encryption from Random Linear Codes: Trial and Challenges

Zhuoran Zhang, Zheng Zhang, Fangguo Zhang

Lecture notes in computer science•Jan 1, 2021•2 citations

Public-key Projective Arithmetic Functional Encryption

Shingo Hasegawa, Masashi Hisai, Hiroki Shizuya

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.

International Symposium on Computing and Networking•Nov 1, 2020•1 citation
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.