首页 | 本学科首页   官方微博 | 高级检索  
     检索      

Efficient and Provably Secure Multi-Recipient Signcryption from Bilinear Pairings
作者姓名:LI  Fagen  HU  Yupu  LIU  Shuanggen
作者单位:[1]Key Laboratory of Computer Networks and InformationSecurity, Ministry of Education, Xidian University, Xi'an 710071,Shaanxi, China; [2]College of Computer Information Engineering, JiangxiNormal University, Nanchang 330022, Jiangxi, China
基金项目:Foundation item: Supported by the National Natural Science Foundation of China (60473029)
摘    要:0 Introduction Confidentiality, integrity, non-repudiation and au- thentication are the important requirements for many cryptographic applications. A traditional approach to achieve these requirements is to sign-then-encrypt the message. Signcryption, fir…

关 键 词:计算机  安全保密  双线性  谕示模型
文章编号:1007-1202(2007)01-0017-04
收稿时间:2006-05-30

Efficient and provably secure multi-recipient signcryption from bilinear pairings
LI Fagen HU Yupu LIU Shuanggen.Efficient and Provably Secure Multi-Recipient Signcryption from Bilinear Pairings[J].Wuhan University Journal of Natural Sciences,2007,12(1):17-20.
Authors:Li Fagen  Hu Yupu  Liu Shuanggen
Institution:(1) Key Laboratory of Computer Networks and Information Security, Ministry of Education, Xidian University, Xi’an, 710071, Shaanxi, China;(2) College of Computer Information Engineering, Jiangxi Normal University, Nanchang, 330022, Jiangxi, China
Abstract:Signcryption is a cryptographic primitive that performs signature and encryption simultaneously, at lower computational costs and communication overheads than the signature-then- encryption approach. In this paper, we propose an efficient multi-recipient signcryption scheme based on the bilinear pairings, which broadcasts a message to multiple users in a secure and authenticated manner. We prove its semantic security and unforgeability under the Gap Diffie-Hellman problem assumption in the random oracle model. The proposed scheme is more efficient than re-signcrypting a message n times using a signcryption scheme in terms of computational costs and communication overheads.
Keywords:signcryption  multi-recipient signcryption  bilinear pairings  provable security
本文献已被 CNKI 维普 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号