An Undeniable Signature Scheme based on Quasi-Dyadic Codes

Abstract

Undeniable signature is a kind of signature primitive where the verification step is an interaction between the verifier and the signer. Code-based cryptography is an alternative of post quantum cryptography, which permits fast encryption operation. In this paper, we introduce a quasi-dyadic code based undeniable signature. The verification protocol for our scheme is a 5-pass zero-knowledge protocol derived from our previous identification protocol. We also analyze the security of completeness, soundnes, zero-knowledge, invisibility, unforgeability and nontransferability of the scheme. And the performance of our scheme shows the signature lengths for different security level, and that the communication costs in the verification step is less than the costs in the compared scheme.