Improved Identification Protocol in the Quantum Random Oracle Model

被引:0
作者
Gao, Wen [1 ]
Hu, Yupu [1 ]
Wang, Baocang [1 ]
Xie, Jia [1 ]
机构
[1] Xidian Univ, State Key Lab Integrated Serv Networks, Xian, Peoples R China
关键词
Collision-finding; quantum-accessible; identification protocol; grover's search algorithm; random oracle model;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Boneh et al. [6] proposed an identification protocol in Asiacrypt 2011 that is secure in the classical random oracle model but insecure in the quantum random oracle model. This paper finds that a constant parameter plays a significant role in the security of the protocol and the variation of this parameter changes the security greatly. Therefore, an improved identification protocol that replaces a variable with this constant parameter is introduced. This study indicates that, when the variable is chosen appropriately, the improved identification protocol is secure in both the classical and the quantum random oracle models. Finally, we find the secure lower bound for this variable.
引用
收藏
页码:339 / 345
页数:7
相关论文
共 17 条
[1]   Quantum Copy-Protection and Quantum Money [J].
Aaronson, Scott .
PROCEEDINGS OF THE 24TH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, 2009, :229-242
[2]  
[Anonymous], P QUANT COMP QUANT C
[3]  
[Anonymous], 2007, INT ARAB J INF TECHN
[4]  
[Anonymous], 2009, SHARCS
[5]  
Bellare M., 1994, J COMPUTER SYSTEM SC, V61, P362
[6]   Strengths and weaknesses of quantum computing [J].
Bennett, CH ;
Bernstein, E ;
Brassard, G ;
Vazirani, U .
SIAM JOURNAL ON COMPUTING, 1997, 26 (05) :1510-1523
[7]  
Boneh D, 2013, LECT NOTES COMPUT SC, V7881, P592, DOI 10.1007/978-3-642-38348-9_35
[8]   Random Oracles in a Quantum World [J].
Boneh, Dan ;
Dagdelen, Ozgur ;
Fischlin, Marc ;
Lehmann, Anja ;
Schaffner, Christian ;
Zhandry, Mark .
ADVANCES IN CRYPTOLOGY - ASIACRYPT 2011, 2011, 7073 :41-+
[9]  
Brassard G., 1998, THEORETICAL INFORMAT
[10]  
Brassard G., 2011, ADV CRYPTOLOGY CRYPT