Constructions for quantum indistinguishability obfuscation
From MaRDI portal
Publication:2146070
DOI10.1007/978-3-030-88238-9_2zbMath1497.81039arXiv2005.14699OpenAlexW3208204668MaRDI QIDQ2146070
Raza Ali Kazmi, Anne Broadbent
Publication date: 15 June 2022
Full work available at URL: https://arxiv.org/abs/2005.14699
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94) Networks and circuits as models of computation; circuit complexity (68Q06)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On best-possible obfuscation
- Quantum FHE (almost) as secure as classical
- Secure software leasing
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification
- Impossibility of quantum virtual black-box obfuscation of classical circuits
- Indistinguishability obfuscation without multilinear maps: new paradigms via low degree weak pseudorandomness and security amplification
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Quantum Homomorphic Encryption for Polynomial-Sized Circuits
- A Subfield Lattice Attack on Overstretched NTRU Assumptions
- Practical Multilinear Maps over the Integers
- Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation
- Generators and relations for n-qubit Clifford operators
- Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity
- How to use indistinguishability obfuscation
- The Power of Negations in Cryptography
- ZAPs and Non-Interactive Witness Indistinguishability from Indistinguishability Obfuscation
- Obfuscation of Probabilistic Circuits and Applications
- Graph-Induced Multilinear Maps from Lattices
- Cryptanalyses of Candidate Branching Program Obfuscators
- On the (im)possibility of obfuscating programs
- GGHLite: More Efficient Multilinear Maps from Ideal Lattices
- Recovering Short Generators of Principal Ideals in Cyclotomic Rings
This page was built for publication: Constructions for quantum indistinguishability obfuscation