Abstract

This paper introduces a new scheme “ A Public Verifiability Signcryption Scheme Without Pairings ” , based on elliptic curve discrete logarithm problem (ECDLP) and in addition to achieve the functionality of the Signcryption schemes, unforgeability, confidentiality and nonrepudiation, it achieves forward security and public verifiability directly. Also, it uses a strong encryption key depends on random choose value and the sender’s private key, although the proposed scheme is slower than the Zheng’s signcryption scheme, it achieves saving in communication overhead reach to 50% with respect to the traditional approach signature then encryption. The proposed scheme has been verified using the Mathematica program.

References

• Y. Zheng, “Digital signcryption or how to achieve cost (signature & encryption) << cost (signature) + cost(encryption)”, Advances in Cryptology – Crypto’97, LNCS 1294, Springer-Verlag, 1997, pp. 165–179.
• Y. Zheng, “Signcryption and Its Applications in Efficient Public Key Solutions”, Monash University Australia, Lecture Notes in Computer Science, Vol.1397, pp.291-312, Springer-Verlag, 1998 URL: http://www-pscit.fcit.monash.edu.au/~yuliang/.
• Y. Zheng, and H. Imai, “How to construct efficient signcryption schemes on elliptic curves,” Information Processing Letters, Vol.68, pp.227-233, Elsevier, 1998.
• Feng Bao and Robert H Deng, “A Signcryption Scheme with Signature Directly Veriable by Public Key”, Institute of Systems Science National University of Singapore Kent Ridge Singapore.
• C. Gamage, J. Leiwo, and Y. Zheng, “Encrypted message authentication by firewalls,” International Workshop on Practice and Theory in Public Key Cryptography (PKC-99), LNCS 1560, pp.69-81, Springer-Verlag, March 1999.
• Y. Han, X. Yang, and Y. Hu, “Signcryption Based on Elliptic Curve and Its Multi-Party Schemes”, 3rd ACM International Conference on Information Security (InfoSecu'04), pp.216-217, 2004.
• Ren-Junn Hwang, Chih-Hua Lai, Feng-Fu Su,” An efficient signcryption scheme with forward secrecy based on elliptic curve” , Department of Computer Science and Information Engineering, Tamkang University, Math. Comput. 167 (2005) pp. 870–881, Elsevier ,2004.
• H. Lin , T. Wu and S. Huang " An Efficient Strong Designated Verifier Proxy Signature Scheme for Electronic Commerce" Journal Of Information Science And Engineering 28, 771-785 (2012)
• H. Delfs and H. Knebl, Introduction to Cryptography: Principles and Applications ,Springer, Berlin, 2002.
• http://www.certicom.com/index.php/index.php/52-the-elliptic-curve-discrete-logarithm-problem.
• C. Popescu,” A Secure Authenticated Key Agreement Protocol”, University of Oradea, Department of Mathematics, Oradea, Romania.
• Darrel Hankerson, Alfred Menezes, Scott Vanstone, “Guide to Elliptic Curve Cryptography”, 2004 Springer-Verlag New York.
• Avi Kak, “Elliptic Curve Cryptography and Digital Rights Management ”, Avinash ak, Purdue University, April 20, 2011.
• William Stallings, “Cryptography and Network Security Principles and Practices, Fourth Edition”, Prentice Hall, November 16, 2005.