Authors: Yan Ren; Hongbin Wang; Jiali Du; Liqiong Ma
Addresses: Department of Applied Mathematics, Yuncheng University, Yuncheng, Shanxi 044000, China ' Department of Applied Mathematics, Yuncheng University, Yuncheng, Shanxi 044000, China ' Guangzhou Vocational School of Finance and Economic, Guangzhou, Guangdong 510000, China ' Emei Campus of Southwest Jiaotong University, Emei, Sichuan 614200, China
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.
Keywords: digital signature; coding theory; code-based signature; syndrome decoding problem; bounded decoding problem; strong DCS; designated confirmer signature; security; non-delegatability; cryptography; designated verifier signature; strong DVS; unforgeability.
International Journal of Grid and Utility Computing, 2016 Vol.7 No.1, pp.61 - 67
Available online: 18 Dec 2015 *Full-text access for editors Access for subscribers Purchase this article Comment on this article