Quantum homomorphic encryption scheme with flexible number of evaluator based on \((k, n)\)-threshold quantum state sharing
From MaRDI portal
Publication:2224811
DOI10.1016/j.ins.2019.06.009zbMath1453.81013OpenAlexW2949284128WikidataQ123205275 ScholiaQ123205275MaRDI QIDQ2224811
Publication date: 4 February 2021
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2019.06.009
securityquantum homomorphic encryptionflexible number of evaluatorsingle-qubit evaluation operations
Related Items (8)
Efficient quantum secret sharing without a trusted player ⋮ Improved multiparty quantum private comparison based on quantum homomorphic encryption ⋮ A verifiable multi-party quantum key distribution protocol based on repetitive codes ⋮ A novel dynamic quantum secret sharing in high-dimensional quantum system ⋮ Effect of noise on deterministic remote preparation of an arbitrary two-qudit state by using a four-qudit χ-type state as the quantum channel ⋮ Multi-party controlled cyclic hybrid quantum communication protocol in noisy environment ⋮ A new kind of universal and flexible quantum information splitting scheme with multi-coin quantum walks ⋮ Efficient quantum homomorphic encryption scheme with flexible evaluators and its simulation
Cites Work
- Unnamed Item
- Unnamed Item
- Cryptanalysis and improvement of verifiable quantum \((k,n)\) secret sharing
- Symmetric quantum fully homomorphic encryption with perfect security
- Quantum fully homomorphic encryption scheme based on universal quantum circuit
- A new scale-invariant homomorphic encryption scheme
- Secret sharing of a known arbitrary quantum state with noisy environment
- Multi-party quantum secret sharing with the single-particle quantum state to encode the information
- Secure multi-label data classification in cloud by additionally homomorphic encryption
- Encrypted data processing with homomorphic re-encryption
- Quantum fully homomorphic encryption with verification
- Quantum Homomorphic Encryption for Polynomial-Sized Circuits
- Multiparty quantum secret sharing
- Quantum Private Queries
- Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity
- Fully Homomorphic Encryption over the Integers
- Universal Blind Quantum Computation
- Fully homomorphic encryption using ideal lattices
- Quantum secret sharing
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Reusable garbled circuits and succinct functional encryption
This page was built for publication: Quantum homomorphic encryption scheme with flexible number of evaluator based on \((k, n)\)-threshold quantum state sharing
