Zero-knowledge identification scheme with companion matrices of primitive polynomials

2020 ◽  
Vol 12 (2) ◽  
pp. 216
Author(s):  
Huawei Huang ◽  
Lunzhi Deng ◽  
Yunyun Qu ◽  
Chunhua Li
Keyword(s):  
Zero Knowledge ◽  
Identification Scheme ◽  
Primitive Polynomials ◽  
Knowledge Identification ◽  
Companion Matrices

A NEW BATCH IDENTIFICATION SCHEME

2009 ◽  
Vol 01 (03) ◽  
pp. 369-376 ◽  
Author(s):  
MASSOUD HADIAN DEHKORDI ◽  
REZA ALIMORADI
Keyword(s):  
Electronic Communication ◽  
Security Analysis ◽  
Weil Pairing ◽  
Zero Knowledge ◽  
Identification Scheme ◽  
Authorized User ◽  
The World ◽  
Secret Keys ◽  
Knowledge Identification

Identification protocols have a very important role in the world of electronic communication. In an identification protocol, the prover (user) proves to the verifier (center) that it is truly the authorized user who is communicating with the center. In one round of batch identification scheme a user with several secret keys (identities) can prove itself to the verifier instead of several proofs. In this paper, the first Weil pairing will be introduced. In addition, we propose a new batch zero-knowledge identification scheme based on the Weil pairing hereafter considered the security analysis of our proposed scheme.

Sign in / Sign up

Export Citation Format

Share Document