Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2013, Vol. 36 ›› Issue (6): 23-26.doi: 10.13190/j.jbupt.2013.06.005

• Papers • Previous Articles     Next Articles

Efficient Multiple Signcryption Scheme Based on Two Hard Problems

LI Zhan-hu1,2, FAN Kai1, LI Hui1   

  1. 1. State Key Laboratory of Integrated Service Networks, Xidian University, Xi'an 710071, China;
    2. Mathematics and Information Science College, Xianyang Normal University, Shanxi Xianyang 712000, China
  • Received:2013-03-21 Online:2013-12-31 Published:2013-10-08

Abstract:

A scheme for efficient multiple signcryption on the conic curve over the ring Zn is presented based on multiple digital signature. The security of the proposed scheme is proved based on the two hard problems of large integer factorization and discrete logarithm on conic curve. As the signcryption and de-signcryption are calculated on conic curve, plaintexts can be embedded easily, and in inverse, the element order and points' operation on conic curve over can be calculated more simply and easily in the proposed scheme. Compared with the exiting scheme in efficiency, the proposed scheme is greatly improved in information computation.

Key words: signcryption, multiple signcryption, conic curve, large integer factorization, discrete logarithm

CLC Number: