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

Functional Encryption: Constructions and Lower Bounds

S. Gorbunov

Published Jan 1, 2012• 0 citations
OpenAlex

Related papers

Functional Encryption: New Perspectives and Lower Bounds

Shweta Agrawal, S. Gorbunov, Vinod Vaikuntanathan +1 more

Lecture notes in computer science•Jan 1, 2013•165 citations

Lower Bounds for Lattice-Based Compact Functional Encryption

Erkan Tairi, Akın Ünal

Lecture notes in computer science•Jan 1, 2024•6 citations

Lower Bounds on Assumptions Behind Registration-Based Encryption

Mohammad Hajiabadi, Mohammad Mahmoody, Qi Wei +1 more

Lecture notes in computer science•Jan 1, 2023•7 citations

Functional Encryption: New Perspectives and Lower Bounds.

Shweta Agrawal, S. Gorbunov, Vinod Vaikuntanathan +1 more

Functional encryption is an emerging paradigm for public-key encryption that enables finegrained control of access to encrypted data. In this work, we present new perspectives on security definitions for functional encryption, as well as new lower bounds on what can be achieved. Our main contributions are as follows: • We show a lower bound for functional encryption that satisfies a weak (non-adaptive) simulation-based security notion, via pseudo-random functions. This is the first lower bound that exploits unbounded collusions in an essential way. • We put forth and discuss a simulation-based notion of security for functional encryption, with an unbounded simulator (called USIM). We show that this notion interpolates indistinguishability and simulation-based security notions, and has strong correlations to results and barriers in the zero-knowledge and multi-party computation literature.

•Jan 1, 2012•8 citations

Lower and Upper Bounds for Deniable Public-Key Encryption

Rikke Bendlin, Jesper Buus Nielsen, Peter Sebastian Nordholt +1 more

Lecture notes in computer science•Jan 1, 2011•36 citations

Simple and Generic Constructions of Succinct Functional Encryption

Fuyuki Kitagawa, Ryo Nishimaki, Keisuke Tanaka

Lecture notes in computer science•Jan 1, 2018•6 citations
Functional encryption is an emerging paradigm for public-key encryption that enables finegrained control of access to encrypted data. In this work, we present new perspectives on security definitions for functional encryption, as well as new lower bounds on what can be achieved. Our main contributions are as follows: • We show a lower bound for functional encryption that satisfies a weak (non-adaptive) simulation-based security notion, via pseudo-random functions. This is the first lower bound that exploits unbounded collusions in an essential way. • We put forth and discuss a simulation-based notion of security for functional encryption, with an unbounded simulator (called USIM). We show that this notion interpolates indistinguishability and simulation-based security notions, and has strong correlations to results and barriers in the zero-knowledge and multi-party computation literature.