¹Department of Mathematics and Informatics, Ludong University, Yantai, China
²Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China
³School of Information and Electrical Engineering, Ludong University, Yantai, China
⁴School of Mathematics, South China Normal University, Guangzhou, China

---

Abstract—Undeniable signatures, introduced by Chaum and van Antwerpen, require a verifier to interact with the signer to verify a signature, and hence allow the signer to control the verifiability of his signatures. Convertible undeniable signatures allow the signer to convert undeniable signatures into ordinary signatures. In this paper we propose some extended variants of the famous Diffie- Hellman assumption on bilinear group system, then design a new convertible undeniable signature scheme and provide proofs for all relevant security properties based on the new assumption in the random oracle model. The advantages of our scheme are the short length of the signatures, the low computational cost of the signature, the receipt generation and the provable security.

Index Terms—Convertible undeniable signature, provable security, bilinear pairing.

[PDF]

Cite: Fei Li, Wei Gao, Yilei Wang, Xueli Wang, "Short Convertible Undeniable Signature From Pairing," Journal of Software vol. 8, no. 12, pp. 2983-2990, 2013.