Improved Identification Protocol in the Quantum
Random
Oracle Model
Wen Gao, Yupu Hu, Baocang Wang, and Jia Xie
State Key Laboratory of Integrated Service Networks,
Xidian University, China
Abstract: 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.
Keywords: Collision-finding, quantum-accessible,
identification protocol, grover’s search algorithm, random oracle model.
Received November 11, 2014; accepted February 10, 2015