计算机科学 ›› 2011, Vol. 38 ›› Issue (3): 136-139.

• 计算机网络与信息安全 • 上一篇    下一篇

短公钥的可证明安全基于身份数字签名算法

王之怡,刘铁,康立,谢静,雷刚   

  1. (西南财经大学经济信息工程学院 成都610074) (中国研究院 北京100193)
  • 出版日期:2018-11-16 发布日期:2018-11-16
  • 基金资助:
    本文受国家自然科学基金青年项目“电子商务协议交易相关安全属性的形式化验证”(60903201)资助。

Short Public Key Provable Security Identity-based Signature Scheme

WANG Zhi-yi,LIU Tie,KANG Li,XIE Jing,LEI Gang   

  • Online:2018-11-16 Published:2018-11-16

摘要: 在标准模型下的适应性选择消息不可伪造攻击(UCMA)安全模型中,Paterson和Schuldt(PS)构造了双线性映射群中基于计算DH难题的基于身份数字签名算法。PS算法直接利用两组独立的Watcrs身份处理函数去分别处理用户身份和签名消息,因此算法中公钥参数数量很大。新算法提出一种改进的参数选择方法以大大减少公钥参数数量,且能在标准模型下得到安全证明。

关键词: 基于身份的数字签名,标准模型,短的公钥参数

Abstract: In the standard model an UCMA security IBS scheme was proposed by Peterson and Schuldt, which was based on computational Diffie-Hellman problem in bilinear pairing group. Two independent Waters' identity hash functions were directly employed to treat the user's identity and the signature message, respectively, so PS's IBS scheme had a great number of public keys. An improved parameters selecting method was proposed in the new scheme, which only needs a small number of public keys,and the new scheme can be proved security in the standard model.

Key words: Identity-based signature, Standard model, Short public key

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!