检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Feng WANG Mingxing LUO Huiran LI Zhiguo QU Xiaojun WANG
机构地区:[1]College of Mathematical Sciences,Dezhou University,Dezhou 253023,China [2]Information Security and National Computing Grid Laboratory,Southwest Jiaotong University,Chengdu 610031,China [3]Jiangsu Engineering Center of Network Monitoring,Nanjing University of Information Science 35 Technology Nanjing 210044,China [4]School of Electronic Engineering,Dublin City University,Dublin 9,Ireland
出 处:《Science China(Information Sciences)》2016年第11期191-203,共13页中国科学(信息科学)(英文版)
基 金:supported by National Natural Science Foundation of China (Grant Nos. 61303039, 61373131);Natural Science Foundation of Shandong Province (Grant No. ZR2015FL024);Fundamental Research Funds for the Central Universities (Grant No. 2682014CX095);PAPD and CICAEET Funds;Open Foundation of Jiangsu Engineering Center of Network Monitoring (Nanjing University of Information Science & Technology) (Grant No. KJR1502);Open Foundation of China-USA Computer Science Center (Grant No. KJR16012);Science Foundation Ireland (SFI) under the International Strategic Cooperation Award (Grant No. SFI/13/ISCA/2845)
摘 要:A serious problem in cloud computing is privacy information protection. This study proposes a new private comparison protocol using Einstein-Podolsky-Rosen (EPR) pairs. This protocol allows two parties to secretly compare their classical information. Quantum dense coding enables the comparison task to be completed with the help of a classical semi-honest center. A one-step transmission scheme and designed decoy photons can be used against various quantum attacks. The new protocol can ensure fairness, efficiency, and security. The classical semi-honest center cannot learn any information about the private inputs of the players. Moreover, this scheme can be easily generalized using the general EPR pairs in order to improve the transmission efficiency.A serious problem in cloud computing is privacy information protection. This study proposes a new private comparison protocol using Einstein-Podolsky-Rosen (EPR) pairs. This protocol allows two parties to secretly compare their classical information. Quantum dense coding enables the comparison task to be completed with the help of a classical semi-honest center. A one-step transmission scheme and designed decoy photons can be used against various quantum attacks. The new protocol can ensure fairness, efficiency, and security. The classical semi-honest center cannot learn any information about the private inputs of the players. Moreover, this scheme can be easily generalized using the general EPR pairs in order to improve the transmission efficiency.
关 键 词:private comparison multiparty secure computation classical semi-honesty center quantum densecoding general EPR pair
分 类 号:TN918[电子电信—通信与信息系统] O413[电子电信—信息与通信工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.229