An efficient designated verifier signature scheme with pairing‐free and low cost. Issue 18 (16th January 2017)

• Record Type: Journal Article
• Authors: Hu, Xiaoming; Xu, Huajie; Liu, Yan; Wang, Jian; Tan, Wenan; Zhang, Xiaojun
• Is Part Of: Security and communication networks. Volume 9:Issue 18(2016)
• Page Start: 5724
• Page End: 5732
• Publication Date: 2017-01-16
• Subjects: cryptography -- designated verifier signature -- non‐delegatability -- message recovery -- pairing‐free; Computer networks -- Security measures -- Periodicals; Computer security -- Periodicals; Cryptography -- Periodicals; 005.805
• DOI: 10.1002/sec.1731
• Languages: English
• ISSNs: 1939-0114

Abstract

Abstract: In a strong designated verifier signature with message recovery (SDVSWMR) scheme, only the designated receiver has the capability to recover and validate the message‐signature pair. In 2015, using the bilinear pairing, Islam and Biswas presented an SDVSWMR scheme (we call it: IsBi‐SDVSWMR) with non‐delegatability, which has better performance than other schemes in terms of communication and computation cost. However, in this study, we address that IsBi‐SDVSWM scheme does not satisfy the security property of non‐delegatability as they claimed and we present two types of delegatability attack to their scheme. We also propose a new and pairing‐free SDVSWMR scheme that possesses the following security requirements: non‐delegatability, unforgeability, non‐transferability and privacy of signer's identity (PrSI). Compared our scheme with other existing related schemes, our scheme obtains better performance; that is, the computational cost is only 58%(lower) of IsBi‐SDVSWM scheme (other schemes), and the communication cost is 800 bits that is only 68%(lower) of IsBi‐SDVSWM scheme (other schemes). Copyright © 2017 John Wiley & Sons, Ltd. Abstract : In this paper, we propose a new and pairing‐free SDVSWMR scheme that possesses the following security requirements: non‐delegatability, unforgeability, non‐transferability and privacy of signer's identity. Compared our scheme with other existing related schemes, the proposed scheme obtains better performance; that is, the computational cost is only 58%(lower) of IsBi‐SDVSWM scheme (other schemes), and the communication cost is 800 bits that is only 68%(lower) of IsBi‐SDVSWM scheme (other schemes).