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 条
  • [31] Blind Quantum Signature with Blind Quantum Computation
    Wei Li
    Ronghua Shi
    Ying Guo
    International Journal of Theoretical Physics, 2017, 56 : 1108 - 1115
  • [32] Blind Quantum Computation with Two Decoy States
    Zhao, Qiang
    Li, Qiong
    ADVANCES IN INTELLIGENT INFORMATION HIDING AND MULTIMEDIA SIGNAL PROCESSING, VOL 2, 2017, 64 : 155 - 162
  • [33] On Secure Two-Party Computation in Three Rounds
    Ananth, Prabhanjan
    Jain, Abhishek
    THEORY OF CRYPTOGRAPHY, TCC 2017, PT I, 2017, 10677 : 612 - 644
  • [34] Statistical Security in Two-Party Computation Revisited
    Badrinarayanan, Saikrishna
    Patranabis, Sikhar
    Sarkar, Pratik
    THEORY OF CRYPTOGRAPHY, TCC 2022, PT II, 2022, 13748 : 181 - 210
  • [35] Two-Party Function Computation on the Reconciled Data
    Kubjas, Ivo
    Skachek, Vitaly
    2017 55TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2017, : 390 - 396
  • [36] Efficiency tradeoffs for malicious two-party computation
    Mohassel, Payman
    Franklin, Matthew
    PUBLIC KEY CRYPTOGRAPHY - PKC 2006, PROCEEDINGS, 2006, 3958 : 458 - 473
  • [37] Rational secure two-party computation protocol
    Zhang, En
    Cai, Yongquan
    Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2013, 50 (07): : 1409 - 1417
  • [38] An improved secure two-party computation protocol
    Yu, Y
    Leiwo, J
    Premkumar, B
    INFORMATION SECURITY AND CRYPTOLOGY, PROCEEDINGS, 2005, 3822 : 221 - 232
  • [39] Complete Fairness in Secure Two-Party Computation
    Gordon, S. Dov
    Hazay, Carmit
    Katz, Jonathan
    Lindell, Yehuda
    STOC'08: PROCEEDINGS OF THE 2008 ACM INTERNATIONAL SYMPOSIUM ON THEORY OF COMPUTING, 2008, : 413 - +
  • [40] Secure Two-Party Computation with Low Communication
    Damgard, Ivan
    Faust, Sebastian
    Hazay, Carmit
    THEORY OF CRYPTOGRAPHY (TCC 2012), 2012, 7194 : 54 - 74