Identity-Based Directed Signature Scheme without Bilinear Pairings


R. R. V. Krishna Rao,N. B. Gayathri,P. Vasudeva Reddy,



Digital signature,Directed Signature,Elliptic Curve Discrete Logarithm Problem,Identity-based Framework,Random Oracle Model,


P. Vasudeva ReddyThe most important contribution of modern cryptography is the invention of digital signatures. Digital signature schemes have been extended to meet the specific requirements for real world applications. A directed signature scheme is a kind of signature scheme intended to protect the privacy of the signature verifier. In directed signature schemes, a signer signs the document/message for a designated verifier so that only the designated verifier can verify the validity of the signature and others cannot do. Thus the restriction of verification is controlled by the signer. Such directed signature schemes are applicable in many situations where the signed message is sensitive to the receiver such as signature on medical records, tax information etc. However all the existing directed signature schemes in ID based setting uses bilinear pairings over elliptic curves. Due to the heavy computational cost of pairing operations, these existing ID based directed signature schemes are not much efficient in practice. In order to improve the efficiency, in this paper, we present an efficient Identity-based directed signature scheme without pairings. The proposed scheme is proven secure under the assumption of elliptic curve discrete logarithm problem is hard. In addition, this scheme improves the efficiency than the existing directed signature schemes in terms of computational cost.


I.A. Shamir; “Identity-based Cryptosystems and Signature Schemes”, Advances in Cryptology, Crypto-84, Lecture Notes in Computer Science, Springer, vol. 196, pp.47-53, 1984

II.B. Uma Prasada Rao; P. Vasudeva Reddy; T. Gowri; “An efficient ID-Based Directed Signature Scheme from Bilinear Pairings”, Available at

III.C. H. Lim; P. J. Lee; “Directed Signatures and Applications to Threshold Cryptosystem”, Workshop on Security Protocol, Cambridge, pp. 131-138, 1996

IV.C. P. Schnorr; “Efficient Identification and Signatures for Smart Cards”,Advances in Cryptology-Crypto’89, Lecture Notes in Computer Science, Springer, vol. 435, pp. 239-252, 1989

V.D. Pointcheval; J. Stern; “Security Arguments for Digital Signatures and Blind Signatures”, Journal of Cryptology, vol. 13, No.3, pp.361-369, 2000

VI.E. S. Ismail; Y. Abu-Hassan; “A Directed Signature Scheme Based on Discrete Logarithm Problems”, Jurnal Teknologi, vol. 47(C), pp. 37-44, 2007

VII.F. Laguillaumie; P. Paillier; D. Vergnaud; “Universally Convertible Directed Signatures”, Advances in Cryptology -ASIACRYPT’05, Lecture Notes in Computer Science, Springer, vol. 3788, pp. 682–701, 2005

VIII.J. Ku; D. Yun; B. Zheng; S. Wei; “An Efficient ID-Based Directed Signature Scheme from Optimal Eta Pairing”, Computational Intelligence and Intelligent Systems, vol. 316, pp. 440-448, 2012

IX.J. Zhang; Y. Yang; X. Niu; “Efficient Provable Secure ID-Based Directed Signature Scheme without Random Oracle”, 6th International Symposium on Neural Networks: Advances in Neural Networks-ISNN 2009, Lecture Notes in Computer Science, Springer, vol. 5553, pp.318-327, 2009

X.L. C. Guillou; J. J. Quisquater; “A “Paradoxical” Indentity-BasedSignature Scheme Resulting from Zero-Knowledge”, Advances in Cryptology-Crypto’88, Lecture Notes in Computer Science, Springer, vol. 403, pp. 216-231, 1988

XI.N. B. Gayathri; T. Gowri; R. R. V. Krishna Rao; P. Vasudeva Reddy; “Efficient and Secure Pairing-free Certificateless Directed Signature Scheme”, Journal of King Saud University-Computer and Information Sciences, Article in press, 2018

XII.N. Koblitz; “Elliptic Curve Cryptosystems”, Mathematics of Computation, vol. 48, no. 177, pp. 203-209, 1987

XIII.N. N. Ramlee; E. S. Ismail; “A New Directed Signature Scheme with Hybrid Problems”, Applied Mathematical Sciences, vol. 7, No. 125, pp. 6217-6225, 2013

XIV.N. Tiwari; S. Padhye; “Provable Secure Multi-proxy Signature Scheme without Bilinear Maps”, International Journal of Network Security,vol.17, no.6, pp.736-742, 2015XV.P.S.L.M. Barreto; B. Libert; N. McCullagh; J.J. Quisquater; “Efficient and Provably Secure Identity-based Signatures and Signcryption from Bilinear Maps”, Advances in Cryptology-ASIACRYPT’05, Lecture Notes in Computer Science, Springer, vol. 3788, pp. 515-532, 2005

XVI.Q. Wei; J. He; H. Shao; “Directed Signature Scheme and its Application to Group Key Initial Distribution”, 2ndInternational Conference on Interaction Sciences: Information Technology, Culture and Human (ICIS-2009), ACM, 2009, pp. 24-26, 2009

XVII.R. Lu; Z. Cao; “A Directed Signature Scheme Based on RSA Assumption”, International Journal of Network Security, vol. 2, No. 3, pp.182–421, 2006

XVIII.S. Lal; M. Kumar; “A Directed Signature Scheme and its Applications”, 2004. Available at

XIX.S. Y. Tan; S. H. Heng; B. M. Goi; “Java Implementation for Pairing-Based Cryptosystems”, Computational Science and Its Applications (ICCSA’10), Lecture Notes in Computer Science, Springer, vol. 6019, pp. 188-198, 2010

XX.Shamus Software Ltd. Miracl Library. Available: /EXT/MIRACL.

XXI.V. Miller; “Uses of Elliptic Curves in Cryptography”, Advances in Cryptology-Crypto 85, pp. 417-426, 1985

XXII.W. Diffie; M.E. Hellman; “New Directions in Cryptography”, IEEE Transactions in Information Theory, vol. 22, pp.644-654, 1976

XXIII.X. Cao; W. Kou; X. Du; “A Pairing-free Identity-based Authenticated Key Agreement Protocol with MinimalMessage Exchanges”, Information Sciences, vol. 180, No. 15, pp. 2895-2903, 2010

XXIV.X. Sun; J. Li; G. Chen; S. Yung; “Identity-Based Directed Signature Scheme from Bilinear Pairings”, Available at https://

XXV.Y. Wang; “Directed Signature Based on Identity”, Journal of Yulin College, vol. 15, No. 5, pp. 1–3, 2005

R. R. V. Krishna Rao, N. B. Gayathri, P. Vasudeva Reddy View Download