Earticle

초록

영어

In this paper we present an improved version of the zero-knowledge identification scheme based on algebraic coding theory. Our protocol is related to the Véron’s identification scheme but permits a lower communication complexity by transferring two hash values in each round instead of three. And the protocol decreases the cheating probability to about 1/2 instead of 2/3 which reduces the rounds of the protocol. Furthermore, we construct the parity-check matrix in a quasi-dyadic form in order to dramatically reduce the matrix size. In sum, the new scheme has good properties of having a small matrix size, computation complexity, and for an overall communication cost of 22.8kb for authentication.

목차

Abstract
 1. Introduction
 2. Preliminaries
 3. Code-Based Zero-Knowledge Identification Schemes
  3.1. The Véron Identification Scheme
 4. A New Code-Based Zero-Knowledge Identification Scheme
  4.1. Key Generation Algorithm
  4.2. Identification Protocol
 5. Security Proof
 6. Parameters for Authentication
 7. Conclusion
 References

키워드

저자

• Mu Han [ School of Computer Science and Communication Engineering, Jiangsu University, Zhenjiang, China ]
• Xiaolin Feng [ School of Computer Science and Communication Engineering, Jiangsu University, Zhenjiang, China ]
• Shidian Ma [ Automotive Engineering Research Institute, Jiangsu University, Zhenjiang, China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Security and Its Applications

• 간기

  격월간

• pISSN

  1738-9976

• 수록기간

  2008~2016

• 등재여부

  SCOPUS

• 십진분류

  KDC 505 DDC 605