Citation

Tan, Syh-Yuan and Heng, Swee-Huay and Phan, Raphael C. -W. and Goi, Bok-Min (2011) A variant of Schnorr identity-based identification scheme with tight reduction. In: Future Generation Information Technology. Lecture Notes in Computer Science (7105). Springer Berlin Heidelberg, pp. 361-370. ISBN 978-3-642-27141-0

Text 5.pdf Restricted to Repository staff only Download (233kB)

Abstract

Using the rewinding technique from Reset Lemma, Schnorr identity-based identification (IBI) can be proven secure against impersonation under passive attack, and active and concurrent attacks if the discrete logarithm problem and one-more discrete logarithm problem are hard in the random oracle model respectively. However, its security reduction is not tight. In this paper, we propose a variant of Schnorr IBI scheme and provide a direct proof with tight security reduction. In particular, we show that with only three additional elements in the system parameters, the proposed scheme can be proven secure against impersonation under passive attack, and active and concurrent attacks if the decisional Diffie-Hellman problem is hard in the random oracle model. This proving technique may also be applied on other IBI schemes

Item Type:	Book Section
Additional Information:	Third International Conference, FGIT 2011 in Conjunction with GDC 2011, Jeju Island, Korea, December 8-10, 2011. Proceedings
Subjects:	T Technology > T Technology (General)
Divisions:	Faculty of Information Science and Technology (FIST)
Depositing User:	Ms Rosnani Abd Wahab
Date Deposited:	02 Jan 2014 01:26
Last Modified:	02 Jan 2014 01:26
URII:	http://shdl.mmu.edu.my/id/eprint/4702

Downloads

Edit (login required)