Application of Blind Quantum Computation to Two-Party Quantum Computation

被引:7
|
作者
Sun, Zhiyuan [1 ]
Li, Qin [1 ]
Yu, Fang [2 ]
Chan, Wai Hong [3 ]
机构
[1] Xiangtan Univ, Coll Informat Engn, Xiangtan 411105, Peoples R China
[2] Jinan Univ, Dept Comp Sci, Guangzhou 510632, Guangdong, Peoples R China
[3] Educ Univ Hong Kong, Dept Math & Informat Technol, Tai Po, Hong Kong, Peoples R China
基金
中国国家自然科学基金;
关键词
Blind quantum computation; Two-party quantum computation;
D O I
10.1007/s10773-018-3711-9
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
Blind quantum computation (BQC) allows a client who has only limited quantum power to achieve quantum computation with the help of a remote quantum server and still keep the client's input, output, and algorithm private. Recently, Kashefi and Wallden extended BQC to achieve two-party quantum computation which allows two parties Alice and Bob to perform a joint unitary transform upon their inputs. However, in their protocol Alice has to prepare rotated single qubits and perform Pauli operations, and Bob needs to have a powerful quantum computer. In this work, we also utilize the idea of BQC to put forward an improved two-party quantum computation protocol in which the operations of both Alice and Bob are simplified since Alice only needs to apply Pauli operations and Bob is just required to prepare and encrypt his input qubits.
引用
收藏
页码:1864 / 1871
页数:8
相关论文
共 50 条
  • [41] Partial Fairness in Secure Two-Party Computation
    Gordon, S. Dov
    Katz, Jonathan
    ADVANCES IN CRYPTOLOGY - EUROCRYPT 2010, 2010, 6110 : 157 - 176
  • [42] Efficient Fair Secure Two-Party Computation
    Ruan, Ou
    Zhou, Jing
    Zheng, Minghui
    Cui, Guohua
    2012 IEEE ASIA-PACIFIC SERVICES COMPUTING CONFERENCE (APSCC), 2012, : 243 - 248
  • [43] Fairplay - A secure two-party computation system
    Malkhi, D
    Nisan, N
    Pinkas, B
    Sella, Y
    USENIX ASSOCIATION PROCEEDINGS OF THE 13TH USENIX SECURITY SYMPOSIUM, 2004, : 287 - 302
  • [44] Complete Fairness in Secure Two-Party Computation
    Gordon, S. Dov
    Hazay, Carmit
    Katz, Jonathan
    Lindell, Yehuda
    JOURNAL OF THE ACM, 2011, 58 (06)
  • [45] Partial Fairness in Secure Two-Party Computation
    S. Dov Gordon
    Jonathan Katz
    Journal of Cryptology, 2012, 25 : 14 - 40
  • [46] Impossibility of secure two-party classical computation
    Colbeck, Roger
    PHYSICAL REVIEW A, 2007, 76 (06)
  • [47] Partial Fairness in Secure Two-Party Computation
    Gordon, S. Dov
    Katz, Jonathan
    JOURNAL OF CRYPTOLOGY, 2012, 25 (01) : 14 - 40
  • [48] Revisiting the efficiency of malicious two-party computation
    Woodruff, David P.
    Advances in Cryptology - EUROCRYPT 2007, 2007, 4515 : 79 - 96
  • [49] Adaptively Secure Two-Party Computation with Erasures
    Lindell, Andrew Y.
    TOPICS IN CRYPTOLOGY - CT-RSA 2009, PROCEEDINGS, 2009, 5473 : 117 - 132
  • [50] Secure Two-Party Computation: A Visual Way
    D'Arco, Paolo
    De Prisco, Roberto
    INFORMATION THEORETIC SECURITY, ICITS 2013, 2014, 8317 : 18 - 38