Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity

DOI10.1007/978-3-662-48000-7_30zbMath1369.94521arXiv1412.8766OpenAlexW3104283531MaRDI QIDQ3457087

Anne Broadbent, Stacey Jeffery

Publication date: 10 December 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1412.8766

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (42)

Impossibility of quantum virtual black-box obfuscation of classical circuits ⋮ Constructions for quantum indistinguishability obfuscation ⋮ Composable and finite computational security of quantum message transmission ⋮ Delegating quantum computation in the quantum random oracle model ⋮ Quantum attribute-based encryption: a comprehensive study ⋮ Block encryption of quantum messages ⋮ Arbitrable blind quantum computation ⋮ Teleportation-based quantum homomorphic encryption scheme with quasi-compactness and perfect security ⋮ Computational Security of Quantum Encryption ⋮ Quantum multiparty cryptosystems based on a homomorphic random basis encryption ⋮ Improved multiparty quantum private comparison based on quantum homomorphic encryption ⋮ From the hardness of detecting superpositions to cryptography: quantum public key encryption and commitments ⋮ The quantum internet: a hardware review ⋮ A multi-valued quantum fully homomorphic encryption scheme ⋮ Secure delegated quantum algorithms for solving Mahalanobis distance ⋮ Practical multi-party quantum homomorphic encryption ⋮ Two-round quantum homomorphic encryption scheme based on matrix decomposition ⋮ Finding collisions in a quantum world: quantum black-box separation of collision-resistance and one-wayness ⋮ Security limitations of classical-client delegated quantum computing ⋮ Quantum cryptography beyond quantum key distribution ⋮ Rate-1 quantum fully homomorphic encryption ⋮ Relationships between quantum IND-CPA notions ⋮ 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 ⋮ Quantum fully homomorphic encryption scheme based on universal quantum circuit ⋮ Multi-server blind quantum computation over collective-noise channels ⋮ How to Verify a Quantum Computation ⋮ A quantum evolving secret sharing scheme ⋮ Unnamed Item ⋮ Generic authenticated key exchange in the quantum random oracle model ⋮ Classical Homomorphic Encryption for Quantum Circuits ⋮ Classical Homomorphic Encryption for Quantum Circuits ⋮ Post-quantum multi-party computation ⋮ On Quantum Chosen-Ciphertext Attacks and Learning with Errors ⋮ Verification of quantum computation: an overview of existing approaches ⋮ Breaking Symmetric Cryptosystems Using Quantum Period Finding ⋮ Quantum Homomorphic Encryption for Polynomial-Sized Circuits ⋮ Semantic Security and Indistinguishability in the Quantum World ⋮ IND-secure quantum symmetric encryption based on point obfuscation ⋮ Quantum multi-secret sharing via trap codes and discrete quantum walks ⋮ Homomorphic Encryption ⋮ Efficient quantum homomorphic encryption scheme with flexible evaluators and its simulation

Cites Work

• Probabilistic encryption
• Quantum One-Time Programs
• A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
• Homomorphic Encryption: From Private-Key to Public-Key
• BLIND QUANTUM COMPUTATION
• Fully Homomorphic Encryption over the Integers
• i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits
• Lattice-based Cryptography
• A single quantum cannot be cloned
• On lattices, learning with errors, random linear codes, and cryptography
• Unnamed Item

This page was built for publication: Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity