首页> 外文期刊>Quantum information processing >Grover algorithm-based quantum homomorphic encryption ciphertext retrieval scheme in quantum cloud computing
【24h】

Grover algorithm-based quantum homomorphic encryption ciphertext retrieval scheme in quantum cloud computing

机译:基于格罗弗算法的量子均匀加密Quantum云计算中的upipherText检索方案

获取原文
获取原文并翻译 | 示例
           

摘要

Existing classical ciphertext retrieval schemes are mainly developed according to the homomorphic encryption that is a cryptographic technique based on computational complexity theory of mathematical puzzles. In quantum computing, on the one hand, most of traditional asymmetric encryption can be quickly cracked as the computational capacity of quantum computer is much higher than that of traditional digital computer. Hence, the quantum homomorphic encryption scheme is widely used in data encryption for the issue of privacy protection in quantum computing. But on the other the retrieval efficiency of homomorphic encrypted data is insufficient especially in quantum cloud computing. Therefore, this paper proposes a novel quantum homomorphic encryption ciphertext retrieval (QHECR) scheme basing on the Grover algorithm to solve the problem of homomorphic encrypted ciphertext data retrieval in quantum cloud computing. Our scheme is to improve such retrieval efficiency mentioned above where the interaction process is not required even if the T-gate exists in the circuit. In the experiment, two qubits without the T-gate are conducted on both simulations and real quantum devices by using IBM quantum information science kit (Qiskit). The results show that the proposed QHECR scheme is capable of achieving the retrieval encrypted data when the T-gate does not exist in the evaluation circuit in ciphertext environment. Moreover, a verification experiment about the T-gate key update algorithm is implemented to verify the feasibility and reliability of the proposed scheme in the Qiskit as well, which indicates that the QHECR is still available when the T-gate exists in the circuit. Since the decryption is inefficient when there are exponential T-gates in the circuit, our proposed scheme is suitable for low T-gate complexity.
机译:现有的经典密文检索方案主要根据具有基于数学难题的计算复杂性理论的加密技术开发的。在量子计算中,一方面,由于量子计算机的计算能力远高于传统数字计算机的计算能力,大多数传统的不对称加密都可以快速破解。因此,量子均匀加密方案广泛用于量子计算中隐私保护问题的数据加密。但另一方面,同性恋加密数据的检索效率特别是在量子云计算中的不足。因此,本文提出了一种新的量子均匀加密密文检索(QHECR)方案,基于Grover算法来解决量子云计算中的同性恋加密密文数据检索问题。我们的方案是提高上述此类检索效率,即使在电路中存在时,也不需要相互作用过程。在实验中,使用IBM量子信息科学套件(Qiskit)在模拟和真实量子设备上进行两种没有T型栅极的Qubits。结果表明,当在密文环境中的评估电路中不存在T型门时,所提出的QHECR方案能够实现检索加密数据。此外,还实现了关于T型栅极密钥更新算法的验证实验,验证了Qiskit中提出的方案的可行性和可靠性,这表明当电路中的T栅极存在时QHECR仍然可用。由于在电路中存在指数T型栅极时,解密效率低下,所以我们所提出的方案适用于低T型栅极复杂性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号