Improved Identification Protocol in the Quantum Random Oracle Model
Journal: The International Arab Journal of Information Technology (Vol.14, No. 3)Publication Date: 2017-05-01
Authors : Wen Gao; Yupu Hu; Baocang Wang; Jia Xie;
Page : 339-345
Keywords : Collision-finding; quantum-accessible; identification protocol; grover’s search algorithm; random oracle model;
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.
Other Latest Articles
- A New Approach for Arabic Named Entity Recognition
- A New Leaky-LMS Algorithm with Analysis
- Proficient Decision Making on Virtual Machine Creation in IaaS Cloud Environment
- New Blind Signature Protocols Based on a New Hard Problem
- Cuckoo Search with Mutation for Biclustering of Microarray Gene Expression Data
Last modified: 2019-05-08 18:21:20