Efficient Multiple Signcryption Scheme Based on Two Hard Problems
LI Zhan-h · Beijing Youdian Xueyuan xuebao · 2013
A scheme for efficient multiple signcryption on the conic curve over the ring Z n 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 designcryption 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.