Formal proofs for the security of signcryption

被引:125
作者
Baek, Joonsang
Steinfeld, Ron
Zheng, Yuliang
机构
[1] Inst Infocomm Res, Singapore 119613, Singapore
[2] Macquarie Univ, Dept Comp, N Ryde, NSW 2109, Australia
[3] Univ N Carolina, Dept Software & Informat Syst, Charlotte, NC 28223 USA
[4] Monash Univ, Sch Network Comp, Clayton, Vic 3168, Australia
[5] Univ Wollongong, Sch Informat Technol & Comp Sci, Wollongong, NSW, Australia
关键词
signcryption; flexible signcryption/unsigncryption oracle models; gap Diffie-Hellman problem; gap discrete log problem;
D O I
10.1007/s00145-007-0211-0
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Signcryption is an asymmetric cryptographic method that provides simultaneously both message confidentiality and unforgeability at a low computational and communication overhead. In this paper we propose realistic security models for signcryption, which give the attacker power to choose both messages/signcryptexts as well as recipient/sender public keys when accessing the signcryption/unsigncryption oracles of attacked entities. We then show that Zheng's original signcryption scheme is secure in our confidentiality model relative to the Gap Diffie-Hellman problem and is secure in our unforgeability model relative to a Gap version of the discrete logarithm problem. All these results are shown in the random oracle model.
引用
收藏
页码:203 / 235
页数:33
相关论文
共 36 条
  • [1] AN J, 2002, SECURITY JOINT SIGNA
  • [2] An JH, 2002, LECT NOTES COMPUT SC, V2332, P83
  • [3] BAEK J, 2002, LECT NOTES COMPUTER, V2274, P80, DOI DOI 10.1007/S00145-007-0211_0
  • [4] Bellare M, 1998, LECT NOTES COMPUT SC, V1462, P26, DOI 10.1007/BFb0055718
  • [5] A concrete security treatment of symmetric encryption
    Bellare, M
    Desai, A
    Jokipii, E
    Rogaway, P
    [J]. 38TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1997, : 394 - 403
  • [6] Bellare M, 2000, LECT NOTES COMPUT SC, V1976, P531
  • [7] Bellare M., 1995, LNCS, V950, P92, DOI [DOI 10.1007/BFB0053428, 10.1007/BFb0053428]
  • [8] BELLARE M, 2004, 2004331 IACR
  • [9] Bellare M., 1995, P 1 ACM C COMPUTER C, P62
  • [10] Cramer R, 1998, LECT NOTES COMPUT SC, V1462, P13, DOI 10.1007/BFb0055717