An efficient quantum somewhat homomorphic symmetric searchable encryption

DOI10.1007/S10773-017-3275-0MaRDI QIDQ1705121zbMATH OpenOpenAlexWikidataFDO

Authors Xiaoqiang Sun, Ting Wang, Ping Wang, Zhi-Wei Sun, Jianping Yu, Weixin Xie

Publication date 14 March 2018

Published in International Journal of Theoretical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10773-017-3275-0

zbMATH Keywords

quantum one-time padquantum somewhat homomorphic encryptionsymmetric searchable encryption

Mathematics Subject Classification ID

Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)

Recommendations

• Symmetric quantum fully homomorphic encryption with perfect security
• Quantum fully homomorphic encryption scheme based on universal quantum circuit
• Efficient quantum homomorphic encryption scheme with flexible evaluators and its simulation
• Classical homomorphic encryption for quantum circuits
• Quantum FHE (almost) as secure as classical

Cites work

• scientific article; zbMATH DE number 3825698 (Why is no real title available?)
• (Leveled) fully homomorphic encryption without bootstrapping
• A method for obtaining digital signatures and public-key cryptosystems
• A public key cryptosystem and a signature scheme based on discrete logarithms
• A single quantum cannot be cloned
• Efficient Fully Homomorphic Encryption from (Standard) LWE
• Efficient and feasible quantum private comparison of equality against the collective amplitude damping noise
• Efficient fully homomorphic encryption from (standard) LWE
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• Fully homomorphic encryption from ring-LWE and security for key dependent messages
• Fully homomorphic encryption over the integers
• Fully homomorphic encryption using ideal lattices
• Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
• On ideal lattices and learning with errors over rings
• Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity
• Symmetric quantum fully homomorphic encryption with perfect security

Cited in

(8)

• Efficient quantum homomorphic encryption scheme with flexible evaluators and its simulation
• Improvements to quantum search techniques for block-ciphers, with applications to AES
• Quantum private query based on quantum homomorphic encryption with qubit rotation
• Quantum \(k\)-means algorithm based on trusted server in quantum cloud computing
• A multi-valued quantum fully homomorphic encryption scheme
• Two-round quantum homomorphic encryption scheme based on matrix decomposition
• Quantum one-time pad-based quantum homomorphic encryption schemes for circuits of the non-Clifford gates
• A novel quantum solution to privacy-preserving lexicographical string sorting problem

This page was built for publication: An efficient quantum somewhat homomorphic symmetric searchable encryption

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1705121)