Dual Construction of Stern-based Signature Scheme

Abstract

In this paper, we propose a dual version of the first identity-based scheme based on error-correcting code proposed by Cayrel et.al. Our scheme combines the McEliece signature and the Veron zero-knowledge identification scheme, which provide better computation complexity than the Stern one. We also propose a generalization of the Veron identification scheme in order to build a threshold ring signature scheme, which is secure in the random oracle model and has the advantage to reduce the computation complexity as well as the size of storage.