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

Achieving Compactness Generically: Indistinguishability Obfuscation from Non-Compact Functional Encryption.

Prabhanjan Ananth, Abhishek Jain, Amit Sahai

Published Jan 1, 2015• 25 citations
OpenAlex

Related papers

Indistinguishability Obfuscation from Compact Functional Encryption

Prabhanjan Ananth, Abhishek Jain

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

Keyed-Fully Homomorphic Encryption Without Indistinguishability Obfuscation

Shingo Sato, Keita Emura, Atsushi Takayasu

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

Indistinguishability Obfuscation: From Approximate to Exact

Nir Bitansky, Vinod Vaikuntanathan

Lecture notes in computer science•Dec 18, 2015•23 citations

Constructions for Quantum Indistinguishability Obfuscation

Anne Broadbent, Raza Ali Kazmi

arXiv:2005.14699•Lecture notes in computer science•Jan 1, 2021•27 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•41 citations

Separating Quantum Indistinguishability Obfuscation from Falsifiable Assumptions

Mohammed Barhoush, Tomoyuki Morimae, Ramis Movassagh

Quantum indistinguishability obfuscation (qIO) aims to make a quantum circuit unintelligible while preserving its functionality. It serves as a foundational primitive for advanced applications, such as witness encryption (WE) for QMA, non-interactive zero-knowledge arguments for QMA, and attribute-based encryption for BQP. Despite its importance, constructing qIO from standard assumptions remains a major open problem. In this work, we prove that the security of WE for QMA cannot be based on any falsifiable cryptographic assumption via a restricted class of quantum black-box reductions. Because qIO for null quantum circuits implies WE for QMA, this also separates null-qIO from falsifiable assumptions. Since almost all standard cryptographic assumptions are falsifiable, our result presents a barrier to basing qIO on standard cryptographic assumptions. The reductions we rule out are restricted: the reduction must query the adversary classically, non-adaptively, at the same security parameter, and only on honestly generated ciphertexts. Moreover, our impossibility applies only to WE with classical ciphertexts, and therefore does not rule out qIO with obfuscators whose output is a quantum state. Ruling out more general reductions, as well as more general forms of WE and qIO, remains open. Our impossibility relies on the existence of a QMA-QCIP[2] gap problem, an average-case assumption postulating a QMA language that cannot be verified with two messages of classical communication.

quant-pharXiv:2608.25195•Aug 27, 2026•1 citation
Quantum indistinguishability obfuscation (qIO) aims to make a quantum circuit unintelligible while preserving its functionality. It serves as a foundational primitive for advanced applications, such as witness encryption (WE) for QMA, non-interactive zero-knowledge arguments for QMA, and attribute-based encryption for BQP. Despite its importance, constructing qIO from standard assumptions remains a major open problem. In this work, we prove that the security of WE for QMA cannot be based on any falsifiable cryptographic assumption via a restricted class of quantum black-box reductions. Because qIO for null quantum circuits implies WE for QMA, this also separates null-qIO from falsifiable assumptions. Since almost all standard cryptographic assumptions are falsifiable, our result presents a barrier to basing qIO on standard cryptographic assumptions. The reductions we rule out are restricted: the reduction must query the adversary classically, non-adaptively, at the same security parameter, and only on honestly generated ciphertexts. Moreover, our impossibility applies only to WE with classical ciphertexts, and therefore does not rule out qIO with obfuscators whose output is a quantum state. Ruling out more general reductions, as well as more general forms of WE and qIO, remains open. Our impossibility relies on the existence of a QMA-QCIP[2] gap problem, an average-case assumption postulating a QMA language that cannot be verified with two messages of classical communication.