位置:成果数据库 > 期刊 > 期刊详情页
An Efficient Identity-Based Anonymous Signcryption Scheme
  • 时间:0
  • 分类:TN918.1[电子电信—通信与信息系统;电子电信—信息与通信工程]
  • 作者机构:[1]School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu 610054, Sichuan, China
  • 相关基金:Supported by the National Natural Science Foundation of China (60573043) and the Foundation of National Laboratory for Modern Communications (9140C1107010604) and Youth Science and Technology Foundation of University of Electronic Science and Technology of China
  • 相关项目:分布式系统中的信任管理研究
中文摘要:

Signcryption 比 sign-then-encrypt 来临是更高效地在单个逻辑步执行加密和签名的密码的原语。到现在为止, signcryption 计划的各种各样的类型被建议了。在他们之中, signcrypter 的隐私保护的要求在一些实际应用是必要的。在这篇论文,从双线性的白族的一个新基于身份的匿名的 signcryption 计划响,它是基于身份的戒指签名和加密计划的器官的联合,被建议。建议计划对在在随机的神谕模型的 Decisional 双线性的 Diffie-Hellman 假设下面的选择密文攻击是难区分的。它的 unforgeability 依靠计算 Diffie-Hellman 问题。与以前的计划相比,新计划在计算是更有效的。

英文摘要:

Signcryption is a cryptographic primitive that performs encryption and signature in a single logical step more efficiently than sign-then-encrypt approach. Till now, various kinds of signcryption schemes have been proposed. Among them, the requirement of signcrypter's privacy protection is needful in some practical applications. In this paper, a new identity-based anonymous signcryption scheme from hilinear pairings, which is the organic combination of identity-based ring signature and encryption scheme, is proposed. The proposed scheme is indistinguishable against the chosen ciphertext attack under the Decisional Bilinear Diffie-Hellman assumption in the random oracle model. Its unforgeability relies on the computational Diffieellman problem. Compared with the previous schemes, the new scheme is more efficient in computation.

同期刊论文项目
期刊论文 73 会议论文 14 著作 1
同项目期刊论文