Efficient ID-based digital signatures with message recovery

被引:0
|
作者
Tso, Raylin [1 ]
Gu, Chunxiang [2 ]
Okamoto, Takeshi [1 ]
Okamoto, Eiji [1 ]
机构
[1] Univ Tsukuba, Dept Risk Engn, Grad Sch Syst & Informat Engn, Tsukuba, Ibaraki 305, Japan
[2] Informat Engn Univ, Network Engn Dept, Zhengzhou, Peoples R China
来源
关键词
ID-based signature; k-BDHI problem; message recovery; pairing; short signature;
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
A digital signature with message recovery is a signature that the message itself is not required to be transmitted together with the signature. Comparing with other (non-short) digital signatures, it has the advantage of small data size of communication. This kind of signature schemes have been widely investigated a decade ago, but, no ID-based message recovery signature is proposed until 2005 by Zhang et al. Since, up to the present, no method can be used to shorten ID-based signatures directly, ID-based message recovery signatures are regarded as a useful method to shorten ID-based signatures, in contrast to proposing a short signature scheme. In this paper, two new ID-based signature schemes with message recovery are proposed. The first one can deal with messages of fixed length and the second one can deal with messages of arbitrary length. Similar to Zhang et al.'s schemes, our schemes shows the idea of shortening ID-based signatures. However, our schemes are more efficient than Zhang et al.'s schemes. In addition, after comparing with Boneh et al.'s short signature (which is not ID-based), we find that although the communication cost is still a little larger than that of a short signature, the computational cost of our scheme is less than that of Boneh et al.'s short signature in the verification phase and our schemes surpass a short signature scheme in the concept of ID-based property. Under the hardness of k-BDHI problem, our schemes are proven secure in the random oracle model.
引用
下载
收藏
页码:47 / +
页数:4
相关论文
共 50 条
  • [11] Generalized ID-based ElGamal signatures
    Kalkan, Said
    Kaya, Kamer
    Selcuk, Ali Aydin
    2007 22ND INTERNATIONAL SYMPOSIUM ON COMPUTER AND INFORMATION SCIENCES, 2007, : 328 - 333
  • [12] Efficient Privacy Enhanced Software Registration with ID-Based Blind Signatures
    CHEN Wuping1
    2. School of Science
    3. Department of Computer Engineering and Mathematics
    Wuhan University Journal of Natural Sciences, 2008, (06) : 733 - 738
  • [13] ID-based restrictive partially blind signatures
    Chen, XF
    Zhang, FG
    Liu, SL
    COMPUTATIONAL INTELLIGENCE AND SECURITY, PT 2, PROCEEDINGS, 2005, 3802 : 117 - 124
  • [14] Security Arguments for a Class of ID-based Signatures
    Guo, Zhengwei
    He, Xinzheng
    Xun, Baocheng
    ICDS 2008: SECOND INTERNATIONAL CONFERENCE ON THE DIGITAL SOCIETY, PROCEEDINGS, 2008, : 165 - +
  • [15] Construction of Subliminal Channel in ID-based Signatures
    Xin Xiangjun
    Li Qingbo
    2009 WASE INTERNATIONAL CONFERENCE ON INFORMATION ENGINEERING, ICIE 2009, VOL II, 2009, : 159 - 162
  • [16] An Efficient ID-Based Message Recoverable Privacy-Preserving Auditing Scheme
    Kiraz, Mehmet Sabir
    Sertkaya, Isa
    Uzunkol, Osmanbey
    2015 THIRTEENTH ANNUAL CONFERENCE ON PRIVACY, SECURITY AND TRUST (PST), 2015, : 117 - 124
  • [17] ID-based digital multisignature scheme
    Dept. of Comp. Sci. and Engineering, South China University of Technology, Guangzhou, Guangdong Province 510640, China
    不详
    J. Circuits Syst. Comput., 3-4 (223-227):
  • [18] ID-based digital multisignature scheme
    Tang, SH
    Wei, G
    JOURNAL OF CIRCUITS SYSTEMS AND COMPUTERS, 1999, 9 (3-4) : 223 - 227
  • [19] Efficient ID-based threshold signature
    Liu, Ying
    Hu, Yu-Pu
    Wang, Fei
    Lu, Xiao-Jun
    Xi'an Dianzi Keji Daxue Xuebao/Journal of Xidian University, 2006, 33 (02): : 311 - 315
  • [20] An efficient ID-based delegation network
    Youn, Taek-Young
    Park, Young-Ho
    Kim, Chang Han
    Lim, Jongin
    ON THE MOVE TO MEANINGFUL INTERNET SYSTEMS 2006: OTM 2006 WORKSHOPS, PT 1, PROCEEDINGS, 2006, 4277 : 382 - 391