Design and Simulation of d Dimensional (t, n) Threshold Quantum Homomorphic Encryption Algorithm

被引：0
作者：
Song X.-L. [1 ,2 ]
Zhou D.-Y. [2 ]
Wen A.-J. [2 ]
机构：
[1] Chongqing University of Posts and Telecommunications, School of Cyber Security and Information Law, Chongqing
[2] Chongqing University of Posts and Telecommunications, College of Computer Science and Technology, Chongqing
来源：
Tien Tzu Hsueh Pao/Acta Electronica Sinica | 2020年 / 48卷 / 05期
关键词：
(t; n); threshold; D-dimension; Evaluation calculation; General unitary operator; Quantum homomorphic encryption;
D O I：
10.3969/j.issn.0372-2112.2020.05.003
中图分类号：
学科分类号：
摘要：
Quantum homomorphic cryptography directly evaluates the quantum ciphertext, rather than decrypts the quantum ciphertext and then calculates it. Based on a general d-dimensional unitary operator of phase and state transformation, a d-dimensional (t, n) threshold quantum homomorphic encryption algorithm was proposed. In this algorithm, the client sent the quantum state ciphertext to t of n servers. Each of the t servers generated the evaluation sub-keys, and then run the evaluation algorithm on the quantum state ciphertext to complete the calculation of quantum homomorphism. The client performed CNOT gates on the quantum states after decryption, and the aggregate value of t+1 particles was the result after evaluation calculation on the quantum state plaintext. The algorithm uses Shamir's(t, n) threshold scheme to hide the evaluation keys, so that it protects the client's private data. The theorems prove the correctness of the algorithm theoretically, and the simulations of each stage of the algorithm further verify its correctness. © 2020, Chinese Institute of Electronics. All right reserved.
引用
收藏
页码：846 / 853
页数：7
相关论文
共 17 条
  • [1] Shor P., Algorithms for quantum computation:discrete logarithms and factoring, 35th Annual Symposium on the Foundations of Computer Science, pp. 124-134, (1994)
  • [2] Rivest R L, Adleman L, Dertouzos M L., On data banks and privacy homomorphisms[J], Foundations of Secure Computation, pp. 169-179, (1978)
  • [3] Gentry C., A fully homomorphic encryption scheme, pp. 1-34, (2009)
  • [4] Gentry C., Computing arbitrary functions of encrypted data[J], Communications of the ACM, 53, 3, pp. 97-104, (2010)
  • [5] Castelluccia C, Chan C F, Mykletun E, Et al., Efficient and provably secure aggregation of encrypted data in wireless sensor networks, ACM Transactions on Sensor Networks, 5, 3, pp. 1-36, (2009)
  • [6] Hessler A, Kakumaru T, Perrey H, Et al., Data obfuscation with network coding[J], Computer Communications, 35, 1, pp. 48-61, (2012)
  • [7] Rohde P P, Fitzsimons J F, Gilchrist A., Quantum walks with encrypted data[J], Physical Review Letters, 109, 15, (2012)
  • [8] Liang M., Quantum fully homomorphic encryption scheme based on universal quantum circuit, Quantum Information Processing, 14, 8, pp. 2749-2759, (2015)
  • [9] Wang Y, She K, Luo Q, Et al., Symmetric weak ternary quantum homomorphic encryption schemes[J], Modern Physics Letters B, 30, (2016)
  • [10] Ouyang Y K, Tan S H, Fitzsimons J F., Quantum homomorphic encryption from quantum codes, Physical Review A, 98, (2015)
12