충청수학회지 (Journal of the Chungcheong Mathematical Society)
- 제21권3호
- /
- Pages.403-411
- /
- 2008
- /
- 1226-3524(pISSN)
- /
- 2383-6245(eISSN)
SECURE IDENTIFICATION AND SIGNATURE USING ZERO-KNOWLEDGE PROOFS AND BILINEAR PAIRINGS
- Choi, Byung Mun (Department of Computer and Information Security, Daejeon University) ;
- Lee, Young Whan (Department of Computer and Information Security, Daejeon University)
- 투고 : 2008.07.31
- 심사 : 2008.08.22
- 발행 : 2008.09.30
초록
In 2005, A. Saxena, B. Soh and S. Priymak [10] proposed a two-flow blind identification protocol. But it has a weakness of the active-intruder attack and uses the pairing operation that causes slow implementation in smart cards. In 2008, Y. W. Lee [9] made a method of the active-intruder attack on their identification scheme and proposed a new zero-knowledge blind identification protocol for smart cards. In this paper, we give more simple and fast protocols than above protocols such that the prover using computationally limited devices such as smart cards has no need of computing the bilinear pairings. Computing the bilinear pairings is needed only for the verifier and is secure assuming the hardness of the Discrete-Logarithm Problem (DLP).