원문정보
보안공학연구지원센터(IJSIA)
International Journal of Security and Its Applications
Vol.10 No.10
2016.10
pp.181-190
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
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
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
저자정보
참고문헌
자료제공 : 네이버학술정보