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

摘要

在标准模型下的适应性选择消息不可伪造攻击(UCMA)安全模型中,Paterson和Schuldt(PS)构造了双线性映射群中基于计算DH难题的基于身份数字签名算法.PS算法直接利用两组独立的Waters身份处理函数去分别处理用户身份和签名消息,因此算法中公钥参数数量很大.新算提出一种改进的参数选择方法以大大减少公钥参数数量,且能在标准模型下得到安全证明.%In the standard model an UCMA security IBS scheme was proposed by Paterson 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.