An undeniable strong DSVS scheme with no bilinear pairings

Undeniability is an essential security property of the traditional digital signature. Strong designated verifier signature(DSVS) is a special digital signature in where the validity of a signature can only be checked by the designated verifier. However, most strong DSVS schemes do not have the undeniability property which leads to dispute between a designated verifier and a signer. In this study, we propose a new strong DSVS scheme. The proposed strong designated verifier scheme involves three participators: a designated verifier, a signer and a judger. When a dispute happens, the judger can tell the real signer by simple computation. So, our scheme proposed in this study holds the undeniability property. What's more, the security and efficiency analysis of this paper's scheme are been presented. By comparing the proposed scheme and other similar strong DSVS schemes, it shows that our proposed strong designated verifier scheme has good performance on the undenability and the cost. We also showed the detail comparison. Therefore, the proposed scheme can be applied in many environments such as electronic-voting and business, e-healthcare and etc.

[1]  Kaoru Kurosawa,et al.  The security of the FDH variant of Chaum's undeniable signature scheme , 2006, IEEE Trans. Inf. Theory.

[2]  Qiang Liu,et al.  A lattice-based designated verifier signature for cloud computing , 2015, Int. J. High Perform. Comput. Netw..

[3]  Ji-Seon Lee,et al.  Strong Designated Verifier Signature Scheme with Message Recovery , 2007, The 9th International Conference on Advanced Communication Technology.

[4]  Ji-Seon Lee,et al.  Comment on Saeednia et al.'s strong designated verifier signature scheme , 2009, Comput. Stand. Interfaces.

[5]  Qiong Huang,et al.  Short and efficient convertible undeniable signature schemes without random oracles , 2013, Theor. Comput. Sci..

[6]  Li Xu,et al.  Universal designated verifier transitive signatures for graph-based big data , 2015, Inf. Sci..

[7]  Yong Yu,et al.  A novel construction of SDVS with secure disavowability , 2013, Cluster Computing.

[8]  Serge Vaudenay,et al.  Short Undeniable Signatures Based on Group Homomorphisms , 2011, Journal of Cryptology.

[9]  Kaoru Kurosawa,et al.  The security of the FDH variant of Chaum's undeniable signature scheme , 2005, IEEE Transactions on Information Theory.

[10]  Yupu Hu,et al.  Efficient identity-based signature over NTRU lattice , 2016, Frontiers of Information Technology & Electronic Engineering.

[11]  Naveen K. Chilamkurti,et al.  Detection and analysis of secure intelligent universal designated verifier signature scheme for electronic voting system , 2014, The Journal of Supercomputing.

[12]  Kenneth G. Paterson,et al.  RSA-Based Undeniable Signatures for General Moduli , 2002, CT-RSA.

[13]  Jianhong Zhang,et al.  A novel ID-based designated verifier signature scheme , 2008, Inf. Sci..

[14]  Feng Bao,et al.  Designated Verifier Signature Schemes: Attacks, New Security Notions and a New Construction , 2005, ICALP.

[15]  Han-Yu Lin,et al.  An Efficient Strong Designated Verifier Proxy Signature Scheme for Electronic Commerce , 2012, J. Inf. Sci. Eng..

[16]  Yi Mu,et al.  Short Designated Verifier Signature Scheme and Its Identity-based Variant , 2008, Int. J. Netw. Secur..

[17]  Markus Jakobsson,et al.  Designated Verifier Proofs and Their Applications , 1996, EUROCRYPT.

[18]  Yang Shi,et al.  Secure Mobile Agents in eCommerce with Forward‐Secure Undetachable Digital Signatures , 2015 .

[19]  Han-Yu Lin,et al.  A DL Based Short Strong Designated Verifier Signature Scheme with Low Computation , 2011, J. Inf. Sci. Eng..

[20]  Qi Xia,et al.  A Strong Designated Verifier Signature Scheme with Secure Disavowability , 2012, 2012 Fourth International Conference on Intelligent Networking and Collaborative Systems.

[21]  Chun-I Fan,et al.  Attribute-based strong designated-verifier signature scheme , 2012, J. Syst. Softw..

[22]  Q. Z Yue,et al.  An Improved Designated Verifier Signature Schemes Using Bilinear Paring , 2015 .

[23]  Fuw-Yi Yang,et al.  A Provably Secure and Efficient Strong Designated Verifier Signature Scheme , 2010 .

[24]  Sk Hafizul Islam,et al.  A provably secure identity-based strong designated verifier proxy signature scheme from bilinear pairings , 2014, J. King Saud Univ. Comput. Inf. Sci..

[25]  Wei Zhao,et al.  Certificateless undeniable signatures from bilinear maps , 2012, Inf. Sci..

[26]  Jacques Stern,et al.  Security Arguments for Digital Signatures and Blind Signatures , 2015, Journal of Cryptology.

[27]  Swee-Huay Heng,et al.  An efficient certificateless undeniable signature scheme , 2015, Int. J. Comput. Math..

[28]  Ed Dawson,et al.  Identity-based strong designated verifier signature schemes: Attacks and new construction , 2009, Comput. Electr. Eng..

[29]  Pankaj Sarde,et al.  Strong Designated Verifier Signature Scheme Based on Discrete Logarithm Problem , 2015 .

[30]  Shanshan Duan,et al.  Certificateless undeniable signature scheme , 2008, Inf. Sci..

[31]  Dong Hoon Lee,et al.  Constructing Strong Identity-Based Designated Verifier Signatures with Self-Unverifiability , 2012 .

[32]  Olivier Markowitch,et al.  An Efficient Strong Designated Verifier Signature Scheme , 2003, ICISC.