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

On the Relationship between Functional Encryption, Obfuscation, and Fully Homomorphic Encryption

Joël Alwen, Manuel Barbosa, Pooya Farshim, Rosario Gennaro, Steven Gordon, Stefano Tessaro, David A. Wilson

Published Jan 1, 2013• 41 citations
Publisher
DOI
10.1007/978-3-642-45239-0_5

Related papers

Keyed-Fully Homomorphic Encryption Without Indistinguishability Obfuscation

Shingo Sato, Keita Emura, Atsushi Takayasu

Lecture notes in computer science•Jan 1, 2022•8 citations

Fully-Homomorphic Encryption from Lattice Isomorphism

Pedro Costa Branco, Giulio Malavolta, Zayd Maradni

Lecture notes in computer science•Dec 1, 2025•6 citations

Fully Homomorphic Encryption with Auxiliary Inputs

Fuqun Wang, Kunpeng Wang

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

Functional Encryption: New Perspectives and Lower Bounds

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

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

Towards a Unified Theory of Cryptographic Agents.

Shashank Agrawal, Shweta Agrawal, Manoj Prabhakaran

In recent years there has been a fantastic boom of increasingly sophisticated “cryptographic objects ” — identity-based encryption, fully-homomorphic encryption, functional encryption, and most recently, various forms of obfuscation. These objects often come in various flavors of security, and as these constructions have grown in number, complexity and inter-connectedness, the relationships between them have become increasingly confusing. We provide a new framework of cryptographic agents that unifies various cryptographic objects and security definitions, similar to how the Universal Composition framework unifies various multi-party computation tasks like commitment, coin-tossing and zero-knowledge proofs. Our contributions can be summarized as follows. • Our main contribution is a new model of cryptographic computation, that unifies and extends cryptographic primitives such as Obfuscation, Functional Encryption, Fully Homomorphic En-cryption, Witness encryption, Property Preserving Encryption and the like, all of which can be cleanly modeled as “schemata ” in our framework. We provide a new indistinguishability preserving (IND-PRE) definition of security that interpolates indistinguishability and simulation

•Jan 1, 2014•1 citation

On the Security of Multikey Homomorphic Encryption

Hyang-Sook Lee, Jeongeun Park

Lecture notes in computer science•Jan 1, 2019•11 citations
In recent years there has been a fantastic boom of increasingly sophisticated “cryptographic objects ” — identity-based encryption, fully-homomorphic encryption, functional encryption, and most recently, various forms of obfuscation. These objects often come in various flavors of security, and as these constructions have grown in number, complexity and inter-connectedness, the relationships between them have become increasingly confusing. We provide a new framework of cryptographic agents that unifies various cryptographic objects and security definitions, similar to how the Universal Composition framework unifies various multi-party computation tasks like commitment, coin-tossing and zero-knowledge proofs. Our contributions can be summarized as follows. • Our main contribution is a new model of cryptographic computation, that unifies and extends cryptographic primitives such as Obfuscation, Functional Encryption, Fully Homomorphic En-cryption, Witness encryption, Property Preserving Encryption and the like, all of which can be cleanly modeled as “schemata ” in our framework. We provide a new indistinguishability preserving (IND-PRE) definition of security that interpolates indistinguishability and simulation