Code-based authentication with designated verifier
by Yan Ren; Hongbin Wang; Jiali Du; Liqiong Ma
International Journal of Grid and Utility Computing (IJGUC), Vol. 7, No. 1, 2016

Abstract: The public key encryption scheme based on the bounded decoding problem was first introduced by McEliece in 1978. Since then, several code-based signature schemes have been designed. Most of them have been analysed and proven secure against different types of adversaries. However, researchers have given less attention to the code-based strong Designated Verifier Signature (DVS) scheme. In this paper, we introduce a new strong DVS scheme. It is based on CFS signature and Stern's identification scheme, whose security depends on syndrome decoding problem and bounded decoding problem. The proposed scheme is the first code-based strong DVS, and also satisfies the strong designated verifier, unforgeability and non-delegatability properties which are the security requirements for a strong DVS.

Online publication date: Tue, 22-Dec-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Grid and Utility Computing (IJGUC):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com