An Efficient Identity-Based Anonymous Signcryption Scheme

作     者：YU Yong LI Fagen XU Chunxiang SUN Ying YU Yong, LI Fagen, XU Chunxiang, SUN Ying School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu 610054 Sichuan, China

作者机构：School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu 610054 Sichuan China 

出 版 物：《Wuhan University Journal of Natural Sciences》 (武汉大学学报（自然科学英文版）)

年 卷 期：2008年第13卷第6期

页      面：670-674页

学科分类：07[理学] 070104[理学-应用数学] 0701[理学-数学] 

基　　金：Supported by the National Natural Science Foundation of China (60573043) the Foundation of National Laboratory for Modern Communications (9140C1107010604) Youth Science and Technology Foundation of University of Electronic Science and Technology of China 

主　　题：identity-based ring signature anonynaous signcryption bilinear pairing 

摘      要：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.