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 Without Obfuscation

Sanjam Garg, Craig Gentry, Shai Halevi, Mark Zhandry

Published Dec 23, 2015• 102 citations
Publisher
DOI
10.1007/978-3-662-49099-0_18

Related papers

Indistinguishability Obfuscation from Compact Functional Encryption

Prabhanjan Ananth, Abhishek Jain

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

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

Joël Alwen, Manuel Barbosa, Pooya Farshim +4 more

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

Keyed-Fully Homomorphic Encryption Without Indistinguishability Obfuscation

Shingo Sato, Keita Emura, Atsushi Takayasu

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

Upgrading to Functional Encryption

Saikrishna Badrinarayanan, Dakshita Khurana, Amit Sahai +1 more

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

Lattice‐based obfuscation for re‐encryption functions

Rong Cheng, Fangguo Zhang

Abstract Program obfuscation is a compiler that transfers a program into an unintelligible form while preserving the original functionality. Secure obfuscation for several particular function families has been raised out despite the general impossibility result presented by Barak et al. Re‐encryption function is a useful primitive, which transforms ciphertexts for one party into ciphertexts under another party's public key. Hohenberger et al. constructed a special re‐encryption function and securely obfuscated it in TCC'07, and the security is based on classical hardness assumption. In this paper, we construct a new re‐encryption function and securely obfuscate it based on the standard learning with error (LWE) assumption. LWE is proved to be reducible to standard lattice problems, which are conjectured immune to quantum cryptanalysis or ‘post‐quantum’. Besides, we discuss about the relations between these two cryptographic primitives in detail: proxy re‐encryption and obfuscation for re‐encryption functions. Copyright © 2014 John Wiley & Sons, Ltd.

Security and Communication Networks•Oct 20, 2014•2 citations

Universal quantum obfuscation for quantum non-linear functions

Chuyue Pan, Tao Shang, Yuanjing Zhang

Research on quantum cryptography has burgeoned in the recent decades and combined quantum mechanics and cryptography theory. Among the existing quantum cryptographic primitives, quantum obfuscation is an emergent force to be reckoned with. Quantum obfuscation means obfuscating a circuit by quantum mechanics to improve security. It is used to hide functionality and prevent the reverse engineering of quantum circuits. However, research studies on the construction of quantum obfuscation are relatively immature due to its difficulty in implementation and application. Also, the obfuscation for quantum non-linear functions has not been suggested yet, although quantum non-linear functions cover a wide range of quantum functions that can be obfuscated. In this paper, we initiate a universal definition of quantum obfuscation which utilizes quantum teleportation to construct an obfuscator and interpreter for quantum non-linear functions. Furthermore, we demonstrate the validity of applying the obfuscation to the quantum asymmetric encryption scheme and rigorously prove that the encryption realized by quantum obfuscation satisfies IND (indistinguishability)-security. This work provides a positive possibility of quantum obfuscation for quantum non-linear functions and will complement the theory of both quantum obfuscation and quantum asymmetric encryption.

Frontiers in Physics•Jan 4, 2023•6 citations
Abstract Program obfuscation is a compiler that transfers a program into an unintelligible form while preserving the original functionality. Secure obfuscation for several particular function families has been raised out despite the general impossibility result presented by Barak et al. Re‐encryption function is a useful primitive, which transforms ciphertexts for one party into ciphertexts under another party's public key. Hohenberger et al. constructed a special re‐encryption function and securely obfuscated it in TCC'07, and the security is based on classical hardness assumption. In this paper, we construct a new re‐encryption function and securely obfuscate it based on the standard learning with error (LWE) assumption. LWE is proved to be reducible to standard lattice problems, which are conjectured immune to quantum cryptanalysis or ‘post‐quantum’. Besides, we discuss about the relations between these two cryptographic primitives in detail: proxy re‐encryption and obfuscation for re‐encryption functions. Copyright © 2014 John Wiley & Sons, Ltd.
Research on quantum cryptography has burgeoned in the recent decades and combined quantum mechanics and cryptography theory. Among the existing quantum cryptographic primitives, quantum obfuscation is an emergent force to be reckoned with. Quantum obfuscation means obfuscating a circuit by quantum mechanics to improve security. It is used to hide functionality and prevent the reverse engineering of quantum circuits. However, research studies on the construction of quantum obfuscation are relatively immature due to its difficulty in implementation and application. Also, the obfuscation for quantum non-linear functions has not been suggested yet, although quantum non-linear functions cover a wide range of quantum functions that can be obfuscated. In this paper, we initiate a universal definition of quantum obfuscation which utilizes quantum teleportation to construct an obfuscator and interpreter for quantum non-linear functions. Furthermore, we demonstrate the validity of applying the obfuscation to the quantum asymmetric encryption scheme and rigorously prove that the encryption realized by quantum obfuscation satisfies IND (indistinguishability)-security. This work provides a positive possibility of quantum obfuscation for quantum non-linear functions and will complement the theory of both quantum obfuscation and quantum asymmetric encryption.