[KSCI] Korea Science Citation Index Service

http://dx.doi.org/10.14317/jami.2011.29.3_4.869

ON EFFICIENT TWO-FLOW ZERO-KNOWLEDGE IDENTIFICATION AND SIGNATURE

Lee, Young-Whan (Department of Computer Hacking and Information Security, College of Natural Sciences, Daejeon University)

Publication Information

Journal of applied mathematics & informatics / v.29, no.3_4, 2011 , pp. 869-877 More about this Journal

Abstract

In this paper, we propose an efficient two-flow zero-knowledge blind identification protocol on the elliptic curve cryptographic (ECC) system. A. Saxena et al. first proposed a two-flow blind identification protocol in 2005. But it has a weakness of the active-intruder attack and uses the pairing operation that causes slow implementation in smart cards. But our protocol is secure under such attacks because of using the hash function. In particular, it is fast because we don't use the pairing operation and consists of only two message flows. It does not rely on any underlying signature or encryption scheme. Our protocol is secure assuming the hardness of the Discrete-Logarithm Problem in bilinear groups.

Keywords

Identification; Signature; Zero-Knowledge; Bilinear pairing;

Citations & Related Records

Reference

1	B. M. Choi and Y. W. Lee, Secure identification and signature using Zero-knowledge proofs and bilinear pairings, J. Chungcheong Math. Soc. 21 (2008) 403-411.
2	A. Saxena, B. Soh and S. Priymak, Zero-Knowledge blind identification for smart cards using bilinear pairings, Cryptology e-Print Archive, Report 343, (2005).
3	D.R. Stinson and J. Wu, An effcient and secure two-flow zero-knowledge identification protocol, Cryptology e-Print Archive, Report 337, (2006).
4	W. Diffe, P.C. van Oorschot and M.J. Wiener, Authentication and Authenticated key exchanges Designs, Codes and Cryptography 2 (1992), 107-125. DOI ScienceOn
5	U. Feige, A. Fiat, and A. Shamir, Zero knowledge proofs of identity, J. Cryptology 1 (1988), 77-94. DOI ScienceOn
6	A. Fiat and A. Shamir, How to prove yourself: practical solutions to identification and sig- nature problems, Advances in Cryptology, Lecture Notes in Computer Science 263 (1987), 186-194.
7	O. Goldreich, S. Micali, and A. Wigderson, Proofs that yield nothing but their validity or all languages in np have zero-knowledge proof systems, J. ACM 38 (3) (1991), 690-728. DOI
8	Y. W. Lee and B. M. Choi, Intelligent ID-based threshold systems by an encryption and decryption from bilinear pairing, Lecture Notes in Artificial Intelligence, 9th International Conference, KES LNAI 3682 (2005) 1022-1028.
9	M. Bellare and O. Goldreich, On defining proofs of knowledge, Lecture Notes in computer Science 740 (1993), 390-420.
10	M. Bellare and P. Rogaway, Entity authentication and key distribution, Lec-ture Notes in computer Science 773 (1994), 232-149.
11	D. Boneh, B. Lynn, and H. Shacham, Short signatures from the Weil pairing, In ASI- ACRYPT '01: Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security, London, UK, Springer-Verlag, (2001), 514-532.
12	D. Boneh and M.K. Franklin, Identity-based encryption from the Weil pairing, In CRYPTO '01: Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology, Springer-Verlag, (2001), 213-229.