Quantum Homomorphic Encryption for Polynomial-Sized Circuits
From MaRDI portal
Publication:2829941
DOI10.1007/978-3-662-53015-3_1zbMath1406.94047arXiv1603.09717OpenAlexW3103263362MaRDI QIDQ2829941
Florian Speelman, Christian Schaffner, Yfke Dulek
Publication date: 9 November 2016
Published in: Theory of Computing, Advances in Cryptology – CRYPTO 2016 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1603.09717
quantum computingquantum cryptographyquantum teleportationhomomorphic encryptiongarden-hose modelGarden-Hose model
Quantum computation (81P68) Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)
Related Items (21)
Constructions for quantum indistinguishability obfuscation ⋮ Delegating quantum computation in the quantum random oracle model ⋮ Arbitrable blind quantum computation ⋮ Teleportation-based quantum homomorphic encryption scheme with quasi-compactness and perfect security ⋮ Quantum multiparty cryptosystems based on a homomorphic random basis encryption ⋮ Improved multiparty quantum private comparison based on quantum homomorphic encryption ⋮ The quantum internet: a hardware review ⋮ Secure delegated quantum algorithms for solving Mahalanobis distance ⋮ Practical multi-party quantum homomorphic encryption ⋮ Security limitations of classical-client delegated quantum computing ⋮ Rate-1 quantum fully homomorphic encryption ⋮ An efficient quantum somewhat homomorphic symmetric searchable encryption ⋮ Quantum homomorphic encryption scheme with flexible number of evaluator based on \((k, n)\)-threshold quantum state sharing ⋮ Multi-server blind quantum computation over collective-noise channels ⋮ Unnamed Item ⋮ Classical Homomorphic Encryption for Quantum Circuits ⋮ Classical Homomorphic Encryption for Quantum Circuits ⋮ Post-quantum multi-party computation ⋮ Verification of quantum computation: an overview of existing approaches ⋮ Quantum Homomorphic Encryption for Polynomial-Sized Circuits ⋮ Efficient quantum homomorphic encryption scheme with flexible evaluators and its simulation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- (Leveled) Fully Homomorphic Encryption without Bootstrapping
- Symmetric quantum fully homomorphic encryption with perfect security
- Quantum fully homomorphic encryption scheme based on universal quantum circuit
- Probabilistic encryption
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- Quantum private information retrieval has linear communication complexity
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- (Leveled) fully homomorphic encryption without bootstrapping
- Quantum Homomorphic Encryption for Polynomial-Sized Circuits
- Semantic Security and Indistinguishability in the Quantum World
- How to Run Turing Machines on Encrypted Data
- Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
- Composable Security of Delegated Quantum Computation
- Computational Security of Quantum Encryption
- New Bounds for the Garden-Hose Model
- The garden-hose model
- Private information retrieval
- Attribute-Based Encryption for Circuits
- BLIND QUANTUM COMPUTATION
- Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity
- Temporally unstructured quantum computation
- Fully Homomorphic Encryption over the Integers
- A Simple BGN-Type Cryptosystem from LWE
- Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries
- Evaluating Branching Programs on Encrypted Data
- A method for obtaining digital signatures and public-key cryptosystems
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Universal Blind Quantum Computation
- Fully homomorphic encryption using ideal lattices
- The Garden Hose Complexity for the Equality Function
- How to use indistinguishability obfuscation
- Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$
- Computing Blindfolded: New Developments in Fully Homomorphic Encryption
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Attribute-based encryption for circuits
- Reusable garbled circuits and succinct functional encryption
- Theory of Cryptography
This page was built for publication: Quantum Homomorphic Encryption for Polynomial-Sized Circuits
