An Efficient Signcryption Scheme with Shortened Ciphertext

摘要：

Signcryption is a novel cryptographic primitive that prove confidentiality and authenticity simultaneously. In bandwidth-constrained environments, the data mount of ciphertext is the crucial factor that holds back its broad application. While most of the known schemes based on discrete logarithm problem and RSA problem, have the low communication performance. Based on BLS signature scheme, an efficient signcryption scheme with shortened ciphertext is proposed in this paper. It is provable secure in random oracle model under GDH (Gap Diffie-Hellman) assumption. With the present secure parameters, the data rate of proposed scheme is 76％. With the long term secure parameters, the data rate is 73％. It has the highest communication performance in all of the known schemes.

关键词： signcryption bilinear paring digital signaturentroduction

作者: Hu Junru Ding Yi

作者单位: Key Laboratory of Network & Information Security of APF, Engineering College of APF Xian, China

会议类型: 国际会议

会议名称: The 2010 International Conference on Computer Application and System Modeling(2010计算机应用与系统建模国际会议 ICCASM 2010)

会议地点: 太原

会议语种:英文

页码: 404-407

在线出版日期: 2010-10-22（万方平台首次上网日期，不代表论文的发表时间）