Experimental realization of an entanglement access network and secure multi-party computation

被引:0
|
作者
X.-Y. Chang
D.-L. Deng
X.-X. Yuan
P.-Y. Hou
Y.-Y. Huang
L.-M. Duan
机构
[1] Center for Quantum Information,Department of Physics
[2] IIIS,undefined
[3] Tsinghua University,undefined
[4] University of Michigan,undefined
来源
关键词
D O I
暂无
中图分类号
学科分类号
摘要
To construct a quantum network with many end users, it is critical to have a cost-efficient way to distribute entanglement over different network ends. We demonstrate an entanglement access network, where the expensive resource, the entangled photon source at the telecom wavelength and the core communication channel, is shared by many end users. Using this cost-efficient entanglement access network, we report experimental demonstration of a secure multiparty computation protocol, the privacy-preserving secure sum problem, based on the network quantum cryptography.
引用
收藏
相关论文
共 50 条
  • [31] Rational protocol of quantum secure multi-party computation
    Zhao Dou
    Gang Xu
    Xiu-Bo Chen
    Xin-Xin Niu
    Yi-Xian Yang
    Quantum Information Processing, 2018, 17
  • [32] Application of Secure Multi-party Computation in Linear Programming
    Fu Zu-feng
    Wang Hai-ying
    Wu Yong-wu
    2014 IEEE 7TH JOINT INTERNATIONAL INFORMATION TECHNOLOGY AND ARTIFICIAL INTELLIGENCE CONFERENCE (ITAIC), 2014, : 244 - 248
  • [33] Secure Multi-party Quantum Computation with a Dishonest Majority
    Dulek, Yfke
    Grilo, Alex B.
    Jeffery, Stacey
    Majenz, Christian
    Schaffner, Christian
    ADVANCES IN CRYPTOLOGY - EUROCRYPT 2020, PT III, 2020, 12107 : 729 - 758
  • [34] Secure Multi-Party Computation for Machine Learning: A Survey
    Zhou, Ian
    Tofigh, Farzad
    Piccardi, Massimo
    Abolhasan, Mehran
    Franklin, Daniel
    Lipman, Justin
    IEEE ACCESS, 2024, 12 : 53881 - 53899
  • [35] Secure multi-party computation protocol for sorting problem
    School of Computer Science, Shaanxi Normal University, Xi'an 710062, China
    不详
    Hsi An Chiao Tung Ta Hsueh, 2008, 2 (231-233+255): : 231 - 233
  • [36] Minimal complete primitives for secure multi-party computation
    Fitzi, M
    Garay, JA
    Maurer, U
    Ostrovsky, R
    JOURNAL OF CRYPTOLOGY, 2005, 18 (01) : 37 - 61
  • [37] Secure multi-party computation protocol for sequencing problem
    TANG ChunMing 1
    2State Key Laboratory of Information Security
    3 School of Mathematics and Computational Science
    Science China(Information Sciences), 2011, 54 (08) : 1654 - 1662
  • [38] Round-Optimal Secure Multi-party Computation
    Halevi, Shai
    Hazay, Carmit
    Polychroniadou, Antigoni
    Venkitasubramaniam, Muthuramakrishnan
    JOURNAL OF CRYPTOLOGY, 2021, 34 (03)
  • [39] Secure Multi-party Computation of Differentially Private Median
    Bohler, Jonas
    Kerschbaum, Florian
    PROCEEDINGS OF THE 29TH USENIX SECURITY SYMPOSIUM, 2020, : 2147 - 2164
  • [40] Conclave: secure multi-party computation on big data
    Volgushev, Nikolaj
    Schwarzkopf, Matte
    Ben Getchell
    Varia, Mayank
    Lapets, Andrei
    Bestavros, Azer
    PROCEEDINGS OF THE FOURTEENTH EUROSYS CONFERENCE 2019 (EUROSYS '19), 2019,